{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SSV3KQ3ZQZNBTPK3XVRJV7NVBS","short_pith_number":"pith:SSV3KQ3Z","schema_version":"1.0","canonical_sha256":"94abb54379865a19bd5bbd629afdb50c9989e21e59f05194fb5a356921657c8d","source":{"kind":"arxiv","id":"1207.5014","version":1},"attestation_state":"computed","paper":{"title":"Checking Satisfiability by Dependency Sequents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg, Panagiotis Manolios","submitted_at":"2012-07-20T18:28:53Z","abstract_excerpt":"We introduce a new algorithm for checking satisfiability based on a calculus of Dependency sequents (D-sequents). Given a CNF formula F(X), a D-sequent is a record stating that under a partial assignment a set of variables of X is redundant in formula \\exists{X}[F]. The D-sequent calculus is based on operation join that forms a new D-sequent from two existing D-sequents. The new algorithm solves the quantified version of SAT. That is, given a satisfiable formula F, it, in general, does not produce an assignment satisfying F.\n  The new algorithm is called DS-QSAT where DS stands for Dependency "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.5014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-20T18:28:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"68f95d139eddf26206fa3c1b82302045e9c269110c3b6be92a2fe69a86f441fc","abstract_canon_sha256":"9cda5af0a20db06d0be50b67fc506abdb268ff4c121fdfa1c68e99ee5a8f551f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:34.533197Z","signature_b64":"rUOvJPMkETVy0JlBBaKSc1d8mCMMGxlsVSOKj5hE6DM8xrp1YB/7PTGGOAwy/VCrI+vpfosE+BEO/byjKZ5EDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94abb54379865a19bd5bbd629afdb50c9989e21e59f05194fb5a356921657c8d","last_reissued_at":"2026-05-18T03:50:34.532448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:34.532448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checking Satisfiability by Dependency Sequents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg, Panagiotis Manolios","submitted_at":"2012-07-20T18:28:53Z","abstract_excerpt":"We introduce a new algorithm for checking satisfiability based on a calculus of Dependency sequents (D-sequents). Given a CNF formula F(X), a D-sequent is a record stating that under a partial assignment a set of variables of X is redundant in formula \\exists{X}[F]. The D-sequent calculus is based on operation join that forms a new D-sequent from two existing D-sequents. The new algorithm solves the quantified version of SAT. That is, given a satisfiable formula F, it, in general, does not produce an assignment satisfying F.\n  The new algorithm is called DS-QSAT where DS stands for Dependency "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5014","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.5014","created_at":"2026-05-18T03:50:34.532569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5014v1","created_at":"2026-05-18T03:50:34.532569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5014","created_at":"2026-05-18T03:50:34.532569+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSV3KQ3ZQZNB","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSV3KQ3ZQZNBTPK3","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSV3KQ3Z","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS","json":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS.json","graph_json":"https://pith.science/api/pith-number/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/graph.json","events_json":"https://pith.science/api/pith-number/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/events.json","paper":"https://pith.science/paper/SSV3KQ3Z"},"agent_actions":{"view_html":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS","download_json":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS.json","view_paper":"https://pith.science/paper/SSV3KQ3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5014&json=true","fetch_graph":"https://pith.science/api/pith-number/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/graph.json","fetch_events":"https://pith.science/api/pith-number/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/action/storage_attestation","attest_author":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/action/author_attestation","sign_citation":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/action/citation_signature","submit_replication":"https://pith.science/pith/SSV3KQ3ZQZNBTPK3XVRJV7NVBS/action/replication_record"}},"created_at":"2026-05-18T03:50:34.532569+00:00","updated_at":"2026-05-18T03:50:34.532569+00:00"}