{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:NEECP6LTOLCXUGZRVUSGA5YDCZ","short_pith_number":"pith:NEECP6LT","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"},"canonical_sha256":"690827f97372c57a1b31ad2460770316507799d84b2a06b40a7b7e658f0ee004","source":{"kind":"arxiv","id":"2201.12381","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12381","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12381v2","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12381","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"NEECP6LTOLCX","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"pith_short_16","alias_value":"NEECP6LTOLCXUGZR","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"pith_short_8","alias_value":"NEECP6LT","created_at":"2026-07-05T05:52:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:NEECP6LTOLCXUGZRVUSGA5YDCZ","target":"record","payload":{"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"},"canonical_sha256":"690827f97372c57a1b31ad2460770316507799d84b2a06b40a7b7e658f0ee004","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"},"source_kind":"arxiv","source_id":"2201.12381","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2makJRDtBPbHoCWJURFYwqcLUKDCWzV38Q/i4WDKlmdUtsoz5PFhy847PowgMmOl0LzOaF0if4PTxoNrwbb8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:44:45.410095Z"},"content_sha256":"460aed5dc1e288b5841a9f24078bd68941e9d8eb4aa5be52fea528fcb1bb0a97","schema_version":"1.0","event_id":"sha256:460aed5dc1e288b5841a9f24078bd68941e9d8eb4aa5be52fea528fcb1bb0a97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:NEECP6LTOLCXUGZRVUSGA5YDCZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEt+QaY4+RKFVm7wuIyS9BAE9NqmLRTN7/E7eDoXtkBBsR4h27UWzQGPXnWNUlGGdj9SaCmwk9vIQSwWOQhGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:44:45.411154Z"},"content_sha256":"a55a743fd434d28c91794f708131a0e5de05b06d4c36fbc6c79e5db9f1f1dba9","schema_version":"1.0","event_id":"sha256:a55a743fd434d28c91794f708131a0e5de05b06d4c36fbc6c79e5db9f1f1dba9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/bundle.json","state_url":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T16:44:45Z","links":{"resolver":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ","bundle":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/bundle.json","state":"https://pith.science/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEECP6LTOLCXUGZRVUSGA5YDCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NEECP6LTOLCXUGZRVUSGA5YDCZ","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":"05d2fb27ce19a87c77c4d53cbf47d69225e372bfb8f71d86650dedb417f5ef1d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-01-28T19:22:20Z","title_canon_sha256":"b330a12976e83af60caa67cbf2fea8de670f1bc1a0ddd5026402a12c56b348de"},"schema_version":"1.0","source":{"id":"2201.12381","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12381","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12381v2","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12381","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"NEECP6LTOLCX","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"pith_short_16","alias_value":"NEECP6LTOLCXUGZR","created_at":"2026-07-05T05:52:07Z"},{"alias_kind":"pith_short_8","alias_value":"NEECP6LT","created_at":"2026-07-05T05:52:07Z"}],"graph_snapshots":[{"event_id":"sha256:a55a743fd434d28c91794f708131a0e5de05b06d4c36fbc6c79e5db9f1f1dba9","target":"graph","created_at":"2026-07-05T05:52:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.12381/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Jan Petr, Julien Portier","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-01-28T19:22:20Z","title":"The odd chromatic number of a planar graph is at most 8"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12381","kind":"arxiv","version":2},"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:460aed5dc1e288b5841a9f24078bd68941e9d8eb4aa5be52fea528fcb1bb0a97","target":"record","created_at":"2026-07-05T05:52:07Z","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":"05d2fb27ce19a87c77c4d53cbf47d69225e372bfb8f71d86650dedb417f5ef1d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-01-28T19:22:20Z","title_canon_sha256":"b330a12976e83af60caa67cbf2fea8de670f1bc1a0ddd5026402a12c56b348de"},"schema_version":"1.0","source":{"id":"2201.12381","kind":"arxiv","version":2}},"canonical_sha256":"690827f97372c57a1b31ad2460770316507799d84b2a06b40a7b7e658f0ee004","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"690827f97372c57a1b31ad2460770316507799d84b2a06b40a7b7e658f0ee004","first_computed_at":"2026-07-05T05:52:07.122246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:52:07.122246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2IqBKmEPaMFHoACTLDKNtNXvaZg9ibT/LbVcBCyrBux20tspLttz/KvlZkJlvhC8+a7fKjDHY1ZDhv1HSRLxAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:52:07.122678Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12381","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:460aed5dc1e288b5841a9f24078bd68941e9d8eb4aa5be52fea528fcb1bb0a97","sha256:a55a743fd434d28c91794f708131a0e5de05b06d4c36fbc6c79e5db9f1f1dba9"],"state_sha256":"ea1d499f2a9409b1550deaa1a402db3cfe7336b8aac21380e3dbde34c81dfd39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgDp9idwOcJczbYE2r37+TtZdEwXMfjXcvFXBIigKOxzJyovJfolgZwH9rUof1WMp6bqq+wv8T6cUjoDeMOBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T16:44:45.417556Z","bundle_sha256":"50b54b12bf1e4b6b47bf8f28f5368b0edd355ade9a3395e7b3e306de6629dc23"}}