{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HEELVHYUAXRGYBNZCBPLP2GYQS","short_pith_number":"pith:HEELVHYU","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"},"canonical_sha256":"3908ba9f1405e26c05b9105eb7e8d884a3bb85a3dcfb02e3a9a349daae473512","source":{"kind":"arxiv","id":"1209.6528","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6528","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6528v2","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6528","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"HEELVHYUAXRG","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HEELVHYUAXRGYBNZ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HEELVHYU","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HEELVHYUAXRGYBNZCBPLP2GYQS","target":"record","payload":{"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"},"canonical_sha256":"3908ba9f1405e26c05b9105eb7e8d884a3bb85a3dcfb02e3a9a349daae473512","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"},"source_kind":"arxiv","source_id":"1209.6528","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wH+BcyXuJ1gKk4AwqNT+8jLDDFzMzZzGg0g5hQtx0+Zq/WPpSQ+vxlahJtbQBSUQEKs7Bc0iDoYMkMwj7YMsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:05:34.893788Z"},"content_sha256":"5b8efb06f8e775db0f56eac0642d4e317ce310249c6fade44b4ce2e22f0710d2","schema_version":"1.0","event_id":"sha256:5b8efb06f8e775db0f56eac0642d4e317ce310249c6fade44b4ce2e22f0710d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HEELVHYUAXRGYBNZCBPLP2GYQS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"081ws+Jd4My0l2A1y+wZ5guqQSWjUn2Iznc3Nh0cNwcfIdIfIzwLdj53voh17f6rEYlfdRgmQOTQ9qIvs9A2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:05:34.894132Z"},"content_sha256":"e9ac91fd470a9a888c7b6226050be5b424af26d738474055b063a9ba7d197d43","schema_version":"1.0","event_id":"sha256:e9ac91fd470a9a888c7b6226050be5b424af26d738474055b063a9ba7d197d43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/bundle.json","state_url":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T11:05:34Z","links":{"resolver":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS","bundle":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/bundle.json","state":"https://pith.science/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEELVHYUAXRGYBNZCBPLP2GYQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HEELVHYUAXRGYBNZCBPLP2GYQS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9d7e7bfdd90872e2ba34c6f547210c1994bccf47125eb236f7549971c3e8c56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-28T14:13:14Z","title_canon_sha256":"612288d9e108eb8b961f00561d35944358818434f48817e73b1e0a35c3dbd2e5"},"schema_version":"1.0","source":{"id":"1209.6528","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6528","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6528v2","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6528","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"HEELVHYUAXRG","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HEELVHYUAXRGYBNZ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HEELVHYU","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:e9ac91fd470a9a888c7b6226050be5b424af26d738474055b063a9ba7d197d43","target":"graph","created_at":"2026-05-18T03:33:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anders Yeo, Gabriele Muciaccia, Gregory Gutin, Mark Jones, Robert Crowston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-28T14:13:14Z","title":"Parameterizations of Test Cover with Bounded Test Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6528","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5b8efb06f8e775db0f56eac0642d4e317ce310249c6fade44b4ce2e22f0710d2","target":"record","created_at":"2026-05-18T03:33:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a9d7e7bfdd90872e2ba34c6f547210c1994bccf47125eb236f7549971c3e8c56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-28T14:13:14Z","title_canon_sha256":"612288d9e108eb8b961f00561d35944358818434f48817e73b1e0a35c3dbd2e5"},"schema_version":"1.0","source":{"id":"1209.6528","kind":"arxiv","version":2}},"canonical_sha256":"3908ba9f1405e26c05b9105eb7e8d884a3bb85a3dcfb02e3a9a349daae473512","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3908ba9f1405e26c05b9105eb7e8d884a3bb85a3dcfb02e3a9a349daae473512","first_computed_at":"2026-05-18T03:33:37.506948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:37.506948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ji7FNWOMahWL2+FhBwjP9uF2ErKGvV6hfVIHd/2nH4JWtvAQXa0Y6p6EUuKNDHnVUZCQoEm0tNQwL44RIadrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:37.507753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6528","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b8efb06f8e775db0f56eac0642d4e317ce310249c6fade44b4ce2e22f0710d2","sha256:e9ac91fd470a9a888c7b6226050be5b424af26d738474055b063a9ba7d197d43"],"state_sha256":"24c71676562998298abe3aba464c47373d120b3aa83ab608f747e73f3a45c695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+D8BTTvCnmgarISGY7CnCuJByjdqSJqKbptAtcgCIFvnsz7hn7fSjhtvQFvj+iBorOClPPrvhTn7Nr32zedYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:05:34.896280Z","bundle_sha256":"17bb5c81ec7ef46efca44628e9ff7c4322126c34aa8106f448b1d5354caf1dd1"}}