{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XTZCBDRSSJ3L4OGNK3MFNDLELM","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":"2902d0f368f26be87654464d505737246fe201e379af416a9fe3b30e945e139c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-28T16:42:26Z","title_canon_sha256":"20e270ad69395e46fb531e88fb77412837a3da77c42119dde830dc7a8b736688"},"schema_version":"1.0","source":{"id":"1203.6310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6310","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6310v2","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6310","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"XTZCBDRSSJ3L","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XTZCBDRSSJ3L4OGN","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XTZCBDRS","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:639a3b119f7d7ca870f2b65ed5f5b7b00a4656756362b9149a129e2f309fad46","target":"graph","created_at":"2026-05-18T03:49:58Z","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":"The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Koml\\'os, Sark\\\"ozy and Szemer\\'edi. Here we prove that if p > n^{-1/2+\\eps}, then asymptotically almost surely, the binomial random graph G_{n,p} contains the square of a Hamilton cycle. This provides an `approximate threshold' for the property in the sense that the result fails to hold if p< n^{-1/2}.","authors_text":"Daniela K\\\"uhn, Deryk Osthus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-28T16:42:26Z","title":"On Posa's conjecture for random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6310","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:caf380941f134b1c51b4194c2c1c13fa0c9803c7fae4c070191c8eaf81dec38c","target":"record","created_at":"2026-05-18T03:49:58Z","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":"2902d0f368f26be87654464d505737246fe201e379af416a9fe3b30e945e139c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-28T16:42:26Z","title_canon_sha256":"20e270ad69395e46fb531e88fb77412837a3da77c42119dde830dc7a8b736688"},"schema_version":"1.0","source":{"id":"1203.6310","kind":"arxiv","version":2}},"canonical_sha256":"bcf2208e329276be38cd56d8568d645b02ab307360a03eae0fe146a3cb76e943","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcf2208e329276be38cd56d8568d645b02ab307360a03eae0fe146a3cb76e943","first_computed_at":"2026-05-18T03:49:58.035981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:58.035981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4LE23Y1dWWfMV/T1SuiKG3KrO0nfx2/BJXOj0f9uuzn6x3/Og4yZd5dJ4iWRSPlTnXsacI4o+7+S83k6fsiOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:58.036524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caf380941f134b1c51b4194c2c1c13fa0c9803c7fae4c070191c8eaf81dec38c","sha256:639a3b119f7d7ca870f2b65ed5f5b7b00a4656756362b9149a129e2f309fad46"],"state_sha256":"863ddb91784ce4148054cfe78bf7536be48acb9ae86c80cc7074edec7425eec9"}