{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DFOIZQ3KJBRJG6D36VUNA4OCFU","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":"14ad220945a36bad8ccbd7cb990d6f1507cc2b74d80f503d436e4a0a8b11f9ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T09:44:54Z","title_canon_sha256":"123a089c39f7ab7bec516238c4e5bd0198f9969f5ea8bb6f4de5f0295485017f"},"schema_version":"1.0","source":{"id":"2410.02336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.02336","created_at":"2026-07-05T09:15:19Z"},{"alias_kind":"arxiv_version","alias_value":"2410.02336v1","created_at":"2026-07-05T09:15:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02336","created_at":"2026-07-05T09:15:19Z"},{"alias_kind":"pith_short_12","alias_value":"DFOIZQ3KJBRJ","created_at":"2026-07-05T09:15:19Z"},{"alias_kind":"pith_short_16","alias_value":"DFOIZQ3KJBRJG6D3","created_at":"2026-07-05T09:15:19Z"},{"alias_kind":"pith_short_8","alias_value":"DFOIZQ3K","created_at":"2026-07-05T09:15:19Z"}],"graph_snapshots":[{"event_id":"sha256:638232d0020986b7b3575686893e8ef9575a9ac9597ff98f4a9fb625b9c18f25","target":"graph","created_at":"2026-07-05T09:15:19Z","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/2410.02336/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A strong odd coloring of a simple graph $G$ is a proper coloring of the vertices of $G$ such that for every vertex $v$ and every color $c$, either $c$ is used an odd number of times in the open neighborhood $N_G(v)$ or no neighbor of $v$ is colored by $c$. The smallest integer $k$ for which $G$ admits a strong odd coloring with $k$ colors is the strong odd chromatic number, $\\chi_{soc}(G)$. These coloring notion and graph parameter were recently defined in [H. Kwon and B. Park, Strong odd coloring of sparse graphs, ArXiv:2401.11653v2]. We answer a question raised by the originators concerning ","authors_text":"Mirko Petru\\v{s}evski, Riste \\v{S}krekovski, Yair Caro, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T09:44:54Z","title":"On strong odd colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02336","kind":"arxiv","version":1},"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:0682656ecf78c4aad3a7657b1ebd38dcdd1676e5ace9acc7f75ed7be356cf385","target":"record","created_at":"2026-07-05T09:15:19Z","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":"14ad220945a36bad8ccbd7cb990d6f1507cc2b74d80f503d436e4a0a8b11f9ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T09:44:54Z","title_canon_sha256":"123a089c39f7ab7bec516238c4e5bd0198f9969f5ea8bb6f4de5f0295485017f"},"schema_version":"1.0","source":{"id":"2410.02336","kind":"arxiv","version":1}},"canonical_sha256":"195c8cc36a486293787bf568d071c22d00a49ecdbbae32fa2fadf67b75bef507","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"195c8cc36a486293787bf568d071c22d00a49ecdbbae32fa2fadf67b75bef507","first_computed_at":"2026-07-05T09:15:19.449180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:15:19.449180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gVJ+Wpzx2L7iC8DuPB94cnQU3wqbOUEVGmp6akhQ0OUoKHXSC79NMIr7NYnzLuHPugOYeAbh4xJeB7EZjuFjAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:15:19.449702Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.02336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0682656ecf78c4aad3a7657b1ebd38dcdd1676e5ace9acc7f75ed7be356cf385","sha256:638232d0020986b7b3575686893e8ef9575a9ac9597ff98f4a9fb625b9c18f25"],"state_sha256":"df4aeaa123596181a6802be7d0d6d1a7e58342d1c8dd4d2649d86d172734a63c"}