{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3XIR4XZ6NE4NEGV6RWOE4PDBCO","short_pith_number":"pith:3XIR4XZ6","schema_version":"1.0","canonical_sha256":"ddd11e5f3e6938d21abe8d9c4e3c6113ba49ef73a04c816eb02bf37f5190d074","source":{"kind":"arxiv","id":"2211.05477","version":2},"attestation_state":"computed","paper":{"title":"Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Dingjia Mao, Jie Han","submitted_at":"2022-11-10T10:45:16Z","abstract_excerpt":"Given a family of graphs $G_1,\\dots,G_{n}$ on the same vertex set $[n]$, a rainbow Hamilton cycle is a Hamilton cycle on $[n]$ such that each $G_c$ contributes exactly one edge. We prove that if $G_1,\\dots,G_{n}$ are independent samples of $G(n,p)$ on the same vertex set $[n]$, then for each $\\varepsilon>0$, whp, every collection of spanning subgraphs $H_c\\subseteq G_c$, with $\\delta(H_c)\\geq(\\frac{1}{2}+\\varepsilon)np$, admits a rainbow Hamilton cycle. A similar result is proved for rainbow perfect matchings in a family of $n/2$ graphs on the same vertex set $[n]$."},"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":"2211.05477","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-10T10:45:16Z","cross_cats_sorted":[],"title_canon_sha256":"f60a5f00a7105098a210efc749d600385244bb430af8007635bb63af02b4333f","abstract_canon_sha256":"4d71417f7b79a943f47d87772906d0d8a743308af1e38879c2584551c73e26f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:18.469086Z","signature_b64":"sTJY9npzhmnpx8/MPCZZeSxkUYnN9ydWGDeekhsc/wvYOFcg3fS76cDQT42Zb+0hQQpp/qrt8Dz3ld4/hf2KBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddd11e5f3e6938d21abe8d9c4e3c6113ba49ef73a04c816eb02bf37f5190d074","last_reissued_at":"2026-07-05T09:27:18.468665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:18.468665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Dingjia Mao, Jie Han","submitted_at":"2022-11-10T10:45:16Z","abstract_excerpt":"Given a family of graphs $G_1,\\dots,G_{n}$ on the same vertex set $[n]$, a rainbow Hamilton cycle is a Hamilton cycle on $[n]$ such that each $G_c$ contributes exactly one edge. We prove that if $G_1,\\dots,G_{n}$ are independent samples of $G(n,p)$ on the same vertex set $[n]$, then for each $\\varepsilon>0$, whp, every collection of spanning subgraphs $H_c\\subseteq G_c$, with $\\delta(H_c)\\geq(\\frac{1}{2}+\\varepsilon)np$, admits a rainbow Hamilton cycle. A similar result is proved for rainbow perfect matchings in a family of $n/2$ graphs on the same vertex set $[n]$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.05477","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.05477/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.05477","created_at":"2026-07-05T09:27:18.468720+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.05477v2","created_at":"2026-07-05T09:27:18.468720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.05477","created_at":"2026-07-05T09:27:18.468720+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XIR4XZ6NE4N","created_at":"2026-07-05T09:27:18.468720+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XIR4XZ6NE4NEGV6","created_at":"2026-07-05T09:27:18.468720+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XIR4XZ6","created_at":"2026-07-05T09:27:18.468720+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.12607","citing_title":"Robust Hamiltonicity in families of Dirac graphs","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2412.01121","citing_title":"Transversal Structures in Graph Systems: A Survey","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO","json":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO.json","graph_json":"https://pith.science/api/pith-number/3XIR4XZ6NE4NEGV6RWOE4PDBCO/graph.json","events_json":"https://pith.science/api/pith-number/3XIR4XZ6NE4NEGV6RWOE4PDBCO/events.json","paper":"https://pith.science/paper/3XIR4XZ6"},"agent_actions":{"view_html":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO","download_json":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO.json","view_paper":"https://pith.science/paper/3XIR4XZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.05477&json=true","fetch_graph":"https://pith.science/api/pith-number/3XIR4XZ6NE4NEGV6RWOE4PDBCO/graph.json","fetch_events":"https://pith.science/api/pith-number/3XIR4XZ6NE4NEGV6RWOE4PDBCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO/action/storage_attestation","attest_author":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO/action/author_attestation","sign_citation":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO/action/citation_signature","submit_replication":"https://pith.science/pith/3XIR4XZ6NE4NEGV6RWOE4PDBCO/action/replication_record"}},"created_at":"2026-07-05T09:27:18.468720+00:00","updated_at":"2026-07-05T09:27:18.468720+00:00"}