arXiv (All)
open access
Scalable persistence pairing graphs on scalar fields with an application to porous media
We present a scalable method for computing persistence pairing graphs from large cubical filtrations and use it to test whether graph organization among persistent classes contains information beyond persistence intervals alone. The method cancels equal-value pairs before global reduction, construct
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs#1247397
- GRET: Graph-Refined Joint Triple Extraction for Overlapping Triples#381305
- Polynomial Compressibility and Forbidden Oriented Forests#1118312
- NCCLZ: Compression-Enabled GPU Collectives with Decoupled Quantization and Entropy Coding#178841
- RaBitQ-SSD: Split Codes and Pipelined I/O for SSD-Resident Vector Search#1186966
Record · ID 1234264
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive