{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UHO6GSIQJ7TXUFP66RDW2TVBBB","short_pith_number":"pith:UHO6GSIQ","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"},"canonical_sha256":"a1dde349104fe77a15fef4476d4ea10864969582d1bc15a4537efaaf4d4590f4","source":{"kind":"arxiv","id":"2401.11653","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11653","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11653v3","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11653","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"UHO6GSIQJ7TX","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"UHO6GSIQJ7TXUFP6","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"UHO6GSIQ","created_at":"2026-06-19T16:09:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UHO6GSIQJ7TXUFP66RDW2TVBBB","target":"record","payload":{"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"},"canonical_sha256":"a1dde349104fe77a15fef4476d4ea10864969582d1bc15a4537efaaf4d4590f4","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"},"source_kind":"arxiv","source_id":"2401.11653","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-06-19T16:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsDXwMOpFk44if3KQk5AJBzqMx7H6mqwzbShypAMmSUOgXRN4z/sXHOioqyWvBCofUqWcu3GsLKB+b7SGohXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:54:47.710172Z"},"content_sha256":"7e063c89208b894f91a7f907492720a798cbfb4e2111048868a1970cab069ffa","schema_version":"1.0","event_id":"sha256:7e063c89208b894f91a7f907492720a798cbfb4e2111048868a1970cab069ffa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UHO6GSIQJ7TXUFP66RDW2TVBBB","target":"graph","payload":{"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"},"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-06-19T16:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5awnvyCaXE+tJIHFzuJHR5+ppv3IoLGtsffEGQTHuQLIVAt0wxHoezso7CfiTPhp68c3by1cXT4+75iOErMOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:54:47.710682Z"},"content_sha256":"66e3ea4c8d94fe7b4980dc31074ad878d92a3e0d8e7609f0c1ac6456acce7079","schema_version":"1.0","event_id":"sha256:66e3ea4c8d94fe7b4980dc31074ad878d92a3e0d8e7609f0c1ac6456acce7079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/bundle.json","state_url":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/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-09T07:54:47Z","links":{"resolver":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB","bundle":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/bundle.json","state":"https://pith.science/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHO6GSIQJ7TXUFP66RDW2TVBBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UHO6GSIQJ7TXUFP66RDW2TVBBB","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":"8bb5954611159a4ca8314174378ed9d4b3e71b2c4239c7f2153dfc33365aa7a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-22T02:20:56Z","title_canon_sha256":"891b05384c188b16a329463d9a8afb69d11cc0a964c05548b44d3077af83f798"},"schema_version":"1.0","source":{"id":"2401.11653","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11653","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11653v3","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11653","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"UHO6GSIQJ7TX","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"UHO6GSIQJ7TXUFP6","created_at":"2026-06-19T16:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"UHO6GSIQ","created_at":"2026-06-19T16:09:45Z"}],"graph_snapshots":[{"event_id":"sha256:66e3ea4c8d94fe7b4980dc31074ad878d92a3e0d8e7609f0c1ac6456acce7079","target":"graph","created_at":"2026-06-19T16:09:45Z","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/2401.11653/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Boram Park, Hyemin Kwon","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-22T02:20:56Z","title":"Strong odd coloring of sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11653","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:7e063c89208b894f91a7f907492720a798cbfb4e2111048868a1970cab069ffa","target":"record","created_at":"2026-06-19T16:09:45Z","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":"8bb5954611159a4ca8314174378ed9d4b3e71b2c4239c7f2153dfc33365aa7a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-22T02:20:56Z","title_canon_sha256":"891b05384c188b16a329463d9a8afb69d11cc0a964c05548b44d3077af83f798"},"schema_version":"1.0","source":{"id":"2401.11653","kind":"arxiv","version":3}},"canonical_sha256":"a1dde349104fe77a15fef4476d4ea10864969582d1bc15a4537efaaf4d4590f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1dde349104fe77a15fef4476d4ea10864969582d1bc15a4537efaaf4d4590f4","first_computed_at":"2026-06-19T16:09:45.785821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:45.785821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54MhJO2cCfA+KGiWCneP0NDKwQhHI0ZeK2eSfiiVAI85UnWPU47uBOkB2OBx9Qw+iV3zzJaWvcwK79BS6gWzCA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:45.786300Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.11653","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e063c89208b894f91a7f907492720a798cbfb4e2111048868a1970cab069ffa","sha256:66e3ea4c8d94fe7b4980dc31074ad878d92a3e0d8e7609f0c1ac6456acce7079"],"state_sha256":"b0dda8569d5ec4939286e1ce7ada0817a18be65c73a9950c4943ad7bf2331610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Erj+OSsFKtvwmj+9sYQYZqOl71FUFuvYo9Q/ggJ9wgMYm1doTw2o7ARDIy2xxF42aj2ptIvvQnY0pZIdWgEmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:54:47.715823Z","bundle_sha256":"c711d1fae86541a2d6cc90bbae886ae8d93bd0813eae0caffcf882d08dd4493f"}}