{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SSU2QG5Y2R576IZYLJ2RLJP3WW","short_pith_number":"pith:SSU2QG5Y","schema_version":"1.0","canonical_sha256":"94a9a81bb8d47bff23385a7515a5fbb5b4cf50e0e43efb4272339616fab6d913","source":{"kind":"arxiv","id":"1601.05305","version":2},"attestation_state":"computed","paper":{"title":"Optimal-size clique transversals in chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Grzesik, Daniel Kral, Jacob W. Cooper","submitted_at":"2016-01-20T15:31:56Z","abstract_excerpt":"The following question was raised by Tuza in 1990 and Erdos et al. in 1992: if every edge of an n-vertex chordal graph G is contained in a clique of size at least four, does G have a clique transversal, i.e., a set of vertices meeting all non-trivial maximal cliques, of size at most n/4? We prove that every such graph G has a clique transversal of size at most 2(n-1)/7 if n>=5, which is the best possible bound."},"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":"1601.05305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-20T15:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"522ec971621a29dd0be294f310d848193920d32ab2a64466e74bb91ed8bf3109","abstract_canon_sha256":"94614bb61b1efab37a77139e43bccd5270b89be933e8a49031a2706044be6883"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:19.622763Z","signature_b64":"Kk1J6Ha+Cpkpi8/qRH0kQ2pwG0EEwXOGafvtD9iGJpHXdapqciwIR7B4q/+X+NRVyt7GG02ciVa3k3oYwucoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a9a81bb8d47bff23385a7515a5fbb5b4cf50e0e43efb4272339616fab6d913","last_reissued_at":"2026-05-18T00:19:19.622299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:19.622299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal-size clique transversals in chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Grzesik, Daniel Kral, Jacob W. Cooper","submitted_at":"2016-01-20T15:31:56Z","abstract_excerpt":"The following question was raised by Tuza in 1990 and Erdos et al. in 1992: if every edge of an n-vertex chordal graph G is contained in a clique of size at least four, does G have a clique transversal, i.e., a set of vertices meeting all non-trivial maximal cliques, of size at most n/4? We prove that every such graph G has a clique transversal of size at most 2(n-1)/7 if n>=5, which is the best possible bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05305","kind":"arxiv","version":2},"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":"1601.05305","created_at":"2026-05-18T00:19:19.622378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05305v2","created_at":"2026-05-18T00:19:19.622378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05305","created_at":"2026-05-18T00:19:19.622378+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSU2QG5Y2R57","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSU2QG5Y2R576IZY","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSU2QG5Y","created_at":"2026-05-18T12:30:44.179134+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/SSU2QG5Y2R576IZYLJ2RLJP3WW","json":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW.json","graph_json":"https://pith.science/api/pith-number/SSU2QG5Y2R576IZYLJ2RLJP3WW/graph.json","events_json":"https://pith.science/api/pith-number/SSU2QG5Y2R576IZYLJ2RLJP3WW/events.json","paper":"https://pith.science/paper/SSU2QG5Y"},"agent_actions":{"view_html":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW","download_json":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW.json","view_paper":"https://pith.science/paper/SSU2QG5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05305&json=true","fetch_graph":"https://pith.science/api/pith-number/SSU2QG5Y2R576IZYLJ2RLJP3WW/graph.json","fetch_events":"https://pith.science/api/pith-number/SSU2QG5Y2R576IZYLJ2RLJP3WW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/action/storage_attestation","attest_author":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/action/author_attestation","sign_citation":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/action/citation_signature","submit_replication":"https://pith.science/pith/SSU2QG5Y2R576IZYLJ2RLJP3WW/action/replication_record"}},"created_at":"2026-05-18T00:19:19.622378+00:00","updated_at":"2026-05-18T00:19:19.622378+00:00"}