{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:F5Z3I7YUKHEVWAKJA4EXPYADWR","short_pith_number":"pith:F5Z3I7YU","canonical_record":{"source":{"id":"1006.1909","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-09T21:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"2ec66b907b612d9c6466cd37a199060660ac54b64d4863a2b3d8771f09c67ca3","abstract_canon_sha256":"eaf582743c6bc69b43d0fc02cabdc28e4037700a6d76fdd4e7bf1ab9adaed019"},"schema_version":"1.0"},"canonical_sha256":"2f73b47f1451c95b0149070977e003b479bc160ee001bccca4e01cda377cdc2f","source":{"kind":"arxiv","id":"1006.1909","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1909","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1909v3","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1909","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"F5Z3I7YUKHEV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F5Z3I7YUKHEVWAKJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F5Z3I7YU","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:F5Z3I7YUKHEVWAKJA4EXPYADWR","target":"record","payload":{"canonical_record":{"source":{"id":"1006.1909","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-09T21:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"2ec66b907b612d9c6466cd37a199060660ac54b64d4863a2b3d8771f09c67ca3","abstract_canon_sha256":"eaf582743c6bc69b43d0fc02cabdc28e4037700a6d76fdd4e7bf1ab9adaed019"},"schema_version":"1.0"},"canonical_sha256":"2f73b47f1451c95b0149070977e003b479bc160ee001bccca4e01cda377cdc2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:08.207860Z","signature_b64":"o30+4IhJ71xacJJdMLOMOvf1oSxXO3YXJ8vk4peTxD/wVzHfrMq2kwUW/yZIkOyoPoNj3ukuj9hYtzciiTV3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f73b47f1451c95b0149070977e003b479bc160ee001bccca4e01cda377cdc2f","last_reissued_at":"2026-05-18T04:28:08.207179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:08.207179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.1909","source_version":3,"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-18T04:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufJ1zq7CrWU6XT7GgAP0BdxSg9XOrvypeixUYmxty7QK4xtcLm8FMSoIO62hLbRocA45MMJWh+8ARBVW+zBtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:11:12.530841Z"},"content_sha256":"90d22857baabaaff981517d0897a407d30f1f74d863a1af26dc881ae079a9f9b","schema_version":"1.0","event_id":"sha256:90d22857baabaaff981517d0897a407d30f1f74d863a1af26dc881ae079a9f9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:F5Z3I7YUKHEVWAKJA4EXPYADWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loose Hamilton Cycles in Random Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek","submitted_at":"2010-06-09T21:07:47Z","abstract_excerpt":"In the random hypergraph $H_{n,p;k}$ each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if $p n^{k-1}/\\log n$ tends to infinity with $n$ then $$\\lim_{\\substack{n\\to \\infty 2(k-1) |n}}\\Pr(H_{n,p;k}\\ contains\\ a\\ loose\\ Hamilton\\ cycle)=1.$$ This is asymptotically best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1909","kind":"arxiv","version":3},"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-18T04:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuVkCGXvxCyIHqufON4WkBt82zEu11oZVuI6E++nVn5Oq6vfvgOynNqce/Az8rzKP1c5/raS71glZhuJx6aYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:11:12.531307Z"},"content_sha256":"fe757c8d02eada336e08df08845fe058af5c378fe10cdc05c1438ddb6afcc7e6","schema_version":"1.0","event_id":"sha256:fe757c8d02eada336e08df08845fe058af5c378fe10cdc05c1438ddb6afcc7e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5Z3I7YUKHEVWAKJA4EXPYADWR/bundle.json","state_url":"https://pith.science/pith/F5Z3I7YUKHEVWAKJA4EXPYADWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5Z3I7YUKHEVWAKJA4EXPYADWR/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-08-19T10:11:12Z","links":{"resolver":"https://pith.science/pith/F5Z3I7YUKHEVWAKJA4EXPYADWR","bundle":"https://pith.science/pith/F5Z3I7YUKHEVWAKJA4EXPYADWR/bundle.json","state":"https://pith.science/pith/F5Z3I7YUKHEVWAKJA4EXPYADWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5Z3I7YUKHEVWAKJA4EXPYADWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:F5Z3I7YUKHEVWAKJA4EXPYADWR","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":"eaf582743c6bc69b43d0fc02cabdc28e4037700a6d76fdd4e7bf1ab9adaed019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-09T21:07:47Z","title_canon_sha256":"2ec66b907b612d9c6466cd37a199060660ac54b64d4863a2b3d8771f09c67ca3"},"schema_version":"1.0","source":{"id":"1006.1909","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1909","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1909v3","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1909","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"F5Z3I7YUKHEV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F5Z3I7YUKHEVWAKJ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F5Z3I7YU","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:fe757c8d02eada336e08df08845fe058af5c378fe10cdc05c1438ddb6afcc7e6","target":"graph","created_at":"2026-05-18T04:28:08Z","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":"In the random hypergraph $H_{n,p;k}$ each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if $p n^{k-1}/\\log n$ tends to infinity with $n$ then $$\\lim_{\\substack{n\\to \\infty 2(k-1) |n}}\\Pr(H_{n,p;k}\\ contains\\ a\\ loose\\ Hamilton\\ cycle)=1.$$ This is asymptotically best possible.","authors_text":"Alan Frieze, Andrzej Dudek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-09T21:07:47Z","title":"Loose Hamilton Cycles in Random Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1909","kind":"arxiv","version":3},"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:90d22857baabaaff981517d0897a407d30f1f74d863a1af26dc881ae079a9f9b","target":"record","created_at":"2026-05-18T04:28:08Z","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":"eaf582743c6bc69b43d0fc02cabdc28e4037700a6d76fdd4e7bf1ab9adaed019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-09T21:07:47Z","title_canon_sha256":"2ec66b907b612d9c6466cd37a199060660ac54b64d4863a2b3d8771f09c67ca3"},"schema_version":"1.0","source":{"id":"1006.1909","kind":"arxiv","version":3}},"canonical_sha256":"2f73b47f1451c95b0149070977e003b479bc160ee001bccca4e01cda377cdc2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f73b47f1451c95b0149070977e003b479bc160ee001bccca4e01cda377cdc2f","first_computed_at":"2026-05-18T04:28:08.207179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:08.207179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o30+4IhJ71xacJJdMLOMOvf1oSxXO3YXJ8vk4peTxD/wVzHfrMq2kwUW/yZIkOyoPoNj3ukuj9hYtzciiTV3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:08.207860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1909","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90d22857baabaaff981517d0897a407d30f1f74d863a1af26dc881ae079a9f9b","sha256:fe757c8d02eada336e08df08845fe058af5c378fe10cdc05c1438ddb6afcc7e6"],"state_sha256":"9086fc9682d667d57366737cb0663cb9db91f0dfa2246425ee0fbd8444e2fede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4I93JDEruTChshxhRF+67+8FC8mSbrv3rClngqH3u0ichX9WSygW0t7AWxjGlgS4XaQ2B/DR++kWkc1K8S8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T10:11:12.535146Z","bundle_sha256":"5bd7909ff8af554bcd4b7e930e63993c68c47ba6be93aa13c0b9d21c40507a64"}}