{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PGCJ7QXAZG5QTERJLYKUFFGTPF","short_pith_number":"pith:PGCJ7QXA","schema_version":"1.0","canonical_sha256":"79849fc2e0c9bb0992295e154294d3797393ec3a92905416bf9f08d740cec9ac","source":{"kind":"arxiv","id":"1504.01145","version":2},"attestation_state":"computed","paper":{"title":"Dualization in Lattices Given by Ordered Sets of Irreducibles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.LO","authors_text":"Mikhail A. Babin, Sergei O. Kuznetsov","submitted_at":"2015-04-05T18:23:50Z","abstract_excerpt":"Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and join irreducibles (i.e., as a concept lattice of a formal context). We show that in this case dualization is equivalent to the enumeration of so-called minimal hypotheses. In contrast to usual dualization setting, where a lattice is given by the ordered set of its elements, dualization in this case is shown to be impossible in output polynomial time unless "},"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":"1504.01145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-05T18:23:50Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"9b4be005b7b80f23e50a1e7b39f741b0526a19a33fad7a6a13034d9afc5e1830","abstract_canon_sha256":"239cefb48502a80deb8fcfe834c7e947268b9284a20ed580e5c0ecb21b73eae6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:38.388407Z","signature_b64":"zGq03nOP28W6CUeRrdAhkR25SY2cM3Ihwtpu4X/+FmV77oe/813hkilIxboNWU6cKRxEHQxy8hbBVTSB8Hv8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79849fc2e0c9bb0992295e154294d3797393ec3a92905416bf9f08d740cec9ac","last_reissued_at":"2026-05-18T01:23:38.387618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:38.387618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dualization in Lattices Given by Ordered Sets of Irreducibles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.LO","authors_text":"Mikhail A. Babin, Sergei O. Kuznetsov","submitted_at":"2015-04-05T18:23:50Z","abstract_excerpt":"Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and join irreducibles (i.e., as a concept lattice of a formal context). We show that in this case dualization is equivalent to the enumeration of so-called minimal hypotheses. In contrast to usual dualization setting, where a lattice is given by the ordered set of its elements, dualization in this case is shown to be impossible in output polynomial time unless "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01145","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.01145","created_at":"2026-05-18T01:23:38.387727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01145v2","created_at":"2026-05-18T01:23:38.387727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01145","created_at":"2026-05-18T01:23:38.387727+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGCJ7QXAZG5Q","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGCJ7QXAZG5QTERJ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGCJ7QXA","created_at":"2026-05-18T12:29:37.295048+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/PGCJ7QXAZG5QTERJLYKUFFGTPF","json":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF.json","graph_json":"https://pith.science/api/pith-number/PGCJ7QXAZG5QTERJLYKUFFGTPF/graph.json","events_json":"https://pith.science/api/pith-number/PGCJ7QXAZG5QTERJLYKUFFGTPF/events.json","paper":"https://pith.science/paper/PGCJ7QXA"},"agent_actions":{"view_html":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF","download_json":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF.json","view_paper":"https://pith.science/paper/PGCJ7QXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01145&json=true","fetch_graph":"https://pith.science/api/pith-number/PGCJ7QXAZG5QTERJLYKUFFGTPF/graph.json","fetch_events":"https://pith.science/api/pith-number/PGCJ7QXAZG5QTERJLYKUFFGTPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/action/storage_attestation","attest_author":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/action/author_attestation","sign_citation":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/action/citation_signature","submit_replication":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/action/replication_record"}},"created_at":"2026-05-18T01:23:38.387727+00:00","updated_at":"2026-05-18T01:23:38.387727+00:00"}