{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5UL4C4J7INPNU7K7XETBKIQFTX","short_pith_number":"pith:5UL4C4J7","canonical_record":{"source":{"id":"1301.6356","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T14:17:54Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"91eb5f51fbbbc2578ddd11ba1f688b5aa81cafefabdd832d1d35ad9c25a7de4d","abstract_canon_sha256":"11ff42faedd542d85500a5c73a16c61b3014ad937f9c431d7c0d4431110484a3"},"schema_version":"1.0"},"canonical_sha256":"ed17c1713f435eda7d5fb9261522059de5f2b2250ec1d848bfbbb646a0b0eba5","source":{"kind":"arxiv","id":"1301.6356","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6356","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6356v3","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6356","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"5UL4C4J7INPN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5UL4C4J7INPNU7K7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5UL4C4J7","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5UL4C4J7INPNU7K7XETBKIQFTX","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6356","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T14:17:54Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"91eb5f51fbbbc2578ddd11ba1f688b5aa81cafefabdd832d1d35ad9c25a7de4d","abstract_canon_sha256":"11ff42faedd542d85500a5c73a16c61b3014ad937f9c431d7c0d4431110484a3"},"schema_version":"1.0"},"canonical_sha256":"ed17c1713f435eda7d5fb9261522059de5f2b2250ec1d848bfbbb646a0b0eba5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:58.684256Z","signature_b64":"WWCs3Gc4/ZaV4wmSVjfbqfmsXdNrAYymU2wmCytCtqO8sYQxb4n0e+bc4Ts1c/mFfxnXO1M7QODa/HpUYvI8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed17c1713f435eda7d5fb9261522059de5f2b2250ec1d848bfbbb646a0b0eba5","last_reissued_at":"2026-05-18T03:25:58.683435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:58.683435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6356","source_version":3,"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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VktXraXuow9Hfy4Bvkweep0FEqmBW2KLxMe4gVgSAmf1WOj16CfZ1K07T6vSIL/PiGRKFuqKc/EYioTbcn+bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:12:04.065413Z"},"content_sha256":"ea6118fd002d9c33353bdb694933da254cc09d4f2791a98b7e5592d4d165c49c","schema_version":"1.0","event_id":"sha256:ea6118fd002d9c33353bdb694933da254cc09d4f2791a98b7e5592d4d165c49c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5UL4C4J7INPNU7K7XETBKIQFTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Brute force searching, the typical set and Guesswork","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Flavio du Pin Calmon, Ken R. Duffy, Mark M. Christiansen, Muriel Medard","submitted_at":"2013-01-27T14:17:54Z","abstract_excerpt":"Consider the situation where a word is chosen probabilistically from a finite list. If an attacker knows the list and can inquire about each word in turn, then selecting the word via the uniform distribution maximizes the attacker's difficulty, its Guesswork, in identifying the chosen word. It is tempting to use this property in cryptanalysis of computationally secure ciphers by assuming coded words are drawn from a source's typical set and so, for all intents and purposes, uniformly distributed within it. By applying recent results on Guesswork, for i.i.d. sources it is this equipartition ans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6356","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"},"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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4LuWLvvnd2YQnKO4uqxJBY7FuycFxdYWXuZoL0PMktgeSgLComEfCxwy2YIRR+c9rqWppGj3CjVngB9xBz3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:12:04.065763Z"},"content_sha256":"8ff43027e0e178ad5a2f4575fa4c923507de2d52515a5cecc325eefa03299930","schema_version":"1.0","event_id":"sha256:8ff43027e0e178ad5a2f4575fa4c923507de2d52515a5cecc325eefa03299930"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UL4C4J7INPNU7K7XETBKIQFTX/bundle.json","state_url":"https://pith.science/pith/5UL4C4J7INPNU7K7XETBKIQFTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UL4C4J7INPNU7K7XETBKIQFTX/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-06-03T05:12:04Z","links":{"resolver":"https://pith.science/pith/5UL4C4J7INPNU7K7XETBKIQFTX","bundle":"https://pith.science/pith/5UL4C4J7INPNU7K7XETBKIQFTX/bundle.json","state":"https://pith.science/pith/5UL4C4J7INPNU7K7XETBKIQFTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UL4C4J7INPNU7K7XETBKIQFTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5UL4C4J7INPNU7K7XETBKIQFTX","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":"11ff42faedd542d85500a5c73a16c61b3014ad937f9c431d7c0d4431110484a3","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T14:17:54Z","title_canon_sha256":"91eb5f51fbbbc2578ddd11ba1f688b5aa81cafefabdd832d1d35ad9c25a7de4d"},"schema_version":"1.0","source":{"id":"1301.6356","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6356","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6356v3","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6356","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"5UL4C4J7INPN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5UL4C4J7INPNU7K7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5UL4C4J7","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:8ff43027e0e178ad5a2f4575fa4c923507de2d52515a5cecc325eefa03299930","target":"graph","created_at":"2026-05-18T03:25:58Z","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":"Consider the situation where a word is chosen probabilistically from a finite list. If an attacker knows the list and can inquire about each word in turn, then selecting the word via the uniform distribution maximizes the attacker's difficulty, its Guesswork, in identifying the chosen word. It is tempting to use this property in cryptanalysis of computationally secure ciphers by assuming coded words are drawn from a source's typical set and so, for all intents and purposes, uniformly distributed within it. By applying recent results on Guesswork, for i.i.d. sources it is this equipartition ans","authors_text":"Flavio du Pin Calmon, Ken R. Duffy, Mark M. Christiansen, Muriel Medard","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T14:17:54Z","title":"Brute force searching, the typical set and Guesswork"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6356","kind":"arxiv","version":3},"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:ea6118fd002d9c33353bdb694933da254cc09d4f2791a98b7e5592d4d165c49c","target":"record","created_at":"2026-05-18T03:25:58Z","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":"11ff42faedd542d85500a5c73a16c61b3014ad937f9c431d7c0d4431110484a3","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T14:17:54Z","title_canon_sha256":"91eb5f51fbbbc2578ddd11ba1f688b5aa81cafefabdd832d1d35ad9c25a7de4d"},"schema_version":"1.0","source":{"id":"1301.6356","kind":"arxiv","version":3}},"canonical_sha256":"ed17c1713f435eda7d5fb9261522059de5f2b2250ec1d848bfbbb646a0b0eba5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed17c1713f435eda7d5fb9261522059de5f2b2250ec1d848bfbbb646a0b0eba5","first_computed_at":"2026-05-18T03:25:58.683435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:58.683435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWCs3Gc4/ZaV4wmSVjfbqfmsXdNrAYymU2wmCytCtqO8sYQxb4n0e+bc4Ts1c/mFfxnXO1M7QODa/HpUYvI8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:58.684256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6356","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea6118fd002d9c33353bdb694933da254cc09d4f2791a98b7e5592d4d165c49c","sha256:8ff43027e0e178ad5a2f4575fa4c923507de2d52515a5cecc325eefa03299930"],"state_sha256":"4cf1654e7a0c7f8c874071c302c0dcb39281bcaa171bb1f413ad9a6de94afe27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkRy7bFNdvvbus+9uDbd/WDFdInuIU/xIjnUe4/IrZpyF+aufSoMIl/1OBrdz9Wc6QY2VahAo/x64w6gtDFxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:12:04.067802Z","bundle_sha256":"57d021702c0dad94b8488af17cd19249cdce5369db73082aa48029d08f8a0bd1"}}