{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HOOLI6TFESW674GM74UZH4RR72","short_pith_number":"pith:HOOLI6TF","canonical_record":{"source":{"id":"1505.02325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-09T22:55:16Z","cross_cats_sorted":["cs.CR","math.OC"],"title_canon_sha256":"1c1459b3e232e27bdc25cee0bb37dc7fae83f9cd4574e8b957c05b69f0349839","abstract_canon_sha256":"21b6b97297278a35b9c1c96a8413584050729574c4fcbce4815dc089a475cb86"},"schema_version":"1.0"},"canonical_sha256":"3b9cb47a6524adeff0ccff2993f231fe80292b27b14b6b995fbf3538f8ff3fbc","source":{"kind":"arxiv","id":"1505.02325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02325","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02325v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02325","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"HOOLI6TFESW6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HOOLI6TFESW674GM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HOOLI6TF","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HOOLI6TFESW674GM74UZH4RR72","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-09T22:55:16Z","cross_cats_sorted":["cs.CR","math.OC"],"title_canon_sha256":"1c1459b3e232e27bdc25cee0bb37dc7fae83f9cd4574e8b957c05b69f0349839","abstract_canon_sha256":"21b6b97297278a35b9c1c96a8413584050729574c4fcbce4815dc089a475cb86"},"schema_version":"1.0"},"canonical_sha256":"3b9cb47a6524adeff0ccff2993f231fe80292b27b14b6b995fbf3538f8ff3fbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.185627Z","signature_b64":"uPsOg0rO11AT7mfAce00SNpkWSnLbzz7IK/W4ZxWMWfBIyBnBWH+cCv7xSaE3F31B7Rr2yb9KC4HgYVnpH5QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9cb47a6524adeff0ccff2993f231fe80292b27b14b6b995fbf3538f8ff3fbc","last_reissued_at":"2026-05-18T02:16:19.184523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.184523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02325","source_version":1,"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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfXR01AnjrO6+Hi6fQd9GwDNGehUlXJjl9SLbka0xzGBC+XMMSQMPX6yqbWYpMfxpuA/KruCgpUGFBWYjoxjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:19:10.870213Z"},"content_sha256":"aa9bc47f9d1e64b5476ac4301592466b414d7149280aca9b70e20aa1da88e9ac","schema_version":"1.0","event_id":"sha256:aa9bc47f9d1e64b5476ac4301592466b414d7149280aca9b70e20aa1da88e9ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HOOLI6TFESW674GM74UZH4RR72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Picking vs. Guessing Secrets: A Game-Theoretic Analysis (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC"],"primary_cat":"cs.GT","authors_text":"Carlos Cid, MHR Khouzani, Mudhakar Srivatsa, Piotr Mardziel","submitted_at":"2015-05-09T22:55:16Z","abstract_excerpt":"Choosing a hard-to-guess secret is a prerequisite in many security applications. Whether it is a password for user authentication or a secret key for a cryptographic primitive, picking it requires the user to trade-off usability costs with resistance against an adversary: a simple password is easier to remember but is also easier to guess; likewise, a shorter cryptographic key may require fewer computational and storage resources but it is also easier to attack. A fundamental question is how one can optimally resolve this trade-off. A big challenge is the fact that an adversary can also utiliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02325","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"},"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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGJskx3AbsbzNwZN9sTcuQr8HCqRxmpf3Ije2NH+MXlpy5RSn9x4CmRmgSNalmKllUzgDLvjTfdfHTHpdls/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:19:10.870577Z"},"content_sha256":"4e2692cb91cb39c8415947b6765935fe113b6163b0f119f16913307d0fdba685","schema_version":"1.0","event_id":"sha256:4e2692cb91cb39c8415947b6765935fe113b6163b0f119f16913307d0fdba685"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/bundle.json","state_url":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOOLI6TFESW674GM74UZH4RR72/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-20T10:19:10Z","links":{"resolver":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72","bundle":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/bundle.json","state":"https://pith.science/pith/HOOLI6TFESW674GM74UZH4RR72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOOLI6TFESW674GM74UZH4RR72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HOOLI6TFESW674GM74UZH4RR72","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":"21b6b97297278a35b9c1c96a8413584050729574c4fcbce4815dc089a475cb86","cross_cats_sorted":["cs.CR","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-09T22:55:16Z","title_canon_sha256":"1c1459b3e232e27bdc25cee0bb37dc7fae83f9cd4574e8b957c05b69f0349839"},"schema_version":"1.0","source":{"id":"1505.02325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02325","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02325v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02325","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"HOOLI6TFESW6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HOOLI6TFESW674GM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HOOLI6TF","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:4e2692cb91cb39c8415947b6765935fe113b6163b0f119f16913307d0fdba685","target":"graph","created_at":"2026-05-18T02:16:19Z","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":"Choosing a hard-to-guess secret is a prerequisite in many security applications. Whether it is a password for user authentication or a secret key for a cryptographic primitive, picking it requires the user to trade-off usability costs with resistance against an adversary: a simple password is easier to remember but is also easier to guess; likewise, a shorter cryptographic key may require fewer computational and storage resources but it is also easier to attack. A fundamental question is how one can optimally resolve this trade-off. A big challenge is the fact that an adversary can also utiliz","authors_text":"Carlos Cid, MHR Khouzani, Mudhakar Srivatsa, Piotr Mardziel","cross_cats":["cs.CR","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-09T22:55:16Z","title":"Picking vs. Guessing Secrets: A Game-Theoretic Analysis (Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02325","kind":"arxiv","version":1},"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:aa9bc47f9d1e64b5476ac4301592466b414d7149280aca9b70e20aa1da88e9ac","target":"record","created_at":"2026-05-18T02:16:19Z","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":"21b6b97297278a35b9c1c96a8413584050729574c4fcbce4815dc089a475cb86","cross_cats_sorted":["cs.CR","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-05-09T22:55:16Z","title_canon_sha256":"1c1459b3e232e27bdc25cee0bb37dc7fae83f9cd4574e8b957c05b69f0349839"},"schema_version":"1.0","source":{"id":"1505.02325","kind":"arxiv","version":1}},"canonical_sha256":"3b9cb47a6524adeff0ccff2993f231fe80292b27b14b6b995fbf3538f8ff3fbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b9cb47a6524adeff0ccff2993f231fe80292b27b14b6b995fbf3538f8ff3fbc","first_computed_at":"2026-05-18T02:16:19.184523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.184523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uPsOg0rO11AT7mfAce00SNpkWSnLbzz7IK/W4ZxWMWfBIyBnBWH+cCv7xSaE3F31B7Rr2yb9KC4HgYVnpH5QBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.185627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa9bc47f9d1e64b5476ac4301592466b414d7149280aca9b70e20aa1da88e9ac","sha256:4e2692cb91cb39c8415947b6765935fe113b6163b0f119f16913307d0fdba685"],"state_sha256":"3df30db48c17f430823ff2206d50f755def27b4782a2e5b1f88cc668fc5b28bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/ulUuJC63APoHndjwMm9CpdhM5rrhbAkq+gUQlk6RLzEKzDGwPm+sd+hsu9dM8rs5ogJWdfCGqtrw6ENPurDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:19:10.872409Z","bundle_sha256":"478a94088887b1c8adbbd92ac0fda947e89080851fadce07f18b27f09640f728"}}