{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UHO6GSIQJ7TXUFP66RDW2TVBBB","short_pith_number":"pith:UHO6GSIQ","schema_version":"1.0","canonical_sha256":"a1dde349104fe77a15fef4476d4ea10864969582d1bc15a4537efaaf4d4590f4","source":{"kind":"arxiv","id":"2401.11653","version":3},"attestation_state":"computed","paper":{"title":"Strong odd coloring of sparse graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Hyemin Kwon","submitted_at":"2024-01-22T02:20:56Z","abstract_excerpt":"An odd coloring of a graph $G$ is a proper coloring of $G$ such that for every non-isolated vertex $v$, there is a color appearing an odd number of times in $N_G(v)$. Odd coloring of graphs was studied intensively in recent few years. In this paper, we introduce the notion of a strong odd coloring, as not only a strengthened version of odd coloring, but also a relaxation of square coloring. A strong odd coloring of a graph $G$ is a proper coloring of $G$ such that for every non-isolated vertex $v$, if a color appears in $N_G(v)$, then it appears an odd number of times in $N_G(v)$. We denote by"},"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":"2401.11653","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-22T02:20:56Z","cross_cats_sorted":[],"title_canon_sha256":"891b05384c188b16a329463d9a8afb69d11cc0a964c05548b44d3077af83f798","abstract_canon_sha256":"8bb5954611159a4ca8314174378ed9d4b3e71b2c4239c7f2153dfc33365aa7a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:45.786300Z","signature_b64":"54MhJO2cCfA+KGiWCneP0NDKwQhHI0ZeK2eSfiiVAI85UnWPU47uBOkB2OBx9Qw+iV3zzJaWvcwK79BS6gWzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1dde349104fe77a15fef4476d4ea10864969582d1bc15a4537efaaf4d4590f4","last_reissued_at":"2026-06-19T16:09:45.785821Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:45.785821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong odd coloring of sparse graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Hyemin Kwon","submitted_at":"2024-01-22T02:20:56Z","abstract_excerpt":"An odd coloring of a graph $G$ is a proper coloring of $G$ such that for every non-isolated vertex $v$, there is a color appearing an odd number of times in $N_G(v)$. Odd coloring of graphs was studied intensively in recent few years. In this paper, we introduce the notion of a strong odd coloring, as not only a strengthened version of odd coloring, but also a relaxation of square coloring. A strong odd coloring of a graph $G$ is a proper coloring of $G$ such that for every non-isolated vertex $v$, if a color appears in $N_G(v)$, then it appears an odd number of times in $N_G(v)$. We denote by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11653","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/2401.11653/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":"2401.11653","created_at":"2026-06-19T16:09:45.785877+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11653v3","created_at":"2026-06-19T16:09:45.785877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11653","created_at":"2026-06-19T16:09:45.785877+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHO6GSIQJ7TX","created_at":"2026-06-19T16:09:45.785877+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHO6GSIQJ7TXUFP6","created_at":"2026-06-19T16:09:45.785877+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHO6GSIQ","created_at":"2026-06-19T16:09:45.785877+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":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB","json":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB.json","graph_json":"https://pith.science/api/pith-number/UHO6GSIQJ7TXUFP66RDW2TVBBB/graph.json","events_json":"https://pith.science/api/pith-number/UHO6GSIQJ7TXUFP66RDW2TVBBB/events.json","paper":"https://pith.science/paper/UHO6GSIQ"},"agent_actions":{"view_html":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB","download_json":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB.json","view_paper":"https://pith.science/paper/UHO6GSIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11653&json=true","fetch_graph":"https://pith.science/api/pith-number/UHO6GSIQJ7TXUFP66RDW2TVBBB/graph.json","fetch_events":"https://pith.science/api/pith-number/UHO6GSIQJ7TXUFP66RDW2TVBBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/action/storage_attestation","attest_author":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/action/author_attestation","sign_citation":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/action/citation_signature","submit_replication":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/action/replication_record"}},"created_at":"2026-06-19T16:09:45.785877+00:00","updated_at":"2026-06-19T16:09:45.785877+00:00"}