{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GGF7TSTXVUJLBKCRL5IKOMROWY","short_pith_number":"pith:GGF7TSTX","schema_version":"1.0","canonical_sha256":"318bf9ca77ad12b0a8515f50a7322eb61ae6f5323daaa7c2327ef1259f657b1c","source":{"kind":"arxiv","id":"1411.5433","version":1},"attestation_state":"computed","paper":{"title":"Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Alexander Semenov, Ilya Otpuschennikov, Oleg Zaikin","submitted_at":"2014-11-20T03:42:13Z","abstract_excerpt":"In this paper we describe the volunteer computing project SAT@home, developed and maintained by us. This project is aimed at solving hard instances of the Boolean satisfiability problem (SAT). We believe that this project can be a useful tool for computational study of inversion problems of some cryptographic functions. In particular we describe a series of experiments performed in SAT@home on the cryptanalysis of the widely known keystream generator A5/1. In all experiments we analyzed one known burst (114 bits) of keystream produced by A5/1. Before the cryptanalysis itself there is a stage o"},"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":"1411.5433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-20T03:42:13Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"b8cdb8e3078aeb0a77f2d3fe600b706ae451fad14dc8d1b79d7605620d42666b","abstract_canon_sha256":"a23679e80152412ca9cada0bbc80af99088aba2091ba41766ac4b0d882828557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:24.667009Z","signature_b64":"HCyvhTMkCH4eDdeTPSwfTdXMboxJZyOg9RbN3AHQYqkdCCQUp8Ck72aRG1l8I3NBkGveKgWSQXvgIsk8/lDsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"318bf9ca77ad12b0a8515f50a7322eb61ae6f5323daaa7c2327ef1259f657b1c","last_reissued_at":"2026-05-18T02:33:24.666543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:24.666543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Alexander Semenov, Ilya Otpuschennikov, Oleg Zaikin","submitted_at":"2014-11-20T03:42:13Z","abstract_excerpt":"In this paper we describe the volunteer computing project SAT@home, developed and maintained by us. This project is aimed at solving hard instances of the Boolean satisfiability problem (SAT). We believe that this project can be a useful tool for computational study of inversion problems of some cryptographic functions. In particular we describe a series of experiments performed in SAT@home on the cryptanalysis of the widely known keystream generator A5/1. In all experiments we analyzed one known burst (114 bits) of keystream produced by A5/1. Before the cryptanalysis itself there is a stage o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5433","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":"1411.5433","created_at":"2026-05-18T02:33:24.666619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5433v1","created_at":"2026-05-18T02:33:24.666619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5433","created_at":"2026-05-18T02:33:24.666619+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGF7TSTXVUJL","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGF7TSTXVUJLBKCR","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGF7TSTX","created_at":"2026-05-18T12:28:30.664211+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/GGF7TSTXVUJLBKCRL5IKOMROWY","json":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY.json","graph_json":"https://pith.science/api/pith-number/GGF7TSTXVUJLBKCRL5IKOMROWY/graph.json","events_json":"https://pith.science/api/pith-number/GGF7TSTXVUJLBKCRL5IKOMROWY/events.json","paper":"https://pith.science/paper/GGF7TSTX"},"agent_actions":{"view_html":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY","download_json":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY.json","view_paper":"https://pith.science/paper/GGF7TSTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5433&json=true","fetch_graph":"https://pith.science/api/pith-number/GGF7TSTXVUJLBKCRL5IKOMROWY/graph.json","fetch_events":"https://pith.science/api/pith-number/GGF7TSTXVUJLBKCRL5IKOMROWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/action/storage_attestation","attest_author":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/action/author_attestation","sign_citation":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/action/citation_signature","submit_replication":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/action/replication_record"}},"created_at":"2026-05-18T02:33:24.666619+00:00","updated_at":"2026-05-18T02:33:24.666619+00:00"}