{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GOVCHFUATWF5XP4KIXN7LWRGHS","short_pith_number":"pith:GOVCHFUA","canonical_record":{"source":{"id":"1402.3011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-13T00:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"4ea59372d363724335b83812abc15119d4b31c8282451feb32b31bdf217cca08","abstract_canon_sha256":"3f31ddae4889b03138e681dc7a9544c4b0b444e707f4cd07e14cb0f228bff07b"},"schema_version":"1.0"},"canonical_sha256":"33aa2396809d8bdbbf8a45dbf5da263c85f9459d26a58a7f1e338aae58e07bfb","source":{"kind":"arxiv","id":"1402.3011","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3011","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3011v2","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3011","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"pith_short_12","alias_value":"GOVCHFUATWF5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GOVCHFUATWF5XP4K","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GOVCHFUA","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GOVCHFUATWF5XP4KIXN7LWRGHS","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-13T00:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"4ea59372d363724335b83812abc15119d4b31c8282451feb32b31bdf217cca08","abstract_canon_sha256":"3f31ddae4889b03138e681dc7a9544c4b0b444e707f4cd07e14cb0f228bff07b"},"schema_version":"1.0"},"canonical_sha256":"33aa2396809d8bdbbf8a45dbf5da263c85f9459d26a58a7f1e338aae58e07bfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:05.654155Z","signature_b64":"9JRdKQH6O9FkeXFCUhSeNj/7EzZzqlZ8sfbjuuqVyT1Sp5UEOL72nRMO8+k1trlCgIKEoPfOI2Dl0g+vHwTDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33aa2396809d8bdbbf8a45dbf5da263c85f9459d26a58a7f1e338aae58e07bfb","last_reissued_at":"2026-05-18T02:59:05.653412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:05.653412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3011","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-18T02:59:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1f0/S6FUv6yBjevI0wkILOXtRhJSPNNpLGebexMzZlsweTY7zByrqqlxEJlkmTUpZDGdQxyfUggk9CgLbescAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:40:29.975710Z"},"content_sha256":"6e9ec3086bdc3f8dd7456591af2fa2820a594455104e6ccfd789bc3e27b2e134","schema_version":"1.0","event_id":"sha256:6e9ec3086bdc3f8dd7456591af2fa2820a594455104e6ccfd789bc3e27b2e134"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GOVCHFUATWF5XP4KIXN7LWRGHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Minimal Sets on Propositional Formulae I: Problems & Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Joao Marques-Silva, Mikolas Janota","submitted_at":"2014-02-13T00:27:51Z","abstract_excerpt":"Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical applications in recent years. However, many practical uses of SAT involve solving function as opposed to decision problems. Concrete examples include computing minimal unsatisfiable subsets, minimal correction subsets, prime implicates and implicants, minimal models, backbone literals, and autarkies, among several others. In most cases, solving a function problem requires a number of adaptive or non-adaptive calls to a S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3011","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-18T02:59:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8yqHlrHnU0f9fN656L91agkd2aFezb85XnpAcoDfPxJgkmCAiJ1aubsEsj3tgB8uFHnRBN1NmHvYLNwuU5ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:40:29.976051Z"},"content_sha256":"6dd6c51c7e46bfaecc27f16caf0518993473fbee674486cff3dfce94c6a9174a","schema_version":"1.0","event_id":"sha256:6dd6c51c7e46bfaecc27f16caf0518993473fbee674486cff3dfce94c6a9174a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOVCHFUATWF5XP4KIXN7LWRGHS/bundle.json","state_url":"https://pith.science/pith/GOVCHFUATWF5XP4KIXN7LWRGHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOVCHFUATWF5XP4KIXN7LWRGHS/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-23T12:40:29Z","links":{"resolver":"https://pith.science/pith/GOVCHFUATWF5XP4KIXN7LWRGHS","bundle":"https://pith.science/pith/GOVCHFUATWF5XP4KIXN7LWRGHS/bundle.json","state":"https://pith.science/pith/GOVCHFUATWF5XP4KIXN7LWRGHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOVCHFUATWF5XP4KIXN7LWRGHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GOVCHFUATWF5XP4KIXN7LWRGHS","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":"3f31ddae4889b03138e681dc7a9544c4b0b444e707f4cd07e14cb0f228bff07b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-13T00:27:51Z","title_canon_sha256":"4ea59372d363724335b83812abc15119d4b31c8282451feb32b31bdf217cca08"},"schema_version":"1.0","source":{"id":"1402.3011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3011","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3011v2","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3011","created_at":"2026-05-18T02:59:05Z"},{"alias_kind":"pith_short_12","alias_value":"GOVCHFUATWF5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GOVCHFUATWF5XP4K","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GOVCHFUA","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:6dd6c51c7e46bfaecc27f16caf0518993473fbee674486cff3dfce94c6a9174a","target":"graph","created_at":"2026-05-18T02:59:05Z","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":"Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical applications in recent years. However, many practical uses of SAT involve solving function as opposed to decision problems. Concrete examples include computing minimal unsatisfiable subsets, minimal correction subsets, prime implicates and implicants, minimal models, backbone literals, and autarkies, among several others. In most cases, solving a function problem requires a number of adaptive or non-adaptive calls to a S","authors_text":"Joao Marques-Silva, Mikolas Janota","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-13T00:27:51Z","title":"Computing Minimal Sets on Propositional Formulae I: Problems & Reductions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3011","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:6e9ec3086bdc3f8dd7456591af2fa2820a594455104e6ccfd789bc3e27b2e134","target":"record","created_at":"2026-05-18T02:59:05Z","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":"3f31ddae4889b03138e681dc7a9544c4b0b444e707f4cd07e14cb0f228bff07b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-13T00:27:51Z","title_canon_sha256":"4ea59372d363724335b83812abc15119d4b31c8282451feb32b31bdf217cca08"},"schema_version":"1.0","source":{"id":"1402.3011","kind":"arxiv","version":2}},"canonical_sha256":"33aa2396809d8bdbbf8a45dbf5da263c85f9459d26a58a7f1e338aae58e07bfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33aa2396809d8bdbbf8a45dbf5da263c85f9459d26a58a7f1e338aae58e07bfb","first_computed_at":"2026-05-18T02:59:05.653412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:05.653412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9JRdKQH6O9FkeXFCUhSeNj/7EzZzqlZ8sfbjuuqVyT1Sp5UEOL72nRMO8+k1trlCgIKEoPfOI2Dl0g+vHwTDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:05.654155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e9ec3086bdc3f8dd7456591af2fa2820a594455104e6ccfd789bc3e27b2e134","sha256:6dd6c51c7e46bfaecc27f16caf0518993473fbee674486cff3dfce94c6a9174a"],"state_sha256":"ad93c482c05853113ee2d92fa6ec541d8200634c69e85cf24f59937cffbc5641"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6LIjDsTWrRkK5S4Pqu96uYJJwpSRU/CJtXdSvuVajgIBkOsYJZiF279quN6x9VNdEWhsmkW/aPD3yUaKIriAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:40:29.978000Z","bundle_sha256":"cba1d05d562a9794cf6e08f787c37d21df045832b654cb4144036f897c739e59"}}