{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QEVWGUPCQC26H7CBYIOHZT4S5V","short_pith_number":"pith:QEVWGUPC","canonical_record":{"source":{"id":"1207.0840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-03T21:43:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f53c4a139eb0f71823cc2e0a5189a7b4e2cfa5386a590238ceb1630b27aa511a","abstract_canon_sha256":"aee44b6b2e7186779c93bb46c954a973a3de1933e665bfcf93b90b631abad712"},"schema_version":"1.0"},"canonical_sha256":"812b6351e280b5e3fc41c21c7ccf92ed71890b8d93dc204f04990b744e76df63","source":{"kind":"arxiv","id":"1207.0840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0840","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0840v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0840","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"QEVWGUPCQC26","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QEVWGUPCQC26H7CB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QEVWGUPC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QEVWGUPCQC26H7CBYIOHZT4S5V","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-03T21:43:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f53c4a139eb0f71823cc2e0a5189a7b4e2cfa5386a590238ceb1630b27aa511a","abstract_canon_sha256":"aee44b6b2e7186779c93bb46c954a973a3de1933e665bfcf93b90b631abad712"},"schema_version":"1.0"},"canonical_sha256":"812b6351e280b5e3fc41c21c7ccf92ed71890b8d93dc204f04990b744e76df63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.285006Z","signature_b64":"l/Kj0jSmoYkbJ5DB24GsH7GQiezmHVLw55TWKqw87Osu2fue7j13lCciNrGN3kunRxvoH34QStnh/APeINxxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"812b6351e280b5e3fc41c21c7ccf92ed71890b8d93dc204f04990b744e76df63","last_reissued_at":"2026-05-18T03:51:48.284326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.284326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0840","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-05-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AW0X1RLM/JjEsbmKq+E9X/TuReO0CEALtLB5qQbb7ELO5NXrOMh9t1IwzRys2ZbZyk1Q7WRRgmepUWZ+zC8VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:37.282040Z"},"content_sha256":"d718a0a9136cc29a2346a87981f2c7390b66fb5607e76a4ad2623e9abbb72c70","schema_version":"1.0","event_id":"sha256:d718a0a9136cc29a2346a87981f2c7390b66fb5607e76a4ad2623e9abbb72c70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QEVWGUPCQC26H7CBYIOHZT4S5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Rainbow Cycles and Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Frank Mousset, Heidi Gebauer","submitted_at":"2012-07-03T21:43:39Z","abstract_excerpt":"In a properly edge colored graph, a subgraph using every color at most once is called rainbow. In this thesis, we study rainbow cycles and paths in proper edge colorings of complete graphs, and we prove that in every proper edge coloring of K_n, there is a rainbow path on (3/4-o(1))n vertices, improving on the previously best bound of (2n+1)/3 from Gyarfas and Mhalla. Similarly, a k-rainbow path in a proper edge coloring of K_n is a path using no color more than k times. We prove that in every proper edge coloring of K_n, there is a k-rainbow path on (1-2/(k+1)!)n vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0840","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"},"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-05-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1LHl1TASszIEtWY4XhBDKIG25/aAEVWVqgabTAO5oiCYXB9IPn61DX5G//y+RpKjTZqdlFA/75Ci/U+RKkwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:37.282492Z"},"content_sha256":"8641c71dd0acbc8ce1d5d0b64d9772efe734d6a6e8a886b83a2eec4e3083f6c0","schema_version":"1.0","event_id":"sha256:8641c71dd0acbc8ce1d5d0b64d9772efe734d6a6e8a886b83a2eec4e3083f6c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEVWGUPCQC26H7CBYIOHZT4S5V/bundle.json","state_url":"https://pith.science/pith/QEVWGUPCQC26H7CBYIOHZT4S5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEVWGUPCQC26H7CBYIOHZT4S5V/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-05-28T16:49:37Z","links":{"resolver":"https://pith.science/pith/QEVWGUPCQC26H7CBYIOHZT4S5V","bundle":"https://pith.science/pith/QEVWGUPCQC26H7CBYIOHZT4S5V/bundle.json","state":"https://pith.science/pith/QEVWGUPCQC26H7CBYIOHZT4S5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEVWGUPCQC26H7CBYIOHZT4S5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QEVWGUPCQC26H7CBYIOHZT4S5V","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":"aee44b6b2e7186779c93bb46c954a973a3de1933e665bfcf93b90b631abad712","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-03T21:43:39Z","title_canon_sha256":"f53c4a139eb0f71823cc2e0a5189a7b4e2cfa5386a590238ceb1630b27aa511a"},"schema_version":"1.0","source":{"id":"1207.0840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0840","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0840v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0840","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"QEVWGUPCQC26","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QEVWGUPCQC26H7CB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QEVWGUPC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:8641c71dd0acbc8ce1d5d0b64d9772efe734d6a6e8a886b83a2eec4e3083f6c0","target":"graph","created_at":"2026-05-18T03:51:48Z","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":"In a properly edge colored graph, a subgraph using every color at most once is called rainbow. In this thesis, we study rainbow cycles and paths in proper edge colorings of complete graphs, and we prove that in every proper edge coloring of K_n, there is a rainbow path on (3/4-o(1))n vertices, improving on the previously best bound of (2n+1)/3 from Gyarfas and Mhalla. Similarly, a k-rainbow path in a proper edge coloring of K_n is a path using no color more than k times. We prove that in every proper edge coloring of K_n, there is a k-rainbow path on (1-2/(k+1)!)n vertices.","authors_text":"Frank Mousset, Heidi Gebauer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-03T21:43:39Z","title":"On Rainbow Cycles and Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0840","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:d718a0a9136cc29a2346a87981f2c7390b66fb5607e76a4ad2623e9abbb72c70","target":"record","created_at":"2026-05-18T03:51:48Z","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":"aee44b6b2e7186779c93bb46c954a973a3de1933e665bfcf93b90b631abad712","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-03T21:43:39Z","title_canon_sha256":"f53c4a139eb0f71823cc2e0a5189a7b4e2cfa5386a590238ceb1630b27aa511a"},"schema_version":"1.0","source":{"id":"1207.0840","kind":"arxiv","version":1}},"canonical_sha256":"812b6351e280b5e3fc41c21c7ccf92ed71890b8d93dc204f04990b744e76df63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"812b6351e280b5e3fc41c21c7ccf92ed71890b8d93dc204f04990b744e76df63","first_computed_at":"2026-05-18T03:51:48.284326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:48.284326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l/Kj0jSmoYkbJ5DB24GsH7GQiezmHVLw55TWKqw87Osu2fue7j13lCciNrGN3kunRxvoH34QStnh/APeINxxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:48.285006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d718a0a9136cc29a2346a87981f2c7390b66fb5607e76a4ad2623e9abbb72c70","sha256:8641c71dd0acbc8ce1d5d0b64d9772efe734d6a6e8a886b83a2eec4e3083f6c0"],"state_sha256":"529d70a69f02902554fb8f2b2e5ccceb96cab1095af613e8f361e5b0e12458ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9CHEIx/xs3A7aDkcv+Ej26dE80LTUShNIjVXb4g8VyZmuTfxkzNyeIUodwFBpIn2HFqBi2WAT8XbU5Cu0fvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:49:37.285431Z","bundle_sha256":"539378a156e5c1f4888249977be5d761627824e6e82d9c3cc264ca13729c4b57"}}