{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QFD7CCW74BAAUW3AM7PZPITO6Y","short_pith_number":"pith:QFD7CCW7","canonical_record":{"source":{"id":"1506.08480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-29T00:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"44bbba75b88fa791cc431eb232e14a6c4aa29abb06de6b0ec95c96f650ba31af","abstract_canon_sha256":"48aeb7e96573f63b77643acbbfee82ec1d36a883db602cee65d7f9e69ab6c242"},"schema_version":"1.0"},"canonical_sha256":"8147f10adfe0400a5b6067df97a26ef6025de44ec89bce2b40731fd3ac1393b5","source":{"kind":"arxiv","id":"1506.08480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08480","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08480v1","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08480","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"QFD7CCW74BAA","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QFD7CCW74BAAUW3A","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QFD7CCW7","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QFD7CCW74BAAUW3AM7PZPITO6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-29T00:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"44bbba75b88fa791cc431eb232e14a6c4aa29abb06de6b0ec95c96f650ba31af","abstract_canon_sha256":"48aeb7e96573f63b77643acbbfee82ec1d36a883db602cee65d7f9e69ab6c242"},"schema_version":"1.0"},"canonical_sha256":"8147f10adfe0400a5b6067df97a26ef6025de44ec89bce2b40731fd3ac1393b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:44.133758Z","signature_b64":"EcfHLVXjJC1IiM75+fIRcADwYjnMyvlmKUxvUbL7aucIAgOhfMAKq6qXhHgdAjAsgzUIb2VNN4eR5JuRZ/7LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8147f10adfe0400a5b6067df97a26ef6025de44ec89bce2b40731fd3ac1393b5","last_reissued_at":"2026-05-18T01:37:44.133105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:44.133105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08480","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-18T01:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLT9cmNrfQzUtYwTte6IJKo50Lfxz4SkF/Dbh3FHPXrc6kSeeNCZpO9++ziJksDMbypNa2peVYnLLx5zEF7kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:46:25.239248Z"},"content_sha256":"bd3a51f5e95fe76982d0ac8399ee5003e43172b06079431bce4eb1534a0a380c","schema_version":"1.0","event_id":"sha256:bd3a51f5e95fe76982d0ac8399ee5003e43172b06079431bce4eb1534a0a380c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QFD7CCW74BAAUW3AM7PZPITO6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$P_{k}$-freeness implies small dichromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Krzysztof Choromanski","submitted_at":"2015-06-29T00:39:06Z","abstract_excerpt":"We propose a purely combinatorial quadratic time algorithm that for any $n$-vertex $P_{k}$-free tournament $T$, where $P_{k}$ is a directed path of length $k$, finds in $T$ a transitive subset of order $n^{\\frac{c}{k\\log(k)^{2}}}$. As a byproduct of our method, we obtain subcubic $O(n^{1-\\frac{c}{k\\log(k)^{2}}})$-approximation algorithm for the optimal acyclic coloring problem on $P_{k}$-free tournaments. Our results are tight up to the $\\log(k)$-factor in the following sense: there exist infinite families of $P_{k}$-free tournaments with largest transitive subsets of order at most $n^{\\frac{c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08480","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-18T01:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yghjaEFGd7IJGTFD4r9YNom037DRTyvaeChQqQ+cdlzvLQ7JO4TtmW2hfMgUTvEqkYdNveWj/ZzzheHC/rK1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:46:25.239688Z"},"content_sha256":"7202479fe5d7ee46bcc844dc1895f0add6a7386f2c70ab07afc68967d915e49d","schema_version":"1.0","event_id":"sha256:7202479fe5d7ee46bcc844dc1895f0add6a7386f2c70ab07afc68967d915e49d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFD7CCW74BAAUW3AM7PZPITO6Y/bundle.json","state_url":"https://pith.science/pith/QFD7CCW74BAAUW3AM7PZPITO6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFD7CCW74BAAUW3AM7PZPITO6Y/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-06-12T09:46:25Z","links":{"resolver":"https://pith.science/pith/QFD7CCW74BAAUW3AM7PZPITO6Y","bundle":"https://pith.science/pith/QFD7CCW74BAAUW3AM7PZPITO6Y/bundle.json","state":"https://pith.science/pith/QFD7CCW74BAAUW3AM7PZPITO6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFD7CCW74BAAUW3AM7PZPITO6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QFD7CCW74BAAUW3AM7PZPITO6Y","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":"48aeb7e96573f63b77643acbbfee82ec1d36a883db602cee65d7f9e69ab6c242","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-29T00:39:06Z","title_canon_sha256":"44bbba75b88fa791cc431eb232e14a6c4aa29abb06de6b0ec95c96f650ba31af"},"schema_version":"1.0","source":{"id":"1506.08480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08480","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08480v1","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08480","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"QFD7CCW74BAA","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QFD7CCW74BAAUW3A","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QFD7CCW7","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:7202479fe5d7ee46bcc844dc1895f0add6a7386f2c70ab07afc68967d915e49d","target":"graph","created_at":"2026-05-18T01:37:44Z","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":"We propose a purely combinatorial quadratic time algorithm that for any $n$-vertex $P_{k}$-free tournament $T$, where $P_{k}$ is a directed path of length $k$, finds in $T$ a transitive subset of order $n^{\\frac{c}{k\\log(k)^{2}}}$. As a byproduct of our method, we obtain subcubic $O(n^{1-\\frac{c}{k\\log(k)^{2}}})$-approximation algorithm for the optimal acyclic coloring problem on $P_{k}$-free tournaments. Our results are tight up to the $\\log(k)$-factor in the following sense: there exist infinite families of $P_{k}$-free tournaments with largest transitive subsets of order at most $n^{\\frac{c","authors_text":"Krzysztof Choromanski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-29T00:39:06Z","title":"$P_{k}$-freeness implies small dichromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08480","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:bd3a51f5e95fe76982d0ac8399ee5003e43172b06079431bce4eb1534a0a380c","target":"record","created_at":"2026-05-18T01:37:44Z","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":"48aeb7e96573f63b77643acbbfee82ec1d36a883db602cee65d7f9e69ab6c242","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-29T00:39:06Z","title_canon_sha256":"44bbba75b88fa791cc431eb232e14a6c4aa29abb06de6b0ec95c96f650ba31af"},"schema_version":"1.0","source":{"id":"1506.08480","kind":"arxiv","version":1}},"canonical_sha256":"8147f10adfe0400a5b6067df97a26ef6025de44ec89bce2b40731fd3ac1393b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8147f10adfe0400a5b6067df97a26ef6025de44ec89bce2b40731fd3ac1393b5","first_computed_at":"2026-05-18T01:37:44.133105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:44.133105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EcfHLVXjJC1IiM75+fIRcADwYjnMyvlmKUxvUbL7aucIAgOhfMAKq6qXhHgdAjAsgzUIb2VNN4eR5JuRZ/7LCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:44.133758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd3a51f5e95fe76982d0ac8399ee5003e43172b06079431bce4eb1534a0a380c","sha256:7202479fe5d7ee46bcc844dc1895f0add6a7386f2c70ab07afc68967d915e49d"],"state_sha256":"acc3fb200afd3abb0f4f138f9b9b2a58fea4ddff24f950f5f1b15aaeccc662bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWSoaeIHjSY4s1A0u33mE6T1/svyTTsmsVIsgLE7HYfVo3/7HtIXa7LjBxU71aGhlREKUs1XthjBlAlMZ9ENAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:46:25.242157Z","bundle_sha256":"f3882e1bfcd7865da3e44bc1ae0e2f7fcacf3564bfc36e231b9877378ab6014f"}}