{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KTQELBLDON3CCFXBFXEBWJCNMU","short_pith_number":"pith:KTQELBLD","canonical_record":{"source":{"id":"1204.5306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-24T08:48:34Z","cross_cats_sorted":[],"title_canon_sha256":"717e77cc809ff0f23c6ae1cbc38547de80cfa56ceaf12fedb10988fe2ca6d9a7","abstract_canon_sha256":"1ab07940cb40a574b4572fc691caf97d8c303af915cbcd5a93ca219f4de15f6c"},"schema_version":"1.0"},"canonical_sha256":"54e045856373762116e12dc81b244d6524598aa965e7840263419ce674a7b1ca","source":{"kind":"arxiv","id":"1204.5306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5306","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5306v1","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5306","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"pith_short_12","alias_value":"KTQELBLDON3C","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KTQELBLDON3CCFXB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KTQELBLD","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KTQELBLDON3CCFXBFXEBWJCNMU","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-24T08:48:34Z","cross_cats_sorted":[],"title_canon_sha256":"717e77cc809ff0f23c6ae1cbc38547de80cfa56ceaf12fedb10988fe2ca6d9a7","abstract_canon_sha256":"1ab07940cb40a574b4572fc691caf97d8c303af915cbcd5a93ca219f4de15f6c"},"schema_version":"1.0"},"canonical_sha256":"54e045856373762116e12dc81b244d6524598aa965e7840263419ce674a7b1ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:13.523831Z","signature_b64":"g8z6N3feO+06X4VpP7UFitP13RzouIuR6279qa+dY7qvoIBKDd6PA/NbK0Zgt+/W14kEWSoBdZ7CQSR2Es+nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e045856373762116e12dc81b244d6524598aa965e7840263419ce674a7b1ca","last_reissued_at":"2026-05-18T03:57:13.523465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:13.523465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5306","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-18T03:57:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlvhqhTtCHyPrJnSImvTieYZSUcAB8teDCexNxNgNIBUta4Swok3WxpCyYBa8vWvbRzPmmsx4U/OBT7M0oVUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:59:50.647816Z"},"content_sha256":"1bd43cba650ef3720c61c478f70c64096e91ca99b5686393d4db9dc14046d1c1","schema_version":"1.0","event_id":"sha256:1bd43cba650ef3720c61c478f70c64096e91ca99b5686393d4db9dc14046d1c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KTQELBLDON3CCFXBFXEBWJCNMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact DSOP and partial DSOP Forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anna Bernasconi, Fabrizio Luccio, Linda Pagli, Valentina Ciriani","submitted_at":"2012-04-24T08:48:34Z","abstract_excerpt":"Given a Boolean function f on n variables, a Disjoint Sum-of-Products (DSOP) of f is a set of products (ANDs) of subsets of literals whose sum (OR) equals f, such that no two products cover the same minterm of f. DSOP forms are a special instance of partial DSOPs, i.e. the general case where a subset of minterms must be covered exactly once and the other minterms (typically corresponding to don't care conditions of $f$) can be covered any number of times. We discuss finding DSOPs and partial DSOP with a minimal number of products, a problem theoretically connected with various properties of Bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5306","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-18T03:57:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9I5KnVTwvzZr3CwPyq32oIZjQEGCHEbiZlt2/WoRucby574aqPSGIO3ilb6S1+PvgCIKHJopPm4vHoCRoj3vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:59:50.648540Z"},"content_sha256":"322aa47f68f7e8c416e488cea2e251a3a869c558129242ba40288339d0e9a658","schema_version":"1.0","event_id":"sha256:322aa47f68f7e8c416e488cea2e251a3a869c558129242ba40288339d0e9a658"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTQELBLDON3CCFXBFXEBWJCNMU/bundle.json","state_url":"https://pith.science/pith/KTQELBLDON3CCFXBFXEBWJCNMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTQELBLDON3CCFXBFXEBWJCNMU/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-08T16:59:50Z","links":{"resolver":"https://pith.science/pith/KTQELBLDON3CCFXBFXEBWJCNMU","bundle":"https://pith.science/pith/KTQELBLDON3CCFXBFXEBWJCNMU/bundle.json","state":"https://pith.science/pith/KTQELBLDON3CCFXBFXEBWJCNMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTQELBLDON3CCFXBFXEBWJCNMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KTQELBLDON3CCFXBFXEBWJCNMU","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":"1ab07940cb40a574b4572fc691caf97d8c303af915cbcd5a93ca219f4de15f6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-24T08:48:34Z","title_canon_sha256":"717e77cc809ff0f23c6ae1cbc38547de80cfa56ceaf12fedb10988fe2ca6d9a7"},"schema_version":"1.0","source":{"id":"1204.5306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5306","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5306v1","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5306","created_at":"2026-05-18T03:57:13Z"},{"alias_kind":"pith_short_12","alias_value":"KTQELBLDON3C","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KTQELBLDON3CCFXB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KTQELBLD","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:322aa47f68f7e8c416e488cea2e251a3a869c558129242ba40288339d0e9a658","target":"graph","created_at":"2026-05-18T03:57:13Z","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":"Given a Boolean function f on n variables, a Disjoint Sum-of-Products (DSOP) of f is a set of products (ANDs) of subsets of literals whose sum (OR) equals f, such that no two products cover the same minterm of f. DSOP forms are a special instance of partial DSOPs, i.e. the general case where a subset of minterms must be covered exactly once and the other minterms (typically corresponding to don't care conditions of $f$) can be covered any number of times. We discuss finding DSOPs and partial DSOP with a minimal number of products, a problem theoretically connected with various properties of Bo","authors_text":"Anna Bernasconi, Fabrizio Luccio, Linda Pagli, Valentina Ciriani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-24T08:48:34Z","title":"Compact DSOP and partial DSOP Forms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5306","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:1bd43cba650ef3720c61c478f70c64096e91ca99b5686393d4db9dc14046d1c1","target":"record","created_at":"2026-05-18T03:57:13Z","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":"1ab07940cb40a574b4572fc691caf97d8c303af915cbcd5a93ca219f4de15f6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-24T08:48:34Z","title_canon_sha256":"717e77cc809ff0f23c6ae1cbc38547de80cfa56ceaf12fedb10988fe2ca6d9a7"},"schema_version":"1.0","source":{"id":"1204.5306","kind":"arxiv","version":1}},"canonical_sha256":"54e045856373762116e12dc81b244d6524598aa965e7840263419ce674a7b1ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54e045856373762116e12dc81b244d6524598aa965e7840263419ce674a7b1ca","first_computed_at":"2026-05-18T03:57:13.523465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:13.523465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g8z6N3feO+06X4VpP7UFitP13RzouIuR6279qa+dY7qvoIBKDd6PA/NbK0Zgt+/W14kEWSoBdZ7CQSR2Es+nDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:13.523831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bd43cba650ef3720c61c478f70c64096e91ca99b5686393d4db9dc14046d1c1","sha256:322aa47f68f7e8c416e488cea2e251a3a869c558129242ba40288339d0e9a658"],"state_sha256":"490d3f896a0b928ddfad84715f49eb4b1a259b77807705f4ae3ebc2e4e535916"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmpmHYOhrUNqb44gnX9hHmPk0T48gEiQmrxvoJrJUzc/ckhudY1/iysBhw0XAis6tbGjiWTEdZGM5YdU/kZiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:59:50.653020Z","bundle_sha256":"665f1e0bfb3287efd73fbed8b61b4ac020f243487ce265090550c8180ce3a16f"}}