{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IAPLM7XMUOCJBSDQTFDWSMSNHO","short_pith_number":"pith:IAPLM7XM","canonical_record":{"source":{"id":"1109.2134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-09T20:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"f028c6b8daa866e89ea053e5fc2e91ebf02be151020180dc0d6a81eae0cbfd74","abstract_canon_sha256":"a093b4bb5ce2941455a76463ccc1e7211b830eff75b63824df24f124eedc27ef"},"schema_version":"1.0"},"canonical_sha256":"401eb67eeca38490c870994769324d3bac51c2ab54e50628361739947d51d69f","source":{"kind":"arxiv","id":"1109.2134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2134","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2134v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2134","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"IAPLM7XMUOCJ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IAPLM7XMUOCJBSDQ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IAPLM7XM","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IAPLM7XMUOCJBSDQTFDWSMSNHO","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-09T20:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"f028c6b8daa866e89ea053e5fc2e91ebf02be151020180dc0d6a81eae0cbfd74","abstract_canon_sha256":"a093b4bb5ce2941455a76463ccc1e7211b830eff75b63824df24f124eedc27ef"},"schema_version":"1.0"},"canonical_sha256":"401eb67eeca38490c870994769324d3bac51c2ab54e50628361739947d51d69f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:38.576147Z","signature_b64":"k7HAw3peHxHC/tZol745iOkrkGEFXmUxofgoMv68Pze4ZCt0UKXqFFKMaX+ORDOOmSNJX+5qxBZ1hhgir6yVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"401eb67eeca38490c870994769324d3bac51c2ab54e50628361739947d51d69f","last_reissued_at":"2026-05-18T04:13:38.575559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:38.575559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2134","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LO+DrpNA5/Agetu/5L2NzYCx9QSq6jTE4rneFWjrVOfM3l+zVoHQzvfMyE47yARAunXkhP0U2933mxuNFm6SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:15:39.032409Z"},"content_sha256":"9dd1b636ec5744d0dee800bf4a93a92f68e88c6e1f02bd527c44c1788c217b95","schema_version":"1.0","event_id":"sha256:9dd1b636ec5744d0dee800bf4a93a92f68e88c6e1f02bd527c44c1788c217b95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IAPLM7XMUOCJBSDQTFDWSMSNHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalizing Boolean Satisfiability II: Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. J. Parkes, E. M. Luks, H. E. Dixon, M. L. Ginsberg","submitted_at":"2011-09-09T20:23:53Z","abstract_excerpt":"This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers.  The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance.  This paper presents the theoretical basis for the ideas underlying ZAP, arguin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2134","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hG2sf01tKZWQfej0LpNs6fmvsi/bbMUPgWouPJE6r4i5315aj9uA9WX4gqanOZpoAGCLZE+UrCVTkkE2nxDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:15:39.032763Z"},"content_sha256":"38bc249939bedd06b3d7832b8350f3c3f359465841bfb1ffa58b06c8ad4beedb","schema_version":"1.0","event_id":"sha256:38bc249939bedd06b3d7832b8350f3c3f359465841bfb1ffa58b06c8ad4beedb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAPLM7XMUOCJBSDQTFDWSMSNHO/bundle.json","state_url":"https://pith.science/pith/IAPLM7XMUOCJBSDQTFDWSMSNHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAPLM7XMUOCJBSDQTFDWSMSNHO/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-01T06:15:39Z","links":{"resolver":"https://pith.science/pith/IAPLM7XMUOCJBSDQTFDWSMSNHO","bundle":"https://pith.science/pith/IAPLM7XMUOCJBSDQTFDWSMSNHO/bundle.json","state":"https://pith.science/pith/IAPLM7XMUOCJBSDQTFDWSMSNHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAPLM7XMUOCJBSDQTFDWSMSNHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IAPLM7XMUOCJBSDQTFDWSMSNHO","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":"a093b4bb5ce2941455a76463ccc1e7211b830eff75b63824df24f124eedc27ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-09T20:23:53Z","title_canon_sha256":"f028c6b8daa866e89ea053e5fc2e91ebf02be151020180dc0d6a81eae0cbfd74"},"schema_version":"1.0","source":{"id":"1109.2134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2134","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2134v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2134","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"IAPLM7XMUOCJ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IAPLM7XMUOCJBSDQ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IAPLM7XM","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:38bc249939bedd06b3d7832b8350f3c3f359465841bfb1ffa58b06c8ad4beedb","target":"graph","created_at":"2026-05-18T04:13: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":"This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers.  The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance.  This paper presents the theoretical basis for the ideas underlying ZAP, arguin","authors_text":"A. J. Parkes, E. M. Luks, H. E. Dixon, M. L. Ginsberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-09T20:23:53Z","title":"Generalizing Boolean Satisfiability II: Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2134","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:9dd1b636ec5744d0dee800bf4a93a92f68e88c6e1f02bd527c44c1788c217b95","target":"record","created_at":"2026-05-18T04:13: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":"a093b4bb5ce2941455a76463ccc1e7211b830eff75b63824df24f124eedc27ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-09T20:23:53Z","title_canon_sha256":"f028c6b8daa866e89ea053e5fc2e91ebf02be151020180dc0d6a81eae0cbfd74"},"schema_version":"1.0","source":{"id":"1109.2134","kind":"arxiv","version":1}},"canonical_sha256":"401eb67eeca38490c870994769324d3bac51c2ab54e50628361739947d51d69f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"401eb67eeca38490c870994769324d3bac51c2ab54e50628361739947d51d69f","first_computed_at":"2026-05-18T04:13:38.575559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:38.575559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k7HAw3peHxHC/tZol745iOkrkGEFXmUxofgoMv68Pze4ZCt0UKXqFFKMaX+ORDOOmSNJX+5qxBZ1hhgir6yVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:38.576147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dd1b636ec5744d0dee800bf4a93a92f68e88c6e1f02bd527c44c1788c217b95","sha256:38bc249939bedd06b3d7832b8350f3c3f359465841bfb1ffa58b06c8ad4beedb"],"state_sha256":"d030cdc01a2ac9abab38732418afa51d1ea976ad7411bf43be8481ba1b446cff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0M5idDN+hMnPv9LCoji8Jkie5IVcBRfNm2UFVmsN6P6pzRCpUUX8003pMcaIqXlYXEMUKZQ8iDI53pUI46TDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:15:39.034723Z","bundle_sha256":"7443e413992364a08e2d29faccb1eef9c49be646c84f8c7ba1715d650bef63b9"}}