{"as_of":"2026-08-15T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d773b0045b0b2ad583465f1ec39e1765c43df7d9c27f68ce05fd658cb9eebbb","coverage":[{"denominator":159,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:20:38.285144Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.19857/citation-record","integrity":"/paper/2506.19857/integrity","json":"/paper/2506.19857/citation-record.json","paper":"/paper/2506.19857"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:31.599367Z","title":"Higher order learning with graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:31.599367Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:19c44784aae13e22fc9488ce2fd7c1c63626e0e043b46e7afb8eb9cf8f7d9717","observation_id":"2ef7ba90-0795-4be3-8860-bfd7c94800ec","resolution":{"observed_at":"2026-08-07T05:20:31.599367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:31.651768Z","title":"HyperEF: Spectral hypergraph coarsening by effective-resistance clustering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:31.651768Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:6494887d8fa77db2d10faea9df82ae8da27c2f047b7028883bc6973cc9abea9a","observation_id":"9ed27ea5-74fd-4cab-8ad2-631e0f531e89","resolution":{"observed_at":"2026-08-07T05:20:31.651768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:31.726261Z","title":"Visualisation and analysis of the Internet Movie Database","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:31.726261Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:b51212719c78bfa023616be6a1724f3acac1b86e55f7d21d9850f751c17652a5","observation_id":"de24793b-c250-4e67-917d-0d18962cbf38","resolution":{"observed_at":"2026-08-07T05:20:31.726261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:31.849129Z","title":"Hypergraph Laplacians in diffusion framework","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:31.849129Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:015d8b2067aadab7208fd20935c79e4551ffb201c3c17c0e4127fabe6e38de73","observation_id":"662befb6-982b-448d-85d2-60743e6765d7","resolution":{"observed_at":"2026-08-07T05:20:31.849129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:31.921893Z","title":"Alsing, Jonathan R","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:31.921893Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:bc278ce334d90d19f8e9b6e368cad3ea36c78cebe1f022749bc3d0197854894e","observation_id":"9cd525c7-0184-4460-985b-008b4ff89800","resolution":{"observed_at":"2026-08-07T05:20:31.921893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:31.994578Z","title":"Curvature of hypergraphs via multi-marginal optimal transport","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:31.994578Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:b69ce7b34bd58a292e5f6313d25250f8695a67f99dd91d51c5e6aeb3ad9fc5a0","observation_id":"9a89f5fc-0d1f-4e1c-bacb-f83d33c293ad","resolution":{"observed_at":"2026-08-07T05:20:31.994578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.068329Z","title":"On the sum of Ricci-curvatures for weighted graphs.Pure and Applied Mathematics Quarterly, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.068329Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:058995c2d111c2b35a1e5fe60dc8116422507cf7ebe12a810c6c1c3ae319fa7b","observation_id":"5bf50d09-7b89-4840-b5df-cb8410f8ba51","resolution":{"observed_at":"2026-08-07T05:20:32.068329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.132383Z","title":"On the spectrum of hypergraphs.Linear Algebra and its Applications, 614:82–110, April 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.132383Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:2d7dfbbad8b9fa4086f4e8417b4aaa04e00b6f3689c13d1499333360f7dbd646","observation_id":"f2b50d9b-a427-4f2a-ae08-e597174e3b6f","resolution":{"observed_at":"2026-08-07T05:20:32.132383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.220687Z","title":"New notions and constructions of sparsifica- tion for graphs and hypergraphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.220687Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:ed95a3c28b3d59da144f36c885a7fee033c2d437fd5f4a34da1e5aa1cf4a2ce6","observation_id":"0a7caf8e-ac49-49d7-ab5e-ec920709f3b7","resolution":{"observed_at":"2026-08-07T05:20:32.220687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.313123Z","title":"Geometric sampling of networks.Journal of Complex Networks, 10(4):cnac014, August 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.313123Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:1d84848a2164d23933898fb5f49bf887d432490b023cb72011d7fc5b6dc1cd70","observation_id":"4ee0103f-2b30-4019-b33d-26ee64332c8f","resolution":{"observed_at":"2026-08-07T05:20:32.313123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.374028Z","title":"Spielman, and Nikhil Srivastava","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.374028Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:50dde312f068a80eccd1d303e21ffe662b60831b50dabcad62dbf76ae080a9b3","observation_id":"38008e61-56d7-423e-9ec9-c9d2b0d22e1c","resolution":{"observed_at":"2026-08-07T05:20:32.374028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.456935Z","title":"Ollivier–Ricci curvature and the spectrum of the normalized graph Laplace operator.Mathematical Research Letters, 19(6):1185–1205, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.456935Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:842804d176e74bc35c6655e45ed58ef3a3cf950369168c3653133faeec8bcc01","observation_id":"bc3ef486-c24d-4ac0-8a09-52603f1c4618","resolution":{"observed_at":"2026-08-07T05:20:32.456935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.606984Z","title":"The Morse theory of ˇCech and Delaunay complexes","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.606984Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:b5a8a7270104de377ff5bdc8f67a1c22c37d2eab942a6600a5910d37f9c09f3a","observation_id":"b51954a5-45b6-459f-aac4-a3165323083c","resolution":{"observed_at":"2026-08-07T05:20:32.606984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.712306Z","title":"Bencz´ ur and David R","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.712306Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:4037f70cbec8b861cfde0d3e851ab9162444956540f4e876d43548ac5c0c039a","observation_id":"e799ba95-4857-4178-bc7e-f533785af2c8","resolution":{"observed_at":"2026-08-07T05:20:32.712306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.840170Z","title":"Benson, David F","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.840170Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:e718340b79e6d2c0171ef7a05568cebf965e0b4fb6534fc98310a4a71262c8f5","observation_id":"a2ada6f0-af64-42e0-a05a-ae9f43cfeb95","resolution":{"observed_at":"2026-08-07T05:20:32.840170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.927385Z","title":"Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.927385Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:44aa58789894528fa2f3b1500a998ee9064e7b1a06274c7909cdaf4ec0fee03f","observation_id":"e6d6c9b4-1701-43c9-8489-6a9640c036ee","resolution":{"observed_at":"2026-08-07T05:20:32.927385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:32.983308Z","title":"Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:32.983308Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:c55e386f4e052a0a02bfa8cee5830de1a8cd03da77f9ec7b55a3f4b74e08ab5c","observation_id":"bffafbd1-93ad-4f5e-9b29-8f028f1a8563","resolution":{"observed_at":"2026-08-07T05:20:32.983308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:33.089037Z","title":"On the stability of interval decomposable persistence modules","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.089037Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:7491de7459592ea8c678fbbc4ab0630339915eedf4d327252ec569754e19d8c3","observation_id":"451b80e0-0104-46ed-b19f-82eef2d0ba79","resolution":{"observed_at":"2026-08-07T05:20:33.089037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:33.247487Z","title":"Fast unfolding of communities in large networks.Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, oct 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.247487Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:79f7023914f9df08fe31266b99c272bee7900e2d00db5f84d25a631de5ab6353","observation_id":"b856567b-160e-49cd-95c3-a0a1b686dc20","resolution":{"observed_at":"2026-08-07T05:20:33.247487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:33.361400Z","title":"Homological percolation and the Euler characteristic","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.361400Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:626a32cc1478fec3be2e2a8d3e4aa9d6b583e8d05837469f96277bcd647ad30c","observation_id":"a81966a4-ac10-4715-a106-df14cb723eec","resolution":{"observed_at":"2026-08-07T05:20:33.361400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:33.437907Z","title":"Mass transportation and rough curvature bounds for discrete spaces.Journal of Functional Analysis, 256(9):2944–2966, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.437907Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:90533140a6557b9ca1d8c36a8a303236f92cedb3b0f0265bbb6d81f8d69a2b44","observation_id":"a372263d-43d3-4854-a746-6d9301ef9515","resolution":{"observed_at":"2026-08-07T05:20:33.437907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:33.558400Z","title":"Decomposition of persistence modules","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.558400Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:282934944464bf19242d6d8371035bf72e9da6d196209b8163e67e8eed824cf8","observation_id":"d7837b7f-9cc2-4a34-a739-7dad54a96984","resolution":{"observed_at":"2026-08-07T05:20:33.558400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:33.665805Z","title":"Dey, and Yusu Wang","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.665805Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:624f60ee3621778678270e6dd5fb5284dceb31b1662cd88aedcdea171cbaefa6","observation_id":"8ad0dec8-e68b-4019-a75a-a704293cda97","resolution":{"observed_at":"2026-08-07T05:20:33.665805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2204.09155","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.726753Z","title":"Approximating persistent homology for large datasets","venue":null,"work_id":"0440dc96-8cd2-44f4-b67a-82d6478e199d","year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.754365Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:426b3591a6cf58049db6a1c7612e9b5461dfc3d9d030ae1868fd2745c1d2fbe0","observation_id":"102b579f-504c-4834-a9a5-2b15e6f032ba","resolution":{"observed_at":"2026-08-07T05:20:38.732433Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:33.877398Z","title":"Cavanna, Mahmoodreza Jahanseir, and Donald R","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:33.877398Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:7553ceed3b41743bb2c5ff5a07591711496a35af4cc5e2dc178342b6e5138f82","observation_id":"13af413d-c089-4ead-b9a2-f7d4df7ca92e","resolution":{"observed_at":"2026-08-07T05:20:33.877398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.042590Z","title":"Spectral properties of hypergraph Laplacian and approximation algorithms.Journal of the ACM, 65(3):1–48, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.042590Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:3ab558eb8c72ca94da0824afe61d5113d1088179b0856d54f6a08643faadc60b","observation_id":"05b0f50b-6842-4e21-9d0f-c8d61bf4d798","resolution":{"observed_at":"2026-08-07T05:20:34.042590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.124438Z","title":"Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.124438Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:b8fee3029488000701438f34702e68f9d3ee5646d48a39bee200486f244feb90","observation_id":"d3c1c0a5-728d-4076-9f79-2d763910462c","resolution":{"observed_at":"2026-08-07T05:20:34.124438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.293450Z","title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.293450Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:8950ee77799fe98dff5674548b1237d2958c42e3d35ad1cff36b72dbfa47ec81","observation_id":"56cac3b0-778c-44a4-8a4c-497e0d550c01","resolution":{"observed_at":"2026-08-07T05:20:34.293450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.360258Z","title":"Graph coarsening: from scientific computing to machine learning.SeMA Journal","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.360258Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:67b4bee949561072758607e6ea972948bdb8e632855940695639e307e5e96f56","observation_id":"79925ead-8356-4bfd-bc67-edb77abf05b0","resolution":{"observed_at":"2026-08-07T05:20:34.360258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.493599Z","title":"Near-linear size hypergraph cut sparsifiers","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.493599Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:a0dc312a944a8be5085af6eedc38151b7e926356a088231d8c52da1479019ddd","observation_id":"83e60dd2-48c3-44f0-b658-dd05005a2db0","resolution":{"observed_at":"2026-08-07T05:20:34.493599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.648161Z","title":"Demystifying graph sparsification algorithms in graph properties preservation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.648161Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:e3345994839e25ee4acfa68ae6536dc76e8cab1348130cc75dd1ed7984025263","observation_id":"4979d8ca-f718-4d75-bedb-7d7aadac14b4","resolution":{"observed_at":"2026-08-07T05:20:34.648161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.780049Z","title":"Community detection in hypergraphs: Optimal statistical limit and efficient algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.780049Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:48276d5646124c07a3aa7107127f1aa62f60061f35b37a577d04fafb78eec862","observation_id":"af97da5a-e51b-494e-88f9-cddbf247919b","resolution":{"observed_at":"2026-08-07T05:20:34.780049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:34.912573Z","title":"Combinatorial Ricci flows on surfaces.Journal of Differential Geometry, 63(1):97–129, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:34.912573Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:9713819e288481db1545d677765ca471445f9a3774eba7446bafead290785a20","observation_id":"2c2009a4-6c7a-45a0-805e-4c9d5e1c2390","resolution":{"observed_at":"2026-08-07T05:20:34.912573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:35.046936Z","title":"Ollivier-Ricci curvature for hypergraphs: A unified framework","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:35.046936Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:adddf8b26222d150a548a3b92f1dc010d32501914562e7dc34bcbd0daefb7197","observation_id":"a8a0bfa9-565e-4958-a6da-dc977cb5e6f3","resolution":{"observed_at":"2026-08-07T05:20:35.046936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:35.178353Z","title":"Decomposition of pointwise finite-dimensional persistence modules","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:35.178353Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:fb0884dd0372c7244e7b8c5e24df206068627b2f59b58068848dd03fb2710284","observation_id":"8160f531-5968-4716-92d4-c059879f834c","resolution":{"observed_at":"2026-08-07T05:20:35.178353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:35.318842Z","title":"Coverage in sensor networks via persistent homology","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:35.318842Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:ff3f252a7175690a15bdb7c6e4eea5dbab4e0322af6b6d4f824e047e6ba85050","observation_id":"14b5c40a-ce36-49d4-945c-ec2192a7a2fa","resolution":{"observed_at":"2026-08-07T05:20:35.318842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:35.420776Z","title":"Discrete curvature on graphs from the effective resistance.Journal of Physics: Complexity, 3(2), 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:35.420776Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:8e2866891b36ed5ae79c5e27a90e10950455d8b4dde501707dc008721057936e","observation_id":"c96670a9-a9a2-451d-9e00-93bd8c6da5de","resolution":{"observed_at":"2026-08-07T05:20:35.420776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:35.542565Z","title":"Graph curvature via resistance distance.Discrete Applied Mathematics, 348:68–78, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:35.542565Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:1ccf302232c1482ab30526de77af80faaf14b5d4f8af610b43c20aa7a648ef9f","observation_id":"0200ce5e-3837-4dce-94cd-ee64f167056e","resolution":{"observed_at":"2026-08-07T05:20:35.542565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:35.687250Z","title":"Dey, Fengtao Fan, and Yusu Wang","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:35.687250Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:f60c1c04225aee80f13e3d8ceec7de8efff01e0ae45fd7e610f82487952afe48","observation_id":"7bf75de6-05dd-473f-9e45-7638c6326200","resolution":{"observed_at":"2026-08-07T05:20:35.687250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:35.825180Z","title":"Dey, Dayu Shi, and Yusu Wang","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:35.825180Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:c9a5cdf62820f6345b5560bf707c38b53213e42071e2458405e18c7ac3c90eb0","observation_id":"14d8b639-6d87-4cb1-827a-cc161991672b","resolution":{"observed_at":"2026-08-07T05:20:35.825180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.020260Z","title":"The density of expected persistence diagrams and its kernel based estimation.Journal of Computational Geometry, 10(2):127–153, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.020260Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:527a774cdc8f6494b47707abbe4016cbcf66bc45f38b23461108f98828aefd10","observation_id":"3f4a615f-311b-4a9d-b447-64ee93d493bc","resolution":{"observed_at":"2026-08-07T05:20:36.020260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.159200Z","title":"Estimation and quantization of expected persistence diagrams","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.159200Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:209eb4821f34b0c9311e67b231c82f58630d340d01331095175d049072fc1482","observation_id":"3fed3860-1962-40f3-9578-62ad643f3cf7","resolution":{"observed_at":"2026-08-07T05:20:36.159200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.282052Z","title":"A notion of harmonic clustering in simplicial complexes","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.282052Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:d8a6a0c2883bf5ce9f7a4c7385bfd0a2b6d3fde53ceddaf6d9ae35bfa3eccaaa","observation_id":"d857c68e-5611-45bf-9e14-4c3b511e47b2","resolution":{"observed_at":"2026-08-07T05:20:36.282052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.384296Z","title":"Persistent homology-a survey.Contemporary Mathe- matics, 453:257–282, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.384296Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:3e16a127987cf62f90199cb5cc34756e65a1da60d5be1c966e117bf1c94bae37","observation_id":"bb96244e-fa37-410e-9fb6-856f923e4d92","resolution":{"observed_at":"2026-08-07T05:20:36.384296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.470970Z","title":"American Mathematical Society, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.470970Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:0fedef6706e5382eed56be54d07d46066af5ca41b56ff0e7e06fe4994101586a","observation_id":"58f91b4c-88c9-43a5-963e-34efc02e8340","resolution":{"observed_at":"2026-08-07T05:20:36.470970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.622807Z","title":"Edge- based analysis of networks: curvatures of graphs and hypergraphs.Theory in Biosciences, 139(4):337–348, December 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.622807Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:a407e9c5021640ff8236760e013cdc88302fd164b11cfb5783edbdfdc77ad8fa","observation_id":"768348ee-cdcb-436c-818f-b485ba92eac5","resolution":{"observed_at":"2026-08-07T05:20:36.622807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.729577Z","title":"Ollivier Ricci curvature of directed hypergraphs.Scientific Reports, 10(1):12466, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.729577Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:23a1c8c6e2977284cb024965279dd954406263c6d5719dac518fe31c81b719a0","observation_id":"4ef6088e-52a3-4322-95e9-9c7a74eb82e1","resolution":{"observed_at":"2026-08-07T05:20:36.729577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07912","last_updated":"2023-11-18T19:05:09Z","snapshot_observed_at":"2026-08-13T05:51:44.953485Z","submitted_at":"2023-10-11T21:41:31Z","title":"Irreducibility of Markov Chains on simplicial complexes, the Spectrum of the Discrete Hodge Laplacian and Homology","version":2},"cited_work":{"arxiv_id":"2310.07912","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.07912","snapshot_observed_at":"2026-08-07T05:20:38.664103Z","title":"Irreducibility of Markov Chains on simplicial complexes, the Spectrum of the Discrete Hodge Laplacian and Homology","venue":"math.SP","work_id":"59ab5918-14e9-44bb-a89d-7b4587a63ce2","year":2023},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.811802Z"},"links":{"cited_paper":"/paper/2310.07912","citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:16a0bec08306712ef60148a254191bd6565f97d0417bbcda642d6945e7e0f812","observation_id":"0f10abad-4ed2-48fb-851a-bf92fa1184c7","resolution":{"observed_at":"2026-08-07T05:20:38.667581Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:36.920054Z","title":"Multiscale topology of chromatin folding","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:36.920054Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:3e308b1ce315cd5e0a48add5a752e44b4bf29b36f79e3706de170df871f66cc6","observation_id":"261170d8-d713-49b5-841c-c8a9d99700a7","resolution":{"observed_at":"2026-08-07T05:20:36.920054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:37.048790Z","title":"Mitchell, Brenda Praggastis, Amie J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.048790Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:17b68e3c6a83f404fa366cfcd9e36aff6cfe82f6dea3186828d4a1ec5ad4c38b","observation_id":"0b25ac4c-1497-4f6b-a049-c8a584ce5632","resolution":{"observed_at":"2026-08-07T05:20:37.048790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:37.161450Z","title":"Augmentations of Forman’s Ricci curvature and their applications in community detection.Journal of Physics: Complexity, 5(3):035010, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.161450Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:4642a7602d8fa0526bad3d5e30aae1a1fc24c42c47550ed7f774f45b1135acc4","observation_id":"802a5415-7c1a-46f1-9258-de7a9aaa52bb","resolution":{"observed_at":"2026-08-07T05:20:37.161450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:37.302570Z","title":"Bochner’s method for cell complexes and combinatorial Ricci curvature","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.302570Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:b0d228c79b4c1cf6cdeeac9f9c0038cd654b8f0404869ee3dba10e618a4e2a2d","observation_id":"7ece55f0-c92f-4e9e-a650-0fab69eda135","resolution":{"observed_at":"2026-08-07T05:20:37.302570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:37.464301Z","title":"Learning discrete structures for graph neural networks","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.464301Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:7928c5b2cfd35fe76bd1d2e4e4c6e575d56911b8f3c23a24a9b94047fa7e3dd9","observation_id":"ed17d249-1a95-40e7-8cb0-e26dbde90402","resolution":{"observed_at":"2026-08-07T05:20:37.464301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:37.630291Z","title":"Directed hypergraphs and applications.Discrete Applied Mathematics, 42(2-3):177–201, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.630291Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:041c0db8cdaef4fc5089cee3b1dc4bf245081a2b0af347b79d1d806e51a4dbfc","observation_id":"a13a1ce6-4f24-43b5-b805-3a475e4e70ca","resolution":{"observed_at":"2026-08-07T05:20:37.630291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:37.798807Z","title":"A topological measurement of protein compressibility.Japan Journal of Industrial and Applied Mathematics, 32:1–17, March 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.798807Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:1ffd24fe078273430ea868b6257e2fb80ea90db94b84674b4bf91901a95046ca","observation_id":"245c0a45-639c-43c3-ada2-e4b676a13955","resolution":{"observed_at":"2026-08-07T05:20:37.798807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:37.847290Z","title":"Graph condensation: A survey.IEEE Transactions on Knowledge and Data Engineering, 37(4):1819– 1837, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.847290Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:eca5350504d4e61f30ca3fee3cf37c72bba6ec32ca253e36add59118799b37c1","observation_id":"8ff6fd85-018d-4613-a370-bcb2f2bcc0f5","resolution":{"observed_at":"2026-08-07T05:20:37.847290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.18310","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.647947Z","title":"A survey of simplicial, relative, and chain complex homology theories for hypergraphs","venue":null,"work_id":"9083e8c4-df26-4d4f-8a5a-2dc3b8941a68","year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:37.920440Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:6563d2e96e7bcdad6f72c0dc4d7e8354fa95d873ca331b058b3e5aa551027220","observation_id":"604603c5-91ee-4297-a836-de538127b561","resolution":{"observed_at":"2026-08-07T05:20:38.653152Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.048566Z","title":"Polyadic opinion formation: The adaptive voter model on a hypergraph.Annalen der Physik, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.048566Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:aa9acdadbeab8661a76717dbe9a3a50930e2839bfac75c3930e8a07c961c0dc2","observation_id":"f9fcf475-6d87-4ea0-bd26-fcf4f9080cf3","resolution":{"observed_at":"2026-08-07T05:20:38.048566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.155548Z","title":"Curvature sets over persistence diagrams.Discrete & Computational Geometry, 72:91–180, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.155548Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:5490036fb5e8dd47891660fbe4b4c9c0713bda238fa6fa6f0375451c5200ca22","observation_id":"82a2975c-80a5-4cdc-be1a-53a30b6cd700","resolution":{"observed_at":"2026-08-07T05:20:38.155548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.158968Z","title":"Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature.Nature Communications, 12(1):4561, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.158968Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:16b934a89fb6d3a5e846cbc5315487adcbec0969f57eca02dcc1a0625efb784d","observation_id":"1a947f34-d024-4ea1-8ebd-1de9c00a302f","resolution":{"observed_at":"2026-08-07T05:20:38.158968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.161816Z","title":"Modern Birkh¨auser Classics","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.161816Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:cb3ccba0bfdc4d9e9f75186a99c9f27ecfda5cf6e595a635de16e1ed5427f124","observation_id":"bb84891d-d6bd-478c-b33c-d437c660ffba","resolution":{"observed_at":"2026-08-07T05:20:38.161816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.164679Z","title":"Metric Ricci curvature for manifolds.Geometry, 2013, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.164679Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:e847b344c1822a6561e3b4e6dc17281686aa88fe4b6e33104bebbef8acba4d35","observation_id":"b22df268-0207-4f4b-bfc1-b92b96bd6648","resolution":{"observed_at":"2026-08-07T05:20:38.164679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.168040Z","title":"Aditya Prakash, and Wei Jin","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.168040Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:f9df94d18be3183501ce50b88b32bee0b36086072a365128a037a7ca6641f7af","observation_id":"ec7a6497-e93a-46e1-aedd-f9d791156fa4","resolution":{"observed_at":"2026-08-07T05:20:38.168040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.170931Z","title":"The total variation on hypergraphs - learning on hypergraphs revisited","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.170931Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:472cc84ad9d9ef0ca2b1ba1286f1b22261503dfb866f6107dc908ff00af6191f","observation_id":"478f5c70-a8d9-42ab-9e04-fc275cc0bc3e","resolution":{"observed_at":"2026-08-07T05:20:38.170931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.173912Z","title":"Independent component analysis: Algorithms and applications","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.173912Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:36bb4c3930ca01a2b4906d8e37ab3a20561658edef11242685c1de9cfc66722f","observation_id":"29455887-6bf0-43e4-a1a4-63c29191e5a8","resolution":{"observed_at":"2026-08-07T05:20:38.173912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.176604Z","title":"Multilayer network simplification: Approaches, models and methods.Computer Science Review, 36:100246, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.176604Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:60ba32d6f39d111113e52038abc9653543a8daeccf9ca23bd5e597dee14b124c","observation_id":"8a7fc061-20d0-4a54-8e03-4c71a3b11fe3","resolution":{"observed_at":"2026-08-07T05:20:38.176604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.01357","last_updated":"2022-12-02T18:34:57Z","snapshot_observed_at":"2026-08-13T13:29:12.073001Z","submitted_at":"2022-12-02T18:34:57Z","title":"Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks","version":1},"cited_work":{"arxiv_id":"2212.01357","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.01357","snapshot_observed_at":"2026-08-07T05:20:38.554741Z","title":"Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks","venue":"math.CO","work_id":"ca1564e7-04d0-4954-9446-15f73573cf26","year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.179267Z"},"links":{"cited_paper":"/paper/2212.01357","citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:94c4304ff474e66cef8c2fd3a5972767d4f1094b62a72531972659b611238bd6","observation_id":"ed117228-684e-4e4b-a13b-0be8afa61336","resolution":{"observed_at":"2026-08-07T05:20:38.558139Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.182873Z","title":"Liu, and Aaron Sidford","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.182873Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:0088910847555b70a225a723b5dd2a8d66802c155fe23c52c53f21e85c2b2feb","observation_id":"bcc6733b-df33-4dca-879a-55c777981812","resolution":{"observed_at":"2026-08-07T05:20:38.182873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.186025Z","title":"Discrete surface Ricci flow: Theory and applications","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.186025Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:d176d19a8e73e007e2249075d1a1a916c0e01037313b9528ce2efcbd53dccf79","observation_id":"17727284-e9f4-4269-93fb-d3974367220d","resolution":{"observed_at":"2026-08-07T05:20:38.186025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.188947Z","title":"Graph structure learning for robust graph neural networks.Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 66–74, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.188947Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:86cad8e46db7e83e518b974acba904ba4db57f8cc746636f1b525e08a9e7c88d","observation_id":"c3272c8c-7932-43cf-a565-26361b3dfc5b","resolution":{"observed_at":"2026-08-07T05:20:38.188947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.191747Z","title":"Graph con- densation for graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.191747Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:284a6d1620b5ba06749126d4c8c11c354eff5e84fef8809cc2398cf43aabd87a","observation_id":"ef2d81df-7741-4abe-a30e-bd52c13b173a","resolution":{"observed_at":"2026-08-07T05:20:38.191747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04554","last_updated":"2021-10-09T12:41:40Z","snapshot_observed_at":"2026-08-15T11:12:12.555947Z","submitted_at":"2021-10-09T12:41:40Z","title":"Characterizations of Forman curvature","version":1},"cited_work":{"arxiv_id":"2110.04554","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.04554","snapshot_observed_at":"2026-08-07T05:20:38.541783Z","title":"Characterizations of Forman curvature","venue":"math.DG","work_id":"6e632911-9a1d-4791-bf39-427a8d80d3f7","year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.194617Z"},"links":{"cited_paper":"/paper/2110.04554","citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:257ed3a9be1d4f9c1eb8ad836ad6e93e6500a3017838f1b1f7a3f9b41582dbed","observation_id":"5ea55b0c-6136-4620-8696-be0f5989c8d1","resolution":{"observed_at":"2026-08-07T05:20:38.545063Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.198014Z","title":"Towards tight bounds for spectral sparsification of hypergraphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.198014Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:ce6f8f93e18683d63663714fb5952f451ce01724a5e986d33de16fbc7131d90e","observation_id":"c8a0ea6c-8218-4ca3-b929-bd9e5492282a","resolution":{"observed_at":"2026-08-07T05:20:38.198014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.200632Z","title":"A hypergraph partitioning package.Army HPC Research Center, Department of Computer Science & Engineering, University of Minnesota, 2:1–20, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.200632Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:a33ab9d85f19696f81d69004189607f0c4e25d78012a1640719ce6b5b881b894","observation_id":"71c711e1-0319-4683-85de-a1bf82217541","resolution":{"observed_at":"2026-08-07T05:20:38.200632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.203758Z","title":"Sharathkumar","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.203758Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:dd5187fa1a5986618cd8bfc37c0eddaabb29a1b7772cbaa5c2ecfa82b7661888","observation_id":"6f294599-fc03-44af-b8fb-7a53b2e44322","resolution":{"observed_at":"2026-08-07T05:20:38.203758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.206828Z","title":"Link pruning for community detection in social networks.Applied Sciences, 12(13):6811, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.206828Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:155e9fcf6b210ac38d1de04c56e10cb99fdd8a8fea5604d7e7c0cdde27753b42","observation_id":"16a81104-8948-4938-89e9-fa5c7807443c","resolution":{"observed_at":"2026-08-07T05:20:38.206828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.209906Z","title":"Klein and Milan Randic","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.209906Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:e9de2c230dc051ffc81655983348293f5aa4902d22b8336e0dcb7f545146d158","observation_id":"d8428158-7065-470b-83c6-16b83047db87","resolution":{"observed_at":"2026-08-07T05:20:38.209906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.212674Z","title":"A simple hypergraph min cut algorithm.Freie Universit¨at Berlin, Fachbereich Mathematik und Informatik; Serie B, Informatik, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.212674Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:70fdeb1bbaeaba758d21d222f4ae4079a38c7e82e690d1000ee38ffbefef2df2","observation_id":"cd86a5fc-b1e1-402d-99f8-e11554bd545e","resolution":{"observed_at":"2026-08-07T05:20:38.212674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.215622Z","title":"Sketching cuts in graphs and hypergraphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.215622Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:ec1c7fb83636992443910951c29e542b5cb417c12d720d3e8197153f2947c5cb","observation_id":"edf0b31e-983e-4517-8f45-be7a0412c299","resolution":{"observed_at":"2026-08-07T05:20:38.215622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.218634Z","title":"k-core: Theories and applications.Physics Reports, 832:1–32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.218634Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:dbabaec02599962a80d6ecd975853f236d8b7d7e60429fab94c3282ed27b913e","observation_id":"804d7f74-a24a-408d-bd1c-a15831063e9e","resolution":{"observed_at":"2026-08-07T05:20:38.218634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.222199Z","title":"Using persistent homology and dynamical distances to analyze protein binding.Statistical Applications in Genetics and Molecular Biology, 15(1), January 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.222199Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:aba43f974e4fec48a7d1b7787fad74af07520b14321c7f970a5772aba9884734","observation_id":"d02c2bc9-dd19-447b-812e-50e95069b37b","resolution":{"observed_at":"2026-08-07T05:20:38.222199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.225060Z","title":"Ricci curvature of random and empirical directed hypernetworks.Applied network science, 5:1–14, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.225060Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:958500bb2e46cf03426884444b4d9a12b03c64a9d88c86573c4885700d0971b9","observation_id":"1e1e36f6-8df4-4628-8469-4292c4449cb8","resolution":{"observed_at":"2026-08-07T05:20:38.225060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.228020Z","title":"Stadler, and J¨ urgen Jost","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.228020Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:e7028881ce5e94c69dfe08b307aca134347251b0c77997143852725b7147cf7b","observation_id":"53e7dec9-6d0a-42cd-8996-dde7033fdffd","resolution":{"observed_at":"2026-08-07T05:20:38.228020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.231045Z","title":"Kahng, Y","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.231045Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:1cbe06d950fedcac05801d7440f9de2da0b8f6ed5f6c2ef750385d11caa1aeb5","observation_id":"0a16dad6-d124-49e0-b861-5cbdb5633296","resolution":{"observed_at":"2026-08-07T05:20:38.231045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.555084Z","title":null,"venue":null,"work_id":"d50a7e70-da57-4f99-9fba-e03ac4b02017","year":null},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.234562Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:5cb204b08e3ec3d5a5e4c7c662405bd0841d9b11691c1e292d0a8247f31a880e","observation_id":"0fa6f6ea-4e2d-4d47-96ef-4e67ce25e168","resolution":{"observed_at":"2026-08-07T05:20:39.559653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.537701Z","title":null,"venue":null,"work_id":"b7966445-9d69-4eb1-a7c6-d284b074e8c4","year":2023},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.241851Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:1e3bdf929cb56ce41dc1639c467f0598c8b10f948e3fcd05e69101cde692ee3c","observation_id":"56e04752-2856-46e2-8474-13c9a75db8b9","resolution":{"observed_at":"2026-08-07T05:20:39.542321Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.526765Z","title":"Percolation on complex networks: Theory and application.Physics Reports, 907:1–68, 2021","venue":null,"work_id":"94b285e8-3e48-4035-b2d0-53e235c03546","year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.244882Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:ff2296801bb5b682c99f50bd3bfcafcd1c489753bb125b9283e18cf7ecf484a4","observation_id":"f5597f7a-e923-4fd9-bab0-7d91d941ccba","resolution":{"observed_at":"2026-08-07T05:20:39.531316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.513124Z","title":"Submodular hypergraphs: p-Laplacians, Cheeger inequalities and spectral clustering","venue":null,"work_id":"ab35443b-d338-4d29-823b-98572ae7b99a","year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.247768Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:c6e029ef6b2be54a9edef32d7ce1e08b4d50a5335d06bd2a3d9c0c0b85f5bc9d","observation_id":"3f0c9bf5-93ec-4dec-a07b-e6d0176e752a","resolution":{"observed_at":"2026-08-07T05:20:39.518512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.501888Z","title":"Ricci curvature of graphs.Tohoku Mathematical Journal, 63(4):605 – 627, 2011","venue":null,"work_id":"37a81a0b-dd64-4aee-9335-9f6799fc5442","year":2011},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.250852Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:c88b88205cad2563388efe03fd8d06c31219698186f0da11d666c38d0beaf904","observation_id":"89dadbdd-0b67-4f64-845f-86cd45e14a6c","resolution":{"observed_at":"2026-08-07T05:20:39.506085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.490354Z","title":"Graph summarization methods and applications: A survey.ACM Computing Surveys, 51(3):1–34, 2018","venue":null,"work_id":"31f17478-43d0-44fc-8c60-4ab150570f8a","year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.253606Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:508f0b3da883aae47dd855b42fef2e51a1701237109284bc8a4fb741b9789bfe","observation_id":"1ca9f4b1-a024-4ae9-9491-65367779e4e0","resolution":{"observed_at":"2026-08-07T05:20:39.494297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.479245Z","title":"Ricci curvature for metric-measure spaces via optimal transport","venue":null,"work_id":"a1b9f056-4a10-4933-b2d0-3e378f748a25","year":2009},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.256814Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:d54cbed8d0c413f1b06cf1393397cd27dc8d2c4cd3d0f656ab8ed4f65e827221","observation_id":"4174f3e2-9ee2-4d0e-ab01-0aaa91369736","resolution":{"observed_at":"2026-08-07T05:20:39.483259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.468399Z","title":"Hypergraph Markov operators, eigenvalues and approximation algorithms","venue":null,"work_id":"145aa417-5de3-49e2-8297-88fab20f756c","year":2015},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.259546Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:cbd211b27271aabc6e905b22936f32fe9d2fa562012ce7e3bee446f6870a92c0","observation_id":"60d38123-bb9b-4355-b7c8-6350270733bd","resolution":{"observed_at":"2026-08-07T05:20:39.472421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.458456Z","title":"A fast hypergraph min-cut algorithm for circuit partitioning","venue":null,"work_id":"849d4345-9d32-4c2c-90cb-31ad7ec67bcf","year":2000},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.262708Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:50f92990b89ae9c4b16af7e1710262a6949611c0b072aba546237b97a0eecd39","observation_id":"84b6d819-5feb-42c8-975d-5082fb4a4f5d","resolution":{"observed_at":"2026-08-07T05:20:39.461728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.447157Z","title":"A random walks view of spectral segmentation","venue":null,"work_id":"6b4bcedc-525d-4487-af6c-74d6e8a8760c","year":2001},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.265647Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:d0b455378d651d8d736983bba33adb70a585ffbdbea847b439544134c0de5ade","observation_id":"32621648-3fca-45e5-b024-f426375bc778","resolution":{"observed_at":"2026-08-07T05:20:39.450780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.435988Z","title":"Quantitative simplification of filtered simplicial complexes.Discrete & Computational Geometry, 65(2):554–583, 2021","venue":null,"work_id":"8c567af6-9b90-467f-8f5b-8fec8a3c82d3","year":2021},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.268973Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:f6a0f7263addd74819ae359014dc5a380f61b70397ee8694e959ca2a93751053","observation_id":"13dce879-5b2d-4a74-89be-c511a9b87701","resolution":{"observed_at":"2026-08-07T05:20:39.439773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.424137Z","title":"Laplacian matrices of graphs: A survey.Linear Algebra and its Applications, 197–198:143–176, 1994","venue":null,"work_id":"3bd98961-d970-4c8e-9a88-9944d66f5da7","year":1994},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.272185Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:f660e1113ed276101c7311e0741cb793e96928b8f91d9ac2d587af82f4fe7712","observation_id":"3a596255-7eb0-4c93-b4f6-da9785ece41a","resolution":{"observed_at":"2026-08-07T05:20:39.428544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.412177Z","title":"Manifolds with density.Notices of the AMS, 52(8):853–858, 2005","venue":null,"work_id":"a0ae97ac-7a06-49d4-8e90-87c8bf01d8bb","year":2005},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.275431Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:ba99fb0414696f3f6dab0616f06f0b4d7660da451b9ba60531254265115729db","observation_id":"f35df736-04af-420c-86f1-1c014119e5e3","resolution":{"observed_at":"2026-08-07T05:20:39.416762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.400264Z","title":"Wojciechowski","venue":null,"work_id":"de4c2716-d4e3-473a-959b-a3402bf97a13","year":2019},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.278469Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:f39c5c87590cfe5bea223007745033b6f9af56eca0b2f385f28a3bda7f09bb17","observation_id":"6b2e735e-1e6c-490d-90cb-6fc47151199e","resolution":{"observed_at":"2026-08-07T05:20:39.404643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:39.388055Z","title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph ofak-connected graph.Algorithmica, 7(1):583–596, 1992","venue":null,"work_id":"5c24a11e-6bda-4e38-b96d-672eb1a6486e","year":1992},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.282218Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:b51834c30476d895fb6f6b2cabcb73ed9485c6f35b795d6b7218fdf9420f97d3","observation_id":"c983a7ee-4508-4da6-b112-9cc814dd262c","resolution":{"observed_at":"2026-08-07T05:20:39.393036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:38.285144Z","title":"Oxford University Press, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T05:20:38.285144Z"},"links":{"citing_paper":"/paper/2506.19857"},"observation_digest":"sha256:484babdab3e5800628d95b6fdde89f39a596ffb95f33520606370070c349ae68","observation_id":"f2aae4d6-c817-4207-a77d-341797c8fce4","resolution":{"observed_at":"2026-08-07T05:20:38.285144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.19857","last_updated":"2025-06-09T21:34:43Z","latest_version":1,"primary_category":"math.HO","snapshot_observed_at":"2026-08-14T16:52:14.368366Z","submitted_at":"2025-06-09T21:34:43Z","title":"Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":82,"verified_exact":5,"verified_fuzzy":13},"total_outbound_references":159},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 159 outbound references and 0 inbound Pith citation observations for arXiv:2506.19857."}