{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z37ZCSCPEXOBSVK4IU4INYGRIW","short_pith_number":"pith:Z37ZCSCP","schema_version":"1.0","canonical_sha256":"ceff91484f25dc19555c453886e0d145bcbf67989ab02725e15be1282dd22b4d","source":{"kind":"arxiv","id":"1212.0117","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Study of the Test Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A. Yeo, G. Gutin, M. Jones, R. Crowston, S. Saurabh","submitted_at":"2012-12-01T14:38:25Z","abstract_excerpt":"We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\\sc Test Cover} problem we are given a set $[n]=\\{1,...,n\\}$ of items together with a collection, $\\cal T$, of distinct subsets of these items called tests. We assume that $\\cal T$ is a test cover, i.e., for each pair of items there is a test in $\\cal T$ containing exactly one of these items. The objective is to find a minimum size subcollection of $\\cal T$, which is still a test cover. The generic parameterized version of {\\sc Test Cove"},"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":"1212.0117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-01T14:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"4557452ee46870a1343b75d1dcd4269e116ca9bfa8aeeec2d5f0199661ce6236","abstract_canon_sha256":"d01a992fb36e9d722e676da0ba41c464496b82b6373babf265975d4800490c48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:27.216165Z","signature_b64":"ZrxYIudyRsHgCPj/cd/iW3GjSL148eplNaxVHy1KYZwRFyFW2Gajupg51Gll8hTZhMHr/SsFyYlW/NoyzrCxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceff91484f25dc19555c453886e0d145bcbf67989ab02725e15be1282dd22b4d","last_reissued_at":"2026-05-18T03:39:27.215515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:27.215515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Study of the Test Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A. Yeo, G. Gutin, M. Jones, R. Crowston, S. Saurabh","submitted_at":"2012-12-01T14:38:25Z","abstract_excerpt":"We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\\sc Test Cover} problem we are given a set $[n]=\\{1,...,n\\}$ of items together with a collection, $\\cal T$, of distinct subsets of these items called tests. We assume that $\\cal T$ is a test cover, i.e., for each pair of items there is a test in $\\cal T$ containing exactly one of these items. The objective is to find a minimum size subcollection of $\\cal T$, which is still a test cover. The generic parameterized version of {\\sc Test Cove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0117","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":"1212.0117","created_at":"2026-05-18T03:39:27.215626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0117v1","created_at":"2026-05-18T03:39:27.215626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0117","created_at":"2026-05-18T03:39:27.215626+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z37ZCSCPEXOB","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z37ZCSCPEXOBSVK4","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z37ZCSCP","created_at":"2026-05-18T12:27:30.460161+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/Z37ZCSCPEXOBSVK4IU4INYGRIW","json":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW.json","graph_json":"https://pith.science/api/pith-number/Z37ZCSCPEXOBSVK4IU4INYGRIW/graph.json","events_json":"https://pith.science/api/pith-number/Z37ZCSCPEXOBSVK4IU4INYGRIW/events.json","paper":"https://pith.science/paper/Z37ZCSCP"},"agent_actions":{"view_html":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW","download_json":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW.json","view_paper":"https://pith.science/paper/Z37ZCSCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0117&json=true","fetch_graph":"https://pith.science/api/pith-number/Z37ZCSCPEXOBSVK4IU4INYGRIW/graph.json","fetch_events":"https://pith.science/api/pith-number/Z37ZCSCPEXOBSVK4IU4INYGRIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW/action/storage_attestation","attest_author":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW/action/author_attestation","sign_citation":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW/action/citation_signature","submit_replication":"https://pith.science/pith/Z37ZCSCPEXOBSVK4IU4INYGRIW/action/replication_record"}},"created_at":"2026-05-18T03:39:27.215626+00:00","updated_at":"2026-05-18T03:39:27.215626+00:00"}