{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:O7WUNDF7ZRGFVN4U3BQLKEXN4J","short_pith_number":"pith:O7WUNDF7","schema_version":"1.0","canonical_sha256":"77ed468cbfcc4c5ab794d860b512ede240f58cacf7858c2f51ff13b0e3ecfc9f","source":{"kind":"arxiv","id":"1010.3304","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.NI","math.MG"],"primary_cat":"math.GR","authors_text":"Gabriel H. Tucci, Yuliy Baryshnikov","submitted_at":"2010-10-16T02:06:28Z","abstract_excerpt":"In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes are called the \"core\" of the graph. We provide a formal definition of the core in a very general context and we study the properties of this set for several graphs."},"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":"1010.3304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-10-16T02:06:28Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.MG"],"title_canon_sha256":"11314189c3f396d8054ea19d34a5ffa4a85f1e2349737e48fedf2cf1437aa9a3","abstract_canon_sha256":"2761e56c47dce4521591126735203918e542cbe2a68ec6426fd04744232abbfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:38.141806Z","signature_b64":"iViAAjvmb4eOZQN1LmqH9DJY84uzyeQO68BkXIbCYw04WiKYI3NpPQRjWak6eIsiLHrmuxeRjBWa27a8H2BhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ed468cbfcc4c5ab794d860b512ede240f58cacf7858c2f51ff13b0e3ecfc9f","last_reissued_at":"2026-05-18T04:00:38.141267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:38.141267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.NI","math.MG"],"primary_cat":"math.GR","authors_text":"Gabriel H. Tucci, Yuliy Baryshnikov","submitted_at":"2010-10-16T02:06:28Z","abstract_excerpt":"In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes are called the \"core\" of the graph. We provide a formal definition of the core in a very general context and we study the properties of this set for several graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3304","kind":"arxiv","version":2},"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":"1010.3304","created_at":"2026-05-18T04:00:38.141363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3304v2","created_at":"2026-05-18T04:00:38.141363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3304","created_at":"2026-05-18T04:00:38.141363+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7WUNDF7ZRGF","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7WUNDF7ZRGFVN4U","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7WUNDF7","created_at":"2026-05-18T12:26:12.377268+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/O7WUNDF7ZRGFVN4U3BQLKEXN4J","json":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J.json","graph_json":"https://pith.science/api/pith-number/O7WUNDF7ZRGFVN4U3BQLKEXN4J/graph.json","events_json":"https://pith.science/api/pith-number/O7WUNDF7ZRGFVN4U3BQLKEXN4J/events.json","paper":"https://pith.science/paper/O7WUNDF7"},"agent_actions":{"view_html":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J","download_json":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J.json","view_paper":"https://pith.science/paper/O7WUNDF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3304&json=true","fetch_graph":"https://pith.science/api/pith-number/O7WUNDF7ZRGFVN4U3BQLKEXN4J/graph.json","fetch_events":"https://pith.science/api/pith-number/O7WUNDF7ZRGFVN4U3BQLKEXN4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/action/storage_attestation","attest_author":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/action/author_attestation","sign_citation":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/action/citation_signature","submit_replication":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/action/replication_record"}},"created_at":"2026-05-18T04:00:38.141363+00:00","updated_at":"2026-05-18T04:00:38.141363+00:00"}