{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GGF7TSTXVUJLBKCRL5IKOMROWY","short_pith_number":"pith:GGF7TSTX","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"},"canonical_sha256":"318bf9ca77ad12b0a8515f50a7322eb61ae6f5323daaa7c2327ef1259f657b1c","source":{"kind":"arxiv","id":"1411.5433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5433","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5433v1","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5433","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"GGF7TSTXVUJL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GGF7TSTXVUJLBKCR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GGF7TSTX","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GGF7TSTXVUJLBKCRL5IKOMROWY","target":"record","payload":{"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"},"canonical_sha256":"318bf9ca77ad12b0a8515f50a7322eb61ae6f5323daaa7c2327ef1259f657b1c","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"},"source_kind":"arxiv","source_id":"1411.5433","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-18T02:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mu2/CRORylPsqzFlyVkpq4qh4mborlQFXMEb9IGK/VP0xsInmyX67h81iA33F0HN0oH5/S2YIKUICBKUzGcmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:52:05.494553Z"},"content_sha256":"c4d3beeec92933b7f37f22af30800022897f03a64997d81eeb883cace7e2d27d","schema_version":"1.0","event_id":"sha256:c4d3beeec92933b7f37f22af30800022897f03a64997d81eeb883cace7e2d27d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GGF7TSTXVUJLBKCRL5IKOMROWY","target":"graph","payload":{"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"},"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-18T02:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xqxQ4MJL/JXg29rqniiYmHbRcuYpWLBtmpFGlrknmJOTX7NSfW30/jLmK9ayo0/q5X+TMM2DDhHbQ6Xd7e4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:52:05.495213Z"},"content_sha256":"ac260cac91868d0b1409149eb299022fc303a8922891b77542d512bbd91f9b60","schema_version":"1.0","event_id":"sha256:ac260cac91868d0b1409149eb299022fc303a8922891b77542d512bbd91f9b60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/bundle.json","state_url":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/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-27T05:52:05Z","links":{"resolver":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY","bundle":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/bundle.json","state":"https://pith.science/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGF7TSTXVUJLBKCRL5IKOMROWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GGF7TSTXVUJLBKCRL5IKOMROWY","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":"a23679e80152412ca9cada0bbc80af99088aba2091ba41766ac4b0d882828557","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-20T03:42:13Z","title_canon_sha256":"b8cdb8e3078aeb0a77f2d3fe600b706ae451fad14dc8d1b79d7605620d42666b"},"schema_version":"1.0","source":{"id":"1411.5433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5433","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5433v1","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5433","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"GGF7TSTXVUJL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GGF7TSTXVUJLBKCR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GGF7TSTX","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:ac260cac91868d0b1409149eb299022fc303a8922891b77542d512bbd91f9b60","target":"graph","created_at":"2026-05-18T02:33:24Z","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":"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","authors_text":"Alexander Semenov, Ilya Otpuschennikov, Oleg Zaikin","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-20T03:42:13Z","title":"Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5433","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:c4d3beeec92933b7f37f22af30800022897f03a64997d81eeb883cace7e2d27d","target":"record","created_at":"2026-05-18T02:33:24Z","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":"a23679e80152412ca9cada0bbc80af99088aba2091ba41766ac4b0d882828557","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-20T03:42:13Z","title_canon_sha256":"b8cdb8e3078aeb0a77f2d3fe600b706ae451fad14dc8d1b79d7605620d42666b"},"schema_version":"1.0","source":{"id":"1411.5433","kind":"arxiv","version":1}},"canonical_sha256":"318bf9ca77ad12b0a8515f50a7322eb61ae6f5323daaa7c2327ef1259f657b1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"318bf9ca77ad12b0a8515f50a7322eb61ae6f5323daaa7c2327ef1259f657b1c","first_computed_at":"2026-05-18T02:33:24.666543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:24.666543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HCyvhTMkCH4eDdeTPSwfTdXMboxJZyOg9RbN3AHQYqkdCCQUp8Ck72aRG1l8I3NBkGveKgWSQXvgIsk8/lDsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:24.667009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4d3beeec92933b7f37f22af30800022897f03a64997d81eeb883cace7e2d27d","sha256:ac260cac91868d0b1409149eb299022fc303a8922891b77542d512bbd91f9b60"],"state_sha256":"8e84720e091a3e9a6873a59de701a7be8588044e41c0a18bfd6641a2e9e2bbdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TWmnKxx/Nv+KjEuM5Wjpq9Hve8vcO7LnqI2qum6oLl03kvTAdcMI7SoFmj0QMRpT1MaB6VFn8otglTzpztWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:52:05.498499Z","bundle_sha256":"06d296df7ab49a5424e884ea632382f423c9805ad775c44c29ad9d9e4bfe16d5"}}