{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SOBARLOWKBESMG2EJZHZ6EGYYT","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":"afd553c928780a3f2a89bf329ec2399dea1af16fd1b49d6e3cb3ceaa6fa40ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T11:42:27Z","title_canon_sha256":"a7f43109e370c74822a88cfd5fcd84f68323aa6b111d82c33e5ced92be9d34be"},"schema_version":"1.0","source":{"id":"1811.05734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05734","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05734v1","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05734","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"SOBARLOWKBES","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SOBARLOWKBESMG2E","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SOBARLOW","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:760db6482fbc1910f4e109324ed3b940203d68cf4bc754a09c3d4f72bd5ec810","target":"graph","created_at":"2026-05-18T00:00:42Z","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":"For an oriented graph $G$, let $f(G)$ denote the maximum chromatic number of an acyclic subgraph of $G$. Let $f(n)$ be the smallest integer such that every oriented graph $G$ with chromatic number larger than $f(n)$ has $f(G) > n$. Let $g(n)$ be the smallest integer such that every tournament $G$ with more than $g(n)$ vertices has $f(G) > n$. It is straightforward that $\\Omega(n) \\le g(n) \\le f(n) \\le n^2$. This paper provides the first nontrivial lower and upper bounds for $g(n)$. In particular, it is proved that $\\frac{1}{4}n^{8/7} \\le g(n) \\le n^2-(2-\\frac{1}{\\sqrt{2}})n+2$. It is also show","authors_text":"Raphael Yuster, Safwat Nassar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T11:42:27Z","title":"Acyclic subgraphs with high chromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05734","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:f1ddab5570a6db31699218a31586621611d4e967ce0cc70f4348e85a40a34b4e","target":"record","created_at":"2026-05-18T00:00:42Z","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":"afd553c928780a3f2a89bf329ec2399dea1af16fd1b49d6e3cb3ceaa6fa40ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T11:42:27Z","title_canon_sha256":"a7f43109e370c74822a88cfd5fcd84f68323aa6b111d82c33e5ced92be9d34be"},"schema_version":"1.0","source":{"id":"1811.05734","kind":"arxiv","version":1}},"canonical_sha256":"938208add65049261b444e4f9f10d8c4de03ddef0563c833eed8a30bd93cd802","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"938208add65049261b444e4f9f10d8c4de03ddef0563c833eed8a30bd93cd802","first_computed_at":"2026-05-18T00:00:42.204451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:42.204451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SYL+6bVLdWd7hsUh8xYOO7x7sKpNoDSO/k8xZ78242wWOF0vVcT2UruBKQkUGZ/7ecPIDHeHNTKTNvRvSx33Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:42.204840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1ddab5570a6db31699218a31586621611d4e967ce0cc70f4348e85a40a34b4e","sha256:760db6482fbc1910f4e109324ed3b940203d68cf4bc754a09c3d4f72bd5ec810"],"state_sha256":"714f3a80f99818cb3a78625d1554a3287c1df8b970de2b0cacef25703882ef10"}