{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O7WUNDF7ZRGFVN4U3BQLKEXN4J","short_pith_number":"pith:O7WUNDF7","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"},"canonical_sha256":"77ed468cbfcc4c5ab794d860b512ede240f58cacf7858c2f51ff13b0e3ecfc9f","source":{"kind":"arxiv","id":"1010.3304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3304","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3304v2","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3304","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"O7WUNDF7ZRGF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O7WUNDF7ZRGFVN4U","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O7WUNDF7","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O7WUNDF7ZRGFVN4U3BQLKEXN4J","target":"record","payload":{"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"},"canonical_sha256":"77ed468cbfcc4c5ab794d860b512ede240f58cacf7858c2f51ff13b0e3ecfc9f","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"},"source_kind":"arxiv","source_id":"1010.3304","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWUhfx9REzX/1/OZmNp6CelOrP+Qz6UOAVemLjDOsBXlAYFXRtUIL3oshDyInWjJgbpfjxftyzi6CZsRgao4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:59:02.788188Z"},"content_sha256":"54ec6178f1b391a757b24bd52f7274b75184829b3691f9f097a40e91a8c09786","schema_version":"1.0","event_id":"sha256:54ec6178f1b391a757b24bd52f7274b75184829b3691f9f097a40e91a8c09786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O7WUNDF7ZRGFVN4U3BQLKEXN4J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAzb9tkdxVk4Xxpr9Ho/y/BVeqTCT4EWRgikFIDP1aAyzkbWXBnAHn2T5Hh2tsbPg7pBlbu7X1koNayV2cVyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:59:02.788924Z"},"content_sha256":"df33bdc118fb0acf487c354ff9854da1f6c2649a0fb8fd0f7e24a3edbac5bbc8","schema_version":"1.0","event_id":"sha256:df33bdc118fb0acf487c354ff9854da1f6c2649a0fb8fd0f7e24a3edbac5bbc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/bundle.json","state_url":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T06:59:02Z","links":{"resolver":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J","bundle":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/bundle.json","state":"https://pith.science/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7WUNDF7ZRGFVN4U3BQLKEXN4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O7WUNDF7ZRGFVN4U3BQLKEXN4J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2761e56c47dce4521591126735203918e542cbe2a68ec6426fd04744232abbfd","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-10-16T02:06:28Z","title_canon_sha256":"11314189c3f396d8054ea19d34a5ffa4a85f1e2349737e48fedf2cf1437aa9a3"},"schema_version":"1.0","source":{"id":"1010.3304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3304","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3304v2","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3304","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"O7WUNDF7ZRGF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O7WUNDF7ZRGFVN4U","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O7WUNDF7","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:df33bdc118fb0acf487c354ff9854da1f6c2649a0fb8fd0f7e24a3edbac5bbc8","target":"graph","created_at":"2026-05-18T04:00:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Gabriel H. Tucci, Yuliy Baryshnikov","cross_cats":["cond-mat.stat-mech","cs.NI","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-10-16T02:06:28Z","title":"Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3304","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:54ec6178f1b391a757b24bd52f7274b75184829b3691f9f097a40e91a8c09786","target":"record","created_at":"2026-05-18T04:00:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2761e56c47dce4521591126735203918e542cbe2a68ec6426fd04744232abbfd","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-10-16T02:06:28Z","title_canon_sha256":"11314189c3f396d8054ea19d34a5ffa4a85f1e2349737e48fedf2cf1437aa9a3"},"schema_version":"1.0","source":{"id":"1010.3304","kind":"arxiv","version":2}},"canonical_sha256":"77ed468cbfcc4c5ab794d860b512ede240f58cacf7858c2f51ff13b0e3ecfc9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ed468cbfcc4c5ab794d860b512ede240f58cacf7858c2f51ff13b0e3ecfc9f","first_computed_at":"2026-05-18T04:00:38.141267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:38.141267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iViAAjvmb4eOZQN1LmqH9DJY84uzyeQO68BkXIbCYw04WiKYI3NpPQRjWak6eIsiLHrmuxeRjBWa27a8H2BhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:38.141806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.3304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54ec6178f1b391a757b24bd52f7274b75184829b3691f9f097a40e91a8c09786","sha256:df33bdc118fb0acf487c354ff9854da1f6c2649a0fb8fd0f7e24a3edbac5bbc8"],"state_sha256":"087d7e53e90dca09bc7bc0398820861c4bd5fddda2d0fd3916d62de1175e7ba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLfbhh/cVGAFFM56GxmsR3PAFQoOHal3xkfPshM0CbmASYRtEmk4DfPes1KitXNlup4UUqwkkVh3iO2a1AFqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:59:02.792760Z","bundle_sha256":"5229252a4306529c854d1919dc3212c15aec256711a2f62c73a1fab8aa831b0b"}}