{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HGLTHXOS5WM5WQ22U7USBPAGFA","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":"407eecd4ae7f1b6ed6caeef5418d547c34e2cc31ec055da5511a9f149c7d6738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-16T20:28:18Z","title_canon_sha256":"14155e5697351c01df4625cb2c1670bb7d4501842a20476915c40b44ae81e732"},"schema_version":"1.0","source":{"id":"1602.05169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05169","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05169v1","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05169","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"HGLTHXOS5WM5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HGLTHXOS5WM5WQ22","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HGLTHXOS","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:ab7ad026a8d7427f41a4969532f0f00b3de8e857874050af1e4c0ca5e2259848","target":"graph","created_at":"2026-05-18T01:20: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":"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","authors_text":"Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at, Xavier P\\'erez-Gim\\'enez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-16T20:28:18Z","title":"Rainbow perfect matchings and Hamilton cycles in the random geometric graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05169","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:c83e1a142caec6378d3d619b4dd8e677666214739bcbd9ebc8c6b060fe691764","target":"record","created_at":"2026-05-18T01:20: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":"407eecd4ae7f1b6ed6caeef5418d547c34e2cc31ec055da5511a9f149c7d6738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-16T20:28:18Z","title_canon_sha256":"14155e5697351c01df4625cb2c1670bb7d4501842a20476915c40b44ae81e732"},"schema_version":"1.0","source":{"id":"1602.05169","kind":"arxiv","version":1}},"canonical_sha256":"399733ddd2ed99db435aa7e920bc06280a1b90c2ca692d6c5cb11a55520c45c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"399733ddd2ed99db435aa7e920bc06280a1b90c2ca692d6c5cb11a55520c45c1","first_computed_at":"2026-05-18T01:20:37.402924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:37.402924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GDtkHJT7NR8/X3sJnhsrq9k8MR3Wx/HBB5aaodmyJnLI7XQ7odY/R00M27ZszqzvTO8alkJUkw5YLDCkwWmsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:37.403588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c83e1a142caec6378d3d619b4dd8e677666214739bcbd9ebc8c6b060fe691764","sha256:ab7ad026a8d7427f41a4969532f0f00b3de8e857874050af1e4c0ca5e2259848"],"state_sha256":"bda1e530e8f7246a8e26280b5d5d671cbe5558c51d662d9aa1c69095822d654d"}