{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YSLFDF2LOONMTT6HR2QTVQVF6Z","short_pith_number":"pith:YSLFDF2L","schema_version":"1.0","canonical_sha256":"c49651974b739ac9cfc78ea13ac2a5f66ddcb2c5d3c97edc260a95a916574055","source":{"kind":"arxiv","id":"1506.02576","version":3},"attestation_state":"computed","paper":{"title":"On the choosability of claw-free perfect graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Lucas Pastor, Sylvain Gravier","submitted_at":"2015-06-08T16:32:05Z","abstract_excerpt":"It has been conjectured that for every claw-free graph $G$ the choice number of $G$ is equal to its chromatic number. We focus on the special case of this conjecture where $G$ is perfect. Claw-free perfect graphs can be decomposed via clique-cutset into two special classes called elementary graphs and peculiar graphs. Based on this decomposition we prove that the conjecture holds true for every claw-free perfect graph with maximum clique size at most $4$."},"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":"1506.02576","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T16:32:05Z","cross_cats_sorted":[],"title_canon_sha256":"b01e1fa79bae047c6daa38f7ebf2828835f96c434e8a3626f7ba9e3cca9f01f0","abstract_canon_sha256":"45ef6083233ac5a6cfc2ccd4f62772d37952571a1b188d8dde5e5a194432182a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:18.276884Z","signature_b64":"VWb3lgkcvTEln9XbajrbjyLuiYMAz81rkdyItfEym3qnQwLInzan2hxcaZaFYwt6ciRpn2kI0noNjhHUV48eBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c49651974b739ac9cfc78ea13ac2a5f66ddcb2c5d3c97edc260a95a916574055","last_reissued_at":"2026-05-18T01:26:18.276038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:18.276038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the choosability of claw-free perfect graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Lucas Pastor, Sylvain Gravier","submitted_at":"2015-06-08T16:32:05Z","abstract_excerpt":"It has been conjectured that for every claw-free graph $G$ the choice number of $G$ is equal to its chromatic number. We focus on the special case of this conjecture where $G$ is perfect. Claw-free perfect graphs can be decomposed via clique-cutset into two special classes called elementary graphs and peculiar graphs. Based on this decomposition we prove that the conjecture holds true for every claw-free perfect graph with maximum clique size at most $4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02576","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":"1506.02576","created_at":"2026-05-18T01:26:18.276184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02576v3","created_at":"2026-05-18T01:26:18.276184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02576","created_at":"2026-05-18T01:26:18.276184+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSLFDF2LOONM","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSLFDF2LOONMTT6H","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSLFDF2L","created_at":"2026-05-18T12:29:52.810259+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/YSLFDF2LOONMTT6HR2QTVQVF6Z","json":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z.json","graph_json":"https://pith.science/api/pith-number/YSLFDF2LOONMTT6HR2QTVQVF6Z/graph.json","events_json":"https://pith.science/api/pith-number/YSLFDF2LOONMTT6HR2QTVQVF6Z/events.json","paper":"https://pith.science/paper/YSLFDF2L"},"agent_actions":{"view_html":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z","download_json":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z.json","view_paper":"https://pith.science/paper/YSLFDF2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02576&json=true","fetch_graph":"https://pith.science/api/pith-number/YSLFDF2LOONMTT6HR2QTVQVF6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/YSLFDF2LOONMTT6HR2QTVQVF6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z/action/storage_attestation","attest_author":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z/action/author_attestation","sign_citation":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z/action/citation_signature","submit_replication":"https://pith.science/pith/YSLFDF2LOONMTT6HR2QTVQVF6Z/action/replication_record"}},"created_at":"2026-05-18T01:26:18.276184+00:00","updated_at":"2026-05-18T01:26:18.276184+00:00"}