{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TNX5DXTXKZQDGHIWDMY4WTDHK3","short_pith_number":"pith:TNX5DXTX","canonical_record":{"source":{"id":"1601.02939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-05T19:24:25Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"ca363d39af777888ecbcf2aa37eb1862f0972b6991fcfb07e81c4dbae8b407d2","abstract_canon_sha256":"703770a489c3165a93083af89033d2ad4e2d25f95d447ccf482c19d9b8d3bf0f"},"schema_version":"1.0"},"canonical_sha256":"9b6fd1de775660331d161b31cb4c6756c0274a6a7a44b911807afe1e97b10a4b","source":{"kind":"arxiv","id":"1601.02939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02939","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02939v1","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02939","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"TNX5DXTXKZQD","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNX5DXTXKZQDGHIW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNX5DXTX","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TNX5DXTXKZQDGHIWDMY4WTDHK3","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-05T19:24:25Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"ca363d39af777888ecbcf2aa37eb1862f0972b6991fcfb07e81c4dbae8b407d2","abstract_canon_sha256":"703770a489c3165a93083af89033d2ad4e2d25f95d447ccf482c19d9b8d3bf0f"},"schema_version":"1.0"},"canonical_sha256":"9b6fd1de775660331d161b31cb4c6756c0274a6a7a44b911807afe1e97b10a4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:59.295737Z","signature_b64":"CCMfsZN9WT340yKI7+QBjh9HpVda4J0oUzp61HBlA/CbIWxWhZNVYcxgQubGFDrZR+WYjk+3sRROxphLNzfTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b6fd1de775660331d161b31cb4c6756c0274a6a7a44b911807afe1e97b10a4b","last_reissued_at":"2026-05-18T01:22:59.295150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:59.295150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02939","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-18T01:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtW9c41zAszzQMlWC71M4b2OV4UsoKugr1wanepImVRePw3kS3Oh/qszB4TKXblBlPzQRM/KOV2LpP4UqaNoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:32:07.909277Z"},"content_sha256":"b183660449fc20b18dcda3321955c224f3fa6c53c382709f141531763dcb43c2","schema_version":"1.0","event_id":"sha256:b183660449fc20b18dcda3321955c224f3fa6c53c382709f141531763dcb43c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TNX5DXTXKZQDGHIWDMY4WTDHK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimal hitting set generation problem: algorithms and computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DS","authors_text":"Andrew Gainer-Dewar, Paola Vera-Licona","submitted_at":"2016-01-05T19:24:25Z","abstract_excerpt":"Finding inclusion-minimal \"hitting sets\" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic literature focuses on the problem of *recognizing* the collection of minimal hitting sets; however, in many of the applications, it is more important to *generate* these hitting sets. We survey twenty algorithms from across a variety of domains, considering their history, classification, useful features, and computational performance on a variety of synthetic and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02939","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-18T01:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4DYS/w3P35BxgXUPg9BXZmEJKNbx8N9Ao2XsnxFBxYWQf3sSNkid+bCMIg0uQoadeVbWnHlXlO/CtJaoUCEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:32:07.909659Z"},"content_sha256":"df39a269b107d149c7136648bacbb8164ed0c4fb5471bdfb6582372d35967358","schema_version":"1.0","event_id":"sha256:df39a269b107d149c7136648bacbb8164ed0c4fb5471bdfb6582372d35967358"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNX5DXTXKZQDGHIWDMY4WTDHK3/bundle.json","state_url":"https://pith.science/pith/TNX5DXTXKZQDGHIWDMY4WTDHK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNX5DXTXKZQDGHIWDMY4WTDHK3/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-27T11:32:07Z","links":{"resolver":"https://pith.science/pith/TNX5DXTXKZQDGHIWDMY4WTDHK3","bundle":"https://pith.science/pith/TNX5DXTXKZQDGHIWDMY4WTDHK3/bundle.json","state":"https://pith.science/pith/TNX5DXTXKZQDGHIWDMY4WTDHK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNX5DXTXKZQDGHIWDMY4WTDHK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TNX5DXTXKZQDGHIWDMY4WTDHK3","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":"703770a489c3165a93083af89033d2ad4e2d25f95d447ccf482c19d9b8d3bf0f","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-05T19:24:25Z","title_canon_sha256":"ca363d39af777888ecbcf2aa37eb1862f0972b6991fcfb07e81c4dbae8b407d2"},"schema_version":"1.0","source":{"id":"1601.02939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02939","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02939v1","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02939","created_at":"2026-05-18T01:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"TNX5DXTXKZQD","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNX5DXTXKZQDGHIW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNX5DXTX","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:df39a269b107d149c7136648bacbb8164ed0c4fb5471bdfb6582372d35967358","target":"graph","created_at":"2026-05-18T01:22:59Z","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":"Finding inclusion-minimal \"hitting sets\" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic literature focuses on the problem of *recognizing* the collection of minimal hitting sets; however, in many of the applications, it is more important to *generate* these hitting sets. We survey twenty algorithms from across a variety of domains, considering their history, classification, useful features, and computational performance on a variety of synthetic and","authors_text":"Andrew Gainer-Dewar, Paola Vera-Licona","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-05T19:24:25Z","title":"The minimal hitting set generation problem: algorithms and computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02939","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:b183660449fc20b18dcda3321955c224f3fa6c53c382709f141531763dcb43c2","target":"record","created_at":"2026-05-18T01:22:59Z","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":"703770a489c3165a93083af89033d2ad4e2d25f95d447ccf482c19d9b8d3bf0f","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-05T19:24:25Z","title_canon_sha256":"ca363d39af777888ecbcf2aa37eb1862f0972b6991fcfb07e81c4dbae8b407d2"},"schema_version":"1.0","source":{"id":"1601.02939","kind":"arxiv","version":1}},"canonical_sha256":"9b6fd1de775660331d161b31cb4c6756c0274a6a7a44b911807afe1e97b10a4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b6fd1de775660331d161b31cb4c6756c0274a6a7a44b911807afe1e97b10a4b","first_computed_at":"2026-05-18T01:22:59.295150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:59.295150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CCMfsZN9WT340yKI7+QBjh9HpVda4J0oUzp61HBlA/CbIWxWhZNVYcxgQubGFDrZR+WYjk+3sRROxphLNzfTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:59.295737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b183660449fc20b18dcda3321955c224f3fa6c53c382709f141531763dcb43c2","sha256:df39a269b107d149c7136648bacbb8164ed0c4fb5471bdfb6582372d35967358"],"state_sha256":"3bb7593a572cfa1e9c300a10c311ac5119f1bfda04369b2a0f4d4b897c20ae1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4ruWNH6tb1tz0FRfiGmMePVVb4p+PWe7CVYOHd3IeDKbChh72FW95r4KdlUm5pUpC7yZHpVZdTCl6dU9VW9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:32:07.911910Z","bundle_sha256":"c6b550d4e672bc13c2e1c192827fa405f4326f4e32747ab0ca67a757799d9134"}}