{"as_of":"2026-08-09T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:644e45824ae3902272945e762a673a565b755581c521aa521b23acf35aaaedbc","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:14:37.852006Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.24096/citation-record","integrity":"/paper/2607.24096/integrity","json":"/paper/2607.24096/citation-record.json","paper":"/paper/2607.24096"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:14:35.408245Z","title":"Hyper- bolic Embeddings for Near-Optimal Greedy Routing","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:35.408245Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:950f3b0322045073d5fab11e33ad4bb3c7dc80af823fbe4bdaf70e2fcba5a688","observation_id":"62ecc293-6622-4fea-aa68-4b2607dfde48","resolution":{"observed_at":"2026-07-31T23:14:35.408245Z","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-07-31T23:14:35.510744Z","title":"Sustaining the Internet with Hyperbolic Mapping","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:35.510744Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:2ef89a0b1d4c0ead9d2dac6e6d659648ce39388a113bba719dd625326ee000d7","observation_id":"0187fc4f-9213-4147-b503-c53e4f56a6a8","resolution":{"observed_at":"2026-07-31T23:14:35.510744Z","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-07-31T23:14:35.707634Z","title":"On Comput- ing the Hyperbolicity of Real-World Graphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:35.707634Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:20f39d51e44258b3081fff7d37ec220274a922d6d34db530cfe765e8bb411508","observation_id":"802f9dc2-d7b0-40e8-92b7-755a5be9542b","resolution":{"observed_at":"2026-07-31T23:14:35.707634Z","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-07-31T23:14:35.848994Z","title":"Bridson and André Haefliger.Metric Spaces of Non-Positive Curvature","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:35.848994Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:ff1b75842fe104e8ebc03c8ad217a79743cf8dd21cf783e41ca310298261097a","observation_id":"339fcb62-f398-4b7c-8a08-66fb5aa9db60","resolution":{"observed_at":"2026-07-31T23:14:35.848994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.10359","last_updated":"2017-05-29T18:47:30Z","snapshot_observed_at":"2026-07-06T05:44:43.710570Z","submitted_at":"2017-05-29T18:47:30Z","title":"Neural Embeddings of Graphs in Hyperbolic Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.10359","snapshot_observed_at":"2026-07-31T23:14:35.946633Z","title":"Neural Embeddings of Graphs in Hyperbolic Space","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:35.946633Z"},"links":{"cited_paper":"/paper/1705.10359","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:5c118e3bc749d6fe9c1361eb8629b43d1639887e01b2c13075cf6d2fa56a5a0e","observation_id":"0788070f-6f75-42db-9b98-91a74641c7c4","resolution":{"observed_at":"2026-07-31T23:14:35.946633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03203","last_updated":"2020-09-27T19:40:07Z","snapshot_observed_at":"2026-07-06T08:05:33.053199Z","submitted_at":"2019-07-06T23:20:59Z","title":"Average Gromov hyperbolicity and the Parisi ansatz","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03203","snapshot_observed_at":"2026-07-31T23:14:36.098714Z","title":"Average Gromov hyperbolicity and the Parisi ansatz","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:36.098714Z"},"links":{"cited_paper":"/paper/1907.03203","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:8cd8df8d0cf96afebc69c9dee447d4f0e89298da1413c7afd1d5c5cc8d9f2103","observation_id":"9ae334c2-da53-4c0e-8cc5-ddd73e5f12d9","resolution":{"observed_at":"2026-07-31T23:14:36.098714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1201.1717","last_updated":"2013-09-14T02:35:20Z","snapshot_observed_at":"2026-07-06T02:40:35.781420Z","submitted_at":"2012-01-09T09:30:38Z","title":"On the Hyperbolicity of Small-World and Tree-Like Random Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.1717","snapshot_observed_at":"2026-07-31T23:14:36.291353Z","title":"On the Hyperbolicity of Small-World and Tree-Like Random Graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:36.291353Z"},"links":{"cited_paper":"/paper/1201.1717","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:29a4c09576cabce3c8d692b5339587ad57239d32d685dec359d8a2b893759054","observation_id":"79008499-3ed8-40a8-bb20-893beda2d7b4","resolution":{"observed_at":"2026-07-31T23:14:36.291353Z","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-07-31T23:14:36.455644Z","title":"What is the dimension of citation space?","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:36.455644Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:aec2d9daa750f33dc403ed5fa57627c20709c739b19ad435053b84a3fe0610cc","observation_id":"060adcca-0ac5-4929-91f2-a0ec91c705ab","resolution":{"observed_at":"2026-07-31T23:14:36.455644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1210.3323","last_updated":"2015-02-10T11:42:11Z","snapshot_observed_at":"2026-07-06T02:57:28.205397Z","submitted_at":"2012-10-11T19:14:02Z","title":"Computing the Gromov hyperbolicity of a discrete metric space","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1210.3323","snapshot_observed_at":"2026-07-31T23:14:36.619427Z","title":"Computing the Gromov hyper- bolicity of a discrete metric space","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:36.619427Z"},"links":{"cited_paper":"/paper/1210.3323","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:070e0f263a505ce88349192579cd2808aa51e8bdbb3885790496daed1d756aa7","observation_id":"1259c8ad-1e4d-4783-87ab-a5a84841aaaf","resolution":{"observed_at":"2026-07-31T23:14:36.619427Z","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-07-31T23:14:36.736620Z","title":"Hyperbolic Groups","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:36.736620Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:b85444da36ea3e0d74e7fce61e4e918bc9c096ef1f2bb793cec4a222796b729e","observation_id":"d3fc566a-3c98-4490-b0a8-ebb0c157e7c3","resolution":{"observed_at":"2026-07-31T23:14:36.736620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.1470","last_updated":"2012-05-07T17:43:59Z","snapshot_observed_at":"2026-07-06T02:47:40.543227Z","submitted_at":"2012-05-07T17:43:59Z","title":"Random Hyperbolic Graphs: Degree Sequence and Clustering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.1470","snapshot_observed_at":"2026-07-31T23:14:36.837270Z","title":"Random Hyperbolic Graphs: Degree Sequence and Clustering","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:36.837270Z"},"links":{"cited_paper":"/paper/1205.1470","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:fb0db7da28bc63c8dae64dfb0cbc85f61b8383dda3f4f7f7c615b93390d63ca1","observation_id":"fd4aeb2f-ca50-4c76-8c87-c2388c032481","resolution":{"observed_at":"2026-07-31T23:14:36.837270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1105.3925","last_updated":"2011-05-19T15:58:14Z","snapshot_observed_at":"2026-08-08T06:34:19.756714Z","submitted_at":"2011-05-19T15:58:14Z","title":"On the tree-likeness of hyperbolic spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1105.3925","snapshot_observed_at":"2026-07-31T23:14:36.929723Z","title":"On the tree-likeness of hyperbolic spaces","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:36.929723Z"},"links":{"cited_paper":"/paper/1105.3925","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:39e851ce39cc9b16ece3ad5e193b3709c74385d57cfe337f263928b97f3cfaf6","observation_id":"74d89a28-43a7-42b9-b839-f7f5037f5e44","resolution":{"observed_at":"2026-07-31T23:14:36.929723Z","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-07-31T23:14:37.019868Z","title":"MAA Textbooks","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.019868Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:b5a6dba2c2c235e66045396f00b62106fb85a8c3233f366df31e8506b2990302","observation_id":"78781b36-fbf7-4816-b24c-2d7b272a5829","resolution":{"observed_at":"2026-07-31T23:14:37.019868Z","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-07-31T23:14:37.112475Z","title":"Hyperbolic geometry of earthquake networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.112475Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:6349ea945aa8376d9ea8158da0d410147fb5a175ff7b528f14c36ac67dd617df","observation_id":"c51bf217-9a0c-4e4b-810f-0b8f1373d66e","resolution":{"observed_at":"2026-07-31T23:14:37.112475Z","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-07-31T23:14:37.198592Z","title":"Bridging Arbitrary and Tree Metrics via Differentiable Gromov Hyperbolicity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.198592Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:3176d1713727eba997f1c9e959b4694bab23b735989bf7251fbbf1647d90034b","observation_id":"ca104bb2-4221-43d3-8dfd-f1e1d3a621a3","resolution":{"observed_at":"2026-07-31T23:14:37.198592Z","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-07-31T23:14:37.262874Z","title":"Scaled Gromov four- point condition for network graph curvature computation","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.262874Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:7f34068e1591e4cc5b1581392880206ccc5453799c86bc60620f2f1857d4d6ae","observation_id":"868df623-41e8-4772-b35d-f0f1be269202","resolution":{"observed_at":"2026-07-31T23:14:37.262874Z","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-07-31T23:14:37.327029Z","title":"Scaled Gromov hyperbolic graphs","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.327029Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:4ac4162453dd8001e563a30543a6326ea1ddae209ae7f491e8e6de470483f71d","observation_id":"99b68594-81b0-47df-9292-14dc816a5736","resolution":{"observed_at":"2026-07-31T23:14:37.327029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08153","last_updated":"2023-10-02T20:05:17Z","snapshot_observed_at":"2026-07-06T13:21:35.473469Z","submitted_at":"2022-06-16T13:17:07Z","title":"A combinatorial higher-rank hyperbolicity condition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.08153","snapshot_observed_at":"2026-07-31T23:14:37.425804Z","title":"A combinatorial higher-rank hyperbolicity condition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.425804Z"},"links":{"cited_paper":"/paper/2206.08153","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:cf91ad77f4281299e4d7e828cd34cb4fe65b223b3e285da87e09f340fd50f077","observation_id":"cf6934f4-3c5c-4757-9893-645937aac77e","resolution":{"observed_at":"2026-07-31T23:14:37.425804Z","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-07-31T23:14:37.524693Z","title":"Hyperbolic geometry of complex networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.524693Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:8b3f13df77e580ab26be6eedc12f16f1daaf55316a74211311e94f1450a31a1f","observation_id":"fb14f245-5f19-4c08-88f7-38a26c876c36","resolution":{"observed_at":"2026-07-31T23:14:37.524693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1009.5700","last_updated":"2012-07-08T17:39:49Z","snapshot_observed_at":"2026-07-06T02:16:01.971068Z","submitted_at":"2010-09-28T21:30:51Z","title":"Lack of Hyperbolicity in Asymptotic Erd\\\"os--Renyi Sparse Random Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.5700","snapshot_observed_at":"2026-07-31T23:14:37.591834Z","title":"Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.591834Z"},"links":{"cited_paper":"/paper/1009.5700","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:f9da9ecb89ddcb03eb0a0761c4dee0fc67ac8691fcea7387c54ba714f5be924d","observation_id":"de5aab7b-51ae-49f0-b0ff-90a4bd48b2a4","resolution":{"observed_at":"2026-07-31T23:14:37.591834Z","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-07-31T23:14:37.657878Z","title":"Strong hyperbolicity","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.657878Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:09bb3d5ffe7985439403af771fdb7c4c767aa81645c2af673f13c4b65263b645","observation_id":"c5bc81e6-b822-4655-b652-49bc83854c10","resolution":{"observed_at":"2026-07-31T23:14:37.657878Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.4384","last_updated":"2014-01-20T13:55:38Z","snapshot_observed_at":"2026-07-31T23:31:33.903873Z","submitted_at":"2012-05-20T05:12:09Z","title":"Network Mapping by Replaying Hyperbolic Growth","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.4384","snapshot_observed_at":"2026-07-31T23:14:37.720959Z","title":"Replaying the Geometric Growth of Complex Networks and Application to the AS Internet","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.720959Z"},"links":{"cited_paper":"/paper/1205.4384","citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:56764cde9b1c997e9c63f9800880abe127ad59c1a4994fea32d00328a2fd9804","observation_id":"30041fdd-8367-4e38-8732-52237bbc3262","resolution":{"observed_at":"2026-07-31T23:14:37.720959Z","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-07-31T23:14:37.783524Z","title":"HyperbolicEmbeddingofInternetGraphforDistance Estimation and Overlay Construction","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.783524Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:ead9fc5530c547c063c2f4ccf22e7af05f978632b68f2b71c50f847d9f1c5136","observation_id":"a2caccca-85ca-40f7-8558-cb70fcfab273","resolution":{"observed_at":"2026-07-31T23:14:37.783524Z","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-07-31T23:14:37.852006Z","title":"Hyperbolic Geometry of the Olfactory Space","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T23:14:37.852006Z"},"links":{"citing_paper":"/paper/2607.24096"},"observation_digest":"sha256:8576e08623ea9eeaa3b77b6b64ab0c377402d9c12e1da48da3a184e539568466","observation_id":"425bbd10-0196-4832-9f6d-93dc0989ce64","resolution":{"observed_at":"2026-07-31T23:14:37.852006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24096","last_updated":"2026-07-28T06:12:28Z","latest_version":2,"primary_category":"math.MG","snapshot_observed_at":"2026-08-06T02:10:54.065261Z","submitted_at":"2026-07-27T07:36:15Z","title":"Characterizing Hyperbolicity in Graphs"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.24096."}