{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IYJZCJ4OIPRDZCGA26T3TIHING","short_pith_number":"pith:IYJZCJ4O","canonical_record":{"source":{"id":"2305.13422","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-22T19:13:47Z","cross_cats_sorted":[],"title_canon_sha256":"7028d1d6546cef0784bcf72fdb4ba0e1d0c9be0eabd7e73987b15c016cb1d9a5","abstract_canon_sha256":"09e3c38bf002d2a32e5c62f767efdf1e99dd710ee7c7cea8738fb6d033b1cd62"},"schema_version":"1.0"},"canonical_sha256":"461391278e43e23c88c0d7a7b9a0e869ace413f197be8688d57f8a20d1f9453b","source":{"kind":"arxiv","id":"2305.13422","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13422","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13422v2","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13422","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"IYJZCJ4OIPRD","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"pith_short_16","alias_value":"IYJZCJ4OIPRDZCGA","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"pith_short_8","alias_value":"IYJZCJ4O","created_at":"2026-07-05T06:16:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IYJZCJ4OIPRDZCGA26T3TIHING","target":"record","payload":{"canonical_record":{"source":{"id":"2305.13422","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-22T19:13:47Z","cross_cats_sorted":[],"title_canon_sha256":"7028d1d6546cef0784bcf72fdb4ba0e1d0c9be0eabd7e73987b15c016cb1d9a5","abstract_canon_sha256":"09e3c38bf002d2a32e5c62f767efdf1e99dd710ee7c7cea8738fb6d033b1cd62"},"schema_version":"1.0"},"canonical_sha256":"461391278e43e23c88c0d7a7b9a0e869ace413f197be8688d57f8a20d1f9453b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:18.669843Z","signature_b64":"l4CkwuxHgbXoypZq+f/yFSD9ocYyEnxHPbibaKd5EKoe7H66T6a/iSCifZLlfS7FfO4wJ6w+YOtzbYbzMX4aDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"461391278e43e23c88c0d7a7b9a0e869ace413f197be8688d57f8a20d1f9453b","last_reissued_at":"2026-07-05T06:16:18.669344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:18.669344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.13422","source_version":2,"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-07-05T06:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGtFAddrS6mlIOyUVDn/n62Yc9jTlQIrNieqCVBWnXdLw+c99QA393GHCgPF5d5N9QzzdpavvyuYgZOvwys7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:39:37.433386Z"},"content_sha256":"967a098882b4376c6e02ad1b508dbcb0684fd6f1cd0d16c798de975e91354321","schema_version":"1.0","event_id":"sha256:967a098882b4376c6e02ad1b508dbcb0684fd6f1cd0d16c798de975e91354321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IYJZCJ4OIPRDZCGA26T3TIHING","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flashes and rainbows in tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Ant\\'onio Gir\\~ao, Freddie Illingworth, Lukas Michel, Michael Savery","submitted_at":"2023-05-22T19:13:47Z","abstract_excerpt":"Colour the edges of the complete graph with vertex set $\\{1, 2, \\dotsc, n\\}$ with an arbitrary number of colours. What is the smallest integer $f(l,k)$ such that if $n > f(l,k)$ then there must exist a monotone monochromatic path of length $l$ or a monotone rainbow path of length $k$? Lefmann, R\\\"{o}dl, and Thomas conjectured in 1992 that $f(l, k) = l^{k - 1}$ and proved this for $l \\ge (3 k)^{2 k}$. We prove the conjecture for $l \\geq k^3 (\\log k)^{1 + o(1)}$ and establish the general upper bound $f(l, k) \\leq k (\\log k)^{1 + o(1)} \\cdot l^{k - 1}$. This reduces the gap between the best lower"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13422","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/2305.13422/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-07-05T06:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJv4xbehepRdRTK0KGFin6x+KWJ5VbSSEJJOTYP429V582hxk98xdV67wQ/1yVrjjLt/EGjfDxXB1mXk4aFuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:39:37.433765Z"},"content_sha256":"5183710cfcf185843b9759878dab9c2c7dc57adbc563ba42765c348a26b030cd","schema_version":"1.0","event_id":"sha256:5183710cfcf185843b9759878dab9c2c7dc57adbc563ba42765c348a26b030cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYJZCJ4OIPRDZCGA26T3TIHING/bundle.json","state_url":"https://pith.science/pith/IYJZCJ4OIPRDZCGA26T3TIHING/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYJZCJ4OIPRDZCGA26T3TIHING/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-07-07T12:39:37Z","links":{"resolver":"https://pith.science/pith/IYJZCJ4OIPRDZCGA26T3TIHING","bundle":"https://pith.science/pith/IYJZCJ4OIPRDZCGA26T3TIHING/bundle.json","state":"https://pith.science/pith/IYJZCJ4OIPRDZCGA26T3TIHING/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYJZCJ4OIPRDZCGA26T3TIHING/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IYJZCJ4OIPRDZCGA26T3TIHING","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":"09e3c38bf002d2a32e5c62f767efdf1e99dd710ee7c7cea8738fb6d033b1cd62","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-22T19:13:47Z","title_canon_sha256":"7028d1d6546cef0784bcf72fdb4ba0e1d0c9be0eabd7e73987b15c016cb1d9a5"},"schema_version":"1.0","source":{"id":"2305.13422","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13422","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13422v2","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13422","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"IYJZCJ4OIPRD","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"pith_short_16","alias_value":"IYJZCJ4OIPRDZCGA","created_at":"2026-07-05T06:16:18Z"},{"alias_kind":"pith_short_8","alias_value":"IYJZCJ4O","created_at":"2026-07-05T06:16:18Z"}],"graph_snapshots":[{"event_id":"sha256:5183710cfcf185843b9759878dab9c2c7dc57adbc563ba42765c348a26b030cd","target":"graph","created_at":"2026-07-05T06:16:18Z","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/2305.13422/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Colour the edges of the complete graph with vertex set $\\{1, 2, \\dotsc, n\\}$ with an arbitrary number of colours. What is the smallest integer $f(l,k)$ such that if $n > f(l,k)$ then there must exist a monotone monochromatic path of length $l$ or a monotone rainbow path of length $k$? Lefmann, R\\\"{o}dl, and Thomas conjectured in 1992 that $f(l, k) = l^{k - 1}$ and proved this for $l \\ge (3 k)^{2 k}$. We prove the conjecture for $l \\geq k^3 (\\log k)^{1 + o(1)}$ and establish the general upper bound $f(l, k) \\leq k (\\log k)^{1 + o(1)} \\cdot l^{k - 1}$. This reduces the gap between the best lower","authors_text":"Alex Scott, Ant\\'onio Gir\\~ao, Freddie Illingworth, Lukas Michel, Michael Savery","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-22T19:13:47Z","title":"Flashes and rainbows in tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13422","kind":"arxiv","version":2},"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:967a098882b4376c6e02ad1b508dbcb0684fd6f1cd0d16c798de975e91354321","target":"record","created_at":"2026-07-05T06:16:18Z","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":"09e3c38bf002d2a32e5c62f767efdf1e99dd710ee7c7cea8738fb6d033b1cd62","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-22T19:13:47Z","title_canon_sha256":"7028d1d6546cef0784bcf72fdb4ba0e1d0c9be0eabd7e73987b15c016cb1d9a5"},"schema_version":"1.0","source":{"id":"2305.13422","kind":"arxiv","version":2}},"canonical_sha256":"461391278e43e23c88c0d7a7b9a0e869ace413f197be8688d57f8a20d1f9453b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"461391278e43e23c88c0d7a7b9a0e869ace413f197be8688d57f8a20d1f9453b","first_computed_at":"2026-07-05T06:16:18.669344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:16:18.669344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4CkwuxHgbXoypZq+f/yFSD9ocYyEnxHPbibaKd5EKoe7H66T6a/iSCifZLlfS7FfO4wJ6w+YOtzbYbzMX4aDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:16:18.669843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.13422","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:967a098882b4376c6e02ad1b508dbcb0684fd6f1cd0d16c798de975e91354321","sha256:5183710cfcf185843b9759878dab9c2c7dc57adbc563ba42765c348a26b030cd"],"state_sha256":"488f9436d31dd9442ea5837f4bd09de0e7c50f86f77815cd64c7c1bdadb58b44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D8aibN7s/Pi8AbeCIo62F8+P/aHZFUv5V0apRYIUpecUg6HMWK3T8xa6H4mfIdpZZaHDTeBjzeowD+DuEKYXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:39:37.435771Z","bundle_sha256":"ebce64eb9ab264864a7622c2088fb69ce7acfd3e1a1e7b0926b42af68cc2cdab"}}