{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2C3ZOYEYLNPFNL6GSJDSKZUPTV","short_pith_number":"pith:2C3ZOYEY","canonical_record":{"source":{"id":"1102.3813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-18T11:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"d7d3b3556cd01d1c3db54df4d0c0fe2d10bf5cc4a5514c9e3cb28c61ed8d221e","abstract_canon_sha256":"4562addce4625fb909842efd061c13c26a5f0010602fcacf2ed8eec41767e6a1"},"schema_version":"1.0"},"canonical_sha256":"d0b79760985b5e56afc6924725668f9d6bf6f9409c676bd897ac3e6cdface348","source":{"kind":"arxiv","id":"1102.3813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3813","created_at":"2026-05-18T04:28:09Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3813v2","created_at":"2026-05-18T04:28:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3813","created_at":"2026-05-18T04:28:09Z"},{"alias_kind":"pith_short_12","alias_value":"2C3ZOYEYLNPF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2C3ZOYEYLNPFNL6G","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2C3ZOYEY","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2C3ZOYEYLNPFNL6GSJDSKZUPTV","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-18T11:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"d7d3b3556cd01d1c3db54df4d0c0fe2d10bf5cc4a5514c9e3cb28c61ed8d221e","abstract_canon_sha256":"4562addce4625fb909842efd061c13c26a5f0010602fcacf2ed8eec41767e6a1"},"schema_version":"1.0"},"canonical_sha256":"d0b79760985b5e56afc6924725668f9d6bf6f9409c676bd897ac3e6cdface348","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:09.215497Z","signature_b64":"TOoh94DMEW3KQCAj3bCyFWYESXrWyZpRyDXFCXmIot2rdbUXfp1EKBdq5Bg1NAsttiB+r2TI3jF8yYiH6hMhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0b79760985b5e56afc6924725668f9d6bf6f9409c676bd897ac3e6cdface348","last_reissued_at":"2026-05-18T04:28:09.214811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:09.214811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3813","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-18T04:28:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+FxlXH/98IfiPX2SGYM1x5GLx1Hy21s7C2m93ymciUuWTdLySi7jHkyKP0ImwFf8oBU0I1N9PG0yXRuP+wxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:04:43.463876Z"},"content_sha256":"0561fb3f764f7bbdbb0e1dc816363526c6b9083ea299ea10fbc4cd5f9c19aedc","schema_version":"1.0","event_id":"sha256:0561fb3f764f7bbdbb0e1dc816363526c6b9083ea299ea10fbc4cd5f9c19aedc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2C3ZOYEYLNPFNL6GSJDSKZUPTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Dualizing Large-Scale Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Keisuke Murakami, Takeaki Uno","submitted_at":"2011-02-18T11:51:28Z","abstract_excerpt":"A hypergraph ${\\cal F}$ is a set family defined on vertex set $V$. The dual of ${\\cal F}$ is the set of minimal subsets $H$ of $V$ such that $F\\cap H \\ne \\emptyset$ for any $F\\in {\\cal F}$. The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset family, minimal set cover enumeration, and the enumeration of hypergraph transversals. Although many algorithms have been proposed for solving the problem, to the best of our knowledge, none of them can work on large-scale input with a large number of output minimal hitting sets. This paper focuse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3813","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-18T04:28:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyF4HIZqhcKXR/OdXoKPo/S+EawpixqUac0tsG+0D8Y9wqE7l/0tllokvspH/zo903bkslNAkj6d2OTXwLntAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:04:43.464224Z"},"content_sha256":"b293809fd6d1e4a9ec0b39b8a5b050f6810c2755878371d227ad6611b4566a14","schema_version":"1.0","event_id":"sha256:b293809fd6d1e4a9ec0b39b8a5b050f6810c2755878371d227ad6611b4566a14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2C3ZOYEYLNPFNL6GSJDSKZUPTV/bundle.json","state_url":"https://pith.science/pith/2C3ZOYEYLNPFNL6GSJDSKZUPTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2C3ZOYEYLNPFNL6GSJDSKZUPTV/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-28T12:04:43Z","links":{"resolver":"https://pith.science/pith/2C3ZOYEYLNPFNL6GSJDSKZUPTV","bundle":"https://pith.science/pith/2C3ZOYEYLNPFNL6GSJDSKZUPTV/bundle.json","state":"https://pith.science/pith/2C3ZOYEYLNPFNL6GSJDSKZUPTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2C3ZOYEYLNPFNL6GSJDSKZUPTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2C3ZOYEYLNPFNL6GSJDSKZUPTV","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":"4562addce4625fb909842efd061c13c26a5f0010602fcacf2ed8eec41767e6a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-18T11:51:28Z","title_canon_sha256":"d7d3b3556cd01d1c3db54df4d0c0fe2d10bf5cc4a5514c9e3cb28c61ed8d221e"},"schema_version":"1.0","source":{"id":"1102.3813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3813","created_at":"2026-05-18T04:28:09Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3813v2","created_at":"2026-05-18T04:28:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3813","created_at":"2026-05-18T04:28:09Z"},{"alias_kind":"pith_short_12","alias_value":"2C3ZOYEYLNPF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2C3ZOYEYLNPFNL6G","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2C3ZOYEY","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:b293809fd6d1e4a9ec0b39b8a5b050f6810c2755878371d227ad6611b4566a14","target":"graph","created_at":"2026-05-18T04:28:09Z","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":"A hypergraph ${\\cal F}$ is a set family defined on vertex set $V$. The dual of ${\\cal F}$ is the set of minimal subsets $H$ of $V$ such that $F\\cap H \\ne \\emptyset$ for any $F\\in {\\cal F}$. The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset family, minimal set cover enumeration, and the enumeration of hypergraph transversals. Although many algorithms have been proposed for solving the problem, to the best of our knowledge, none of them can work on large-scale input with a large number of output minimal hitting sets. This paper focuse","authors_text":"Keisuke Murakami, Takeaki Uno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-18T11:51:28Z","title":"Efficient Algorithms for Dualizing Large-Scale Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3813","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:0561fb3f764f7bbdbb0e1dc816363526c6b9083ea299ea10fbc4cd5f9c19aedc","target":"record","created_at":"2026-05-18T04:28:09Z","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":"4562addce4625fb909842efd061c13c26a5f0010602fcacf2ed8eec41767e6a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-18T11:51:28Z","title_canon_sha256":"d7d3b3556cd01d1c3db54df4d0c0fe2d10bf5cc4a5514c9e3cb28c61ed8d221e"},"schema_version":"1.0","source":{"id":"1102.3813","kind":"arxiv","version":2}},"canonical_sha256":"d0b79760985b5e56afc6924725668f9d6bf6f9409c676bd897ac3e6cdface348","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0b79760985b5e56afc6924725668f9d6bf6f9409c676bd897ac3e6cdface348","first_computed_at":"2026-05-18T04:28:09.214811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:09.214811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TOoh94DMEW3KQCAj3bCyFWYESXrWyZpRyDXFCXmIot2rdbUXfp1EKBdq5Bg1NAsttiB+r2TI3jF8yYiH6hMhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:09.215497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0561fb3f764f7bbdbb0e1dc816363526c6b9083ea299ea10fbc4cd5f9c19aedc","sha256:b293809fd6d1e4a9ec0b39b8a5b050f6810c2755878371d227ad6611b4566a14"],"state_sha256":"982ef8a0aa84c9202979c0c6a12cd9a4e74b041e11b5650f85b4d32c5078de3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJYbXg0IgqUkW89G6NB5LICQpB/TV/wLzBQ61IX7NKO2h8OZ8JBuUVQqNKARCVx1ukaE0xLejgNmVEbDnlwFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:04:43.466195Z","bundle_sha256":"cce0f6b4e8d5cc15508472402985c400afcb6505c68c20db52a82cf440b630f4"}}