{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UQGKVXVLB6DSSCD7YDII6D5QJP","short_pith_number":"pith:UQGKVXVL","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"},"canonical_sha256":"a40caadeab0f8729087fc0d08f0fb04bea33d08608974bef02b6ad0a4bee3e18","source":{"kind":"arxiv","id":"1801.00716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00716","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00716v1","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00716","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"UQGKVXVLB6DS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQGKVXVLB6DSSCD7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQGKVXVL","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UQGKVXVLB6DSSCD7YDII6D5QJP","target":"record","payload":{"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"},"canonical_sha256":"a40caadeab0f8729087fc0d08f0fb04bea33d08608974bef02b6ad0a4bee3e18","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"},"source_kind":"arxiv","source_id":"1801.00716","source_version":1,"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-18T00:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+wjyZywkZ0XzhZPUSu+w1KA+k03kMDgsuiRZZ6lob9UYAdbOGgfXYNFzPUy9fHXWpmGCDb1QozSNkeJJENfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:45:07.536853Z"},"content_sha256":"604ce22447ab9ce6ca2247eac1fa0a2cfcef779407a1dada357dbf829b8a788e","schema_version":"1.0","event_id":"sha256:604ce22447ab9ce6ca2247eac1fa0a2cfcef779407a1dada357dbf829b8a788e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UQGKVXVLB6DSSCD7YDII6D5QJP","target":"graph","payload":{"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"},"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-18T00:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVet/0+D4XZ3OEPiWQBuKTAn4KouC/GQT0bund4hhbe13XkZr4idsFSnDR+5xFZaXBCIRVOS0MOtYu2NAlL2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:45:07.537476Z"},"content_sha256":"276958984997da7c00d92c96fe3189d4ccadd57dc34c60dfda342abc605533ce","schema_version":"1.0","event_id":"sha256:276958984997da7c00d92c96fe3189d4ccadd57dc34c60dfda342abc605533ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/bundle.json","state_url":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/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-06-07T20:45:07Z","links":{"resolver":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP","bundle":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/bundle.json","state":"https://pith.science/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQGKVXVLB6DSSCD7YDII6D5QJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UQGKVXVLB6DSSCD7YDII6D5QJP","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":"0d92901aecf5b6f0c9094ab71fda30a3e152a7ba900c1eb97304c88d1fddb7fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-02T16:42:26Z","title_canon_sha256":"4e0168511ab05d21c99290276d831f35d6dcf39f6e5e2d5c4e53714303a254df"},"schema_version":"1.0","source":{"id":"1801.00716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00716","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00716v1","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00716","created_at":"2026-05-18T00:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"UQGKVXVLB6DS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQGKVXVLB6DSSCD7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQGKVXVL","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:276958984997da7c00d92c96fe3189d4ccadd57dc34c60dfda342abc605533ce","target":"graph","created_at":"2026-05-18T00:26:52Z","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":"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","authors_text":"Max Bannach, Till Tantau","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-02T16:42:26Z","title":"Computing Hitting Set Kernels By AC^0-Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00716","kind":"arxiv","version":1},"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:604ce22447ab9ce6ca2247eac1fa0a2cfcef779407a1dada357dbf829b8a788e","target":"record","created_at":"2026-05-18T00:26:52Z","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":"0d92901aecf5b6f0c9094ab71fda30a3e152a7ba900c1eb97304c88d1fddb7fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-02T16:42:26Z","title_canon_sha256":"4e0168511ab05d21c99290276d831f35d6dcf39f6e5e2d5c4e53714303a254df"},"schema_version":"1.0","source":{"id":"1801.00716","kind":"arxiv","version":1}},"canonical_sha256":"a40caadeab0f8729087fc0d08f0fb04bea33d08608974bef02b6ad0a4bee3e18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a40caadeab0f8729087fc0d08f0fb04bea33d08608974bef02b6ad0a4bee3e18","first_computed_at":"2026-05-18T00:26:52.521499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:52.521499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ciqVldIfEg5Qtce+i0YgpmiOCd31pp1yA0+Je7/1FAJuO2jgOfunIOgdoTzHQixIixrZAhtPUt/P6kQpGOGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:52.522297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:604ce22447ab9ce6ca2247eac1fa0a2cfcef779407a1dada357dbf829b8a788e","sha256:276958984997da7c00d92c96fe3189d4ccadd57dc34c60dfda342abc605533ce"],"state_sha256":"e998176a668f388e9bb7adb532afc8bfdd1ec5e12753001d1bb6c79b6f579166"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9ScmtIMvt8YFmGpQpf3gz28yc57bxH3dE5k7sE4PvFaysRi/RAlXrQGieo9TtDo0TDUg3dm3fzAI+D+US7pBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:45:07.541016Z","bundle_sha256":"13eafe3b247b7f9f56f69e69675716aed123c5fb717ecc2d9b1341c3a0aa728b"}}