{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WQ2GOKXEDLUZZPRJ7N3QJHH3IP","short_pith_number":"pith:WQ2GOKXE","schema_version":"1.0","canonical_sha256":"b434672ae41ae99cbe29fb77049cfb43d03cdf9c1a51fabacd87052c2c3ed78d","source":{"kind":"arxiv","id":"1712.09082","version":1},"attestation_state":"computed","paper":{"title":"Guesswork Subject to a Total Entropy Budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Ali Makhdoumi, Arman Rezaee, Ken Duffy, Muriel Medard","submitted_at":"2017-12-25T14:53:05Z","abstract_excerpt":"We consider an abstraction of computational security in password protected systems where a user draws a secret string of given length with i.i.d. characters from a finite alphabet, and an adversary would like to identify the secret string by querying, or guessing, the identity of the string. The concept of a \"total entropy budget\" on the chosen word by the user is natural, otherwise the chosen password would have arbitrary length and complexity. One intuitively expects that a password chosen from the uniform distribution is more secure. This is not the case, however, if we are considering only"},"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":"1712.09082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-25T14:53:05Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"af26d09836f270dfbd4bb72eeab699e8f8e554b118db44d5cfb3bb90193b7bc3","abstract_canon_sha256":"b5f05254b0d92a7a0b6a38a7868609486dbef4eb7bbd4b5ab645041e5bbc6d35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:14.467581Z","signature_b64":"1CdynPVRW3aXY821O4am6f0fZ6qLHrkxvWlr9z9qJ99Rr02muHvre5LdoR4yTr6p8/nF/sPjtv1YmHi4ahVUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b434672ae41ae99cbe29fb77049cfb43d03cdf9c1a51fabacd87052c2c3ed78d","last_reissued_at":"2026-05-18T00:27:14.467150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:14.467150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guesswork Subject to a Total Entropy Budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Ali Makhdoumi, Arman Rezaee, Ken Duffy, Muriel Medard","submitted_at":"2017-12-25T14:53:05Z","abstract_excerpt":"We consider an abstraction of computational security in password protected systems where a user draws a secret string of given length with i.i.d. characters from a finite alphabet, and an adversary would like to identify the secret string by querying, or guessing, the identity of the string. The concept of a \"total entropy budget\" on the chosen word by the user is natural, otherwise the chosen password would have arbitrary length and complexity. One intuitively expects that a password chosen from the uniform distribution is more secure. This is not the case, however, if we are considering only"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09082","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":"1712.09082","created_at":"2026-05-18T00:27:14.467209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09082v1","created_at":"2026-05-18T00:27:14.467209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09082","created_at":"2026-05-18T00:27:14.467209+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQ2GOKXEDLUZ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQ2GOKXEDLUZZPRJ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQ2GOKXE","created_at":"2026-05-18T12:31:53.515858+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/WQ2GOKXEDLUZZPRJ7N3QJHH3IP","json":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP.json","graph_json":"https://pith.science/api/pith-number/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/graph.json","events_json":"https://pith.science/api/pith-number/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/events.json","paper":"https://pith.science/paper/WQ2GOKXE"},"agent_actions":{"view_html":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP","download_json":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP.json","view_paper":"https://pith.science/paper/WQ2GOKXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09082&json=true","fetch_graph":"https://pith.science/api/pith-number/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/graph.json","fetch_events":"https://pith.science/api/pith-number/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/action/storage_attestation","attest_author":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/action/author_attestation","sign_citation":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/action/citation_signature","submit_replication":"https://pith.science/pith/WQ2GOKXEDLUZZPRJ7N3QJHH3IP/action/replication_record"}},"created_at":"2026-05-18T00:27:14.467209+00:00","updated_at":"2026-05-18T00:27:14.467209+00:00"}