{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AW4EYEPMRUOUSRYLIV4EVWKB5Q","short_pith_number":"pith:AW4EYEPM","canonical_record":{"source":{"id":"1104.2312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-12T19:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"1304c6e2eca4a290c6484191bcde94ada90065782932948075fed58f7c43295d","abstract_canon_sha256":"beb81a0cf9f3103a1980264f58244d3b4385c71db62c044fc5ee4fe4c7c4dc16"},"schema_version":"1.0"},"canonical_sha256":"05b84c11ec8d1d49470b45784ad941ec06cfbcf4a2a83747b774b450a69fc4d8","source":{"kind":"arxiv","id":"1104.2312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2312","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2312v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2312","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"AW4EYEPMRUOU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AW4EYEPMRUOUSRYL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AW4EYEPM","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AW4EYEPMRUOUSRYLIV4EVWKB5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-12T19:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"1304c6e2eca4a290c6484191bcde94ada90065782932948075fed58f7c43295d","abstract_canon_sha256":"beb81a0cf9f3103a1980264f58244d3b4385c71db62c044fc5ee4fe4c7c4dc16"},"schema_version":"1.0"},"canonical_sha256":"05b84c11ec8d1d49470b45784ad941ec06cfbcf4a2a83747b774b450a69fc4d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.486050Z","signature_b64":"CVUJhu5EgYV2UbVnmW5VDGQSgAkL+HQ+ol/CdcVrxC2JAV5fifhz4dT1JaVzkxkLaqhRkU7SFsVJ1n9ROpq+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05b84c11ec8d1d49470b45784ad941ec06cfbcf4a2a83747b774b450a69fc4d8","last_reissued_at":"2026-05-18T04:24:35.485670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.485670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2312","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQbqEasnOftUnIOTcv6Lz94Fhy0slQOtyI8RW1KvL3x/Ijj/rxFs7vKyJGYFozO3Sja0TDr9p8EQuBIB9EElAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:38:35.497219Z"},"content_sha256":"62c9ec1c991bca49b53bb1d4c5ac70fe539e7107d63cb1e90275c2983cd07557","schema_version":"1.0","event_id":"sha256:62c9ec1c991bca49b53bb1d4c5ac70fe539e7107d63cb1e90275c2983cd07557"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AW4EYEPMRUOUSRYLIV4EVWKB5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimization for Generalized Boolean Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Edith Hemaspaandra, Henning Schnoor","submitted_at":"2011-04-12T19:38:32Z","abstract_excerpt":"The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Sigma-2-complete under Turing reductions, but restricted versions are tractable. We study the complexity of minimization for formulas in two established frameworks for restricted propositional logic: The Post framework allowing arbitrarily nested formulas over a set of Boolean connectors, and the constraint setting, allowing generalizations of CNF formulas. In the Post case, we obtain a dichotomy result: Minimization is solvable in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2312","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRxuFpyQ8l19QsWHZJ45keTwFiqe/Y2G5MY1h12jJv1IMJ9bJwxxKtbDxtpLRtTjlymmzo/of2tJq93f8iykAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:38:35.497922Z"},"content_sha256":"4624ce232b6e42803e754012fae1b65414944d3398f548f9a6b9bdb438851cd3","schema_version":"1.0","event_id":"sha256:4624ce232b6e42803e754012fae1b65414944d3398f548f9a6b9bdb438851cd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AW4EYEPMRUOUSRYLIV4EVWKB5Q/bundle.json","state_url":"https://pith.science/pith/AW4EYEPMRUOUSRYLIV4EVWKB5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AW4EYEPMRUOUSRYLIV4EVWKB5Q/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-26T04:38:35Z","links":{"resolver":"https://pith.science/pith/AW4EYEPMRUOUSRYLIV4EVWKB5Q","bundle":"https://pith.science/pith/AW4EYEPMRUOUSRYLIV4EVWKB5Q/bundle.json","state":"https://pith.science/pith/AW4EYEPMRUOUSRYLIV4EVWKB5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AW4EYEPMRUOUSRYLIV4EVWKB5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AW4EYEPMRUOUSRYLIV4EVWKB5Q","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":"beb81a0cf9f3103a1980264f58244d3b4385c71db62c044fc5ee4fe4c7c4dc16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-12T19:38:32Z","title_canon_sha256":"1304c6e2eca4a290c6484191bcde94ada90065782932948075fed58f7c43295d"},"schema_version":"1.0","source":{"id":"1104.2312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2312","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2312v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2312","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"AW4EYEPMRUOU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AW4EYEPMRUOUSRYL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AW4EYEPM","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:4624ce232b6e42803e754012fae1b65414944d3398f548f9a6b9bdb438851cd3","target":"graph","created_at":"2026-05-18T04:24:35Z","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":"The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Sigma-2-complete under Turing reductions, but restricted versions are tractable. We study the complexity of minimization for formulas in two established frameworks for restricted propositional logic: The Post framework allowing arbitrarily nested formulas over a set of Boolean connectors, and the constraint setting, allowing generalizations of CNF formulas. In the Post case, we obtain a dichotomy result: Minimization is solvable in","authors_text":"Edith Hemaspaandra, Henning Schnoor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-12T19:38:32Z","title":"Minimization for Generalized Boolean Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2312","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:62c9ec1c991bca49b53bb1d4c5ac70fe539e7107d63cb1e90275c2983cd07557","target":"record","created_at":"2026-05-18T04:24:35Z","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":"beb81a0cf9f3103a1980264f58244d3b4385c71db62c044fc5ee4fe4c7c4dc16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-12T19:38:32Z","title_canon_sha256":"1304c6e2eca4a290c6484191bcde94ada90065782932948075fed58f7c43295d"},"schema_version":"1.0","source":{"id":"1104.2312","kind":"arxiv","version":1}},"canonical_sha256":"05b84c11ec8d1d49470b45784ad941ec06cfbcf4a2a83747b774b450a69fc4d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05b84c11ec8d1d49470b45784ad941ec06cfbcf4a2a83747b774b450a69fc4d8","first_computed_at":"2026-05-18T04:24:35.485670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:35.485670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CVUJhu5EgYV2UbVnmW5VDGQSgAkL+HQ+ol/CdcVrxC2JAV5fifhz4dT1JaVzkxkLaqhRkU7SFsVJ1n9ROpq+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:35.486050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62c9ec1c991bca49b53bb1d4c5ac70fe539e7107d63cb1e90275c2983cd07557","sha256:4624ce232b6e42803e754012fae1b65414944d3398f548f9a6b9bdb438851cd3"],"state_sha256":"8b622ad0b3248fdbd5e022e56959788865d08951924b695a669e29a3d793ca9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxWyRXnK7Tl2i5zyj8P75UEvZsbyRMYT2FPHrWGCUxy36Q+QqJzXm0Sb4cJU3THZ4/6lORjE3BBISTAEkDoUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:38:35.501289Z","bundle_sha256":"77a07459ba9a8f68adb361015ae7c6e1f655afab7ca7d1ac6f36dfe13f6d3ad3"}}