{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L2Z3PNFVDT5NP7KARGGNDEA23L","short_pith_number":"pith:L2Z3PNFV","schema_version":"1.0","canonical_sha256":"5eb3b7b4b51cfad7fd40898cd1901adad21825064b4fbdb658b57bc45b5c0c19","source":{"kind":"arxiv","id":"1408.4065","version":2},"attestation_state":"computed","paper":{"title":"On the chromatic number of the Erd\\H{o}s-R\\'enyi orthogonal polarity graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Mike Tait, Xing Peng","submitted_at":"2014-08-18T17:20:18Z","abstract_excerpt":"For a prime power $q$, let $ER_q$ denote the Erd\\H{o}s-R\\'enyi orthogonal polarity graph. We prove that if $q$ is an even power of an odd prime, then $\\chi ( ER_{q}) \\leq 2 \\sqrt{q} + O ( \\sqrt{q} / \\log q)$. This upper bound is best possible up to a constant factor of at most 2. If $q$ is an odd power of an odd prime and satisfies some condition on irreducible polynomials, then we improve the best known upper bound for $\\chi(ER_{q})$ substantially. We also show that for sufficiently large $q$, every $ER_q$ contains a subgraph that is not 3-chromatic and has at most 36 vertices."},"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":"1408.4065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T17:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"572c0c5d1345741ff782798376e8cf9d090909adf2598f32071e3a0dee199368","abstract_canon_sha256":"a3a586de293bd65d6c574419f22f05be9aa8215b4ee1e39e9175f0f04b205352"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.625957Z","signature_b64":"rF41yLb/b8Dg0LcQLCOlHXEN973b4yzQqth7BV/vEKfyQUEEuPyvodjF4/JjR4Kboil8SafBV/p7ryf8FgK5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eb3b7b4b51cfad7fd40898cd1901adad21825064b4fbdb658b57bc45b5c0c19","last_reissued_at":"2026-05-18T02:42:53.625588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.625588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the chromatic number of the Erd\\H{o}s-R\\'enyi orthogonal polarity graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Mike Tait, Xing Peng","submitted_at":"2014-08-18T17:20:18Z","abstract_excerpt":"For a prime power $q$, let $ER_q$ denote the Erd\\H{o}s-R\\'enyi orthogonal polarity graph. We prove that if $q$ is an even power of an odd prime, then $\\chi ( ER_{q}) \\leq 2 \\sqrt{q} + O ( \\sqrt{q} / \\log q)$. This upper bound is best possible up to a constant factor of at most 2. If $q$ is an odd power of an odd prime and satisfies some condition on irreducible polynomials, then we improve the best known upper bound for $\\chi(ER_{q})$ substantially. We also show that for sufficiently large $q$, every $ER_q$ contains a subgraph that is not 3-chromatic and has at most 36 vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4065","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":""},"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":"1408.4065","created_at":"2026-05-18T02:42:53.625639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.4065v2","created_at":"2026-05-18T02:42:53.625639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4065","created_at":"2026-05-18T02:42:53.625639+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2Z3PNFVDT5N","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2Z3PNFVDT5NP7KA","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2Z3PNFV","created_at":"2026-05-18T12:28:35.611951+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/L2Z3PNFVDT5NP7KARGGNDEA23L","json":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L.json","graph_json":"https://pith.science/api/pith-number/L2Z3PNFVDT5NP7KARGGNDEA23L/graph.json","events_json":"https://pith.science/api/pith-number/L2Z3PNFVDT5NP7KARGGNDEA23L/events.json","paper":"https://pith.science/paper/L2Z3PNFV"},"agent_actions":{"view_html":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L","download_json":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L.json","view_paper":"https://pith.science/paper/L2Z3PNFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.4065&json=true","fetch_graph":"https://pith.science/api/pith-number/L2Z3PNFVDT5NP7KARGGNDEA23L/graph.json","fetch_events":"https://pith.science/api/pith-number/L2Z3PNFVDT5NP7KARGGNDEA23L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L/action/storage_attestation","attest_author":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L/action/author_attestation","sign_citation":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L/action/citation_signature","submit_replication":"https://pith.science/pith/L2Z3PNFVDT5NP7KARGGNDEA23L/action/replication_record"}},"created_at":"2026-05-18T02:42:53.625639+00:00","updated_at":"2026-05-18T02:42:53.625639+00:00"}