{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NEECP6LTOLCXUGZRVUSGA5YDCZ","short_pith_number":"pith:NEECP6LT","schema_version":"1.0","canonical_sha256":"690827f97372c57a1b31ad2460770316507799d84b2a06b40a7b7e658f0ee004","source":{"kind":"arxiv","id":"2201.12381","version":2},"attestation_state":"computed","paper":{"title":"The odd chromatic number of a planar graph is at most 8","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Petr, Julien Portier","submitted_at":"2022-01-28T19:22:20Z","abstract_excerpt":"Petru\\v{s}evski and \\v{S}krekovski \\cite{odd9} recently introduced the notion of an odd colouring of a graph: a proper vertex colouring of a graph $G$ is said to be \\emph{odd} if for each non-isolated vertex $x \\in V(G)$ there exists a colour $c$ appearing an odd number of times in $N(x)$.\n  Petru\\v{s}evski and \\v{S}krekovski proved that for any planar graph $G$ there is an odd colouring using at most $9$ colours and, together with Caro \\cite{oddremarks}, showed that $8$ colours are enough for a significant family of planar graphs. We show that $8$ colours suffice for all planar graphs."},"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":"2201.12381","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-01-28T19:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"b330a12976e83af60caa67cbf2fea8de670f1bc1a0ddd5026402a12c56b348de","abstract_canon_sha256":"05d2fb27ce19a87c77c4d53cbf47d69225e372bfb8f71d86650dedb417f5ef1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:52:07.122678Z","signature_b64":"2IqBKmEPaMFHoACTLDKNtNXvaZg9ibT/LbVcBCyrBux20tspLttz/KvlZkJlvhC8+a7fKjDHY1ZDhv1HSRLxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690827f97372c57a1b31ad2460770316507799d84b2a06b40a7b7e658f0ee004","last_reissued_at":"2026-07-05T05:52:07.122246Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:52:07.122246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The odd chromatic number of a planar graph is at most 8","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Petr, Julien Portier","submitted_at":"2022-01-28T19:22:20Z","abstract_excerpt":"Petru\\v{s}evski and \\v{S}krekovski \\cite{odd9} recently introduced the notion of an odd colouring of a graph: a proper vertex colouring of a graph $G$ is said to be \\emph{odd} if for each non-isolated vertex $x \\in V(G)$ there exists a colour $c$ appearing an odd number of times in $N(x)$.\n  Petru\\v{s}evski and \\v{S}krekovski proved that for any planar graph $G$ there is an odd colouring using at most $9$ colours and, together with Caro \\cite{oddremarks}, showed that $8$ colours are enough for a significant family of planar graphs. We show that $8$ colours suffice for all planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12381","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.12381/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2201.12381","created_at":"2026-07-05T05:52:07.122307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12381v2","created_at":"2026-07-05T05:52:07.122307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12381","created_at":"2026-07-05T05:52:07.122307+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEECP6LTOLCX","created_at":"2026-07-05T05:52:07.122307+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEECP6LTOLCXUGZR","created_at":"2026-07-05T05:52:07.122307+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEECP6LT","created_at":"2026-07-05T05:52:07.122307+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/NEECP6LTOLCXUGZRVUSGA5YDCZ","json":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ.json","graph_json":"https://pith.science/api/pith-number/NEECP6LTOLCXUGZRVUSGA5YDCZ/graph.json","events_json":"https://pith.science/api/pith-number/NEECP6LTOLCXUGZRVUSGA5YDCZ/events.json","paper":"https://pith.science/paper/NEECP6LT"},"agent_actions":{"view_html":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ","download_json":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ.json","view_paper":"https://pith.science/paper/NEECP6LT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12381&json=true","fetch_graph":"https://pith.science/api/pith-number/NEECP6LTOLCXUGZRVUSGA5YDCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NEECP6LTOLCXUGZRVUSGA5YDCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/action/storage_attestation","attest_author":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/action/author_attestation","sign_citation":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/action/citation_signature","submit_replication":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/action/replication_record"}},"created_at":"2026-07-05T05:52:07.122307+00:00","updated_at":"2026-07-05T05:52:07.122307+00:00"}