{"as_of":"2026-08-08T01:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38b642c56cb92659807a3f876a0d48695eeef0c3a5a671aa623d31480f7d5e27","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-07T06:34:17.273281+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-07T05:13:04.791481Z","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:00e85e97642b961e617e4547f2215cab34741e43e3891509d62e5194ab9ce638","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-07T05:13:04.791481Z","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:467d250daf39b922ab50b6de4d57a5940998bdfc0052d330cafc8963d20df4a3","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-07T05:13:04.791481Z","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:62f8e47200014722369974ebbc1d28ff0e0e4cca5e62955a205399785d8de2fc","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-07T05:13:04.791481Z","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:0226329203580e4e947c98e32d3aab3bcf3eb0ca61943c908db0ed96d6b398ab","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-07T05:13:04.791481Z","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:8fcc355a899a40c370dbd543a7a86edfd5d285a79633f145d41a34b207c59e8a","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-07T05:13:04.791481Z","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:9fb1ff4901951127ce0cce3f7a299c7b13c50e6298a8c7ba0055489fe6fd2516","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-07T05:13:04.791481Z","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:ac9ef39916c110d617b9c1d42c3964ee20cb7aff7d66d89efa87de77f84e3121","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-07T05:13:04.791481Z","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:da651df0b2372fc0f3448da55fa0d5dd803135240f8597aaed0d4ef7239d239d","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-07T05:13:04.791481Z","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:e270e575ade5a82a759c69ac09c2fa1792f776f86bf8da631bc0049a7dbcddf9","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-07T05:13:04.791481Z","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:1b1e183b16b34c736c0a1de2128985854e99a3eb73c050d51c5ec2ec7456fbe2","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-07T05:13:04.791481Z","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:f73ac9742220c3981eb28844595eb0d6c7c8cf3ad67cebca6e78a2331b2f3c00","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-07T05:13:04.791481Z","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:42f6141233b8a305937bddd3c6c7947dc8aaae19c0f7173ee9923fa9102d65d9","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-07T05:13:04.791481Z","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:f3714b2761b907c9c73ac3f31b09fd083c5227e629e188a646081bd21468e2b1","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-07T05:13:04.791481Z","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:1e5b787b6e2d49336d107637bcc32a20cab3a84a60358a2339ecc02ce1d3abef","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-07T05:13:04.791481Z","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:5d2375137594cd9263dc70cabada5210a58d560c3ce0b4a3bbc1cb22f9d2b472","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-07T05:13:04.791481Z","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:c6285009c707508a6ba37103d2637c4250ee887bc467b258a3724e5d666a4332","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-07T05:13:04.791481Z","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:baebac958f33801de6ff4ed3e0b492e6789bf015875252f6c0bc180a5dd2c7c1","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-07T05:13:04.791481Z","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:8ceb9c64cea57fc6acf678a7cc8b3c96b293bc00624d95958db2d58f7ec010aa","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-07T05:13:04.791481Z","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:c79e660d62685f1cdd43f060a5dccb519c11f73bad8675ff41fd0e5f9f2c8969","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-07T05:13:04.791481Z","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:322633573725d1d273cc3e8caa9fe8ef948a9ddf650ca6583ab0ab4c1b35f505","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-07T05:13:04.791481Z","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:8b95a46171420eb359bffb4d202e48c1cc34c74dbd81365da0a546575677eafe","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-07T05:13:04.791481Z","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:bc8c826ce1cad16b725a8f4ac8dba1fa22515555d50dde24e5fa292951301fad","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-07T05:13:04.791481Z","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:adaa8a08ddd5a76c9a04fcadf4a9e1c4f55c7539d9c2d6709c2ab8738e58caed","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-07T05:13:04.791481Z","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:7d761fec0c46f5116a370b06318504feb24c534667f9e8fecfc95837993db10e","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:031dd977a0d7e8b5c53f9dd439da07e55a873eaa66691c43de961aa1e2825755","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-07T05:13:04.791481Z","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:bcd0b60c6cfe106b3ea6c8a6b2094b727d8da98dbe43edbc9c42d90eba4b0dea","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-07T05:13:04.791481Z","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:802c3653bd5cee89cf9d6496a45c7faefed62345421dfb5c6df2cafd19baba63","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-07T05:13:04.791481Z","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:029085f0d334ca5d92a728fe715e2a7ef0f7128ecdc544849948b6331134c1c9","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-07T05:13:04.791481Z","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:c48a970a62aad916726dc9aacbf5c3878342d6b86b08fb34166b3c247e0686ba","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-07T05:13:04.791481Z","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:4fce50eec1786a7f49b086a1f7d63cee84d49bf9fc505fd3e061d0a282f9e45d","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-07T05:13:04.791481Z","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:04607588022eb312967379e89d72ba2ad7cab5ea15dcafc825869ea6394c0f3f","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-07T05:13:04.791481Z","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:250469b98de21bfc4141cc634c2a9680dd189f7cbdf9cd9822a30aaef7e5fa01","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-07T05:13:04.791481Z","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:92004b222f9cdac41bc54c6eee7e8e2ee2bab787fd2228277038d949e781465b","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-07T05:13:04.791481Z","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:61573747b63c0e005dde2014e40d682f891706e0c356021c54fcf13527980fb4","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-07T05:13:04.791481Z","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:c4debf510636df38aa1c003ecc784958d41ed9ad8d7f8a6d659cb26e96fd2d58","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-07T05:13:04.791481Z","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:8ed559b905141a0ddcc51c92d1783c21de5be2c02a8809ea20fc90d79c65fd80","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-07T05:13:04.791481Z","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:efe863b5fcf7633058601b4423dca5d0356bc53e31ce3d29f7e6dff5bc3661b9","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-07T05:13:04.791481Z","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:dd6c8e1c9afa92881d2f192537f5c5e6310894d87fc29ce2c2d41ac1f493f0b5","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-07T05:13:04.791481Z","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:153c2f6c1c30ed507ea87e550734333bca2b9cadc87bd0ccf91c13089c51c116","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-07T05:13:04.791481Z","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:2f272220f81da27b42de77753b9239a0badb22757e82639fca5e9d1b4212b50c","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-07T05:13:04.791481Z","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:10a500770643624c1ee4d653ce4f7dc88618225d576242a97b7b64869640b3e4","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-07T05:13:04.791481Z","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:88144ffdee35903379515baa19e24cddaf4c7d204d7fc4a2e761384ba365c8f8","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-07T05:13:04.791481Z","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:1c3c5c0400e5148b71f8ab2b9f76684381a98fe1e77bcaf8daaca20d0b106f19","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-07T05:13:04.791481Z","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:7ba7d17da16ec2adda6986e724d1c102fab0d8af7dc6ca0dd96707fee88a5a31","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-07T05:13:04.791481Z","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:572b8f9672d09d4a9f8959edc1baf10301e4bd34fae15531af19ca74c391cd78","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-07T05:13:04.791481Z","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:69b2c51142b4c355899613d566485d282d9b122cacda6b21bfc9a9d91f476052","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-07T05:13:04.791481Z","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:6cd851b5553be8fef219af3fadc8dddf2ef8842bea356d4291c926ac7ea1f3b3","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-04T06:20:37.181036Z","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-07T05:13:04.791481Z","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:15cd1184108a008d4530e6c0a705a9e1376de11d9f149014bb013cd69b9f2910","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:d40c5e27328109b7790feaf6312ca8285ae08b2af224bbd696d0b8aa3efcbb4f","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-07T05:13:04.791481Z","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:168c34b218282c80a9fd0fd488f3427bccfa148c158ab7c8f81ecb60a0cbe5c0","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-07T05:13:04.791481Z","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:4dc283a95271e5988943b096e0f7f6a8ea11bdcfe2b3d46eedb8c9244d6ff9c4","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-07T05:13:04.791481Z","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:389811ebe2a24984afdd60f0dd2db6a864b7e83e8ac85e8435afd69d5f187576","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-07T05:13:04.791481Z","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:f980ba1eae661a7948e9b1195b31099b6e18827a5ab0c588449589f09ef77849","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-07T05:13:04.791481Z","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:835adc3a4aeb69cf0d218342fd2c24ab8e6897b47a24eb3665b9b3f237515950","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-07T05:13:04.791481Z","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:27c98dc7e052b3ee0bcc575a0fe1a06268e075648e1e4e1d9ed0c48f34104cbd","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-07T05:13:04.791481Z","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:f520de72db0090c0e7b3f7d027e86d344b5d4d1942ac363c844793a78b1970c3","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-07T05:13:04.791481Z","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:81bfd6f3ffa1d816096e37b4328af8157c1ba673a263963b4866fde7b0c3de2f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:ae8b41e6d786898e16e77cdbe4286648eba232b3ad165d0f355fb55a848d6be2","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-07T05:13:04.791481Z","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:a115623ebcf3f30103bca9890875f09667a32ff117c9148e43245aab6d92bf32","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-07T05:13:04.791481Z","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:2050d4415501e4699b4c1eee7178b4e32a89904fe88402838256e1b8593c3c87","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-07T05:13:04.791481Z","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:d0ab2398a97df881df26df0a571c7933aba79f33191da7292177ffb6ea451e2f","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-07T05:13:04.791481Z","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:87afd1c9cf0d0fa973a6e3ac80395542f88715886d31d5b536cf8d266c85d452","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-07T05:13:04.791481Z","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:8d13eaa045daafa1604fedf29f1089b5852cb504c62545c8e7645934c9fa91e2","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-07T05:13:04.791481Z","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:44ca33a2855c53cc5ea62549f98b1990f5b1f6123de5079e13c6de87f3b6fa89","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-07T05:13:04.791481Z","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:71df5ce690956ab0da959dacb9c0f59d3ae524fa05c8ef21a0d10b6cff3a6173","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-07T05:13:04.791481Z","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:97f0d28d8365dde18bf639678cbd0867bc7d8b6f693c762ddd05dcc06fb25404","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-07-06T14:26:17.430390Z","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-07T05:13:04.791481Z","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:a058ac1211a47f4b36596b2fc8ca162f2d6c451f42299eecef5108a4342ab1c7","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:376f46717f0d53fa6afa09a8a7b071c80bdd16bcc3a6340786541582d80db976","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-07T05:13:04.791481Z","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:93590a8a48f8930a5989d2e74a54a74f62369fecb8f3a393e81c11f11292292f","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-07T05:13:04.791481Z","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:6aa1feadc413dd2f05886aaa04edbdab66e2fd586cf763eff7d539dfe15c9b25","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-07T05:13:04.791481Z","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:c5cf431fba77cf492393c97f04ab86c96512ad2c981d3c317a95d1bfdb952d6c","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-07-06T11:56:07.301485Z","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-07T05:13:04.791481Z","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:e24102d270a221da858b347f173d163b1d1b13f92e38e3e953244f1dbca7e3d2","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:11f92da2ce26b8bdc56c7a52a78569e47c6427507e4a93b7824b7ba624fbae0c","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-07T05:13:04.791481Z","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:abd62671b08163c3be624993a1b6fcffe24200c091ecd88d7a606c5d8f94f847","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-07T05:13:04.791481Z","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:dcc4af9a5d156f23987bac7c81528cd672d84f5ab971f60587cb137c0de69d74","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-07T05:13:04.791481Z","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:ff3a27dc50e6d477d4ab507ee8bbb4e64faf4a2c1b0d6c1e558a57a9a1fce349","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-07T05:13:04.791481Z","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:fd9d839a3bc8fa0c5a36e23014a41f1504b52d24aab6a8ed7d08290d5f337ee3","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-07T05:13:04.791481Z","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:c743440a7aaf14528f835c6f8a981d7888ae997f5f7aed5110a14adaeb434a7e","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-07T05:13:04.791481Z","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:82bd5c83da960fcc15bb9ca93c8727d8ea34166c9a5540c537e8a9d80fe0661e","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-07T05:13:04.791481Z","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:2c10df67c16b6c7ef89fe7de3507861764501df3ab287296f624664dd166e3c0","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-07T05:13:04.791481Z","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:4b9da18c6d2ea6d381201699ddf79802817b41e920452577d299cbdc3a84509c","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-07T05:13:04.791481Z","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:b82260e4ec9a8e7f06e5f2a282a6fa5fcbf3c7d644e5fd7884b73991c7986554","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-07T05:13:04.791481Z","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:68e2ef2460026031e126a2b6250d1f831a1f3e3de1cb75ab4de580d98c395f31","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-07T05:13:04.791481Z","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:6948810af6b8fd35f08b6461936da358ae7c0606527ff0bb5cf4c5802be82512","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-07T05:13:04.791481Z","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:1b55b8df5184d4be6b1947518d5f3e19561036f4917afe0dd0e662bf6fac851a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:c1d118738cdb7538a0f713898417875a664151cefecc787b203a2181dd1ea99a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:95761fcc5e95241ab7876109f388f385e68dd9676e6362d8a8ef085c37a8476c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:43c50f850ee4c3214bdc42ba3b69c92c411101960baf109e75f43cd7b74172b0","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:7d3b002bcc35dd1d4b32bc19529557adee944aba35d02595376d3663b38b6755","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:9ac04670761b311234488678acd6ff6d6ac004d0b17f425788c2029a66ad1c23","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:8162182e0f75fd3eb12d891b085bead1759650e8002f471a3566f99373ee90de","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:55912e5b79a38933a126a213baf124fdfd5aee9730122dfb02f1994334f3ff09","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:3a7d72a1844eb5da3b1ab1e5e91396e56eec03f03a1ee030b5a652672c47287a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:d08df16e416932730ed2e77048eb4fdb10618b54ffd7c6022ade2bac8ee5c302","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:4a2c33c27dd1dc535820dc891dc2d992682d252e993672f6befcd3be28fbe1f4","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:a26b4a2a3d521d240d91d9f39c3c6a0be1ebb13742ba3278ac371c5870fd0595","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:97b75ecebb12b919b78330f41efdc1772e39d137b51e2ecbfd5e8af5cf36a98d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:b40020dae47e92cebcd7f84a1fe6b332564b87d410c50ea401a4a263d6668301","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:1b6f0c40fe39b36309f2141271f72d5e03b6208de7feb21f67030884866a815d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:13:04.791481Z","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:89d29b6c5e1de6e71088f6ddeeb9f7aac43ffa0ae6a51f58c6a4a70d18ae1b97","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-07T05:13:04.791481Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 159 outbound references and 0 inbound Pith citation observations for arXiv:2506.19857."}