{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:73543EJYM4IVYZYAE77EA4WOSW","short_pith_number":"pith:73543EJY","canonical_record":{"source":{"id":"2012.15229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-12-30T17:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"23ba508e20ee7f0e911eac6ebb1bfd595fe0f3eb3e31fda871a3cf297da825f9","abstract_canon_sha256":"8307271f922e6adbea9896ff4d9c4e2514cab7f721dda0dec7814077e739b1e5"},"schema_version":"1.0"},"canonical_sha256":"fefbcd913867115c670027fe4072ce95bab94f9675d29931bc1ecdb6db39804e","source":{"kind":"arxiv","id":"2012.15229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15229","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15229v2","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15229","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"pith_short_12","alias_value":"73543EJYM4IV","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"pith_short_16","alias_value":"73543EJYM4IVYZYA","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"pith_short_8","alias_value":"73543EJY","created_at":"2026-07-05T02:45:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:73543EJYM4IVYZYAE77EA4WOSW","target":"record","payload":{"canonical_record":{"source":{"id":"2012.15229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-12-30T17:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"23ba508e20ee7f0e911eac6ebb1bfd595fe0f3eb3e31fda871a3cf297da825f9","abstract_canon_sha256":"8307271f922e6adbea9896ff4d9c4e2514cab7f721dda0dec7814077e739b1e5"},"schema_version":"1.0"},"canonical_sha256":"fefbcd913867115c670027fe4072ce95bab94f9675d29931bc1ecdb6db39804e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:45:35.470122Z","signature_b64":"oq/wRrGgtOOd3Loz1qq8+CSUAN8PAu8XyfUAko5+Tz3GlW1EXjtx28K2/NBLrs2HZEOTixNZql+nIddf4ZLrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefbcd913867115c670027fe4072ce95bab94f9675d29931bc1ecdb6db39804e","last_reissued_at":"2026-07-05T02:45:35.469651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:45:35.469651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.15229","source_version":2,"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-07-05T02:45:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9Y6bDSPQtl7ZUnVGbUJI6sgLt6Q9pQ5uYuhT3P0omSCwQG5N3PtFpF7hj/Zaqk7lnSGCzIppLzF/lJTB159Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:34:48.780179Z"},"content_sha256":"0d72806edb2d9de62fe04d04ea8e2c21b001654fe12ce301d3b504b6c190acbc","schema_version":"1.0","event_id":"sha256:0d72806edb2d9de62fe04d04ea8e2c21b001654fe12ce301d3b504b6c190acbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:73543EJYM4IVYZYAE77EA4WOSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Sequence-to-Sequence Models Crack Substitution Ciphers?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jonathan May, Nada Aldarrab","submitted_at":"2020-12-30T17:16:33Z","abstract_excerpt":"Decipherment of historical ciphers is a challenging problem. The language of the target plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art decipherment methods use beam search and a neural language model to score candidate plaintext hypotheses for a given cipher, assuming the plaintext language is known. We propose an end-to-end multilingual model for solving simple substitution ciphers. We test our model on synthetic and real historical ciphers and show that our proposed method can decipher text without explicit language identification while still being robus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15229","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.15229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:45:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdtMdfyTNXV//MKJ+RL2acqlmkNR8ki2ugVC2PK7AVfntmpUpEyfM3bg1nHSzPg+rtx5YUri1oTO1vpCXcDAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:34:48.781223Z"},"content_sha256":"afb6996cd4128296a2c52197d3101e8e7883fda38685655590f44a1818893bf9","schema_version":"1.0","event_id":"sha256:afb6996cd4128296a2c52197d3101e8e7883fda38685655590f44a1818893bf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73543EJYM4IVYZYAE77EA4WOSW/bundle.json","state_url":"https://pith.science/pith/73543EJYM4IVYZYAE77EA4WOSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73543EJYM4IVYZYAE77EA4WOSW/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-08-05T16:34:48Z","links":{"resolver":"https://pith.science/pith/73543EJYM4IVYZYAE77EA4WOSW","bundle":"https://pith.science/pith/73543EJYM4IVYZYAE77EA4WOSW/bundle.json","state":"https://pith.science/pith/73543EJYM4IVYZYAE77EA4WOSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73543EJYM4IVYZYAE77EA4WOSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:73543EJYM4IVYZYAE77EA4WOSW","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":"8307271f922e6adbea9896ff4d9c4e2514cab7f721dda0dec7814077e739b1e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-12-30T17:16:33Z","title_canon_sha256":"23ba508e20ee7f0e911eac6ebb1bfd595fe0f3eb3e31fda871a3cf297da825f9"},"schema_version":"1.0","source":{"id":"2012.15229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15229","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15229v2","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15229","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"pith_short_12","alias_value":"73543EJYM4IV","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"pith_short_16","alias_value":"73543EJYM4IVYZYA","created_at":"2026-07-05T02:45:35Z"},{"alias_kind":"pith_short_8","alias_value":"73543EJY","created_at":"2026-07-05T02:45:35Z"}],"graph_snapshots":[{"event_id":"sha256:afb6996cd4128296a2c52197d3101e8e7883fda38685655590f44a1818893bf9","target":"graph","created_at":"2026-07-05T02:45:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.15229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decipherment of historical ciphers is a challenging problem. The language of the target plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art decipherment methods use beam search and a neural language model to score candidate plaintext hypotheses for a given cipher, assuming the plaintext language is known. We propose an end-to-end multilingual model for solving simple substitution ciphers. We test our model on synthetic and real historical ciphers and show that our proposed method can decipher text without explicit language identification while still being robus","authors_text":"Jonathan May, Nada Aldarrab","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-12-30T17:16:33Z","title":"Can Sequence-to-Sequence Models Crack Substitution Ciphers?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15229","kind":"arxiv","version":2},"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:0d72806edb2d9de62fe04d04ea8e2c21b001654fe12ce301d3b504b6c190acbc","target":"record","created_at":"2026-07-05T02:45:35Z","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":"8307271f922e6adbea9896ff4d9c4e2514cab7f721dda0dec7814077e739b1e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-12-30T17:16:33Z","title_canon_sha256":"23ba508e20ee7f0e911eac6ebb1bfd595fe0f3eb3e31fda871a3cf297da825f9"},"schema_version":"1.0","source":{"id":"2012.15229","kind":"arxiv","version":2}},"canonical_sha256":"fefbcd913867115c670027fe4072ce95bab94f9675d29931bc1ecdb6db39804e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fefbcd913867115c670027fe4072ce95bab94f9675d29931bc1ecdb6db39804e","first_computed_at":"2026-07-05T02:45:35.469651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:45:35.469651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oq/wRrGgtOOd3Loz1qq8+CSUAN8PAu8XyfUAko5+Tz3GlW1EXjtx28K2/NBLrs2HZEOTixNZql+nIddf4ZLrAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:45:35.470122Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.15229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d72806edb2d9de62fe04d04ea8e2c21b001654fe12ce301d3b504b6c190acbc","sha256:afb6996cd4128296a2c52197d3101e8e7883fda38685655590f44a1818893bf9"],"state_sha256":"bdd135b75393f4381f3942582ffa669e110e30371d0030e5a4b5f8d1b8816a3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExtRWXjebYDfFU1eyGrvcjanQy/8eVRnWVZvjYItMJs7BVzqgtNolRW3f7W0DuSaDVZ+F0lcltLcfcv17TMTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T16:34:48.796658Z","bundle_sha256":"b966acb1dc7e945657afe7a1294c44e2ad4bf326498ad9c8a61513540417a9cc"}}