{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HHITTGSW72X76JOWDXXJBEXB2K","short_pith_number":"pith:HHITTGSW","schema_version":"1.0","canonical_sha256":"39d1399a56feafff25d61dee9092e1d2a963c8f279f105f0fb827b551ae25555","source":{"kind":"arxiv","id":"1403.1472","version":1},"attestation_state":"computed","paper":{"title":"Long paths in random Apollonian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alan Frieze, Colin Cooper","submitted_at":"2014-02-07T02:22:25Z","abstract_excerpt":"We consider the length $L(n)$ of the longest path in a randomly generated Apollonian Network (ApN) ${\\cal A}_n$. We show that w.h.p. $L(n)\\leq ne^{-\\log^cn}$ for any constant $c<2/3$."},"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":"1403.1472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-07T02:22:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a3b6c7bcd6be877366fbeee93d8628eb65278e0f974a3e4c6c2bd4bd921cfb18","abstract_canon_sha256":"d1c4136e381bd02a083a689492d79778b9d05920f641a4044a7bf2843b169c33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:58.964202Z","signature_b64":"/Gh+Gz3d0xNKS05nXxPvwQVsciHVlSmGzgOZmdMydE5zW7zkEN3Rybm5KZkxe5rmVfDlwn8lnDWjOnspIo4xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39d1399a56feafff25d61dee9092e1d2a963c8f279f105f0fb827b551ae25555","last_reissued_at":"2026-05-18T02:56:58.963735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:58.963735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long paths in random Apollonian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alan Frieze, Colin Cooper","submitted_at":"2014-02-07T02:22:25Z","abstract_excerpt":"We consider the length $L(n)$ of the longest path in a randomly generated Apollonian Network (ApN) ${\\cal A}_n$. We show that w.h.p. $L(n)\\leq ne^{-\\log^cn}$ for any constant $c<2/3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1472","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.1472","created_at":"2026-05-18T02:56:58.963801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1472v1","created_at":"2026-05-18T02:56:58.963801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1472","created_at":"2026-05-18T02:56:58.963801+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHITTGSW72X7","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHITTGSW72X76JOW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHITTGSW","created_at":"2026-05-18T12:28:30.664211+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/HHITTGSW72X76JOWDXXJBEXB2K","json":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K.json","graph_json":"https://pith.science/api/pith-number/HHITTGSW72X76JOWDXXJBEXB2K/graph.json","events_json":"https://pith.science/api/pith-number/HHITTGSW72X76JOWDXXJBEXB2K/events.json","paper":"https://pith.science/paper/HHITTGSW"},"agent_actions":{"view_html":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K","download_json":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K.json","view_paper":"https://pith.science/paper/HHITTGSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1472&json=true","fetch_graph":"https://pith.science/api/pith-number/HHITTGSW72X76JOWDXXJBEXB2K/graph.json","fetch_events":"https://pith.science/api/pith-number/HHITTGSW72X76JOWDXXJBEXB2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K/action/storage_attestation","attest_author":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K/action/author_attestation","sign_citation":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K/action/citation_signature","submit_replication":"https://pith.science/pith/HHITTGSW72X76JOWDXXJBEXB2K/action/replication_record"}},"created_at":"2026-05-18T02:56:58.963801+00:00","updated_at":"2026-05-18T02:56:58.963801+00:00"}