{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:L6RATBITUZRPVNSUDGLA2FLR7D","short_pith_number":"pith:L6RATBIT","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"},"canonical_sha256":"5fa2098513a662fab65419960d1571f8fe6469f784d4bdfaa8edd0b2c27e075a","source":{"kind":"arxiv","id":"2112.13710","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.13710","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"2112.13710v3","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13710","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"L6RATBITUZRP","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"pith_short_16","alias_value":"L6RATBITUZRPVNSU","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"pith_short_8","alias_value":"L6RATBIT","created_at":"2026-07-05T04:36:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:L6RATBITUZRPVNSUDGLA2FLR7D","target":"record","payload":{"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"},"canonical_sha256":"5fa2098513a662fab65419960d1571f8fe6469f784d4bdfaa8edd0b2c27e075a","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"},"source_kind":"arxiv","source_id":"2112.13710","source_version":3,"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-05T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdcSwgswVNxWgpHXAPmq+alltK/iGGSCm/vbOd2fYvrFXEredRAi3Ie7bEGbAVI61Ly7gHquGHM0mUS3rLwVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:53:22.639828Z"},"content_sha256":"b2c06b73ceaeacfffd5d8e44e0b425a4a368d743961666a16adf0ea7574fd8e6","schema_version":"1.0","event_id":"sha256:b2c06b73ceaeacfffd5d8e44e0b425a4a368d743961666a16adf0ea7574fd8e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:L6RATBITUZRPVNSUDGLA2FLR7D","target":"graph","payload":{"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"},"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-05T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhLuGY1a7XtCDUSYvSgqKapNI0fPXtoBxNieF/cCyy676er4hzsvR4Z90xKPCeu2FKov/XecDfwmQiHCtH1CAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:53:22.640327Z"},"content_sha256":"95774a37e963fb3526e5aa690411d53cb6e53720bcd6c6d356f6ec68d20da83a","schema_version":"1.0","event_id":"sha256:95774a37e963fb3526e5aa690411d53cb6e53720bcd6c6d356f6ec68d20da83a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/bundle.json","state_url":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6RATBITUZRPVNSUDGLA2FLR7D/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-08T13:53:22Z","links":{"resolver":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D","bundle":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/bundle.json","state":"https://pith.science/pith/L6RATBITUZRPVNSUDGLA2FLR7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6RATBITUZRPVNSUDGLA2FLR7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:L6RATBITUZRPVNSUDGLA2FLR7D","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":"81870da88baa6a56121e51d26d799aecaa34911d002e95ff91757a1ac21f4e10","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-27T14:34:29Z","title_canon_sha256":"ec4ac118c3026e5de0473adecf104e4e152aa75bc034da1122e3f06ef0d756d3"},"schema_version":"1.0","source":{"id":"2112.13710","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.13710","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"2112.13710v3","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13710","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"L6RATBITUZRP","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"pith_short_16","alias_value":"L6RATBITUZRPVNSU","created_at":"2026-07-05T04:36:09Z"},{"alias_kind":"pith_short_8","alias_value":"L6RATBIT","created_at":"2026-07-05T04:36:09Z"}],"graph_snapshots":[{"event_id":"sha256:95774a37e963fb3526e5aa690411d53cb6e53720bcd6c6d356f6ec68d20da83a","target":"graph","created_at":"2026-07-05T04:36:09Z","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/2112.13710/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Mirko Petru\\v{s}evski, Riste \\v{S}krekovski","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-27T14:34:29Z","title":"Colorings with neighborhood parity condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13710","kind":"arxiv","version":3},"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:b2c06b73ceaeacfffd5d8e44e0b425a4a368d743961666a16adf0ea7574fd8e6","target":"record","created_at":"2026-07-05T04:36:09Z","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":"81870da88baa6a56121e51d26d799aecaa34911d002e95ff91757a1ac21f4e10","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-27T14:34:29Z","title_canon_sha256":"ec4ac118c3026e5de0473adecf104e4e152aa75bc034da1122e3f06ef0d756d3"},"schema_version":"1.0","source":{"id":"2112.13710","kind":"arxiv","version":3}},"canonical_sha256":"5fa2098513a662fab65419960d1571f8fe6469f784d4bdfaa8edd0b2c27e075a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fa2098513a662fab65419960d1571f8fe6469f784d4bdfaa8edd0b2c27e075a","first_computed_at":"2026-07-05T04:36:09.340954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:36:09.340954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"62UDKAXMs0pH5MIVvVgezyTMLDOLfX5zoCX+yBJKJB5eAGQTVSTpIYvh02ZK8eMMNBhAv/9UuzE+ebR8rmfrBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:36:09.341508Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.13710","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2c06b73ceaeacfffd5d8e44e0b425a4a368d743961666a16adf0ea7574fd8e6","sha256:95774a37e963fb3526e5aa690411d53cb6e53720bcd6c6d356f6ec68d20da83a"],"state_sha256":"8f45a5ee9539ac3914398288e7c187ac120b5149417495ef38bda019f69904a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lfIf/j7cAC0UK8TTMLfidmoubiqoGidcPOYepM6VUAtZp14ArgLrEHskmkUP9+XSZWjwx5GhxS8xEyS1kUtjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:53:22.643889Z","bundle_sha256":"b9cbbb7c2bd9b02a442378e191d14779fc03ee6d5120860cec2b02721974a8b4"}}