{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XM5KYQWKQJ3DKZYUZXT3LKJRNM","short_pith_number":"pith:XM5KYQWK","schema_version":"1.0","canonical_sha256":"bb3aac42ca8276356714cde7b5a9316b38b01535c8e07044703b7286e4ed8df9","source":{"kind":"arxiv","id":"1309.1020","version":1},"attestation_state":"computed","paper":{"title":"On the Erd\\\"os-Lov\\'asz Tihany Conjecture for Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandra Fradkin, Maria Chudnovsky, Matthieu Plumettaz","submitted_at":"2013-09-04T13:20:09Z","abstract_excerpt":"In 1968, Erd\\\"os and Lov\\'asz conjectured that for every graph $G$ and all integers $s,t\\geq 2$ such that $s+t-1=\\chi(G) > \\omega(G)$, there exists a partition $(S,T)$ of the vertex set of $G$ such that $\\chi(G|S)\\geq s$ and $\\chi(G|T)\\geq t$. For general graphs, the only settled cases of the conjecture are when $s$ and $t$ are small. Recently, the conjecture was proved for a few special classes of graphs: graphs with stability number 2 \\cite{quasi-line}, line graphs \\cite{line} and quasi-line graphs \\cite{quasi-line}. In this paper, we consider the conjecture for claw-free graphs and present "},"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":"1309.1020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T13:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"c25b9133c3cabca07c3e661d641c080ce5b7877c61c1ad7f2d6186feffe23287","abstract_canon_sha256":"be5090d798b515be77d5cab67d0f8b3288c350592ceb6117a2fd85444fe6bcce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:09.312202Z","signature_b64":"1vSNJWYH6em31wXNTyijFvaS2TOWtz/8OtIjKchIjybYYhD+mmUA9MXxKS46CKC8dmq/1Uvrb+gGCD23eAGHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb3aac42ca8276356714cde7b5a9316b38b01535c8e07044703b7286e4ed8df9","last_reissued_at":"2026-05-18T03:14:09.311776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:09.311776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Erd\\\"os-Lov\\'asz Tihany Conjecture for Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandra Fradkin, Maria Chudnovsky, Matthieu Plumettaz","submitted_at":"2013-09-04T13:20:09Z","abstract_excerpt":"In 1968, Erd\\\"os and Lov\\'asz conjectured that for every graph $G$ and all integers $s,t\\geq 2$ such that $s+t-1=\\chi(G) > \\omega(G)$, there exists a partition $(S,T)$ of the vertex set of $G$ such that $\\chi(G|S)\\geq s$ and $\\chi(G|T)\\geq t$. For general graphs, the only settled cases of the conjecture are when $s$ and $t$ are small. Recently, the conjecture was proved for a few special classes of graphs: graphs with stability number 2 \\cite{quasi-line}, line graphs \\cite{line} and quasi-line graphs \\cite{quasi-line}. In this paper, we consider the conjecture for claw-free graphs and present "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1020","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":"1309.1020","created_at":"2026-05-18T03:14:09.311836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1020v1","created_at":"2026-05-18T03:14:09.311836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1020","created_at":"2026-05-18T03:14:09.311836+00:00"},{"alias_kind":"pith_short_12","alias_value":"XM5KYQWKQJ3D","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XM5KYQWKQJ3DKZYU","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XM5KYQWK","created_at":"2026-05-18T12:28:06.772260+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/XM5KYQWKQJ3DKZYUZXT3LKJRNM","json":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM.json","graph_json":"https://pith.science/api/pith-number/XM5KYQWKQJ3DKZYUZXT3LKJRNM/graph.json","events_json":"https://pith.science/api/pith-number/XM5KYQWKQJ3DKZYUZXT3LKJRNM/events.json","paper":"https://pith.science/paper/XM5KYQWK"},"agent_actions":{"view_html":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM","download_json":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM.json","view_paper":"https://pith.science/paper/XM5KYQWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1020&json=true","fetch_graph":"https://pith.science/api/pith-number/XM5KYQWKQJ3DKZYUZXT3LKJRNM/graph.json","fetch_events":"https://pith.science/api/pith-number/XM5KYQWKQJ3DKZYUZXT3LKJRNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM/action/storage_attestation","attest_author":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM/action/author_attestation","sign_citation":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM/action/citation_signature","submit_replication":"https://pith.science/pith/XM5KYQWKQJ3DKZYUZXT3LKJRNM/action/replication_record"}},"created_at":"2026-05-18T03:14:09.311836+00:00","updated_at":"2026-05-18T03:14:09.311836+00:00"}