{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FZ63KQHQKKTGUPIGVGZLB6SL3C","short_pith_number":"pith:FZ63KQHQ","schema_version":"1.0","canonical_sha256":"2e7db540f052a66a3d06a9b2b0fa4bd896f2aacf26bbfa38d1dc2662bc646565","source":{"kind":"arxiv","id":"1803.06324","version":3},"attestation_state":"computed","paper":{"title":"Fast approximation and exact computation of negative curvature parameters of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Abdulhakeem Mohammed, Feodor F. Dragan, Guillaume Ducoffe, J\\'er\\'emie Chalopin, Victor Chepoi, Yann Vax\\`es","submitted_at":"2018-03-16T17:25:06Z","abstract_excerpt":"In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to the study of graph hyperbolicity. The main contribution of this paper is a new characterization of the hyperbolicity of graphs. This characterization has algorithmic implications in the field of large-scale network analysis. A sharp estimate of graph hyperbolicity is useful, e.g., in embedding an undirected graph into hyperbolic space with minimum distortion"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.06324","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-16T17:25:06Z","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"title_canon_sha256":"0c9e928932506631f78f0ba1e68a6609ea00a8ed718f38ba1887952308623f84","abstract_canon_sha256":"8553157e7ecabef56876bb77ec8fda69aff0841789167902d310ef80d46318b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:04.742814Z","signature_b64":"PNw+ae3f2TC4Ts9TyX0Ed0ATHGSFdB/r89nHl5gvFnmttgIw/4+71L9brag9JaampIS7OCIxGHj+5XvhaFUfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e7db540f052a66a3d06a9b2b0fa4bd896f2aacf26bbfa38d1dc2662bc646565","last_reissued_at":"2026-05-17T23:44:04.742310Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:04.742310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast approximation and exact computation of negative curvature parameters of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Abdulhakeem Mohammed, Feodor F. Dragan, Guillaume Ducoffe, J\\'er\\'emie Chalopin, Victor Chepoi, Yann Vax\\`es","submitted_at":"2018-03-16T17:25:06Z","abstract_excerpt":"In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to the study of graph hyperbolicity. The main contribution of this paper is a new characterization of the hyperbolicity of graphs. This characterization has algorithmic implications in the field of large-scale network analysis. A sharp estimate of graph hyperbolicity is useful, e.g., in embedding an undirected graph into hyperbolic space with minimum distortion"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06324","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.06324","created_at":"2026-05-17T23:44:04.742406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06324v3","created_at":"2026-05-17T23:44:04.742406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06324","created_at":"2026-05-17T23:44:04.742406+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZ63KQHQKKTG","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZ63KQHQKKTGUPIG","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZ63KQHQ","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C","json":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C.json","graph_json":"https://pith.science/api/pith-number/FZ63KQHQKKTGUPIGVGZLB6SL3C/graph.json","events_json":"https://pith.science/api/pith-number/FZ63KQHQKKTGUPIGVGZLB6SL3C/events.json","paper":"https://pith.science/paper/FZ63KQHQ"},"agent_actions":{"view_html":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C","download_json":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C.json","view_paper":"https://pith.science/paper/FZ63KQHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06324&json=true","fetch_graph":"https://pith.science/api/pith-number/FZ63KQHQKKTGUPIGVGZLB6SL3C/graph.json","fetch_events":"https://pith.science/api/pith-number/FZ63KQHQKKTGUPIGVGZLB6SL3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C/action/storage_attestation","attest_author":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C/action/author_attestation","sign_citation":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C/action/citation_signature","submit_replication":"https://pith.science/pith/FZ63KQHQKKTGUPIGVGZLB6SL3C/action/replication_record"}},"created_at":"2026-05-17T23:44:04.742406+00:00","updated_at":"2026-05-17T23:44:04.742406+00:00"}