{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BTBVVNLJI3A5NSTKDLYTB4Z2DY","short_pith_number":"pith:BTBVVNLJ","schema_version":"1.0","canonical_sha256":"0cc35ab56946c1d6ca6a1af130f33a1e0ca9b1db1854390e6df4ebf379e56c1c","source":{"kind":"arxiv","id":"1906.00029","version":1},"attestation_state":"computed","paper":{"title":"Human-Usable Password Schemas: Beyond Information-Theoretic Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CY"],"primary_cat":"cs.CR","authors_text":"Elan Rosenfeld, Manuel Blum, Santosh Vempala","submitted_at":"2019-05-31T18:51:18Z","abstract_excerpt":"Password users frequently employ passwords that are too simple, or they just reuse passwords for multiple websites. A common complaint is that utilizing secure passwords is too difficult. One possible solution to this problem is to use a password schema. Password schemas are deterministic functions which map challenges (typically the website name) to responses (passwords). Previous work has been done on developing and analyzing publishable schemas, but these analyses have been information-theoretic, not complexity-theoretic; they consider an adversary with infinite computing power.\n  We perfor"},"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":"1906.00029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-31T18:51:18Z","cross_cats_sorted":["cs.CC","cs.CY"],"title_canon_sha256":"ef35123e414f3c8167ac69136b4e2c5141f9798d3919bef6a46ad6ad725e506d","abstract_canon_sha256":"5f69d3d747baa09d6ae08b06041a9e8264cfd4489caf7e9969a0024298e168f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:33.670035Z","signature_b64":"TC5v++AHKgOE+Hpj5I8iltQK42G2wznyxTPl4QKLg8wSIQxpmjX39uK5UDK/8OMJUE9Ury5gnqJCLvItg9mDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc35ab56946c1d6ca6a1af130f33a1e0ca9b1db1854390e6df4ebf379e56c1c","last_reissued_at":"2026-05-17T23:44:33.669549Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:33.669549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Human-Usable Password Schemas: Beyond Information-Theoretic Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CY"],"primary_cat":"cs.CR","authors_text":"Elan Rosenfeld, Manuel Blum, Santosh Vempala","submitted_at":"2019-05-31T18:51:18Z","abstract_excerpt":"Password users frequently employ passwords that are too simple, or they just reuse passwords for multiple websites. A common complaint is that utilizing secure passwords is too difficult. One possible solution to this problem is to use a password schema. Password schemas are deterministic functions which map challenges (typically the website name) to responses (passwords). Previous work has been done on developing and analyzing publishable schemas, but these analyses have been information-theoretic, not complexity-theoretic; they consider an adversary with infinite computing power.\n  We perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00029","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":"1906.00029","created_at":"2026-05-17T23:44:33.669628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00029v1","created_at":"2026-05-17T23:44:33.669628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00029","created_at":"2026-05-17T23:44:33.669628+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTBVVNLJI3A5","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTBVVNLJI3A5NSTK","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTBVVNLJ","created_at":"2026-05-18T12:33:12.712433+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/BTBVVNLJI3A5NSTKDLYTB4Z2DY","json":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY.json","graph_json":"https://pith.science/api/pith-number/BTBVVNLJI3A5NSTKDLYTB4Z2DY/graph.json","events_json":"https://pith.science/api/pith-number/BTBVVNLJI3A5NSTKDLYTB4Z2DY/events.json","paper":"https://pith.science/paper/BTBVVNLJ"},"agent_actions":{"view_html":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY","download_json":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY.json","view_paper":"https://pith.science/paper/BTBVVNLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00029&json=true","fetch_graph":"https://pith.science/api/pith-number/BTBVVNLJI3A5NSTKDLYTB4Z2DY/graph.json","fetch_events":"https://pith.science/api/pith-number/BTBVVNLJI3A5NSTKDLYTB4Z2DY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY/action/storage_attestation","attest_author":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY/action/author_attestation","sign_citation":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY/action/citation_signature","submit_replication":"https://pith.science/pith/BTBVVNLJI3A5NSTKDLYTB4Z2DY/action/replication_record"}},"created_at":"2026-05-17T23:44:33.669628+00:00","updated_at":"2026-05-17T23:44:33.669628+00:00"}