{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HEELVHYUAXRGYBNZCBPLP2GYQS","short_pith_number":"pith:HEELVHYU","schema_version":"1.0","canonical_sha256":"3908ba9f1405e26c05b9105eb7e8d884a3bb85a3dcfb02e3a9a349daae473512","source":{"kind":"arxiv","id":"1209.6528","version":2},"attestation_state":"computed","paper":{"title":"Parameterizations of Test Cover with Bounded Test Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Yeo, Gabriele Muciaccia, Gregory Gutin, Mark Jones, Robert Crowston","submitted_at":"2012-09-28T14:13:14Z","abstract_excerpt":"In the {\\sc Test Cover} problem we are given a hypergraph $H=(V, \\mathcal{E})$ with $|V|=n, |\\mathcal{E}|=m$, and we assume that $\\mathcal{E}$ is a test cover, i.e. for every pair of vertices $x_i, x_j$, there exists an edge $e \\in \\mathcal{E}$ such that $|{x_i,x_j}\\cap e|=1$. The objective is to find a minimum subset of $\\mathcal{E}$ which is a test cover. The problem is used for identification across many areas, and is NP-complete. From a parameterized complexity standpoint, many natural parameterizations of {\\sc Test Cover} are either $W[1]$-complete or have no polynomial kernel unless $coN"},"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":"1209.6528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-28T14:13:14Z","cross_cats_sorted":[],"title_canon_sha256":"612288d9e108eb8b961f00561d35944358818434f48817e73b1e0a35c3dbd2e5","abstract_canon_sha256":"a9d7e7bfdd90872e2ba34c6f547210c1994bccf47125eb236f7549971c3e8c56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:37.507753Z","signature_b64":"Ji7FNWOMahWL2+FhBwjP9uF2ErKGvV6hfVIHd/2nH4JWtvAQXa0Y6p6EUuKNDHnVUZCQoEm0tNQwL44RIadrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3908ba9f1405e26c05b9105eb7e8d884a3bb85a3dcfb02e3a9a349daae473512","last_reissued_at":"2026-05-18T03:33:37.506948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:37.506948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterizations of Test Cover with Bounded Test Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Yeo, Gabriele Muciaccia, Gregory Gutin, Mark Jones, Robert Crowston","submitted_at":"2012-09-28T14:13:14Z","abstract_excerpt":"In the {\\sc Test Cover} problem we are given a hypergraph $H=(V, \\mathcal{E})$ with $|V|=n, |\\mathcal{E}|=m$, and we assume that $\\mathcal{E}$ is a test cover, i.e. for every pair of vertices $x_i, x_j$, there exists an edge $e \\in \\mathcal{E}$ such that $|{x_i,x_j}\\cap e|=1$. The objective is to find a minimum subset of $\\mathcal{E}$ which is a test cover. The problem is used for identification across many areas, and is NP-complete. From a parameterized complexity standpoint, many natural parameterizations of {\\sc Test Cover} are either $W[1]$-complete or have no polynomial kernel unless $coN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6528","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":"1209.6528","created_at":"2026-05-18T03:33:37.507072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.6528v2","created_at":"2026-05-18T03:33:37.507072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6528","created_at":"2026-05-18T03:33:37.507072+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEELVHYUAXRG","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEELVHYUAXRGYBNZ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEELVHYU","created_at":"2026-05-18T12:27:09.501522+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/HEELVHYUAXRGYBNZCBPLP2GYQS","json":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS.json","graph_json":"https://pith.science/api/pith-number/HEELVHYUAXRGYBNZCBPLP2GYQS/graph.json","events_json":"https://pith.science/api/pith-number/HEELVHYUAXRGYBNZCBPLP2GYQS/events.json","paper":"https://pith.science/paper/HEELVHYU"},"agent_actions":{"view_html":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS","download_json":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS.json","view_paper":"https://pith.science/paper/HEELVHYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.6528&json=true","fetch_graph":"https://pith.science/api/pith-number/HEELVHYUAXRGYBNZCBPLP2GYQS/graph.json","fetch_events":"https://pith.science/api/pith-number/HEELVHYUAXRGYBNZCBPLP2GYQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/action/storage_attestation","attest_author":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/action/author_attestation","sign_citation":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/action/citation_signature","submit_replication":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/action/replication_record"}},"created_at":"2026-05-18T03:33:37.507072+00:00","updated_at":"2026-05-18T03:33:37.507072+00:00"}