{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D5XDTN2BBAK4BWBN2VSFHIPQY3","short_pith_number":"pith:D5XDTN2B","canonical_record":{"source":{"id":"1301.5836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-24T16:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"e4c0b7d76183f9666acdd331d63734a589a8bb260c02c6485fc150edccca479c","abstract_canon_sha256":"0881d314aa38e912e5a34fbab56b8d81a1ca921df09f736744dc109b804928a9"},"schema_version":"1.0"},"canonical_sha256":"1f6e39b7410815c0d82dd56453a1f0c6f528e0f1d20b35a3b521db44a795bb1b","source":{"kind":"arxiv","id":"1301.5836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5836","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5836v1","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5836","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"D5XDTN2BBAK4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D5XDTN2BBAK4BWBN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D5XDTN2B","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D5XDTN2BBAK4BWBN2VSFHIPQY3","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-24T16:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"e4c0b7d76183f9666acdd331d63734a589a8bb260c02c6485fc150edccca479c","abstract_canon_sha256":"0881d314aa38e912e5a34fbab56b8d81a1ca921df09f736744dc109b804928a9"},"schema_version":"1.0"},"canonical_sha256":"1f6e39b7410815c0d82dd56453a1f0c6f528e0f1d20b35a3b521db44a795bb1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:37.234976Z","signature_b64":"tw8U+Hmm8ZixAHbAYGMBWo8driAPUDn+okwXLGkEumVrKz9yCgRiCuV6P30lMUjFA65wdCl01P/4D7X3qsitAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6e39b7410815c0d82dd56453a1f0c6f528e0f1d20b35a3b521db44a795bb1b","last_reissued_at":"2026-05-18T03:35:37.234176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:37.234176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5836","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:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IaUQzhXRbZhcSjbZwJB/obybIovVNWUGXuvv1jCUjmbtFfNLnNkioF6Jzdg++CoSdKL2XA6+pP3hT9f96dBfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:58:59.427755Z"},"content_sha256":"4c9ee5e9278e55906e50f9f28431c356507feeea9662cfa113d320f8dfe0085e","schema_version":"1.0","event_id":"sha256:4c9ee5e9278e55906e50f9f28431c356507feeea9662cfa113d320f8dfe0085e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D5XDTN2BBAK4BWBN2VSFHIPQY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Hamilton cycles in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Peter Allen, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2013-01-24T16:44:03Z","abstract_excerpt":"We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a question of Dudek and Frieze [Random Structures Algorithms], who used a second moment method to show that tight Hamilton cycles exist even for p=omega(n)/n (r>2) where omega(n) tends to infinity arbitrary slowly, and for p=(e+o(1))/n (r>3).\n  The method we develop for proving our result applies to related problems as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5836","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:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fOU2zkWu8L2WmFav/vMGdYT7Wy6egVPdtPWz7CMjlmaVPJsIqwnP+g45mwVi8xIltEU77gQu/Wex3nV38T6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:58:59.428490Z"},"content_sha256":"e30ab81125f229f0f6653c31536df471dc970c1aba5d8b12e79920c605df3f6d","schema_version":"1.0","event_id":"sha256:e30ab81125f229f0f6653c31536df471dc970c1aba5d8b12e79920c605df3f6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5XDTN2BBAK4BWBN2VSFHIPQY3/bundle.json","state_url":"https://pith.science/pith/D5XDTN2BBAK4BWBN2VSFHIPQY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5XDTN2BBAK4BWBN2VSFHIPQY3/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-08T17:58:59Z","links":{"resolver":"https://pith.science/pith/D5XDTN2BBAK4BWBN2VSFHIPQY3","bundle":"https://pith.science/pith/D5XDTN2BBAK4BWBN2VSFHIPQY3/bundle.json","state":"https://pith.science/pith/D5XDTN2BBAK4BWBN2VSFHIPQY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5XDTN2BBAK4BWBN2VSFHIPQY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D5XDTN2BBAK4BWBN2VSFHIPQY3","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":"0881d314aa38e912e5a34fbab56b8d81a1ca921df09f736744dc109b804928a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-24T16:44:03Z","title_canon_sha256":"e4c0b7d76183f9666acdd331d63734a589a8bb260c02c6485fc150edccca479c"},"schema_version":"1.0","source":{"id":"1301.5836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5836","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5836v1","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5836","created_at":"2026-05-18T03:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"D5XDTN2BBAK4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D5XDTN2BBAK4BWBN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D5XDTN2B","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e30ab81125f229f0f6653c31536df471dc970c1aba5d8b12e79920c605df3f6d","target":"graph","created_at":"2026-05-18T03:35:37Z","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 give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a question of Dudek and Frieze [Random Structures Algorithms], who used a second moment method to show that tight Hamilton cycles exist even for p=omega(n)/n (r>2) where omega(n) tends to infinity arbitrary slowly, and for p=(e+o(1))/n (r>3).\n  The method we develop for proving our result applies to related problems as well.","authors_text":"Julia B\\\"ottcher, Peter Allen, Yoshiharu Kohayakawa, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-24T16:44:03Z","title":"Tight Hamilton cycles in random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5836","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:4c9ee5e9278e55906e50f9f28431c356507feeea9662cfa113d320f8dfe0085e","target":"record","created_at":"2026-05-18T03:35:37Z","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":"0881d314aa38e912e5a34fbab56b8d81a1ca921df09f736744dc109b804928a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-24T16:44:03Z","title_canon_sha256":"e4c0b7d76183f9666acdd331d63734a589a8bb260c02c6485fc150edccca479c"},"schema_version":"1.0","source":{"id":"1301.5836","kind":"arxiv","version":1}},"canonical_sha256":"1f6e39b7410815c0d82dd56453a1f0c6f528e0f1d20b35a3b521db44a795bb1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f6e39b7410815c0d82dd56453a1f0c6f528e0f1d20b35a3b521db44a795bb1b","first_computed_at":"2026-05-18T03:35:37.234176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:37.234176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tw8U+Hmm8ZixAHbAYGMBWo8driAPUDn+okwXLGkEumVrKz9yCgRiCuV6P30lMUjFA65wdCl01P/4D7X3qsitAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:37.234976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c9ee5e9278e55906e50f9f28431c356507feeea9662cfa113d320f8dfe0085e","sha256:e30ab81125f229f0f6653c31536df471dc970c1aba5d8b12e79920c605df3f6d"],"state_sha256":"26893dd22dc0ffa51dae683f78fe6ff854b4aedc95e49065b7875f950cc49d2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6Oo9G7wniXpk9Bq9rB2N+iiTnP5u3lOmZmqWtYXwm/l/7Y5J2RU57TmnUe9+PNnOlfaln1kbkuwW9yNgkFrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:58:59.432717Z","bundle_sha256":"08b0807cf6dcf32fd4150dc2109d965c620eaaa72ea1d4f29afb55df443412ef"}}