{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GESDTMHHSXNHFVU3ZIFVCV4LE7","short_pith_number":"pith:GESDTMHH","canonical_record":{"source":{"id":"1609.03101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T23:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"575f050c4aa36e90f3db797eba830bf1924247a0e179e7241569170c4d14f145","abstract_canon_sha256":"e9e353be094b8fcba26855a7e7896a773e542d0e38070eb3ee126fa35ac98475"},"schema_version":"1.0"},"canonical_sha256":"312439b0e795da72d69bca0b51578b27e231fef28125ff901358fa7bcb79ec41","source":{"kind":"arxiv","id":"1609.03101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03101","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03101v2","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03101","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"GESDTMHHSXNH","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GESDTMHHSXNHFVU3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GESDTMHH","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GESDTMHHSXNHFVU3ZIFVCV4LE7","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T23:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"575f050c4aa36e90f3db797eba830bf1924247a0e179e7241569170c4d14f145","abstract_canon_sha256":"e9e353be094b8fcba26855a7e7896a773e542d0e38070eb3ee126fa35ac98475"},"schema_version":"1.0"},"canonical_sha256":"312439b0e795da72d69bca0b51578b27e231fef28125ff901358fa7bcb79ec41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:27.299410Z","signature_b64":"7RO8FTF5/FMGbFifNKEHC2Sb1RG4njm36fKugoGCoYXkLsZzKTU/D7qnokXPcfZ/q7nMmDFzJZDudRAjB6NkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312439b0e795da72d69bca0b51578b27e231fef28125ff901358fa7bcb79ec41","last_reissued_at":"2026-05-18T00:17:27.298871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:27.298871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03101","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-18T00:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9Tvxue53AjVh3ffxRaT8pNzU/wG4t7DsAlZOhkl+CsuxlwKenOOivGwdNpHxR7rU+PKMPlgb2plTgC8G7nfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:09:06.491127Z"},"content_sha256":"3a94b86b2b1d2aa0e7dc68219bdefdf84006237c1413e2d742c44c65a158a9fb","schema_version":"1.0","event_id":"sha256:3a94b86b2b1d2aa0e7dc68219bdefdf84006237c1413e2d742c44c65a158a9fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GESDTMHHSXNHFVU3ZIFVCV4LE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamilton cycles in hypergraphs below the Dirac threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frederik Garbe, Richard Mycroft","submitted_at":"2016-09-10T23:58:13Z","abstract_excerpt":"We establish a precise characterisation of $4$-uniform hypergraphs with minimum codegree close to $n/2$ which contain a Hamilton $2$-cycle. As an immediate corollary we identify the exact Dirac threshold for Hamilton $2$-cycles in $4$-uniform hypergraphs. Moreover, by derandomising the proof of our characterisation we provide a polynomial-time algorithm which, given a $4$-uniform hypergraph $H$ with minimum codegree close to $n/2$, either finds a Hamilton $2$-cycle in $H$ or provides a certificate that no such cycle exists. This surprising result stands in contrast to the graph setting, in whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03101","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-18T00:17:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGPWVXQUHYJoE2DmKxjOdgJDq932fNcMiIaOygR/4SfUCfnYLHu6ltWrl43abtFTB9TFGnpsZKwSywgLwS9HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:09:06.491947Z"},"content_sha256":"4627a88a236cf1ce8ee089f5c7bc379229e2124a9f91b1d7581e7dd0fbf3bf04","schema_version":"1.0","event_id":"sha256:4627a88a236cf1ce8ee089f5c7bc379229e2124a9f91b1d7581e7dd0fbf3bf04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/bundle.json","state_url":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/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-20T03:09:06Z","links":{"resolver":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7","bundle":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/bundle.json","state":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GESDTMHHSXNHFVU3ZIFVCV4LE7","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":"e9e353be094b8fcba26855a7e7896a773e542d0e38070eb3ee126fa35ac98475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T23:58:13Z","title_canon_sha256":"575f050c4aa36e90f3db797eba830bf1924247a0e179e7241569170c4d14f145"},"schema_version":"1.0","source":{"id":"1609.03101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03101","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03101v2","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03101","created_at":"2026-05-18T00:17:27Z"},{"alias_kind":"pith_short_12","alias_value":"GESDTMHHSXNH","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GESDTMHHSXNHFVU3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GESDTMHH","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:4627a88a236cf1ce8ee089f5c7bc379229e2124a9f91b1d7581e7dd0fbf3bf04","target":"graph","created_at":"2026-05-18T00:17:27Z","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 establish a precise characterisation of $4$-uniform hypergraphs with minimum codegree close to $n/2$ which contain a Hamilton $2$-cycle. As an immediate corollary we identify the exact Dirac threshold for Hamilton $2$-cycles in $4$-uniform hypergraphs. Moreover, by derandomising the proof of our characterisation we provide a polynomial-time algorithm which, given a $4$-uniform hypergraph $H$ with minimum codegree close to $n/2$, either finds a Hamilton $2$-cycle in $H$ or provides a certificate that no such cycle exists. This surprising result stands in contrast to the graph setting, in whi","authors_text":"Frederik Garbe, Richard Mycroft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T23:58:13Z","title":"Hamilton cycles in hypergraphs below the Dirac threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03101","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:3a94b86b2b1d2aa0e7dc68219bdefdf84006237c1413e2d742c44c65a158a9fb","target":"record","created_at":"2026-05-18T00:17:27Z","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":"e9e353be094b8fcba26855a7e7896a773e542d0e38070eb3ee126fa35ac98475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T23:58:13Z","title_canon_sha256":"575f050c4aa36e90f3db797eba830bf1924247a0e179e7241569170c4d14f145"},"schema_version":"1.0","source":{"id":"1609.03101","kind":"arxiv","version":2}},"canonical_sha256":"312439b0e795da72d69bca0b51578b27e231fef28125ff901358fa7bcb79ec41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"312439b0e795da72d69bca0b51578b27e231fef28125ff901358fa7bcb79ec41","first_computed_at":"2026-05-18T00:17:27.298871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:27.298871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7RO8FTF5/FMGbFifNKEHC2Sb1RG4njm36fKugoGCoYXkLsZzKTU/D7qnokXPcfZ/q7nMmDFzJZDudRAjB6NkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:27.299410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a94b86b2b1d2aa0e7dc68219bdefdf84006237c1413e2d742c44c65a158a9fb","sha256:4627a88a236cf1ce8ee089f5c7bc379229e2124a9f91b1d7581e7dd0fbf3bf04"],"state_sha256":"09e8994ffa0b9c737242e7944811ff0756171143fffe55da9b4e8d55a7112abb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7aMmuXUM3ykbdHtQTfkyjB/WRnfr7f6L7AK+/XrqslypIYSA/KcPRI4WI1xdwB3vYPDQcfGs4R/1oSSvVTQ1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T03:09:06.495690Z","bundle_sha256":"c68d193b94068670c82836e7be7223a27528a47f2f0c369f30910321473b39e5"}}