{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RHEG2OOPFSAEOKH2SVDWNQOVW5","short_pith_number":"pith:RHEG2OOP","canonical_record":{"source":{"id":"1506.02929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T14:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"d13643ab84010e0bfc4341c9cba23a110a6db545fecfd2a62c178e3280185e6a","abstract_canon_sha256":"4c163da85b1c6fcc2e4eca2ad5f726af0ba4cf1b6bffddf61d19863b350d6759"},"schema_version":"1.0"},"canonical_sha256":"89c86d39cf2c804728fa954766c1d5b7428763ac953586bc4e7c8cd0941e5348","source":{"kind":"arxiv","id":"1506.02929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02929","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02929v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02929","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"RHEG2OOPFSAE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RHEG2OOPFSAEOKH2","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RHEG2OOP","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RHEG2OOPFSAEOKH2SVDWNQOVW5","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T14:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"d13643ab84010e0bfc4341c9cba23a110a6db545fecfd2a62c178e3280185e6a","abstract_canon_sha256":"4c163da85b1c6fcc2e4eca2ad5f726af0ba4cf1b6bffddf61d19863b350d6759"},"schema_version":"1.0"},"canonical_sha256":"89c86d39cf2c804728fa954766c1d5b7428763ac953586bc4e7c8cd0941e5348","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.481971Z","signature_b64":"aKu5I8V9wB1oa29m0L39S+TrnPMWoFsHFwn56AvpoSz8u2D8CRG3U66lE8IbKFu72FopIRj60yJvtkZ+lsBhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89c86d39cf2c804728fa954766c1d5b7428763ac953586bc4e7c8cd0941e5348","last_reissued_at":"2026-05-18T01:55:40.481154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.481154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02929","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-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DJJG8kbeNUevk49RkIJv6gSriM6VLAZDi69/huonKLXOKBZs2wA/R4ftvUnDR0LpfciElacmq9Izxop5+ZtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:40.954606Z"},"content_sha256":"8c6e1f5b93436d4c1024274a603f34518ef7f0122483a33b25d332a1b1e6d3a1","schema_version":"1.0","event_id":"sha256:8c6e1f5b93436d4c1024274a603f34518ef7f0122483a33b25d332a1b1e6d3a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RHEG2OOPFSAEOKH2SVDWNQOVW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Hamilton cycles in random graphs and hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Michael Krivelevich","submitted_at":"2015-06-09T14:25:24Z","abstract_excerpt":"Let $H$ be an edge colored hypergraph. We say that $H$ contains a \\emph{rainbow} copy of a hypergraph $S$ if it contains an isomorphic copy of $S$ with all edges of distinct colors.\n  We consider the following setting. A randomly edge colored random hypergraph $H\\sim \\mathcal H_c^k(n,p)$ is obtained by adding each $k$-subset of $[n]$ with probability $p$, and assigning it a color from $[c]$ uniformly, independently at random.\n  As a first result we show that a typical $H\\sim \\mathcal H^2_c(n,p)$ (that is, a random edge colored graph) contains a rainbow Hamilton cycle, provided that $c=(1+o(1))"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02929","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-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHSmxvQb3fkNbTdgu62Qn2AZt6HAUjUXVFORj/ISmkHPNjHLlIjvzFTC7Jw+DkoEUMUSg1McqOcRz/U6mL3uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:40.955029Z"},"content_sha256":"167372fd7c2af3d3033b72bf1ef4822840bfb726aac25a024e70532390a6c60e","schema_version":"1.0","event_id":"sha256:167372fd7c2af3d3033b72bf1ef4822840bfb726aac25a024e70532390a6c60e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/bundle.json","state_url":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/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-25T20:57:40Z","links":{"resolver":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5","bundle":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/bundle.json","state":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RHEG2OOPFSAEOKH2SVDWNQOVW5","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":"4c163da85b1c6fcc2e4eca2ad5f726af0ba4cf1b6bffddf61d19863b350d6759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T14:25:24Z","title_canon_sha256":"d13643ab84010e0bfc4341c9cba23a110a6db545fecfd2a62c178e3280185e6a"},"schema_version":"1.0","source":{"id":"1506.02929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02929","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02929v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02929","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"RHEG2OOPFSAE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RHEG2OOPFSAEOKH2","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RHEG2OOP","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:167372fd7c2af3d3033b72bf1ef4822840bfb726aac25a024e70532390a6c60e","target":"graph","created_at":"2026-05-18T01:55:40Z","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$ be an edge colored hypergraph. We say that $H$ contains a \\emph{rainbow} copy of a hypergraph $S$ if it contains an isomorphic copy of $S$ with all edges of distinct colors.\n  We consider the following setting. A randomly edge colored random hypergraph $H\\sim \\mathcal H_c^k(n,p)$ is obtained by adding each $k$-subset of $[n]$ with probability $p$, and assigning it a color from $[c]$ uniformly, independently at random.\n  As a first result we show that a typical $H\\sim \\mathcal H^2_c(n,p)$ (that is, a random edge colored graph) contains a rainbow Hamilton cycle, provided that $c=(1+o(1))","authors_text":"Asaf Ferber, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T14:25:24Z","title":"Rainbow Hamilton cycles in random graphs and hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02929","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:8c6e1f5b93436d4c1024274a603f34518ef7f0122483a33b25d332a1b1e6d3a1","target":"record","created_at":"2026-05-18T01:55:40Z","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":"4c163da85b1c6fcc2e4eca2ad5f726af0ba4cf1b6bffddf61d19863b350d6759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T14:25:24Z","title_canon_sha256":"d13643ab84010e0bfc4341c9cba23a110a6db545fecfd2a62c178e3280185e6a"},"schema_version":"1.0","source":{"id":"1506.02929","kind":"arxiv","version":1}},"canonical_sha256":"89c86d39cf2c804728fa954766c1d5b7428763ac953586bc4e7c8cd0941e5348","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89c86d39cf2c804728fa954766c1d5b7428763ac953586bc4e7c8cd0941e5348","first_computed_at":"2026-05-18T01:55:40.481154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:40.481154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aKu5I8V9wB1oa29m0L39S+TrnPMWoFsHFwn56AvpoSz8u2D8CRG3U66lE8IbKFu72FopIRj60yJvtkZ+lsBhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:40.481971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c6e1f5b93436d4c1024274a603f34518ef7f0122483a33b25d332a1b1e6d3a1","sha256:167372fd7c2af3d3033b72bf1ef4822840bfb726aac25a024e70532390a6c60e"],"state_sha256":"9f0deb0fbb471aff58dd5a8c88d7c9df09d4ff5639192d7dd1a347b74f7e4ce6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNtLz4kKgCMdwu9szHfrST3Eu00tqHStT0t7Slnben6IKoIJDLp9RLumZidwFe9T+VSVAHy1urlXmurWL3RfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:57:40.957235Z","bundle_sha256":"d64540ab3660293fb6e2d708d1edb184dd1d8eb0ced24a459a9d3dd2cdeb0759"}}