{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QSBOUKI2OJRLKJF7YKQEMZJQYF","short_pith_number":"pith:QSBOUKI2","canonical_record":{"source":{"id":"1210.5999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T18:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"9fe030ec2c4e6199ccd1751c87a8d6cde23b92de4b310a6eb7a7bee689c0e058","abstract_canon_sha256":"01e87d0f81cc932849dc6eff8510795a969eae857bb97faca719a83568111f00"},"schema_version":"1.0"},"canonical_sha256":"8482ea291a7262b524bfc2a0466530c1551ae3e67c5702568725505c3282d6fe","source":{"kind":"arxiv","id":"1210.5999","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5999","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5999v2","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5999","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"QSBOUKI2OJRL","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QSBOUKI2OJRLKJF7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QSBOUKI2","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QSBOUKI2OJRLKJF7YKQEMZJQYF","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T18:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"9fe030ec2c4e6199ccd1751c87a8d6cde23b92de4b310a6eb7a7bee689c0e058","abstract_canon_sha256":"01e87d0f81cc932849dc6eff8510795a969eae857bb97faca719a83568111f00"},"schema_version":"1.0"},"canonical_sha256":"8482ea291a7262b524bfc2a0466530c1551ae3e67c5702568725505c3282d6fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:33.461243Z","signature_b64":"CL8uy9ffOHMIpTyIbuuAVea+nt5KxCAk43sJeVeqX3xLI6Y7LiiZkqPgS7WcPcLT6TIzkjVPrULBkbxwFYKXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8482ea291a7262b524bfc2a0466530c1551ae3e67c5702568725505c3282d6fe","last_reissued_at":"2026-05-18T03:42:33.460759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:33.460759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5999","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-18T03:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNIpHCEH1ZNKEJOx0mB6W1o57ocVVbo9hrWUK5A50HkSntu+cmueFUS+/oxmlMEk6PCCD9zLay0ELam0Ua0aAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:57:16.837564Z"},"content_sha256":"da9531864ae224607e29d6cc8b0dc5605f2f81d265e4c380abc9021c348837b3","schema_version":"1.0","event_id":"sha256:da9531864ae224607e29d6cc8b0dc5605f2f81d265e4c380abc9021c348837b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QSBOUKI2OJRLKJF7YKQEMZJQYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Simi Haber","submitted_at":"2012-10-22T18:57:47Z","abstract_excerpt":"We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph $G=\\gc$. In this model $G$ is drawn uniformly from graphs with vertex set $[n]$, $m$ edges and minimum degree at least three. We focus on the case where $m=cn$ for constant $c$. If $c$ is sufficiently large then our algorithm runs in $O(n^{1+o(1)})$ time and succeeds w.h.p."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5999","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-18T03:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABJ9i6/5fRvfbcapM0ewmrV2qQd1LIw/LV4ftFmMFH3++kFs3BOEeQj6fl+DP0ez0f2fSVPlAeQTo/Ut3YmdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:57:16.838175Z"},"content_sha256":"2b7d688fe0d6a044972391e504cfe081d756b0ef3f3086d31fffaaab68ff2454","schema_version":"1.0","event_id":"sha256:2b7d688fe0d6a044972391e504cfe081d756b0ef3f3086d31fffaaab68ff2454"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSBOUKI2OJRLKJF7YKQEMZJQYF/bundle.json","state_url":"https://pith.science/pith/QSBOUKI2OJRLKJF7YKQEMZJQYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSBOUKI2OJRLKJF7YKQEMZJQYF/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-05-25T22:57:16Z","links":{"resolver":"https://pith.science/pith/QSBOUKI2OJRLKJF7YKQEMZJQYF","bundle":"https://pith.science/pith/QSBOUKI2OJRLKJF7YKQEMZJQYF/bundle.json","state":"https://pith.science/pith/QSBOUKI2OJRLKJF7YKQEMZJQYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSBOUKI2OJRLKJF7YKQEMZJQYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QSBOUKI2OJRLKJF7YKQEMZJQYF","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":"01e87d0f81cc932849dc6eff8510795a969eae857bb97faca719a83568111f00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T18:57:47Z","title_canon_sha256":"9fe030ec2c4e6199ccd1751c87a8d6cde23b92de4b310a6eb7a7bee689c0e058"},"schema_version":"1.0","source":{"id":"1210.5999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5999","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5999v2","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5999","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"QSBOUKI2OJRL","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QSBOUKI2OJRLKJF7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QSBOUKI2","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:2b7d688fe0d6a044972391e504cfe081d756b0ef3f3086d31fffaaab68ff2454","target":"graph","created_at":"2026-05-18T03:42:33Z","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 describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph $G=\\gc$. In this model $G$ is drawn uniformly from graphs with vertex set $[n]$, $m$ edges and minimum degree at least three. We focus on the case where $m=cn$ for constant $c$. If $c$ is sufficiently large then our algorithm runs in $O(n^{1+o(1)})$ time and succeeds w.h.p.","authors_text":"Alan Frieze, Simi Haber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T18:57:47Z","title":"An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5999","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:da9531864ae224607e29d6cc8b0dc5605f2f81d265e4c380abc9021c348837b3","target":"record","created_at":"2026-05-18T03:42:33Z","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":"01e87d0f81cc932849dc6eff8510795a969eae857bb97faca719a83568111f00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-22T18:57:47Z","title_canon_sha256":"9fe030ec2c4e6199ccd1751c87a8d6cde23b92de4b310a6eb7a7bee689c0e058"},"schema_version":"1.0","source":{"id":"1210.5999","kind":"arxiv","version":2}},"canonical_sha256":"8482ea291a7262b524bfc2a0466530c1551ae3e67c5702568725505c3282d6fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8482ea291a7262b524bfc2a0466530c1551ae3e67c5702568725505c3282d6fe","first_computed_at":"2026-05-18T03:42:33.460759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:33.460759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CL8uy9ffOHMIpTyIbuuAVea+nt5KxCAk43sJeVeqX3xLI6Y7LiiZkqPgS7WcPcLT6TIzkjVPrULBkbxwFYKXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:33.461243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da9531864ae224607e29d6cc8b0dc5605f2f81d265e4c380abc9021c348837b3","sha256:2b7d688fe0d6a044972391e504cfe081d756b0ef3f3086d31fffaaab68ff2454"],"state_sha256":"7c7401db6e95e8060544585754af6c89ef8239ecdf8597d2a176509e8f59c509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sl6DFa8krD2gr6yF4t0noN4Pqg3vug2UIrTuHbRbymT0q+XPZsgKerNZVilPMYoxIsEZakOSDcmdoB8424zfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:57:16.841465Z","bundle_sha256":"786fe9b585b8ca27aca00beae75909979ccc3836808306ff11b7a9016bc055d8"}}