{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HGLTHXOS5WM5WQ22U7USBPAGFA","short_pith_number":"pith:HGLTHXOS","schema_version":"1.0","canonical_sha256":"399733ddd2ed99db435aa7e920bc06280a1b90c2ca692d6c5cb11a55520c45c1","source":{"kind":"arxiv","id":"1602.05169","version":1},"attestation_state":"computed","paper":{"title":"Rainbow perfect matchings and Hamilton cycles in the random geometric graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at, Xavier P\\'erez-Gim\\'enez","submitted_at":"2016-02-16T20:28:18Z","abstract_excerpt":"Given a graph on $n$ vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length $n$ visiting each vertex once and with pairwise different colours on the edges. Similarly (for even $n$) a rainbow perfect matching is a collection of $n/2$ independent edges with pairwise different colours. In this note we show that if we randomly colour the edges of a random geometric graph with sufficiently many colours, then a.a.s. the graph contains a rainbow perfect matching (rainbow Hamilton cycle) if and only if the minimum degree is at least $1$ (respectively, at leas"},"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":"1602.05169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-16T20:28:18Z","cross_cats_sorted":[],"title_canon_sha256":"14155e5697351c01df4625cb2c1670bb7d4501842a20476915c40b44ae81e732","abstract_canon_sha256":"407eecd4ae7f1b6ed6caeef5418d547c34e2cc31ec055da5511a9f149c7d6738"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:37.403588Z","signature_b64":"GDtkHJT7NR8/X3sJnhsrq9k8MR3Wx/HBB5aaodmyJnLI7XQ7odY/R00M27ZszqzvTO8alkJUkw5YLDCkwWmsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399733ddd2ed99db435aa7e920bc06280a1b90c2ca692d6c5cb11a55520c45c1","last_reissued_at":"2026-05-18T01:20:37.402924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:37.402924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow perfect matchings and Hamilton cycles in the random geometric graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at, Xavier P\\'erez-Gim\\'enez","submitted_at":"2016-02-16T20:28:18Z","abstract_excerpt":"Given a graph on $n$ vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length $n$ visiting each vertex once and with pairwise different colours on the edges. Similarly (for even $n$) a rainbow perfect matching is a collection of $n/2$ independent edges with pairwise different colours. In this note we show that if we randomly colour the edges of a random geometric graph with sufficiently many colours, then a.a.s. the graph contains a rainbow perfect matching (rainbow Hamilton cycle) if and only if the minimum degree is at least $1$ (respectively, at leas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05169","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":"1602.05169","created_at":"2026-05-18T01:20:37.403028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05169v1","created_at":"2026-05-18T01:20:37.403028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05169","created_at":"2026-05-18T01:20:37.403028+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGLTHXOS5WM5","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGLTHXOS5WM5WQ22","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGLTHXOS","created_at":"2026-05-18T12:30:19.053100+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/HGLTHXOS5WM5WQ22U7USBPAGFA","json":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA.json","graph_json":"https://pith.science/api/pith-number/HGLTHXOS5WM5WQ22U7USBPAGFA/graph.json","events_json":"https://pith.science/api/pith-number/HGLTHXOS5WM5WQ22U7USBPAGFA/events.json","paper":"https://pith.science/paper/HGLTHXOS"},"agent_actions":{"view_html":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA","download_json":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA.json","view_paper":"https://pith.science/paper/HGLTHXOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05169&json=true","fetch_graph":"https://pith.science/api/pith-number/HGLTHXOS5WM5WQ22U7USBPAGFA/graph.json","fetch_events":"https://pith.science/api/pith-number/HGLTHXOS5WM5WQ22U7USBPAGFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA/action/storage_attestation","attest_author":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA/action/author_attestation","sign_citation":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA/action/citation_signature","submit_replication":"https://pith.science/pith/HGLTHXOS5WM5WQ22U7USBPAGFA/action/replication_record"}},"created_at":"2026-05-18T01:20:37.403028+00:00","updated_at":"2026-05-18T01:20:37.403028+00:00"}