{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DFOIZQ3KJBRJG6D36VUNA4OCFU","short_pith_number":"pith:DFOIZQ3K","schema_version":"1.0","canonical_sha256":"195c8cc36a486293787bf568d071c22d00a49ecdbbae32fa2fadf67b75bef507","source":{"kind":"arxiv","id":"2410.02336","version":1},"attestation_state":"computed","paper":{"title":"On strong odd colorings of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mirko Petru\\v{s}evski, Riste \\v{S}krekovski, Yair Caro, Zsolt Tuza","submitted_at":"2024-10-03T09:44:54Z","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 "},"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":"2410.02336","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-03T09:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"123a089c39f7ab7bec516238c4e5bd0198f9969f5ea8bb6f4de5f0295485017f","abstract_canon_sha256":"14ad220945a36bad8ccbd7cb990d6f1507cc2b74d80f503d436e4a0a8b11f9ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:19.449702Z","signature_b64":"gVJ+Wpzx2L7iC8DuPB94cnQU3wqbOUEVGmp6akhQ0OUoKHXSC79NMIr7NYnzLuHPugOYeAbh4xJeB7EZjuFjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"195c8cc36a486293787bf568d071c22d00a49ecdbbae32fa2fadf67b75bef507","last_reissued_at":"2026-07-05T09:15:19.449180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:19.449180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On strong odd colorings of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mirko Petru\\v{s}evski, Riste \\v{S}krekovski, Yair Caro, Zsolt Tuza","submitted_at":"2024-10-03T09:44:54Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02336","kind":"arxiv","version":1},"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/2410.02336/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":"2410.02336","created_at":"2026-07-05T09:15:19.449229+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.02336v1","created_at":"2026-07-05T09:15:19.449229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02336","created_at":"2026-07-05T09:15:19.449229+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFOIZQ3KJBRJ","created_at":"2026-07-05T09:15:19.449229+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFOIZQ3KJBRJG6D3","created_at":"2026-07-05T09:15:19.449229+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFOIZQ3K","created_at":"2026-07-05T09:15:19.449229+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15288","citing_title":"Strong odd colorings in graph classes of bounded expansion","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU","json":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU.json","graph_json":"https://pith.science/api/pith-number/DFOIZQ3KJBRJG6D36VUNA4OCFU/graph.json","events_json":"https://pith.science/api/pith-number/DFOIZQ3KJBRJG6D36VUNA4OCFU/events.json","paper":"https://pith.science/paper/DFOIZQ3K"},"agent_actions":{"view_html":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU","download_json":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU.json","view_paper":"https://pith.science/paper/DFOIZQ3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.02336&json=true","fetch_graph":"https://pith.science/api/pith-number/DFOIZQ3KJBRJG6D36VUNA4OCFU/graph.json","fetch_events":"https://pith.science/api/pith-number/DFOIZQ3KJBRJG6D36VUNA4OCFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU/action/storage_attestation","attest_author":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU/action/author_attestation","sign_citation":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU/action/citation_signature","submit_replication":"https://pith.science/pith/DFOIZQ3KJBRJG6D36VUNA4OCFU/action/replication_record"}},"created_at":"2026-07-05T09:15:19.449229+00:00","updated_at":"2026-07-05T09:15:19.449229+00:00"}