{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7JAJ2OMFM6WQJ46GBZIMYTXLVL","short_pith_number":"pith:7JAJ2OMF","schema_version":"1.0","canonical_sha256":"fa409d398567ad04f3c60e50cc4eebaade36e544fba0030dc3443a2fa3a9c4b3","source":{"kind":"arxiv","id":"1005.5602","version":3},"attestation_state":"computed","paper":{"title":"Choosability of a weighted path and free-choosability of a cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Christophe Godin (IML), Olivier Togni (Le2i), Yves Aubry (IML)","submitted_at":"2010-05-31T06:57:30Z","abstract_excerpt":"A graph $G$ with a list of colors $L(v)$ and weight $w(v)$ for each vertex $v$ is $(L,w)$-colorable if one can choose a subset of $w(v)$ colors from $L(v)$ for each vertex $v$, such that adjacent vertices receive disjoint color sets. In this paper, we give necessary and sufficient conditions for a weighted path to be $(L,w)$-colorable for some list assignments $L$. Furthermore, we solve the problem of the free-choosability of a cycle."},"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":"1005.5602","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-31T06:57:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c9c54631bf216650978c9de92febe66c3901c9d038d8b5c62b9d393136c7868a","abstract_canon_sha256":"06f1c9a270ca7f1b1b045d2e11360c3740fd7e867d5a386b9d01120583b1777c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:02.402103Z","signature_b64":"HQTCTAf+9RfhF0/hkuzabS1Um63B/510TttHekWWRXNrpqd1HUPy8TKqnKrOQlm4Y6J/r8CNVjkGSO8dPUsmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa409d398567ad04f3c60e50cc4eebaade36e544fba0030dc3443a2fa3a9c4b3","last_reissued_at":"2026-05-18T04:22:02.401491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:02.401491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Choosability of a weighted path and free-choosability of a cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Christophe Godin (IML), Olivier Togni (Le2i), Yves Aubry (IML)","submitted_at":"2010-05-31T06:57:30Z","abstract_excerpt":"A graph $G$ with a list of colors $L(v)$ and weight $w(v)$ for each vertex $v$ is $(L,w)$-colorable if one can choose a subset of $w(v)$ colors from $L(v)$ for each vertex $v$, such that adjacent vertices receive disjoint color sets. In this paper, we give necessary and sufficient conditions for a weighted path to be $(L,w)$-colorable for some list assignments $L$. Furthermore, we solve the problem of the free-choosability of a cycle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5602","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":""},"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":"1005.5602","created_at":"2026-05-18T04:22:02.401597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.5602v3","created_at":"2026-05-18T04:22:02.401597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5602","created_at":"2026-05-18T04:22:02.401597+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JAJ2OMFM6WQ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JAJ2OMFM6WQJ46G","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JAJ2OMF","created_at":"2026-05-18T12:26:04.259169+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/7JAJ2OMFM6WQJ46GBZIMYTXLVL","json":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL.json","graph_json":"https://pith.science/api/pith-number/7JAJ2OMFM6WQJ46GBZIMYTXLVL/graph.json","events_json":"https://pith.science/api/pith-number/7JAJ2OMFM6WQJ46GBZIMYTXLVL/events.json","paper":"https://pith.science/paper/7JAJ2OMF"},"agent_actions":{"view_html":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL","download_json":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL.json","view_paper":"https://pith.science/paper/7JAJ2OMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.5602&json=true","fetch_graph":"https://pith.science/api/pith-number/7JAJ2OMFM6WQJ46GBZIMYTXLVL/graph.json","fetch_events":"https://pith.science/api/pith-number/7JAJ2OMFM6WQJ46GBZIMYTXLVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL/action/storage_attestation","attest_author":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL/action/author_attestation","sign_citation":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL/action/citation_signature","submit_replication":"https://pith.science/pith/7JAJ2OMFM6WQJ46GBZIMYTXLVL/action/replication_record"}},"created_at":"2026-05-18T04:22:02.401597+00:00","updated_at":"2026-05-18T04:22:02.401597+00:00"}