{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ABMBP6JKHCSQI62B4FX5NHGSDK","short_pith_number":"pith:ABMBP6JK","schema_version":"1.0","canonical_sha256":"005817f92a38a5047b41e16fd69cd21aae0ae7dadd2663ddc52bde4ed99b7155","source":{"kind":"arxiv","id":"1304.0166","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.0166","created_at":"2026-05-18T03:22:05.253622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0166v1","created_at":"2026-05-18T03:22:05.253622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0166","created_at":"2026-05-18T03:22:05.253622+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABMBP6JKHCSQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABMBP6JKHCSQI62B","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABMBP6JK","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK","json":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK.json","graph_json":"https://pith.science/api/pith-number/ABMBP6JKHCSQI62B4FX5NHGSDK/graph.json","events_json":"https://pith.science/api/pith-number/ABMBP6JKHCSQI62B4FX5NHGSDK/events.json","paper":"https://pith.science/paper/ABMBP6JK"},"agent_actions":{"view_html":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK","download_json":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK.json","view_paper":"https://pith.science/paper/ABMBP6JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0166&json=true","fetch_graph":"https://pith.science/api/pith-number/ABMBP6JKHCSQI62B4FX5NHGSDK/graph.json","fetch_events":"https://pith.science/api/pith-number/ABMBP6JKHCSQI62B4FX5NHGSDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/action/storage_attestation","attest_author":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/action/author_attestation","sign_citation":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/action/citation_signature","submit_replication":"https://pith.science/pith/ABMBP6JKHCSQI62B4FX5NHGSDK/action/replication_record"}},"created_at":"2026-05-18T03:22:05.253622+00:00","updated_at":"2026-05-18T03:22:05.253622+00:00"}