{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:56KML5TUD2BKK476HALDKJD34T","short_pith_number":"pith:56KML5TU","canonical_record":{"source":{"id":"1303.5213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T09:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"cce32dfc70974ef27944f0e00967deed3deb64580bee084b058e14826e10127c","abstract_canon_sha256":"900eea0ea02f620e6830039ba4d86f0633d3d21362eae3214b8b6eaf34f90857"},"schema_version":"1.0"},"canonical_sha256":"ef94c5f6741e82a573fe381635247be4e9d3e1972b3d6f02ee7980864103db54","source":{"kind":"arxiv","id":"1303.5213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5213","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5213v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5213","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"56KML5TUD2BK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"56KML5TUD2BKK476","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"56KML5TU","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:56KML5TUD2BKK476HALDKJD34T","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T09:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"cce32dfc70974ef27944f0e00967deed3deb64580bee084b058e14826e10127c","abstract_canon_sha256":"900eea0ea02f620e6830039ba4d86f0633d3d21362eae3214b8b6eaf34f90857"},"schema_version":"1.0"},"canonical_sha256":"ef94c5f6741e82a573fe381635247be4e9d3e1972b3d6f02ee7980864103db54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:13.602363Z","signature_b64":"Uj3bNbfRj6QvXsDSQw5fTFPu1XJHLMnur1g0T3XLNbkeuZSGNtG3zXVurv0Y8Ck6eAqyXSuXFoMG+NNVNNSNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef94c5f6741e82a573fe381635247be4e9d3e1972b3d6f02ee7980864103db54","last_reissued_at":"2026-05-18T03:30:13.601589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:13.601589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5213","source_version":1,"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-18T03:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rL5bCjgrmyvTgYL0NxH0YJmPXc3vcDarDAyOg7Aj+FVL1jCqc8I/yndpwHVGl5rJ9XDINVRJl/nWjDFvdZCyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:30:07.784077Z"},"content_sha256":"43b883ccea417abd9fbeb5e4dcc1922e8aec2b094997a302ee3d8f75d61272e2","schema_version":"1.0","event_id":"sha256:43b883ccea417abd9fbeb5e4dcc1922e8aec2b094997a302ee3d8f75d61272e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:56KML5TUD2BKK476HALDKJD34T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Longest Paths and the Diameter in Random Apollonian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Mehrabian, Cristiane M. Sato, Ehsan Ebrahimzadeh, Jonathan Zung, Linda Farczadi, Nick Wormald, Pu Gao","submitted_at":"2013-03-21T09:52:09Z","abstract_excerpt":"We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at random, add a vertex inside that face and join it to the vertices of the face. After n-3 steps, we obtain a random triangulated plane graph with n vertices, which is called a Random Apollonian Network (RAN). We show that asymptotically almost surely (a.a.s.) every path in a RAN has length o(n), refuting a conjecture of Frieze and Tsourakakis. We also show that a RAN always has a path of length (2n-5)^{log 2/log 3}, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5213","kind":"arxiv","version":1},"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-18T03:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfdC/t75Th2j288Ly1GWd469jAgJsthcnROEu9leIz9VIFozdY5AoLHme1sMJAN5sgAxwlI7IRe7ZcCS8ZKIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:30:07.784446Z"},"content_sha256":"a55dcd7cd11d63c26a7d30f7d67a5d23b6fec88651702e658424f1933b85291b","schema_version":"1.0","event_id":"sha256:a55dcd7cd11d63c26a7d30f7d67a5d23b6fec88651702e658424f1933b85291b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56KML5TUD2BKK476HALDKJD34T/bundle.json","state_url":"https://pith.science/pith/56KML5TUD2BKK476HALDKJD34T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56KML5TUD2BKK476HALDKJD34T/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-01T17:30:07Z","links":{"resolver":"https://pith.science/pith/56KML5TUD2BKK476HALDKJD34T","bundle":"https://pith.science/pith/56KML5TUD2BKK476HALDKJD34T/bundle.json","state":"https://pith.science/pith/56KML5TUD2BKK476HALDKJD34T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56KML5TUD2BKK476HALDKJD34T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:56KML5TUD2BKK476HALDKJD34T","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":"900eea0ea02f620e6830039ba4d86f0633d3d21362eae3214b8b6eaf34f90857","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T09:52:09Z","title_canon_sha256":"cce32dfc70974ef27944f0e00967deed3deb64580bee084b058e14826e10127c"},"schema_version":"1.0","source":{"id":"1303.5213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5213","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5213v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5213","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"56KML5TUD2BK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"56KML5TUD2BKK476","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"56KML5TU","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a55dcd7cd11d63c26a7d30f7d67a5d23b6fec88651702e658424f1933b85291b","target":"graph","created_at":"2026-05-18T03:30:13Z","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":"We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at random, add a vertex inside that face and join it to the vertices of the face. After n-3 steps, we obtain a random triangulated plane graph with n vertices, which is called a Random Apollonian Network (RAN). We show that asymptotically almost surely (a.a.s.) every path in a RAN has length o(n), refuting a conjecture of Frieze and Tsourakakis. We also show that a RAN always has a path of length (2n-5)^{log 2/log 3}, and ","authors_text":"Abbas Mehrabian, Cristiane M. Sato, Ehsan Ebrahimzadeh, Jonathan Zung, Linda Farczadi, Nick Wormald, Pu Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T09:52:09Z","title":"On the Longest Paths and the Diameter in Random Apollonian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5213","kind":"arxiv","version":1},"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:43b883ccea417abd9fbeb5e4dcc1922e8aec2b094997a302ee3d8f75d61272e2","target":"record","created_at":"2026-05-18T03:30:13Z","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":"900eea0ea02f620e6830039ba4d86f0633d3d21362eae3214b8b6eaf34f90857","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T09:52:09Z","title_canon_sha256":"cce32dfc70974ef27944f0e00967deed3deb64580bee084b058e14826e10127c"},"schema_version":"1.0","source":{"id":"1303.5213","kind":"arxiv","version":1}},"canonical_sha256":"ef94c5f6741e82a573fe381635247be4e9d3e1972b3d6f02ee7980864103db54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef94c5f6741e82a573fe381635247be4e9d3e1972b3d6f02ee7980864103db54","first_computed_at":"2026-05-18T03:30:13.601589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:13.601589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uj3bNbfRj6QvXsDSQw5fTFPu1XJHLMnur1g0T3XLNbkeuZSGNtG3zXVurv0Y8Ck6eAqyXSuXFoMG+NNVNNSNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:13.602363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43b883ccea417abd9fbeb5e4dcc1922e8aec2b094997a302ee3d8f75d61272e2","sha256:a55dcd7cd11d63c26a7d30f7d67a5d23b6fec88651702e658424f1933b85291b"],"state_sha256":"18de683538e94e4177f332f11e57d6b649b507d2b856e07dca6d920afff47d1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxWF3d8gv1tGH98G89T8pSt7xACbhiwqJcb6cdCZYbebfVYtlrk3hcar/dVad2xyExvS77F3tPnbq0C2xqD0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:30:07.786603Z","bundle_sha256":"029620739d30463ca2c256c8649adbc3a43757e110968224b5b85e54273d31f0"}}