{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6U22DUYW3TMDRNS43NRXTOVXVO","short_pith_number":"pith:6U22DUYW","schema_version":"1.0","canonical_sha256":"f535a1d316dcd838b65cdb6379bab7ab9018ad4b95f9d6e9cb59f2ffc60044ff","source":{"kind":"arxiv","id":"1411.6668","version":1},"attestation_state":"computed","paper":{"title":"Density of 5/2-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Zdenek Dvorak","submitted_at":"2014-11-24T22:13:31Z","abstract_excerpt":"A graph G is 5/2-critical if G has no circular 5/2-coloring (or equivalently, homomorphism to C_5), but every proper subgraph of G has one. We prove that every 5/2-critical graph on n>=4 vertices has at least (5n-2)/4 edges, and list all 5/2-critical graphs achieving this bound. This implies that every planar or projective-planar graph of girth at least 10 is 5/2-colorable."},"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":"1411.6668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T22:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"88afe46e365940822bba21e10e98c1c14a4c5967dd83c7f20340e188a54b731c","abstract_canon_sha256":"b3399bfeaebf07c529d40a18c3a87d160006943103f25961d72a97253963c26c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:52.714120Z","signature_b64":"xflcIcVxOAW2N7BeS7y6elXpyJV+0zWiT949U0/vbDlcK5UxH3fA+O1EiOwJE/sJlaS3yj41wXtYAE74v4YkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f535a1d316dcd838b65cdb6379bab7ab9018ad4b95f9d6e9cb59f2ffc60044ff","last_reissued_at":"2026-05-18T02:32:52.713635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:52.713635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density of 5/2-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Zdenek Dvorak","submitted_at":"2014-11-24T22:13:31Z","abstract_excerpt":"A graph G is 5/2-critical if G has no circular 5/2-coloring (or equivalently, homomorphism to C_5), but every proper subgraph of G has one. We prove that every 5/2-critical graph on n>=4 vertices has at least (5n-2)/4 edges, and list all 5/2-critical graphs achieving this bound. This implies that every planar or projective-planar graph of girth at least 10 is 5/2-colorable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6668","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":"1411.6668","created_at":"2026-05-18T02:32:52.713715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6668v1","created_at":"2026-05-18T02:32:52.713715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6668","created_at":"2026-05-18T02:32:52.713715+00:00"},{"alias_kind":"pith_short_12","alias_value":"6U22DUYW3TMD","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6U22DUYW3TMDRNS4","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6U22DUYW","created_at":"2026-05-18T12:28:16.859392+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/6U22DUYW3TMDRNS43NRXTOVXVO","json":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO.json","graph_json":"https://pith.science/api/pith-number/6U22DUYW3TMDRNS43NRXTOVXVO/graph.json","events_json":"https://pith.science/api/pith-number/6U22DUYW3TMDRNS43NRXTOVXVO/events.json","paper":"https://pith.science/paper/6U22DUYW"},"agent_actions":{"view_html":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO","download_json":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO.json","view_paper":"https://pith.science/paper/6U22DUYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6668&json=true","fetch_graph":"https://pith.science/api/pith-number/6U22DUYW3TMDRNS43NRXTOVXVO/graph.json","fetch_events":"https://pith.science/api/pith-number/6U22DUYW3TMDRNS43NRXTOVXVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO/action/storage_attestation","attest_author":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO/action/author_attestation","sign_citation":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO/action/citation_signature","submit_replication":"https://pith.science/pith/6U22DUYW3TMDRNS43NRXTOVXVO/action/replication_record"}},"created_at":"2026-05-18T02:32:52.713715+00:00","updated_at":"2026-05-18T02:32:52.713715+00:00"}