{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P6KTPY4I6LWSKUITLHPRO6QDRH","short_pith_number":"pith:P6KTPY4I","canonical_record":{"source":{"id":"1504.01119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-05T13:17:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aebee45650bc775908b6f7b8720e6efb39c60779b211ed7dbb8a13d078014e83","abstract_canon_sha256":"fe5783342f0e7ef4f7e5939e923a24f6be8518f41c5adfae2c441e9666a73c96"},"schema_version":"1.0"},"canonical_sha256":"7f9537e388f2ed25511359df177a0389d86cc3338fbc63614ab4be6d34b93f02","source":{"kind":"arxiv","id":"1504.01119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01119","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01119v1","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01119","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"P6KTPY4I6LWS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P6KTPY4I6LWSKUIT","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P6KTPY4I","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P6KTPY4I6LWSKUITLHPRO6QDRH","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-05T13:17:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aebee45650bc775908b6f7b8720e6efb39c60779b211ed7dbb8a13d078014e83","abstract_canon_sha256":"fe5783342f0e7ef4f7e5939e923a24f6be8518f41c5adfae2c441e9666a73c96"},"schema_version":"1.0"},"canonical_sha256":"7f9537e388f2ed25511359df177a0389d86cc3338fbc63614ab4be6d34b93f02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:35.107487Z","signature_b64":"r6NOMTHUgZvfTA+aqIMzniYvLY2poD43F6SsAGHNe/vh4xEzTB0CEXZKtP0SGo1sPhkw1joKM3plO0vCCOMsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f9537e388f2ed25511359df177a0389d86cc3338fbc63614ab4be6d34b93f02","last_reissued_at":"2026-05-18T02:19:35.107042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:35.107042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01119","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-18T02:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bS8j4C8e9Zh1Kcb4o8sHTXiWmNEVM0lBxCUTE609JtW2BnaKyuZHCwjrqM0fVwH8lSY+AGEAp9hRT3cEbyDaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:41:52.436505Z"},"content_sha256":"e1d2018b8357d2ae9aab5a89802d53254ef0e70ae2c5705f7b6ee619ad47a733","schema_version":"1.0","event_id":"sha256:e1d2018b8357d2ae9aab5a89802d53254ef0e70ae2c5705f7b6ee619ad47a733"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P6KTPY4I6LWSKUITLHPRO6QDRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring tournaments with forbidden substructures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Krzysztof Choromanski, Tony Jebara","submitted_at":"2015-04-05T13:17:17Z","abstract_excerpt":"Coloring graphs is an important algorithmic problem in combinatorics with many applications in computer science. In this paper we study coloring tournaments. A chromatic number of a random tournament is of order $\\Omega(\\frac{n}{\\log(n)})$. The question arises whether the chromatic number can be proven to be smaller for more structured nontrivial classes of tournaments. We analyze the class of tournaments defined by a forbidden subtournament $H$. This paper gives a first quasi-polynomial algorithm running in time $e^{O(\\log(n)^{2})}$ that constructs colorings of $H$-free tournaments using only"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01119","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-18T02:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jx5wEx6R61Yc5upJ6v6KL3IIHAlNdsdrpwNMQuXQUxoQ402Q/FCeLTlny8FhCWXkbAU0x38myQKTslqyw7R4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:41:52.436875Z"},"content_sha256":"3c343e375b851d12c3b1a74aaaddc91ba9399096a1c99412687b2de063bc086e","schema_version":"1.0","event_id":"sha256:3c343e375b851d12c3b1a74aaaddc91ba9399096a1c99412687b2de063bc086e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6KTPY4I6LWSKUITLHPRO6QDRH/bundle.json","state_url":"https://pith.science/pith/P6KTPY4I6LWSKUITLHPRO6QDRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6KTPY4I6LWSKUITLHPRO6QDRH/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-05T10:41:52Z","links":{"resolver":"https://pith.science/pith/P6KTPY4I6LWSKUITLHPRO6QDRH","bundle":"https://pith.science/pith/P6KTPY4I6LWSKUITLHPRO6QDRH/bundle.json","state":"https://pith.science/pith/P6KTPY4I6LWSKUITLHPRO6QDRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6KTPY4I6LWSKUITLHPRO6QDRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P6KTPY4I6LWSKUITLHPRO6QDRH","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":"fe5783342f0e7ef4f7e5939e923a24f6be8518f41c5adfae2c441e9666a73c96","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-05T13:17:17Z","title_canon_sha256":"aebee45650bc775908b6f7b8720e6efb39c60779b211ed7dbb8a13d078014e83"},"schema_version":"1.0","source":{"id":"1504.01119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01119","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01119v1","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01119","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"P6KTPY4I6LWS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P6KTPY4I6LWSKUIT","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P6KTPY4I","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:3c343e375b851d12c3b1a74aaaddc91ba9399096a1c99412687b2de063bc086e","target":"graph","created_at":"2026-05-18T02:19:35Z","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":"Coloring graphs is an important algorithmic problem in combinatorics with many applications in computer science. In this paper we study coloring tournaments. A chromatic number of a random tournament is of order $\\Omega(\\frac{n}{\\log(n)})$. The question arises whether the chromatic number can be proven to be smaller for more structured nontrivial classes of tournaments. We analyze the class of tournaments defined by a forbidden subtournament $H$. This paper gives a first quasi-polynomial algorithm running in time $e^{O(\\log(n)^{2})}$ that constructs colorings of $H$-free tournaments using only","authors_text":"Krzysztof Choromanski, Tony Jebara","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-05T13:17:17Z","title":"Coloring tournaments with forbidden substructures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01119","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:e1d2018b8357d2ae9aab5a89802d53254ef0e70ae2c5705f7b6ee619ad47a733","target":"record","created_at":"2026-05-18T02:19:35Z","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":"fe5783342f0e7ef4f7e5939e923a24f6be8518f41c5adfae2c441e9666a73c96","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-05T13:17:17Z","title_canon_sha256":"aebee45650bc775908b6f7b8720e6efb39c60779b211ed7dbb8a13d078014e83"},"schema_version":"1.0","source":{"id":"1504.01119","kind":"arxiv","version":1}},"canonical_sha256":"7f9537e388f2ed25511359df177a0389d86cc3338fbc63614ab4be6d34b93f02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f9537e388f2ed25511359df177a0389d86cc3338fbc63614ab4be6d34b93f02","first_computed_at":"2026-05-18T02:19:35.107042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:35.107042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6NOMTHUgZvfTA+aqIMzniYvLY2poD43F6SsAGHNe/vh4xEzTB0CEXZKtP0SGo1sPhkw1joKM3plO0vCCOMsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:35.107487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1d2018b8357d2ae9aab5a89802d53254ef0e70ae2c5705f7b6ee619ad47a733","sha256:3c343e375b851d12c3b1a74aaaddc91ba9399096a1c99412687b2de063bc086e"],"state_sha256":"ef1f6c752428f13b4352ced85f0af7f4d4a6ba5b0f2b5d74d1664689a7461059"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80C7sAlj1ZFETLHU0YpwjgVObK+2Qp08Za9YnWsUxA6ROl94eZ2NzyKoRyRZSjA2eqtUeLyiP4erXPbLpzRIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:41:52.438825Z","bundle_sha256":"a3e3d3025a1e6eb255a769e0d3b9779642752fd2e12023d7157b4412327dff9a"}}