{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CBWWBYBZNSZRQUQAKS2Y33NQER","short_pith_number":"pith:CBWWBYBZ","canonical_record":{"source":{"id":"1302.5122","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-02-20T21:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"103b90c8336c22051cbd1cb5c27cac88f61273e789749e64a446fe54b3c60616","abstract_canon_sha256":"ce1b5ed4446d07c010aa2af8f59b6ebf0969714edbe27b300fc464f5b447fceb"},"schema_version":"1.0"},"canonical_sha256":"106d60e0396cb318520054b58dedb02473f78b10ccbe1b4d5c861ff44ddd78af","source":{"kind":"arxiv","id":"1302.5122","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5122","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5122v5","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5122","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"CBWWBYBZNSZR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CBWWBYBZNSZRQUQA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CBWWBYBZ","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CBWWBYBZNSZRQUQAKS2Y33NQER","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5122","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-02-20T21:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"103b90c8336c22051cbd1cb5c27cac88f61273e789749e64a446fe54b3c60616","abstract_canon_sha256":"ce1b5ed4446d07c010aa2af8f59b6ebf0969714edbe27b300fc464f5b447fceb"},"schema_version":"1.0"},"canonical_sha256":"106d60e0396cb318520054b58dedb02473f78b10ccbe1b4d5c861ff44ddd78af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:46.087647Z","signature_b64":"RD/v5xDNUumFXwf9mqxVpO8zDB3bgJPF91HPfRTCfB70Mluz2xt9vq6MxmPsMQ93Zdj0d8QJXKi/56POnEpWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"106d60e0396cb318520054b58dedb02473f78b10ccbe1b4d5c861ff44ddd78af","last_reissued_at":"2026-05-18T03:13:46.087008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:46.087008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5122","source_version":5,"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:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMmiXz6Ve/2ogvRS2MMtTSF73LC8r6othdHieewVtaxhv59FYLFs0RPXpgT45tuwOhLu0OSiF7iZyWgvvuqNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:18:44.523939Z"},"content_sha256":"5ee962f9ecdf319e26350c2779f20e1e4549e3542d6e31b50367150c31f7dc22","schema_version":"1.0","event_id":"sha256:5ee962f9ecdf319e26350c2779f20e1e4549e3542d6e31b50367150c31f7dc22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CBWWBYBZNSZRQUQAKS2Y33NQER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Naturally Rehearsing Passwords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anupam Datta, Jeremiah Blocki, Manuel Blum","submitted_at":"2013-02-20T21:16:43Z","abstract_excerpt":"We introduce quantitative usability and security models to guide the design of password management schemes --- systematic strategies to help users create and remember multiple passwords. In the same way that security proofs in cryptography are based on complexity-theoretic assumptions (e.g., hardness of factoring and discrete logarithm), we quantify usability by introducing usability assumptions. In particular, password management relies on assumptions about human memory, e.g., that a user who follows a particular rehearsal schedule will successfully maintain the corresponding memory. These as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5122","kind":"arxiv","version":5},"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:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IteM3Of6SbY3c6WxvUgOzSXHpPhO3C2VHaDaBs6OLfh6jZLDrBAltkpAwQXazgPEo6cr34cxp8ZaGRn+9/O/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:18:44.524292Z"},"content_sha256":"d6add1e9f69ecd14762cc0a5abe3fea3dfbdc518a2309a4ff58f26bfa3fd4222","schema_version":"1.0","event_id":"sha256:d6add1e9f69ecd14762cc0a5abe3fea3dfbdc518a2309a4ff58f26bfa3fd4222"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBWWBYBZNSZRQUQAKS2Y33NQER/bundle.json","state_url":"https://pith.science/pith/CBWWBYBZNSZRQUQAKS2Y33NQER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBWWBYBZNSZRQUQAKS2Y33NQER/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-31T05:18:44Z","links":{"resolver":"https://pith.science/pith/CBWWBYBZNSZRQUQAKS2Y33NQER","bundle":"https://pith.science/pith/CBWWBYBZNSZRQUQAKS2Y33NQER/bundle.json","state":"https://pith.science/pith/CBWWBYBZNSZRQUQAKS2Y33NQER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBWWBYBZNSZRQUQAKS2Y33NQER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CBWWBYBZNSZRQUQAKS2Y33NQER","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":"ce1b5ed4446d07c010aa2af8f59b6ebf0969714edbe27b300fc464f5b447fceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-02-20T21:16:43Z","title_canon_sha256":"103b90c8336c22051cbd1cb5c27cac88f61273e789749e64a446fe54b3c60616"},"schema_version":"1.0","source":{"id":"1302.5122","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5122","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5122v5","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5122","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"CBWWBYBZNSZR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CBWWBYBZNSZRQUQA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CBWWBYBZ","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:d6add1e9f69ecd14762cc0a5abe3fea3dfbdc518a2309a4ff58f26bfa3fd4222","target":"graph","created_at":"2026-05-18T03:13:46Z","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":"We introduce quantitative usability and security models to guide the design of password management schemes --- systematic strategies to help users create and remember multiple passwords. In the same way that security proofs in cryptography are based on complexity-theoretic assumptions (e.g., hardness of factoring and discrete logarithm), we quantify usability by introducing usability assumptions. In particular, password management relies on assumptions about human memory, e.g., that a user who follows a particular rehearsal schedule will successfully maintain the corresponding memory. These as","authors_text":"Anupam Datta, Jeremiah Blocki, Manuel Blum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-02-20T21:16:43Z","title":"Naturally Rehearsing Passwords"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5122","kind":"arxiv","version":5},"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:5ee962f9ecdf319e26350c2779f20e1e4549e3542d6e31b50367150c31f7dc22","target":"record","created_at":"2026-05-18T03:13:46Z","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":"ce1b5ed4446d07c010aa2af8f59b6ebf0969714edbe27b300fc464f5b447fceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-02-20T21:16:43Z","title_canon_sha256":"103b90c8336c22051cbd1cb5c27cac88f61273e789749e64a446fe54b3c60616"},"schema_version":"1.0","source":{"id":"1302.5122","kind":"arxiv","version":5}},"canonical_sha256":"106d60e0396cb318520054b58dedb02473f78b10ccbe1b4d5c861ff44ddd78af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"106d60e0396cb318520054b58dedb02473f78b10ccbe1b4d5c861ff44ddd78af","first_computed_at":"2026-05-18T03:13:46.087008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:46.087008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RD/v5xDNUumFXwf9mqxVpO8zDB3bgJPF91HPfRTCfB70Mluz2xt9vq6MxmPsMQ93Zdj0d8QJXKi/56POnEpWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:46.087647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5122","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ee962f9ecdf319e26350c2779f20e1e4549e3542d6e31b50367150c31f7dc22","sha256:d6add1e9f69ecd14762cc0a5abe3fea3dfbdc518a2309a4ff58f26bfa3fd4222"],"state_sha256":"72e02d618bc31fdf25cf4ca9be15ea4b9e40a0e964224b2846959f42f636c7df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QR7tN4aCnmb8twqxugg4joJzlF90nUCCq744NcfuDZrPAKif99oFZdfqJqj+OLRyCUJvCwYLTgmGYU9JAlU8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:18:44.526401Z","bundle_sha256":"898d045ef7354ebff2e87ef49e69200e693122b84abd6be66024fe3f3deb68d6"}}