{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6S4CN4YPY5FRIVR4CUU2TFJMVE","short_pith_number":"pith:6S4CN4YP","schema_version":"1.0","canonical_sha256":"f4b826f30fc74b14563c1529a9952ca91bddaef27aa5e38a1ec158b87a9c3fee","source":{"kind":"arxiv","id":"1704.02942","version":3},"attestation_state":"computed","paper":{"title":"The Boolean SATisfiability Problem in Clifford algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.MP"],"primary_cat":"math-ph","authors_text":"Marco Budinich","submitted_at":"2017-04-10T16:36:21Z","abstract_excerpt":"We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties."},"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":"1704.02942","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2017-04-10T16:36:21Z","cross_cats_sorted":["cs.CC","math.MP"],"title_canon_sha256":"3bb93edf25cbc714225837bc8ce9be36a58aae3a1ba7ee8fcd1701a1ee363c48","abstract_canon_sha256":"4a0ced93ef837ed724c800f7f0e93303316ed0c138a4480241921ab9d7480a13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:28.094505Z","signature_b64":"q6DRCNaDGVCe2LsArYCN1LD3c7oqFieE/nW+zMpwEoHGXYHfnQwLM5mQpi6m3FkrQWpj2tGFFs14VxA8WZdICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4b826f30fc74b14563c1529a9952ca91bddaef27aa5e38a1ec158b87a9c3fee","last_reissued_at":"2026-05-17T23:49:28.093824Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:28.093824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Boolean SATisfiability Problem in Clifford algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.MP"],"primary_cat":"math-ph","authors_text":"Marco Budinich","submitted_at":"2017-04-10T16:36:21Z","abstract_excerpt":"We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02942","kind":"arxiv","version":3},"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":"1704.02942","created_at":"2026-05-17T23:49:28.093934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02942v3","created_at":"2026-05-17T23:49:28.093934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02942","created_at":"2026-05-17T23:49:28.093934+00:00"},{"alias_kind":"pith_short_12","alias_value":"6S4CN4YPY5FR","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6S4CN4YPY5FRIVR4","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6S4CN4YP","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01961","citing_title":"A Satisfiability algorithm based on Simple Spinors of the Clifford algebra of $\\mathbb{R}^{n,n}$","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE","json":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE.json","graph_json":"https://pith.science/api/pith-number/6S4CN4YPY5FRIVR4CUU2TFJMVE/graph.json","events_json":"https://pith.science/api/pith-number/6S4CN4YPY5FRIVR4CUU2TFJMVE/events.json","paper":"https://pith.science/paper/6S4CN4YP"},"agent_actions":{"view_html":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE","download_json":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE.json","view_paper":"https://pith.science/paper/6S4CN4YP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02942&json=true","fetch_graph":"https://pith.science/api/pith-number/6S4CN4YPY5FRIVR4CUU2TFJMVE/graph.json","fetch_events":"https://pith.science/api/pith-number/6S4CN4YPY5FRIVR4CUU2TFJMVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE/action/storage_attestation","attest_author":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE/action/author_attestation","sign_citation":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE/action/citation_signature","submit_replication":"https://pith.science/pith/6S4CN4YPY5FRIVR4CUU2TFJMVE/action/replication_record"}},"created_at":"2026-05-17T23:49:28.093934+00:00","updated_at":"2026-05-17T23:49:28.093934+00:00"}