{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WGFMUUS36THHSDQQOUKLSFV4OE","short_pith_number":"pith:WGFMUUS3","schema_version":"1.0","canonical_sha256":"b18aca525bf4ce790e107514b916bc713a95d3c803ab9b63753fe56ff98ce7ba","source":{"kind":"arxiv","id":"0909.1051","version":1},"attestation_state":"computed","paper":{"title":"Finding passwords by random walks: How long does it take?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","cs.DS","math.PR"],"primary_cat":"cs.CR","authors_text":"2), (2) Laboratory J.-V. Poncelet, 3) ((1) Dobrushin Mathematical Laboratory, (3) LPTMC, France), G. Kabatiansky (1, G.Oshanin (2, Independent University of Moscow, Institute of Information Transmission Problems, Moscow, Paris, Russia, University Pierre & Marie Curie","submitted_at":"2009-09-05T19:25:35Z","abstract_excerpt":"We compare an efficiency of a deterministic \"lawnmower\" and random search strategies for finding a prescribed sequence of letters (a password) of length M in which all letters are taken from the same Q-ary alphabet. We show that at best a random search takes two times longer than a \"lawnmower\" search."},"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":"0909.1051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2009-09-05T19:25:35Z","cross_cats_sorted":["cond-mat.other","cs.DS","math.PR"],"title_canon_sha256":"7be0bfbbb8f2eb7339891b081af16eb95bf7cc93a5ca4bd0dca1619a6d13f670","abstract_canon_sha256":"d80a37ab004db52158b713a7076b9cfb52a4457c090d0334295b57dd523347da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:59.420370Z","signature_b64":"ZrCrEFi0RSQKY7x+/f+GNDhLjsjnyef85FGj3ylI9UU+PQEIWQT9R7NCprE1kR5Hg1eoIp+bb9XtCNmHUkQYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b18aca525bf4ce790e107514b916bc713a95d3c803ab9b63753fe56ff98ce7ba","last_reissued_at":"2026-05-18T02:11:59.419613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:59.419613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding passwords by random walks: How long does it take?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","cs.DS","math.PR"],"primary_cat":"cs.CR","authors_text":"2), (2) Laboratory J.-V. Poncelet, 3) ((1) Dobrushin Mathematical Laboratory, (3) LPTMC, France), G. Kabatiansky (1, G.Oshanin (2, Independent University of Moscow, Institute of Information Transmission Problems, Moscow, Paris, Russia, University Pierre & Marie Curie","submitted_at":"2009-09-05T19:25:35Z","abstract_excerpt":"We compare an efficiency of a deterministic \"lawnmower\" and random search strategies for finding a prescribed sequence of letters (a password) of length M in which all letters are taken from the same Q-ary alphabet. We show that at best a random search takes two times longer than a \"lawnmower\" search."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1051","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":"0909.1051","created_at":"2026-05-18T02:11:59.419730+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.1051v1","created_at":"2026-05-18T02:11:59.419730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1051","created_at":"2026-05-18T02:11:59.419730+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGFMUUS36THH","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGFMUUS36THHSDQQ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGFMUUS3","created_at":"2026-05-18T12:26:02.257875+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/WGFMUUS36THHSDQQOUKLSFV4OE","json":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE.json","graph_json":"https://pith.science/api/pith-number/WGFMUUS36THHSDQQOUKLSFV4OE/graph.json","events_json":"https://pith.science/api/pith-number/WGFMUUS36THHSDQQOUKLSFV4OE/events.json","paper":"https://pith.science/paper/WGFMUUS3"},"agent_actions":{"view_html":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE","download_json":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE.json","view_paper":"https://pith.science/paper/WGFMUUS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.1051&json=true","fetch_graph":"https://pith.science/api/pith-number/WGFMUUS36THHSDQQOUKLSFV4OE/graph.json","fetch_events":"https://pith.science/api/pith-number/WGFMUUS36THHSDQQOUKLSFV4OE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE/action/storage_attestation","attest_author":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE/action/author_attestation","sign_citation":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE/action/citation_signature","submit_replication":"https://pith.science/pith/WGFMUUS36THHSDQQOUKLSFV4OE/action/replication_record"}},"created_at":"2026-05-18T02:11:59.419730+00:00","updated_at":"2026-05-18T02:11:59.419730+00:00"}