{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:L6RATBITUZRPVNSUDGLA2FLR7D","short_pith_number":"pith:L6RATBIT","schema_version":"1.0","canonical_sha256":"5fa2098513a662fab65419960d1571f8fe6469f784d4bdfaa8edd0b2c27e075a","source":{"kind":"arxiv","id":"2112.13710","version":3},"attestation_state":"computed","paper":{"title":"Colorings with neighborhood parity condition","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mirko Petru\\v{s}evski, Riste \\v{S}krekovski","submitted_at":"2021-12-27T14:34:29Z","abstract_excerpt":"In this short paper, we introduce a new vertex coloring whose motivation comes from our series on odd edge-colorings of graphs. A proper vertex coloring $\\varphi$ of graph $G$ is said to be odd if for each non-isolated vertex $x\\in V(G)$ there exists a color $c$ such that $\\varphi^{-1}(c)\\cap N(x)$ is odd-sized. We prove that every simple planar graph admits an odd $9$-coloring, and conjecture that $5$ colors always suffice."},"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":"2112.13710","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-27T14:34:29Z","cross_cats_sorted":[],"title_canon_sha256":"ec4ac118c3026e5de0473adecf104e4e152aa75bc034da1122e3f06ef0d756d3","abstract_canon_sha256":"81870da88baa6a56121e51d26d799aecaa34911d002e95ff91757a1ac21f4e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:09.341508Z","signature_b64":"62UDKAXMs0pH5MIVvVgezyTMLDOLfX5zoCX+yBJKJB5eAGQTVSTpIYvh02ZK8eMMNBhAv/9UuzE+ebR8rmfrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fa2098513a662fab65419960d1571f8fe6469f784d4bdfaa8edd0b2c27e075a","last_reissued_at":"2026-07-05T04:36:09.340954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:09.340954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colorings with neighborhood parity condition","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mirko Petru\\v{s}evski, Riste \\v{S}krekovski","submitted_at":"2021-12-27T14:34:29Z","abstract_excerpt":"In this short paper, we introduce a new vertex coloring whose motivation comes from our series on odd edge-colorings of graphs. A proper vertex coloring $\\varphi$ of graph $G$ is said to be odd if for each non-isolated vertex $x\\in V(G)$ there exists a color $c$ such that $\\varphi^{-1}(c)\\cap N(x)$ is odd-sized. We prove that every simple planar graph admits an odd $9$-coloring, and conjecture that $5$ colors always suffice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13710","kind":"arxiv","version":3},"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/2112.13710/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":"2112.13710","created_at":"2026-07-05T04:36:09.341012+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.13710v3","created_at":"2026-07-05T04:36:09.341012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13710","created_at":"2026-07-05T04:36:09.341012+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6RATBITUZRP","created_at":"2026-07-05T04:36:09.341012+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6RATBITUZRPVNSU","created_at":"2026-07-05T04:36:09.341012+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6RATBIT","created_at":"2026-07-05T04:36:09.341012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.16879","citing_title":"Complexity Classification of Colouring Problems with Parity Constraints","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D","json":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D.json","graph_json":"https://pith.science/api/pith-number/L6RATBITUZRPVNSUDGLA2FLR7D/graph.json","events_json":"https://pith.science/api/pith-number/L6RATBITUZRPVNSUDGLA2FLR7D/events.json","paper":"https://pith.science/paper/L6RATBIT"},"agent_actions":{"view_html":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D","download_json":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D.json","view_paper":"https://pith.science/paper/L6RATBIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.13710&json=true","fetch_graph":"https://pith.science/api/pith-number/L6RATBITUZRPVNSUDGLA2FLR7D/graph.json","fetch_events":"https://pith.science/api/pith-number/L6RATBITUZRPVNSUDGLA2FLR7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/action/storage_attestation","attest_author":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/action/author_attestation","sign_citation":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/action/citation_signature","submit_replication":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/action/replication_record"}},"created_at":"2026-07-05T04:36:09.341012+00:00","updated_at":"2026-07-05T04:36:09.341012+00:00"}