{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PH46SMGX65H7M67HYV6STR7S4M","short_pith_number":"pith:PH46SMGX","schema_version":"1.0","canonical_sha256":"79f9e930d7f74ff67be7c57d29c7f2e33b82c6cce7bbd5cf09737a230d58c515","source":{"kind":"arxiv","id":"1803.04646","version":1},"attestation_state":"computed","paper":{"title":"On Cryptographic Attacks Using Backdoors for SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.AI","authors_text":"Alexander Semenov, Alexey Ignatiev, Ilya Otpuschennikov, Oleg Zaikin, Stepan Kochemazov","submitted_at":"2018-03-13T06:29:50Z","abstract_excerpt":"Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number of practical applications of SAT can only be tackled efficiently by identifying and exploiting a subset of formula's variables called backdoor set (or simply backdoors). This paper proposes a new class of backdoor sets for SAT used in the context of cryptographic attacks, namely guess-and-determine attacks. The idea is to identify the best set of backdoor variables subject to a statistically estimated hardness of th"},"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":"1803.04646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-13T06:29:50Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"a7e0ac98b3bc17bf77a908dcac6e1bbb51188dec7a97ed4af3927da13a934104","abstract_canon_sha256":"6dab597ad22aeb586a24e89e9b1a98491f724953ccc83fe2b7ff780fdb5685e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:18.305959Z","signature_b64":"OFYcuDXneLC9ZuTKk1DgUi8SmRg4/+k9fX2EnArt589smAMopCfj6kxVldcQuhpQr2RMlgSgFVTmS/1BBHLsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f9e930d7f74ff67be7c57d29c7f2e33b82c6cce7bbd5cf09737a230d58c515","last_reissued_at":"2026-05-18T00:21:18.305200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:18.305200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Cryptographic Attacks Using Backdoors for SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.AI","authors_text":"Alexander Semenov, Alexey Ignatiev, Ilya Otpuschennikov, Oleg Zaikin, Stepan Kochemazov","submitted_at":"2018-03-13T06:29:50Z","abstract_excerpt":"Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number of practical applications of SAT can only be tackled efficiently by identifying and exploiting a subset of formula's variables called backdoor set (or simply backdoors). This paper proposes a new class of backdoor sets for SAT used in the context of cryptographic attacks, namely guess-and-determine attacks. The idea is to identify the best set of backdoor variables subject to a statistically estimated hardness of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04646","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":"1803.04646","created_at":"2026-05-18T00:21:18.305300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04646v1","created_at":"2026-05-18T00:21:18.305300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04646","created_at":"2026-05-18T00:21:18.305300+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH46SMGX65H7","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH46SMGX65H7M67H","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH46SMGX","created_at":"2026-05-18T12:32:43.782077+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/PH46SMGX65H7M67HYV6STR7S4M","json":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M.json","graph_json":"https://pith.science/api/pith-number/PH46SMGX65H7M67HYV6STR7S4M/graph.json","events_json":"https://pith.science/api/pith-number/PH46SMGX65H7M67HYV6STR7S4M/events.json","paper":"https://pith.science/paper/PH46SMGX"},"agent_actions":{"view_html":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M","download_json":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M.json","view_paper":"https://pith.science/paper/PH46SMGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04646&json=true","fetch_graph":"https://pith.science/api/pith-number/PH46SMGX65H7M67HYV6STR7S4M/graph.json","fetch_events":"https://pith.science/api/pith-number/PH46SMGX65H7M67HYV6STR7S4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M/action/storage_attestation","attest_author":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M/action/author_attestation","sign_citation":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M/action/citation_signature","submit_replication":"https://pith.science/pith/PH46SMGX65H7M67HYV6STR7S4M/action/replication_record"}},"created_at":"2026-05-18T00:21:18.305300+00:00","updated_at":"2026-05-18T00:21:18.305300+00:00"}