{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PGCJ7QXAZG5QTERJLYKUFFGTPF","short_pith_number":"pith:PGCJ7QXA","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"},"canonical_sha256":"79849fc2e0c9bb0992295e154294d3797393ec3a92905416bf9f08d740cec9ac","source":{"kind":"arxiv","id":"1504.01145","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01145","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01145v2","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01145","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"PGCJ7QXAZG5Q","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PGCJ7QXAZG5QTERJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PGCJ7QXA","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PGCJ7QXAZG5QTERJLYKUFFGTPF","target":"record","payload":{"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"},"canonical_sha256":"79849fc2e0c9bb0992295e154294d3797393ec3a92905416bf9f08d740cec9ac","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"},"source_kind":"arxiv","source_id":"1504.01145","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-18T01:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11Sl8/C7+glwEgJCJTSvgw2QqY20g5eeWqeAf9k750ys88dK7tT/gE0ImOAku+F8AYY+c2PaioOUuPbDQzkbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:57:14.976353Z"},"content_sha256":"ef9ea759499515fa71070de27dea42d4fd728e5e37c27dc164f03bae8766fd7e","schema_version":"1.0","event_id":"sha256:ef9ea759499515fa71070de27dea42d4fd728e5e37c27dc164f03bae8766fd7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PGCJ7QXAZG5QTERJLYKUFFGTPF","target":"graph","payload":{"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"},"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:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTJvSxjOKMmBiPZxk5itw3hQseI1PRFqTgGyaYYzt1cAMkBPszlF4zSQXW8of4r8Xlb9W59fR2UCVnOj8APYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:57:14.976705Z"},"content_sha256":"3319d939413843d4f53fe99bfdb8de4863fbe5bfc3984891a03d1e9bbc35e29f","schema_version":"1.0","event_id":"sha256:3319d939413843d4f53fe99bfdb8de4863fbe5bfc3984891a03d1e9bbc35e29f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/bundle.json","state_url":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/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-26T07:57:14Z","links":{"resolver":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF","bundle":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/bundle.json","state":"https://pith.science/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGCJ7QXAZG5QTERJLYKUFFGTPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PGCJ7QXAZG5QTERJLYKUFFGTPF","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":"239cefb48502a80deb8fcfe834c7e947268b9284a20ed580e5c0ecb21b73eae6","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-05T18:23:50Z","title_canon_sha256":"9b4be005b7b80f23e50a1e7b39f741b0526a19a33fad7a6a13034d9afc5e1830"},"schema_version":"1.0","source":{"id":"1504.01145","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01145","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01145v2","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01145","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"PGCJ7QXAZG5Q","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PGCJ7QXAZG5QTERJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PGCJ7QXA","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:3319d939413843d4f53fe99bfdb8de4863fbe5bfc3984891a03d1e9bbc35e29f","target":"graph","created_at":"2026-05-18T01:23:38Z","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":"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 ","authors_text":"Mikhail A. Babin, Sergei O. Kuznetsov","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-05T18:23:50Z","title":"Dualization in Lattices Given by Ordered Sets of Irreducibles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01145","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:ef9ea759499515fa71070de27dea42d4fd728e5e37c27dc164f03bae8766fd7e","target":"record","created_at":"2026-05-18T01:23:38Z","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":"239cefb48502a80deb8fcfe834c7e947268b9284a20ed580e5c0ecb21b73eae6","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-05T18:23:50Z","title_canon_sha256":"9b4be005b7b80f23e50a1e7b39f741b0526a19a33fad7a6a13034d9afc5e1830"},"schema_version":"1.0","source":{"id":"1504.01145","kind":"arxiv","version":2}},"canonical_sha256":"79849fc2e0c9bb0992295e154294d3797393ec3a92905416bf9f08d740cec9ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79849fc2e0c9bb0992295e154294d3797393ec3a92905416bf9f08d740cec9ac","first_computed_at":"2026-05-18T01:23:38.387618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:38.387618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zGq03nOP28W6CUeRrdAhkR25SY2cM3Ihwtpu4X/+FmV77oe/813hkilIxboNWU6cKRxEHQxy8hbBVTSB8Hv8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:38.388407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01145","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef9ea759499515fa71070de27dea42d4fd728e5e37c27dc164f03bae8766fd7e","sha256:3319d939413843d4f53fe99bfdb8de4863fbe5bfc3984891a03d1e9bbc35e29f"],"state_sha256":"de6265d898add7d320449203e29e74458c590ad0034ca2c97543db5bf5d87afa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2a5DhOma5jCAI3iJwVkKnbcJuuzHTWGGFM5tE8jMmvCR5mhiY2icVBAk1HE2pdyfmnUO8Ae9bXTeeA4xVU4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T07:57:14.978684Z","bundle_sha256":"fcade7f4371cb4cb1a7f395e965d3c471979ee862121f28ab62949748f07ba06"}}