{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TLPAUGWET7BDEFSYT3OXATV6R6","short_pith_number":"pith:TLPAUGWE","canonical_record":{"source":{"id":"1708.08975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T18:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"b2eee4bc3d1cae93d795b9b9afba37a63da950b5bc91b2c53c76b41cf1ccbd6d","abstract_canon_sha256":"cab3c4029506d32d34ab0b054d827d4b8c29a4f3dd2feac4531a230b4adb2500"},"schema_version":"1.0"},"canonical_sha256":"9ade0a1ac49fc23216589edd704ebe8fa97b1eb618f2049b9aa6a1d448d3639d","source":{"kind":"arxiv","id":"1708.08975","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08975","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08975v2","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08975","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"TLPAUGWET7BD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TLPAUGWET7BDEFSY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TLPAUGWE","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TLPAUGWET7BDEFSYT3OXATV6R6","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T18:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"b2eee4bc3d1cae93d795b9b9afba37a63da950b5bc91b2c53c76b41cf1ccbd6d","abstract_canon_sha256":"cab3c4029506d32d34ab0b054d827d4b8c29a4f3dd2feac4531a230b4adb2500"},"schema_version":"1.0"},"canonical_sha256":"9ade0a1ac49fc23216589edd704ebe8fa97b1eb618f2049b9aa6a1d448d3639d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:37.718689Z","signature_b64":"BUyQzPYWlUmlFKFAK8c00U1UMejv69YbVWpC6hCosXJSehIqPS5VM8pLG6aiG2ZYfkzi5jaL1+iirzkdH89MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ade0a1ac49fc23216589edd704ebe8fa97b1eb618f2049b9aa6a1d448d3639d","last_reissued_at":"2026-05-18T00:13:37.718085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:37.718085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08975","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6/qENoop0ZH5ikddOepHn1jdLdn468b5A4kyFSkAWRuhoaznLnee/u5UWYOxS97ZN2MA9JQz3Er104O9cfncAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:08:11.337983Z"},"content_sha256":"19d610ffdf9a3bc5cbba2b9446169cc70c01f1f5741f6c04ebd5720fb77ba7f5","schema_version":"1.0","event_id":"sha256:19d610ffdf9a3bc5cbba2b9446169cc70c01f1f5741f6c04ebd5720fb77ba7f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TLPAUGWET7BDEFSYT3OXATV6R6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Rainbow Hamilton Cycles in Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek, Sean English","submitted_at":"2017-08-29T18:58:33Z","abstract_excerpt":"Let $H_{n,p,r}^{(k)}$ denote a randomly colored random hypergraph, constructed on the vertex set $[n]$ by taking each $k$-tuple independently with probability $p$, and then independently coloring it with a random color from the set $[r]$. Let $H$ be a $k$-uniform hypergraph of order $n$. An $\\ell$-Hamilton cycle is a spanning subhypergraph $C$ of $H$ with $n/(k-\\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists of $k$ consecutive vertices and every pair of adjacent edges in $C$ intersects in precisely $\\ell$ vertices.\n  In this note we study the exist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08975","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xZaARY90Wr7rjJL6fa7HTKhG0KIzqsQkzsC302RloLDOxU63duCcz/AYVvoSUrgs1xM1iGhbogBMYBKZ+ZgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:08:11.338336Z"},"content_sha256":"073ce1a2f49a9265ae57678eedf5f4d5d15d1fbf4e0d315ab389fe2c6fb55763","schema_version":"1.0","event_id":"sha256:073ce1a2f49a9265ae57678eedf5f4d5d15d1fbf4e0d315ab389fe2c6fb55763"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/bundle.json","state_url":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLPAUGWET7BDEFSYT3OXATV6R6/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-25T12:08:11Z","links":{"resolver":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6","bundle":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/bundle.json","state":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLPAUGWET7BDEFSYT3OXATV6R6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TLPAUGWET7BDEFSYT3OXATV6R6","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":"cab3c4029506d32d34ab0b054d827d4b8c29a4f3dd2feac4531a230b4adb2500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T18:58:33Z","title_canon_sha256":"b2eee4bc3d1cae93d795b9b9afba37a63da950b5bc91b2c53c76b41cf1ccbd6d"},"schema_version":"1.0","source":{"id":"1708.08975","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08975","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08975v2","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08975","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"TLPAUGWET7BD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TLPAUGWET7BDEFSY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TLPAUGWE","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:073ce1a2f49a9265ae57678eedf5f4d5d15d1fbf4e0d315ab389fe2c6fb55763","target":"graph","created_at":"2026-05-18T00:13: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":"Let $H_{n,p,r}^{(k)}$ denote a randomly colored random hypergraph, constructed on the vertex set $[n]$ by taking each $k$-tuple independently with probability $p$, and then independently coloring it with a random color from the set $[r]$. Let $H$ be a $k$-uniform hypergraph of order $n$. An $\\ell$-Hamilton cycle is a spanning subhypergraph $C$ of $H$ with $n/(k-\\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists of $k$ consecutive vertices and every pair of adjacent edges in $C$ intersects in precisely $\\ell$ vertices.\n  In this note we study the exist","authors_text":"Alan Frieze, Andrzej Dudek, Sean English","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T18:58:33Z","title":"On Rainbow Hamilton Cycles in Random Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08975","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:19d610ffdf9a3bc5cbba2b9446169cc70c01f1f5741f6c04ebd5720fb77ba7f5","target":"record","created_at":"2026-05-18T00:13: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":"cab3c4029506d32d34ab0b054d827d4b8c29a4f3dd2feac4531a230b4adb2500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T18:58:33Z","title_canon_sha256":"b2eee4bc3d1cae93d795b9b9afba37a63da950b5bc91b2c53c76b41cf1ccbd6d"},"schema_version":"1.0","source":{"id":"1708.08975","kind":"arxiv","version":2}},"canonical_sha256":"9ade0a1ac49fc23216589edd704ebe8fa97b1eb618f2049b9aa6a1d448d3639d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ade0a1ac49fc23216589edd704ebe8fa97b1eb618f2049b9aa6a1d448d3639d","first_computed_at":"2026-05-18T00:13:37.718085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:37.718085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BUyQzPYWlUmlFKFAK8c00U1UMejv69YbVWpC6hCosXJSehIqPS5VM8pLG6aiG2ZYfkzi5jaL1+iirzkdH89MAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:37.718689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08975","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19d610ffdf9a3bc5cbba2b9446169cc70c01f1f5741f6c04ebd5720fb77ba7f5","sha256:073ce1a2f49a9265ae57678eedf5f4d5d15d1fbf4e0d315ab389fe2c6fb55763"],"state_sha256":"81ed847a4ad6198529806a6d5f1135f28aecccdd0f350d565d4b268d5ed1cbe9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DZpLdlqjmBmjk57fbphCjpDRkO7MMrLRYppDAYbXst7nEqjHEJdw3rcqVZGaa5Q9+WeJh+fTco2RIDYCXB3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:08:11.340244Z","bundle_sha256":"668f6a086f7b7f1ba7f8898012dd3c8bf87e7ab4c61251aab00193d392ec4226"}}