{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:P6KTC3FPKMMGDKL3UIIH23ZD4H","short_pith_number":"pith:P6KTC3FP","canonical_record":{"source":{"id":"1102.1488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T01:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"430c43221883a3173d2a52db85c28d667292c7c2a766d23b136cd464cc609557","abstract_canon_sha256":"ae58b419aeb502418d44c222e5a056e4ec15b60175ab83b7dc697a2fc10b6e1e"},"schema_version":"1.0"},"canonical_sha256":"7f95316caf531861a97ba2107d6f23e1f4aa1b1907fc653c8942dd0e091e9fbf","source":{"kind":"arxiv","id":"1102.1488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1488","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1488v1","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1488","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"P6KTC3FPKMMG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P6KTC3FPKMMGDKL3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P6KTC3FP","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:P6KTC3FPKMMGDKL3UIIH23ZD4H","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T01:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"430c43221883a3173d2a52db85c28d667292c7c2a766d23b136cd464cc609557","abstract_canon_sha256":"ae58b419aeb502418d44c222e5a056e4ec15b60175ab83b7dc697a2fc10b6e1e"},"schema_version":"1.0"},"canonical_sha256":"7f95316caf531861a97ba2107d6f23e1f4aa1b1907fc653c8942dd0e091e9fbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:53.130361Z","signature_b64":"TSjy/KOIAKl7zDn/2feprR/BzLlgghkgq0i5LsH7BOOhaNtB0Cv5FS0tdKloC0qxAs95YPeO1HXi+d185QXkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f95316caf531861a97ba2107d6f23e1f4aa1b1907fc653c8942dd0e091e9fbf","last_reissued_at":"2026-05-18T04:29:53.129877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:53.129877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1488","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-18T04:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvEuFMSwFhTIytenwiMXeFiZng033c1VKVoNv6xmJkj7ASe6R6Y3fiYl1RtPmS4/DKtcaS9TtxFxmHYCTvSCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:51.886760Z"},"content_sha256":"5cdbcdd9b241e70699ac51dac7508cda73dff0665584dbe121317dd096b346ce","schema_version":"1.0","event_id":"sha256:5cdbcdd9b241e70699ac51dac7508cda73dff0665584dbe121317dd096b346ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:P6KTC3FPKMMGDKL3UIIH23ZD4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing tight Hamilton cycles in uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal","submitted_at":"2011-02-08T01:48:52Z","abstract_excerpt":"We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\\ell$, for some $1\\le \\ell \\le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair of consecutive edges $E_{i-1},E_i$ in $C$ (in the natural ordering of the edges) we have $|E_{i-1}\\setminus E_i|=\\ell$. We define a class of $(\\e,p)$-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type $\\ell$ Hamilton cycles, where $\\ell<k/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1488","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-18T04:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QndJyhRnSqVkT+KafZlDI+d9TE5rtg/sL+5jCxKLQ5Z+y2NoGtmVRRZnVL4DlaZGmLw5E9tPv9RZag3OO0YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:51.887105Z"},"content_sha256":"7e1729aa2d94af9f14b7a4731f5c69ae0220a54f347d31f8b7fde0f7590b24ed","schema_version":"1.0","event_id":"sha256:7e1729aa2d94af9f14b7a4731f5c69ae0220a54f347d31f8b7fde0f7590b24ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6KTC3FPKMMGDKL3UIIH23ZD4H/bundle.json","state_url":"https://pith.science/pith/P6KTC3FPKMMGDKL3UIIH23ZD4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6KTC3FPKMMGDKL3UIIH23ZD4H/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-02T19:24:51Z","links":{"resolver":"https://pith.science/pith/P6KTC3FPKMMGDKL3UIIH23ZD4H","bundle":"https://pith.science/pith/P6KTC3FPKMMGDKL3UIIH23ZD4H/bundle.json","state":"https://pith.science/pith/P6KTC3FPKMMGDKL3UIIH23ZD4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6KTC3FPKMMGDKL3UIIH23ZD4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:P6KTC3FPKMMGDKL3UIIH23ZD4H","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":"ae58b419aeb502418d44c222e5a056e4ec15b60175ab83b7dc697a2fc10b6e1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T01:48:52Z","title_canon_sha256":"430c43221883a3173d2a52db85c28d667292c7c2a766d23b136cd464cc609557"},"schema_version":"1.0","source":{"id":"1102.1488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1488","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1488v1","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1488","created_at":"2026-05-18T04:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"P6KTC3FPKMMG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P6KTC3FPKMMGDKL3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P6KTC3FP","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:7e1729aa2d94af9f14b7a4731f5c69ae0220a54f347d31f8b7fde0f7590b24ed","target":"graph","created_at":"2026-05-18T04:29:53Z","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 say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\\ell$, for some $1\\le \\ell \\le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair of consecutive edges $E_{i-1},E_i$ in $C$ (in the natural ordering of the edges) we have $|E_{i-1}\\setminus E_i|=\\ell$. We define a class of $(\\e,p)$-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type $\\ell$ Hamilton cycles, where $\\ell<k/2$.","authors_text":"Alan Frieze, Deepak Bal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T01:48:52Z","title":"Packing tight Hamilton cycles in uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1488","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:5cdbcdd9b241e70699ac51dac7508cda73dff0665584dbe121317dd096b346ce","target":"record","created_at":"2026-05-18T04:29:53Z","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":"ae58b419aeb502418d44c222e5a056e4ec15b60175ab83b7dc697a2fc10b6e1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-08T01:48:52Z","title_canon_sha256":"430c43221883a3173d2a52db85c28d667292c7c2a766d23b136cd464cc609557"},"schema_version":"1.0","source":{"id":"1102.1488","kind":"arxiv","version":1}},"canonical_sha256":"7f95316caf531861a97ba2107d6f23e1f4aa1b1907fc653c8942dd0e091e9fbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f95316caf531861a97ba2107d6f23e1f4aa1b1907fc653c8942dd0e091e9fbf","first_computed_at":"2026-05-18T04:29:53.129877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:53.129877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TSjy/KOIAKl7zDn/2feprR/BzLlgghkgq0i5LsH7BOOhaNtB0Cv5FS0tdKloC0qxAs95YPeO1HXi+d185QXkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:53.130361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cdbcdd9b241e70699ac51dac7508cda73dff0665584dbe121317dd096b346ce","sha256:7e1729aa2d94af9f14b7a4731f5c69ae0220a54f347d31f8b7fde0f7590b24ed"],"state_sha256":"38e54663b7408d345aa7f7f9061400d059c0491d7c4c418d663feff3f514e503"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZywTVAJqrjr2R4BoamuDf0qy531HiNbbSCwXFKawfor45vuZFcW1PVfZItgifCyVsfeMwBT3zqsRT87gURM3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:24:51.888991Z","bundle_sha256":"950ebd75e179efd36d8403f94924c7d085981db400bdae680b18e6e35aef0ea8"}}