{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CXX2V5KDRJSAX3DLX47AZBUH74","short_pith_number":"pith:CXX2V5KD","schema_version":"1.0","canonical_sha256":"15efaaf5438a640bec6bbf3e0c8687ff08d006be6b04c09a143524e05068aad2","source":{"kind":"arxiv","id":"1603.00312","version":1},"attestation_state":"computed","paper":{"title":"Chromatic number of ordered graphs with forbidden ordered subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jonathan Rollin, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2016-03-01T15:14:20Z","abstract_excerpt":"It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., graphs with a linear ordering on their vertex set, and the function f(H) = sup{chi(G) | G in Forb(H)} where Forb(H) denotes the set of all ordered graphs that do not contain a copy of H. If H contains a cycle, then as in the case of unordered graphs, f(H) is infinity. However, in contrast to the unordered graphs, we describe an infinite family of ordered forests H with infinite f(H). An ordered graph is crossing if there"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.00312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-01T15:14:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c4e270aa525bad03818e04a521f7eda76569da6ec674df6ea3370fbf0b66b851","abstract_canon_sha256":"4ec2ef961de5aba3a7a6f7576a521dbb9a64c717f37b9b6668a157d18f21f789"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:45.364894Z","signature_b64":"ls02IN5GDWSCTMljahUScqZa3PqxMKfK94e4HYqPOQ42eOcNh+lIHV63t2+0BvvjNjapak6lUZZzyMsXIngDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15efaaf5438a640bec6bbf3e0c8687ff08d006be6b04c09a143524e05068aad2","last_reissued_at":"2026-05-18T01:19:45.364211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:45.364211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic number of ordered graphs with forbidden ordered subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jonathan Rollin, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2016-03-01T15:14:20Z","abstract_excerpt":"It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., graphs with a linear ordering on their vertex set, and the function f(H) = sup{chi(G) | G in Forb(H)} where Forb(H) denotes the set of all ordered graphs that do not contain a copy of H. If H contains a cycle, then as in the case of unordered graphs, f(H) is infinity. However, in contrast to the unordered graphs, we describe an infinite family of ordered forests H with infinite f(H). An ordered graph is crossing if there"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00312","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.00312","created_at":"2026-05-18T01:19:45.364327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00312v1","created_at":"2026-05-18T01:19:45.364327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00312","created_at":"2026-05-18T01:19:45.364327+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXX2V5KDRJSA","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXX2V5KDRJSAX3DL","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXX2V5KD","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74","json":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74.json","graph_json":"https://pith.science/api/pith-number/CXX2V5KDRJSAX3DLX47AZBUH74/graph.json","events_json":"https://pith.science/api/pith-number/CXX2V5KDRJSAX3DLX47AZBUH74/events.json","paper":"https://pith.science/paper/CXX2V5KD"},"agent_actions":{"view_html":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74","download_json":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74.json","view_paper":"https://pith.science/paper/CXX2V5KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00312&json=true","fetch_graph":"https://pith.science/api/pith-number/CXX2V5KDRJSAX3DLX47AZBUH74/graph.json","fetch_events":"https://pith.science/api/pith-number/CXX2V5KDRJSAX3DLX47AZBUH74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74/action/storage_attestation","attest_author":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74/action/author_attestation","sign_citation":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74/action/citation_signature","submit_replication":"https://pith.science/pith/CXX2V5KDRJSAX3DLX47AZBUH74/action/replication_record"}},"created_at":"2026-05-18T01:19:45.364327+00:00","updated_at":"2026-05-18T01:19:45.364327+00:00"}