{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:H63NURVB2ELNS5OV4ZE7VAVLAF","short_pith_number":"pith:H63NURVB","canonical_record":{"source":{"id":"cs/0702072","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2007-02-13T03:10:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"60457cbd3f35c083f9cd36030601851b2445f281902629e9398545859c6dd3bf","abstract_canon_sha256":"f41c9f22ea010dbfbb1aa97b86fc4326b3592489085ab216588080600a718471"},"schema_version":"1.0"},"canonical_sha256":"3fb6da46a1d116d975d5e649fa82ab0150703ee886305bf24a2af82a2c9803da","source":{"kind":"arxiv","id":"cs/0702072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702072","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702072v1","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702072","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"H63NURVB2ELN","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"H63NURVB2ELNS5OV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"H63NURVB","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:H63NURVB2ELNS5OV4ZE7VAVLAF","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0702072","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2007-02-13T03:10:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"60457cbd3f35c083f9cd36030601851b2445f281902629e9398545859c6dd3bf","abstract_canon_sha256":"f41c9f22ea010dbfbb1aa97b86fc4326b3592489085ab216588080600a718471"},"schema_version":"1.0"},"canonical_sha256":"3fb6da46a1d116d975d5e649fa82ab0150703ee886305bf24a2af82a2c9803da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.387863Z","signature_b64":"SFnTHDNGwmf9kbWh4R2Wb/tBZmR+7sqvYbJThNcXTDhWqAtBY3gVQJpkTiDkW9Dr+TqDRJ635ANTrCXY+kSGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb6da46a1d116d975d5e649fa82ab0150703ee886305bf24a2af82a2c9803da","last_reissued_at":"2026-05-18T04:41:26.387250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.387250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0702072","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:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLiNW7+PA43mUZ9ndo7/rjQGugVNjLtkTgU0I2N+4FaUA26hAKctqjDVQTZJdhS0uyvl7eMAiVBoeqR5/u6JCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:22.435534Z"},"content_sha256":"9bd4f10351f3b009013ff9710af7d2ac56c1e285498662e971d3f934df3524b3","schema_version":"1.0","event_id":"sha256:9bd4f10351f3b009013ff9710af7d2ac56c1e285498662e971d3f934df3524b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:H63NURVB2ELNS5OV4ZE7VAVLAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logic Programming with Satisfiability","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Michael Codish, Peter J. Stuckey, Vitaly Lagoon","submitted_at":"2007-02-13T03:10:02Z","abstract_excerpt":"This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic program- ming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm which we propose here as a logic programming pearl. To illustrate logic programming with SAT solving we give an example Prolog program which solves instances of Partial MAXSAT."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702072","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:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COsB5s6kXAPIgng73PolksAJfcy3MR5BlZ5z0D1Md9QEMEO8iZSgqsWZpmTFiJaRngnsJcSYXiobX81ToPAnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:22.436187Z"},"content_sha256":"38de369d1d19729124a8e72da5dc70e405be7bc02aa3b4f528997cc4281d2d4d","schema_version":"1.0","event_id":"sha256:38de369d1d19729124a8e72da5dc70e405be7bc02aa3b4f528997cc4281d2d4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/bundle.json","state_url":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/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-26T08:30:22Z","links":{"resolver":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF","bundle":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/bundle.json","state":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:H63NURVB2ELNS5OV4ZE7VAVLAF","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":"f41c9f22ea010dbfbb1aa97b86fc4326b3592489085ab216588080600a718471","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.PL","submitted_at":"2007-02-13T03:10:02Z","title_canon_sha256":"60457cbd3f35c083f9cd36030601851b2445f281902629e9398545859c6dd3bf"},"schema_version":"1.0","source":{"id":"cs/0702072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702072","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702072v1","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702072","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"H63NURVB2ELN","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"H63NURVB2ELNS5OV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"H63NURVB","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:38de369d1d19729124a8e72da5dc70e405be7bc02aa3b4f528997cc4281d2d4d","target":"graph","created_at":"2026-05-18T04:41:26Z","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 paper presents a Prolog interface to the MiniSat satisfiability solver. Logic program- ming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm which we propose here as a logic programming pearl. To illustrate logic programming with SAT solving we give an example Prolog program which solves instances of Partial MAXSAT.","authors_text":"Michael Codish, Peter J. Stuckey, Vitaly Lagoon","cross_cats":["cs.AI"],"headline":"","license":"","primary_cat":"cs.PL","submitted_at":"2007-02-13T03:10:02Z","title":"Logic Programming with Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702072","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:9bd4f10351f3b009013ff9710af7d2ac56c1e285498662e971d3f934df3524b3","target":"record","created_at":"2026-05-18T04:41:26Z","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":"f41c9f22ea010dbfbb1aa97b86fc4326b3592489085ab216588080600a718471","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.PL","submitted_at":"2007-02-13T03:10:02Z","title_canon_sha256":"60457cbd3f35c083f9cd36030601851b2445f281902629e9398545859c6dd3bf"},"schema_version":"1.0","source":{"id":"cs/0702072","kind":"arxiv","version":1}},"canonical_sha256":"3fb6da46a1d116d975d5e649fa82ab0150703ee886305bf24a2af82a2c9803da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fb6da46a1d116d975d5e649fa82ab0150703ee886305bf24a2af82a2c9803da","first_computed_at":"2026-05-18T04:41:26.387250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:26.387250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SFnTHDNGwmf9kbWh4R2Wb/tBZmR+7sqvYbJThNcXTDhWqAtBY3gVQJpkTiDkW9Dr+TqDRJ635ANTrCXY+kSGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:26.387863Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0702072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd4f10351f3b009013ff9710af7d2ac56c1e285498662e971d3f934df3524b3","sha256:38de369d1d19729124a8e72da5dc70e405be7bc02aa3b4f528997cc4281d2d4d"],"state_sha256":"8fd9c95f5418f8b107ab9990c36e969d41eab8faf7bea821a2d0fcdd42cc5385"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFrdsntV6MxhFkRWbqCRF/C7xd/NZOt0gBeHzSWMuN+CU8h8qpaIHQ6D/Zq5IgzNmJ2t6L+X9oO3Mycjx3DrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:30:22.439554Z","bundle_sha256":"a1ea06fa746907233b30eabcd9170d31042117db60d2e209f08ccd66aba3055c"}}