{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:EUH423KMD3VGSHU524HEDYVNED","short_pith_number":"pith:EUH423KM","schema_version":"1.0","canonical_sha256":"250fcd6d4c1eea691e9dd70e41e2ad20d13e42e418ded9af62616e976b193ad5","source":{"kind":"arxiv","id":"0905.4650","version":2},"attestation_state":"computed","paper":{"title":"Hamilton cycles in random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"B\\'ela Bollob\\'as, J\\'ozsef Balogh, Mark Walters, Michael Krivelevich, Tobias M\\\"uller","submitted_at":"2009-05-28T13:43:04Z","abstract_excerpt":"We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it first becomes 2-connected. This answers a question of Penrose. We also show that in the k-nearest neighbor model, there is a constant \\kappa\\ such that almost every \\kappa-connected graph has a Hamilton cycle."},"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":"0905.4650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-05-28T13:43:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a8dbd7cb5b96eda643a868452b58fd2a173f692365e82ae47b83188cb6487e6d","abstract_canon_sha256":"83a9d28dd93debc5b833820296e175dc45f2e5ce4b96251d39e96486258cc963"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.512989Z","signature_b64":"2fYe2j7gU/+xhdqBX+e637EeYHwdWMeGnKN4jJFlpkcegR0DZnXogJQ8h2JAOtBwVAFrHaD+1BJB2f9YbnDrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250fcd6d4c1eea691e9dd70e41e2ad20d13e42e418ded9af62616e976b193ad5","last_reissued_at":"2026-05-18T03:41:20.512618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.512618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton cycles in random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"B\\'ela Bollob\\'as, J\\'ozsef Balogh, Mark Walters, Michael Krivelevich, Tobias M\\\"uller","submitted_at":"2009-05-28T13:43:04Z","abstract_excerpt":"We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it first becomes 2-connected. This answers a question of Penrose. We also show that in the k-nearest neighbor model, there is a constant \\kappa\\ such that almost every \\kappa-connected graph has a Hamilton cycle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4650","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":"0905.4650","created_at":"2026-05-18T03:41:20.512673+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.4650v2","created_at":"2026-05-18T03:41:20.512673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4650","created_at":"2026-05-18T03:41:20.512673+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUH423KMD3VG","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUH423KMD3VGSHU5","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUH423KM","created_at":"2026-05-18T12:25:59.703012+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/EUH423KMD3VGSHU524HEDYVNED","json":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED.json","graph_json":"https://pith.science/api/pith-number/EUH423KMD3VGSHU524HEDYVNED/graph.json","events_json":"https://pith.science/api/pith-number/EUH423KMD3VGSHU524HEDYVNED/events.json","paper":"https://pith.science/paper/EUH423KM"},"agent_actions":{"view_html":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED","download_json":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED.json","view_paper":"https://pith.science/paper/EUH423KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.4650&json=true","fetch_graph":"https://pith.science/api/pith-number/EUH423KMD3VGSHU524HEDYVNED/graph.json","fetch_events":"https://pith.science/api/pith-number/EUH423KMD3VGSHU524HEDYVNED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED/action/storage_attestation","attest_author":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED/action/author_attestation","sign_citation":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED/action/citation_signature","submit_replication":"https://pith.science/pith/EUH423KMD3VGSHU524HEDYVNED/action/replication_record"}},"created_at":"2026-05-18T03:41:20.512673+00:00","updated_at":"2026-05-18T03:41:20.512673+00:00"}