{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2GPX4A6HK7YTIAUG5F2ASO4QDS","short_pith_number":"pith:2GPX4A6H","canonical_record":{"source":{"id":"2608.06369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:58:27Z","cross_cats_sorted":[],"title_canon_sha256":"61915566de04682158bb5003991173b7818a6705949004ec0c3688b09dcbc0d1","abstract_canon_sha256":"92c7ebfeecbace0514243da113bc7c257d16d6e7726215d7762f4587823efda8"},"schema_version":"1.0"},"canonical_sha256":"d19f7e03c757f1340286e974093b901cba14c23bb041e5d71c99ae3f633a7114","source":{"kind":"arxiv","id":"2608.06369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06369","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06369v1","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06369","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"2GPX4A6HK7YT","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_16","alias_value":"2GPX4A6HK7YTIAUG","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_8","alias_value":"2GPX4A6H","created_at":"2026-08-07T01:41:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2GPX4A6HK7YTIAUG5F2ASO4QDS","target":"record","payload":{"canonical_record":{"source":{"id":"2608.06369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:58:27Z","cross_cats_sorted":[],"title_canon_sha256":"61915566de04682158bb5003991173b7818a6705949004ec0c3688b09dcbc0d1","abstract_canon_sha256":"92c7ebfeecbace0514243da113bc7c257d16d6e7726215d7762f4587823efda8"},"schema_version":"1.0"},"canonical_sha256":"d19f7e03c757f1340286e974093b901cba14c23bb041e5d71c99ae3f633a7114","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T01:41:29.822914Z","signature_b64":"gMOkcisXyvdJ4usWPhhBXaNTT/DL/uHOKbZ/6/K67a132VG6i790N+3W8Od6IEXXdeIQxHYABFGjK3idsbORDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d19f7e03c757f1340286e974093b901cba14c23bb041e5d71c99ae3f633a7114","last_reissued_at":"2026-08-07T01:41:29.821372Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T01:41:29.821372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.06369","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-08-07T01:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHvdBjPUDOqkONmK+e24d3Zz/CyqLjIFAlmVYE4LLCt0mmxChLAWuCWD+wLmQsH9MrgRae3TDElS8K/Iql7sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:40:50.844751Z"},"content_sha256":"e20b44e6d66bf3149f2ca4de1ebf513f51ee0900b4f3bf4c9134921461646ad6","schema_version":"1.0","event_id":"sha256:e20b44e6d66bf3149f2ca4de1ebf513f51ee0900b4f3bf4c9134921461646ad6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2GPX4A6HK7YTIAUG5F2ASO4QDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A proof of Andersen's rainbow path conjecture for large $n$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Alp M\\\"uyesser, Candida Bowtell, Richard Montgomery","submitted_at":"2026-08-06T17:58:27Z","abstract_excerpt":"We show that, for sufficiently large $n$, every properly edge-coloured $n$-vertex complete graph contains a path with $n-1$ vertices which uses each colour at most once (that is, a rainbow path). This resolves a conjecture of Andersen from 1989 for all large $n$ and improves previous results of Alon-Pokrovskiy-Sudakov, and then Balogh-Molla, which showed that rainbow paths/cycles of length $n-O(n^{1/2}\\log n)$ exist in this setting. Furthermore, with related methods, we show that, for every sufficiently large $n$, every Latin square of order $n$ contains a cycle-free transversal of order $n-2$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06369","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.06369/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"},"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-08-07T01:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygxTnKhWZbfX4IXWrPRU9g6W8lL4NCMk+5MA8L7Vrf/nks4Ae5kTxCkCCDUwr4xT4kM0StEwEDdarHYeeOyWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:40:50.845549Z"},"content_sha256":"4cac6d5f6a2a0a6bc9b7e61c356df6003c4fc36778da11a5dcfb1d275228fddf","schema_version":"1.0","event_id":"sha256:4cac6d5f6a2a0a6bc9b7e61c356df6003c4fc36778da11a5dcfb1d275228fddf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GPX4A6HK7YTIAUG5F2ASO4QDS/bundle.json","state_url":"https://pith.science/pith/2GPX4A6HK7YTIAUG5F2ASO4QDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GPX4A6HK7YTIAUG5F2ASO4QDS/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-08-08T19:40:50Z","links":{"resolver":"https://pith.science/pith/2GPX4A6HK7YTIAUG5F2ASO4QDS","bundle":"https://pith.science/pith/2GPX4A6HK7YTIAUG5F2ASO4QDS/bundle.json","state":"https://pith.science/pith/2GPX4A6HK7YTIAUG5F2ASO4QDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GPX4A6HK7YTIAUG5F2ASO4QDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2GPX4A6HK7YTIAUG5F2ASO4QDS","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":"92c7ebfeecbace0514243da113bc7c257d16d6e7726215d7762f4587823efda8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:58:27Z","title_canon_sha256":"61915566de04682158bb5003991173b7818a6705949004ec0c3688b09dcbc0d1"},"schema_version":"1.0","source":{"id":"2608.06369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06369","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06369v1","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06369","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"2GPX4A6HK7YT","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_16","alias_value":"2GPX4A6HK7YTIAUG","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_8","alias_value":"2GPX4A6H","created_at":"2026-08-07T01:41:29Z"}],"graph_snapshots":[{"event_id":"sha256:4cac6d5f6a2a0a6bc9b7e61c356df6003c4fc36778da11a5dcfb1d275228fddf","target":"graph","created_at":"2026-08-07T01:41:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.06369/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that, for sufficiently large $n$, every properly edge-coloured $n$-vertex complete graph contains a path with $n-1$ vertices which uses each colour at most once (that is, a rainbow path). This resolves a conjecture of Andersen from 1989 for all large $n$ and improves previous results of Alon-Pokrovskiy-Sudakov, and then Balogh-Molla, which showed that rainbow paths/cycles of length $n-O(n^{1/2}\\log n)$ exist in this setting. Furthermore, with related methods, we show that, for every sufficiently large $n$, every Latin square of order $n$ contains a cycle-free transversal of order $n-2$","authors_text":"Alexey Pokrovskiy, Alp M\\\"uyesser, Candida Bowtell, Richard Montgomery","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:58:27Z","title":"A proof of Andersen's rainbow path conjecture for large $n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06369","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:e20b44e6d66bf3149f2ca4de1ebf513f51ee0900b4f3bf4c9134921461646ad6","target":"record","created_at":"2026-08-07T01:41:29Z","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":"92c7ebfeecbace0514243da113bc7c257d16d6e7726215d7762f4587823efda8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T17:58:27Z","title_canon_sha256":"61915566de04682158bb5003991173b7818a6705949004ec0c3688b09dcbc0d1"},"schema_version":"1.0","source":{"id":"2608.06369","kind":"arxiv","version":1}},"canonical_sha256":"d19f7e03c757f1340286e974093b901cba14c23bb041e5d71c99ae3f633a7114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d19f7e03c757f1340286e974093b901cba14c23bb041e5d71c99ae3f633a7114","first_computed_at":"2026-08-07T01:41:29.821372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T01:41:29.821372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gMOkcisXyvdJ4usWPhhBXaNTT/DL/uHOKbZ/6/K67a132VG6i790N+3W8Od6IEXXdeIQxHYABFGjK3idsbORDw==","signature_status":"signed_v1","signed_at":"2026-08-07T01:41:29.822914Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.06369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e20b44e6d66bf3149f2ca4de1ebf513f51ee0900b4f3bf4c9134921461646ad6","sha256:4cac6d5f6a2a0a6bc9b7e61c356df6003c4fc36778da11a5dcfb1d275228fddf"],"state_sha256":"92446258a9c2bb5700eaa707bf0a2932bf97bd4c5106b56692114832978835b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7aP3i6Z2G9dJZzptorIXmBw+6XDFsf2MGkHKe4x53cM78FWjzG32EndyaNpN7LK1lQ0EE9oE9zg1eN2zUK6fBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:40:50.853140Z","bundle_sha256":"96fd21ab3ebac452aeb19d9ab9398730992a40672f9186d12f5ca8500ac2f226"}}