{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5MIUBLOMCZFVTIUMTTTZ7OE4ZE","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":"2687ed780ebd199f4babbc55fefa40ef05306f130e240fc25817016a26f53f1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-10T18:49:05Z","title_canon_sha256":"4c49feacb090fc8f09c5226b5b8ffea9493a39045741c2a94db9ef96779f2ab2"},"schema_version":"1.0","source":{"id":"1403.2339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2339","created_at":"2026-05-18T02:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2339v1","created_at":"2026-05-18T02:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2339","created_at":"2026-05-18T02:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"5MIUBLOMCZFV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5MIUBLOMCZFVTIUM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5MIUBLOM","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:35b7864cf6c989135e5897ca28ce350410c65383f0eda2fe707ba6588879e362","target":"graph","created_at":"2026-05-18T02:56:44Z","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":"A graph $G$ is free $(a,b)$-choosable if for any vertex $v$ with $b$ colors assigned and for any list of colors of size $a$ associated with each vertex $u\\ne v$, the coloring can be completed by choosing for $u$ a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. In this note, a necessary and sufficient condition for a cycle to be free $(a,b)$-choosable is given. As a corollary, some choosability results are derived for graphs in which cycles are connected by a tree structure.","authors_text":"I2M), Jean-Christophe Godin (IMATH), Olivier Togni (Le2i), Yves Aubry (IMATH","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-10T18:49:05Z","title":"Free choosability of the cycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2339","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:bf03d913e205e9c4db0e06d09eeb603ae59de03e2073dea2bebf07ef6248c328","target":"record","created_at":"2026-05-18T02:56:44Z","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":"2687ed780ebd199f4babbc55fefa40ef05306f130e240fc25817016a26f53f1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-10T18:49:05Z","title_canon_sha256":"4c49feacb090fc8f09c5226b5b8ffea9493a39045741c2a94db9ef96779f2ab2"},"schema_version":"1.0","source":{"id":"1403.2339","kind":"arxiv","version":1}},"canonical_sha256":"eb1140adcc164b59a28c9ce79fb89cc935dc49b5c747a46202d6d935f5c305c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb1140adcc164b59a28c9ce79fb89cc935dc49b5c747a46202d6d935f5c305c8","first_computed_at":"2026-05-18T02:56:44.794359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:44.794359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ClXKtrOvz82vXYRcSn7oqY1Wv8tnE24Y6wBETxRCcz/OEtWHplVVQaEZADg2c6zlYmDyA7K805vWOW2g1szqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:44.794913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf03d913e205e9c4db0e06d09eeb603ae59de03e2073dea2bebf07ef6248c328","sha256:35b7864cf6c989135e5897ca28ce350410c65383f0eda2fe707ba6588879e362"],"state_sha256":"a2bad8567d4c96aed8ed7b65bf15d77f5ae04aaf05936e4f87d8d0e802add26e"}