{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UQGKVXVLB6DSSCD7YDII6D5QJP","short_pith_number":"pith:UQGKVXVL","schema_version":"1.0","canonical_sha256":"a40caadeab0f8729087fc0d08f0fb04bea33d08608974bef02b6ad0a4bee3e18","source":{"kind":"arxiv","id":"1801.00716","version":1},"attestation_state":"computed","paper":{"title":"Computing Hitting Set Kernels By AC^0-Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Max Bannach, Till Tantau","submitted_at":"2018-01-02T16:42:26Z","abstract_excerpt":"Given a hypergraph $H = (V,E)$, what is the smallest subset $X \\subseteq V$ such that $e \\cap X \\neq \\emptyset$ holds for all $e \\in E$? This problem, known as the hitting set problem, is a basic problem in parameterized complexity theory. There are well-known kernelization algorithms for it, which get a hypergraph $H$ and a number $k$ as input and output a hypergraph $H'$ such that (1) $H$ has a hitting set of size $k$ if, and only if, $H'$ has such a hitting set and (2) the size of $H'$ depends only on $k$ and on the maximum cardinality $d$ of edges in $H$. The algorithms run in polynomial t"},"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":"1801.00716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-02T16:42:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4e0168511ab05d21c99290276d831f35d6dcf39f6e5e2d5c4e53714303a254df","abstract_canon_sha256":"0d92901aecf5b6f0c9094ab71fda30a3e152a7ba900c1eb97304c88d1fddb7fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:52.522297Z","signature_b64":"6ciqVldIfEg5Qtce+i0YgpmiOCd31pp1yA0+Je7/1FAJuO2jgOfunIOgdoTzHQixIixrZAhtPUt/P6kQpGOGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a40caadeab0f8729087fc0d08f0fb04bea33d08608974bef02b6ad0a4bee3e18","last_reissued_at":"2026-05-18T00:26:52.521499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:52.521499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Hitting Set Kernels By AC^0-Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Max Bannach, Till Tantau","submitted_at":"2018-01-02T16:42:26Z","abstract_excerpt":"Given a hypergraph $H = (V,E)$, what is the smallest subset $X \\subseteq V$ such that $e \\cap X \\neq \\emptyset$ holds for all $e \\in E$? This problem, known as the hitting set problem, is a basic problem in parameterized complexity theory. There are well-known kernelization algorithms for it, which get a hypergraph $H$ and a number $k$ as input and output a hypergraph $H'$ such that (1) $H$ has a hitting set of size $k$ if, and only if, $H'$ has such a hitting set and (2) the size of $H'$ depends only on $k$ and on the maximum cardinality $d$ of edges in $H$. The algorithms run in polynomial t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00716","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":"1801.00716","created_at":"2026-05-18T00:26:52.521621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00716v1","created_at":"2026-05-18T00:26:52.521621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00716","created_at":"2026-05-18T00:26:52.521621+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQGKVXVLB6DS","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQGKVXVLB6DSSCD7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQGKVXVL","created_at":"2026-05-18T12:32:56.356000+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/UQGKVXVLB6DSSCD7YDII6D5QJP","json":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP.json","graph_json":"https://pith.science/api/pith-number/UQGKVXVLB6DSSCD7YDII6D5QJP/graph.json","events_json":"https://pith.science/api/pith-number/UQGKVXVLB6DSSCD7YDII6D5QJP/events.json","paper":"https://pith.science/paper/UQGKVXVL"},"agent_actions":{"view_html":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP","download_json":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP.json","view_paper":"https://pith.science/paper/UQGKVXVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00716&json=true","fetch_graph":"https://pith.science/api/pith-number/UQGKVXVLB6DSSCD7YDII6D5QJP/graph.json","fetch_events":"https://pith.science/api/pith-number/UQGKVXVLB6DSSCD7YDII6D5QJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/action/storage_attestation","attest_author":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/action/author_attestation","sign_citation":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/action/citation_signature","submit_replication":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/action/replication_record"}},"created_at":"2026-05-18T00:26:52.521621+00:00","updated_at":"2026-05-18T00:26:52.521621+00:00"}