{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RHEG2OOPFSAEOKH2SVDWNQOVW5","short_pith_number":"pith:RHEG2OOP","schema_version":"1.0","canonical_sha256":"89c86d39cf2c804728fa954766c1d5b7428763ac953586bc4e7c8cd0941e5348","source":{"kind":"arxiv","id":"1506.02929","version":1},"attestation_state":"computed","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))"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.02929","created_at":"2026-05-18T01:55:40.481239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02929v1","created_at":"2026-05-18T01:55:40.481239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02929","created_at":"2026-05-18T01:55:40.481239+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHEG2OOPFSAE","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHEG2OOPFSAEOKH2","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHEG2OOP","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5","json":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5.json","graph_json":"https://pith.science/api/pith-number/RHEG2OOPFSAEOKH2SVDWNQOVW5/graph.json","events_json":"https://pith.science/api/pith-number/RHEG2OOPFSAEOKH2SVDWNQOVW5/events.json","paper":"https://pith.science/paper/RHEG2OOP"},"agent_actions":{"view_html":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5","download_json":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5.json","view_paper":"https://pith.science/paper/RHEG2OOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02929&json=true","fetch_graph":"https://pith.science/api/pith-number/RHEG2OOPFSAEOKH2SVDWNQOVW5/graph.json","fetch_events":"https://pith.science/api/pith-number/RHEG2OOPFSAEOKH2SVDWNQOVW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/action/storage_attestation","attest_author":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/action/author_attestation","sign_citation":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/action/citation_signature","submit_replication":"https://pith.science/pith/RHEG2OOPFSAEOKH2SVDWNQOVW5/action/replication_record"}},"created_at":"2026-05-18T01:55:40.481239+00:00","updated_at":"2026-05-18T01:55:40.481239+00:00"}