{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ABMBP6JKHCSQI62B4FX5NHGSDK","short_pith_number":"pith:ABMBP6JK","canonical_record":{"source":{"id":"1304.0166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-31T08:56:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"907240edeb3c805b64c08dd2fbfbc17434c27dacca03d0a9ca21ba5a83d4d8a9","abstract_canon_sha256":"be61bbc378c832f20333ce8c70623301d9db9284e957ff002e2fadc797b0fe2b"},"schema_version":"1.0"},"canonical_sha256":"005817f92a38a5047b41e16fd69cd21aae0ae7dadd2663ddc52bde4ed99b7155","source":{"kind":"arxiv","id":"1304.0166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0166","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0166v1","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0166","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"ABMBP6JKHCSQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABMBP6JKHCSQI62B","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABMBP6JK","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ABMBP6JKHCSQI62B4FX5NHGSDK","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-31T08:56:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"907240edeb3c805b64c08dd2fbfbc17434c27dacca03d0a9ca21ba5a83d4d8a9","abstract_canon_sha256":"be61bbc378c832f20333ce8c70623301d9db9284e957ff002e2fadc797b0fe2b"},"schema_version":"1.0"},"canonical_sha256":"005817f92a38a5047b41e16fd69cd21aae0ae7dadd2663ddc52bde4ed99b7155","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:05.254134Z","signature_b64":"M/8K5lWTJZe+16vbAihj327cyHU6/GUGK+FmcyxXkI8ggHoPlKNLlZsKa1GA9YS2HVn/8+J3E3ITdbmKf3dzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"005817f92a38a5047b41e16fd69cd21aae0ae7dadd2663ddc52bde4ed99b7155","last_reissued_at":"2026-05-18T03:22:05.253525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:05.253525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0166","source_version":1,"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-05-18T03:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RlBLxbk3gtLqyeUT/khGyQ9r0MOfaynFtBIg/UTX7xQMcFick3WIScaXWsrLsuqN2CYZzljMSluz1/wkh2tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:17:49.428466Z"},"content_sha256":"485fd7dce399c5879a2e14841e115c91347f3f82b5e2f1472d230011cabcafe4","schema_version":"1.0","event_id":"sha256:485fd7dce399c5879a2e14841e115c91347f3f82b5e2f1472d230011cabcafe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ABMBP6JKHCSQI62B4FX5NHGSDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incidence coloring game and arboricity of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Cl\\'ement Charpentier (LaBRI), Eric Sopena (LaBRI)","submitted_at":"2013-03-31T08:56:24Z","abstract_excerpt":"An incidence of a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ an edge incident to $v$. Two incidences $(v,e)$ and $(w,f)$ are adjacent whenever $v = w$, or $e = f$, or $vw = e$ or $f$. The incidence coloring game [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 1980-1987] is a variation of the ordinary coloring game where the two players, Alice and Bob, alternately color the incidences of a graph, using a given number of colors, in such a way that adjacent incidences get distinct colors. If the whole graph is colored then Alice wins the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0166","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":""},"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-05-18T03:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9omIfmauEGUOIgkLH1ri/RQ01HTod6ZcLRFFUke3zm2SH6LK4iCXhacM3dOFGUVOweV0y4v28irbGoLHNEIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:17:49.428817Z"},"content_sha256":"4970edc7e81ab0cb03d889918da9c7b1b9ac6b55c608057ee46917988e80b4d1","schema_version":"1.0","event_id":"sha256:4970edc7e81ab0cb03d889918da9c7b1b9ac6b55c608057ee46917988e80b4d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/bundle.json","state_url":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/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-06-05T13:17:49Z","links":{"resolver":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK","bundle":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/bundle.json","state":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ABMBP6JKHCSQI62B4FX5NHGSDK","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":"be61bbc378c832f20333ce8c70623301d9db9284e957ff002e2fadc797b0fe2b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-31T08:56:24Z","title_canon_sha256":"907240edeb3c805b64c08dd2fbfbc17434c27dacca03d0a9ca21ba5a83d4d8a9"},"schema_version":"1.0","source":{"id":"1304.0166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0166","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0166v1","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0166","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"ABMBP6JKHCSQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABMBP6JKHCSQI62B","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABMBP6JK","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:4970edc7e81ab0cb03d889918da9c7b1b9ac6b55c608057ee46917988e80b4d1","target":"graph","created_at":"2026-05-18T03:22:05Z","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"},"paper":{"abstract_excerpt":"An incidence of a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ an edge incident to $v$. Two incidences $(v,e)$ and $(w,f)$ are adjacent whenever $v = w$, or $e = f$, or $vw = e$ or $f$. The incidence coloring game [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 1980-1987] is a variation of the ordinary coloring game where the two players, Alice and Bob, alternately color the incidences of a graph, using a given number of colors, in such a way that adjacent incidences get distinct colors. If the whole graph is colored then Alice wins the g","authors_text":"Cl\\'ement Charpentier (LaBRI), Eric Sopena (LaBRI)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-31T08:56:24Z","title":"Incidence coloring game and arboricity of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0166","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:485fd7dce399c5879a2e14841e115c91347f3f82b5e2f1472d230011cabcafe4","target":"record","created_at":"2026-05-18T03:22:05Z","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":"be61bbc378c832f20333ce8c70623301d9db9284e957ff002e2fadc797b0fe2b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-31T08:56:24Z","title_canon_sha256":"907240edeb3c805b64c08dd2fbfbc17434c27dacca03d0a9ca21ba5a83d4d8a9"},"schema_version":"1.0","source":{"id":"1304.0166","kind":"arxiv","version":1}},"canonical_sha256":"005817f92a38a5047b41e16fd69cd21aae0ae7dadd2663ddc52bde4ed99b7155","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"005817f92a38a5047b41e16fd69cd21aae0ae7dadd2663ddc52bde4ed99b7155","first_computed_at":"2026-05-18T03:22:05.253525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:05.253525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M/8K5lWTJZe+16vbAihj327cyHU6/GUGK+FmcyxXkI8ggHoPlKNLlZsKa1GA9YS2HVn/8+J3E3ITdbmKf3dzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:05.254134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:485fd7dce399c5879a2e14841e115c91347f3f82b5e2f1472d230011cabcafe4","sha256:4970edc7e81ab0cb03d889918da9c7b1b9ac6b55c608057ee46917988e80b4d1"],"state_sha256":"2e881c0715e0d9732b6b80546a43de0f71c8b5ff19a39a06114b8897685b6aa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twPHyp4SKWwsCwLNKJjU8IDP+BWc4OLE0yEMe3bTdL+CX/Ba7ONstQ3cd2y62gA9WyMx3u1vear3N/WWMYOqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:17:49.430788Z","bundle_sha256":"4c28849074243f24c3f5783c49786284acd3bfc9584cdfef2d855cdd340a5412"}}