{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4CHMFVNX47QHB5SZ5CPSQ26V3J","short_pith_number":"pith:4CHMFVNX","canonical_record":{"source":{"id":"1212.4667","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-19T14:27:55Z","cross_cats_sorted":[],"title_canon_sha256":"2d2675a2a821ad0257bd365c6524b173ea05aa7c171ce1568224d9fedcef84c8","abstract_canon_sha256":"69b5c47e6ffeb6349bf12c6d1e858ff203288d814e1b3fc4373f66bae1fed3de"},"schema_version":"1.0"},"canonical_sha256":"e08ec2d5b7e7e070f659e89f286bd5da718a3c6ebf8aef459e5597f51ae5ecb2","source":{"kind":"arxiv","id":"1212.4667","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4667","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4667v4","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4667","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"4CHMFVNX47QH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4CHMFVNX47QHB5SZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4CHMFVNX","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4CHMFVNX47QHB5SZ5CPSQ26V3J","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4667","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-19T14:27:55Z","cross_cats_sorted":[],"title_canon_sha256":"2d2675a2a821ad0257bd365c6524b173ea05aa7c171ce1568224d9fedcef84c8","abstract_canon_sha256":"69b5c47e6ffeb6349bf12c6d1e858ff203288d814e1b3fc4373f66bae1fed3de"},"schema_version":"1.0"},"canonical_sha256":"e08ec2d5b7e7e070f659e89f286bd5da718a3c6ebf8aef459e5597f51ae5ecb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:08.383910Z","signature_b64":"v4WDxqJzT6ci6BBgYJcbG54CeWpGc4YJMYCVfm2Few0NyPXMNA0v5GiPVrp4oZktwAHizcypMPrb2WkwLjW/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e08ec2d5b7e7e070f659e89f286bd5da718a3c6ebf8aef459e5597f51ae5ecb2","last_reissued_at":"2026-05-18T01:27:08.383174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:08.383174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4667","source_version":4,"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-18T01:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VZ+U1ZFP6LJcOGwNt87MlMd2xqPpKxhU0o5F5MrtQ2aMTV3mxcI4Bn+E8Ed+6FbXYqlRXx7/ndRNw6B0FT2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:57:31.277709Z"},"content_sha256":"f68ac2782b65e8cdaa52ac666a92db4ce2dece6b0c3b54c04f7712d08dcc5e0c","schema_version":"1.0","event_id":"sha256:f68ac2782b65e8cdaa52ac666a92db4ce2dece6b0c3b54c04f7712d08dcc5e0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4CHMFVNX47QHB5SZ5CPSQ26V3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting and packing Hamilton cycles in dense graphs and oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich","submitted_at":"2012-12-19T14:27:55Z","abstract_excerpt":"We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly $cn$-regular oriented graph on $n$ vertices with $c>3/8$ contains $(cn/e)^n(1+o(1))^n$ directed Hamilton cycles. This is an extension of a result of Cuckler, who settled an old conjecture of Thomassen about the number of Hamilton cycles in regular tournaments. We also prove that every graph $G$ on $n$ vertices of minimum degree at least $(1/2+\\varepsilon)n$ con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4667","kind":"arxiv","version":4},"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-18T01:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzEyeXEhRY2rHfTudbkZtyxqPcMLyEFue7EArL0T5G23SOALbbud+Un7H7vGnqJIV/V+Rhgdq0B5j7Q4DROUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:57:31.278063Z"},"content_sha256":"575b7978ddd177267162ab994dccdbd23e6a5bba25a91501b43a83705c66e8fa","schema_version":"1.0","event_id":"sha256:575b7978ddd177267162ab994dccdbd23e6a5bba25a91501b43a83705c66e8fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CHMFVNX47QHB5SZ5CPSQ26V3J/bundle.json","state_url":"https://pith.science/pith/4CHMFVNX47QHB5SZ5CPSQ26V3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CHMFVNX47QHB5SZ5CPSQ26V3J/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-30T10:57:31Z","links":{"resolver":"https://pith.science/pith/4CHMFVNX47QHB5SZ5CPSQ26V3J","bundle":"https://pith.science/pith/4CHMFVNX47QHB5SZ5CPSQ26V3J/bundle.json","state":"https://pith.science/pith/4CHMFVNX47QHB5SZ5CPSQ26V3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CHMFVNX47QHB5SZ5CPSQ26V3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4CHMFVNX47QHB5SZ5CPSQ26V3J","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":"69b5c47e6ffeb6349bf12c6d1e858ff203288d814e1b3fc4373f66bae1fed3de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-19T14:27:55Z","title_canon_sha256":"2d2675a2a821ad0257bd365c6524b173ea05aa7c171ce1568224d9fedcef84c8"},"schema_version":"1.0","source":{"id":"1212.4667","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4667","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4667v4","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4667","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"4CHMFVNX47QH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4CHMFVNX47QHB5SZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4CHMFVNX","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:575b7978ddd177267162ab994dccdbd23e6a5bba25a91501b43a83705c66e8fa","target":"graph","created_at":"2026-05-18T01:27: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":"We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly $cn$-regular oriented graph on $n$ vertices with $c>3/8$ contains $(cn/e)^n(1+o(1))^n$ directed Hamilton cycles. This is an extension of a result of Cuckler, who settled an old conjecture of Thomassen about the number of Hamilton cycles in regular tournaments. We also prove that every graph $G$ on $n$ vertices of minimum degree at least $(1/2+\\varepsilon)n$ con","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-19T14:27:55Z","title":"Counting and packing Hamilton cycles in dense graphs and oriented graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4667","kind":"arxiv","version":4},"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:f68ac2782b65e8cdaa52ac666a92db4ce2dece6b0c3b54c04f7712d08dcc5e0c","target":"record","created_at":"2026-05-18T01:27: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":"69b5c47e6ffeb6349bf12c6d1e858ff203288d814e1b3fc4373f66bae1fed3de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-19T14:27:55Z","title_canon_sha256":"2d2675a2a821ad0257bd365c6524b173ea05aa7c171ce1568224d9fedcef84c8"},"schema_version":"1.0","source":{"id":"1212.4667","kind":"arxiv","version":4}},"canonical_sha256":"e08ec2d5b7e7e070f659e89f286bd5da718a3c6ebf8aef459e5597f51ae5ecb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e08ec2d5b7e7e070f659e89f286bd5da718a3c6ebf8aef459e5597f51ae5ecb2","first_computed_at":"2026-05-18T01:27:08.383174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:08.383174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v4WDxqJzT6ci6BBgYJcbG54CeWpGc4YJMYCVfm2Few0NyPXMNA0v5GiPVrp4oZktwAHizcypMPrb2WkwLjW/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:08.383910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4667","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f68ac2782b65e8cdaa52ac666a92db4ce2dece6b0c3b54c04f7712d08dcc5e0c","sha256:575b7978ddd177267162ab994dccdbd23e6a5bba25a91501b43a83705c66e8fa"],"state_sha256":"db7b7d1539556ad311128a2c07c9ba4f3558ac53992d8511a68251f1c0a7281a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPvbOzYqKHAmR3q0YuMF8uIRD1x7idWfdk1uIZ/9HZlQowsmB4g0ExqTptpfRNdCIzAN3UUCzL37jz0uiYFeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:57:31.280154Z","bundle_sha256":"dcceef0c373dad11e1d8b6d650f4d2a5a1aaa4aa967ea5f3bc65febf47aa27d2"}}