{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:34HVQ7SWQYRGOJTIEUDZRQFPMI","short_pith_number":"pith:34HVQ7SW","schema_version":"1.0","canonical_sha256":"df0f587e568622672668250798c0af62294296a3eb77534d0560c0940779279f","source":{"kind":"arxiv","id":"1902.07004","version":2},"attestation_state":"computed","paper":{"title":"On the dualization in distributive lattices and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Lhouari Nourine, Oscar Defrain, Takeaki Uno","submitted_at":"2019-02-19T11:38:15Z","abstract_excerpt":"In this paper, we study the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem. We in particular propose equivalent formulations of the problem in terms of graphs, hypergraphs, and posets. It is known that hypergraph dualization amounts to generate all minimal transversals of a hypergraph, or all minimal dominating sets of a graph. In this new framework, a poset on vertices is given together with the input (hyper)graph, and minimal ``ideal solutions'' are to be generated. This in particular allows us to study the complexity of the problem un"},"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":"1902.07004","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-02-19T11:38:15Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"981f1e0cee81af0d0f5ad0b23c590bfe5f9e4b31eaffaded3503abbabf64558b","abstract_canon_sha256":"13ece7591f59a63819433a63f15f2a776fbb6dd15eb899b62b189ad3aa1af256"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:23.067803Z","signature_b64":"d3yq8VicN6ScTCqtFNvtG62lzhXdcwsYRsdT4fbW9y08t40nTwiL/VCocfqvkONnXw0zzAYY2sUAz67hOuP2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df0f587e568622672668250798c0af62294296a3eb77534d0560c0940779279f","last_reissued_at":"2026-07-05T01:05:23.066120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:23.066120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the dualization in distributive lattices and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Lhouari Nourine, Oscar Defrain, Takeaki Uno","submitted_at":"2019-02-19T11:38:15Z","abstract_excerpt":"In this paper, we study the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem. We in particular propose equivalent formulations of the problem in terms of graphs, hypergraphs, and posets. It is known that hypergraph dualization amounts to generate all minimal transversals of a hypergraph, or all minimal dominating sets of a graph. In this new framework, a poset on vertices is given together with the input (hyper)graph, and minimal ``ideal solutions'' are to be generated. This in particular allows us to study the complexity of the problem un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07004","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.07004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.07004","created_at":"2026-07-05T01:05:23.066176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07004v2","created_at":"2026-07-05T01:05:23.066176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07004","created_at":"2026-07-05T01:05:23.066176+00:00"},{"alias_kind":"pith_short_12","alias_value":"34HVQ7SWQYRG","created_at":"2026-07-05T01:05:23.066176+00:00"},{"alias_kind":"pith_short_16","alias_value":"34HVQ7SWQYRGOJTI","created_at":"2026-07-05T01:05:23.066176+00:00"},{"alias_kind":"pith_short_8","alias_value":"34HVQ7SW","created_at":"2026-07-05T01:05:23.066176+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/34HVQ7SWQYRGOJTIEUDZRQFPMI","json":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI.json","graph_json":"https://pith.science/api/pith-number/34HVQ7SWQYRGOJTIEUDZRQFPMI/graph.json","events_json":"https://pith.science/api/pith-number/34HVQ7SWQYRGOJTIEUDZRQFPMI/events.json","paper":"https://pith.science/paper/34HVQ7SW"},"agent_actions":{"view_html":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI","download_json":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI.json","view_paper":"https://pith.science/paper/34HVQ7SW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07004&json=true","fetch_graph":"https://pith.science/api/pith-number/34HVQ7SWQYRGOJTIEUDZRQFPMI/graph.json","fetch_events":"https://pith.science/api/pith-number/34HVQ7SWQYRGOJTIEUDZRQFPMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI/action/storage_attestation","attest_author":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI/action/author_attestation","sign_citation":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI/action/citation_signature","submit_replication":"https://pith.science/pith/34HVQ7SWQYRGOJTIEUDZRQFPMI/action/replication_record"}},"created_at":"2026-07-05T01:05:23.066176+00:00","updated_at":"2026-07-05T01:05:23.066176+00:00"}