{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VONX2GAQV4MN6R7H2C6QZBRRFM","short_pith_number":"pith:VONX2GAQ","canonical_record":{"source":{"id":"1105.6212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-05-31T09:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"b197238d65271d5a2e5684e64c9bd148666d709d4bcd16654781b1f505c06d61","abstract_canon_sha256":"c5f5c0cb33a742a9cd65eb22d0d4ebc23a153339e3a45fd0014511c49bfce497"},"schema_version":"1.0"},"canonical_sha256":"ab9b7d1810af18df47e7d0bd0c86312b00a0ddd1d8fb351e219f869870f77c0b","source":{"kind":"arxiv","id":"1105.6212","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6212","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6212v2","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6212","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"VONX2GAQV4MN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VONX2GAQV4MN6R7H","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VONX2GAQ","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VONX2GAQV4MN6R7H2C6QZBRRFM","target":"record","payload":{"canonical_record":{"source":{"id":"1105.6212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-05-31T09:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"b197238d65271d5a2e5684e64c9bd148666d709d4bcd16654781b1f505c06d61","abstract_canon_sha256":"c5f5c0cb33a742a9cd65eb22d0d4ebc23a153339e3a45fd0014511c49bfce497"},"schema_version":"1.0"},"canonical_sha256":"ab9b7d1810af18df47e7d0bd0c86312b00a0ddd1d8fb351e219f869870f77c0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:54.874049Z","signature_b64":"aoxMPeSdX3Xtt4UhxMAxGKXYl3iRtg7m0KAmf61bu458PSLK35B9PoJaaQbqYivPt+XH0S97FiuXjRq3VpzZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9b7d1810af18df47e7d0bd0c86312b00a0ddd1d8fb351e219f869870f77c0b","last_reissued_at":"2026-05-18T03:52:54.873334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:54.873334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.6212","source_version":2,"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:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WF7LKztjsmSA5napjFd9vgCP/d2jqXpaXAZd43qwaEYoewYe2v7+6RvQEPuz2zunDnBRVJhBfchepYpiVGeXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:22:49.721744Z"},"content_sha256":"196a7707606ec8608001cef84d8b7c91886c4a424be1051c26548a2203425f57","schema_version":"1.0","event_id":"sha256:196a7707606ec8608001cef84d8b7c91886c4a424be1051c26548a2203425f57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VONX2GAQV4MN6R7H2C6QZBRRFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An All-But-One Entropic Uncertainty Relation, and Application to Password-based Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carlos Gonz\\'alez-Guill\\'en, Christian Schaffner, Niek J. Bouman, Serge Fehr","submitted_at":"2011-05-31T09:19:09Z","abstract_excerpt":"Entropic uncertainty relations are quantitative characterizations of Heisenberg's uncertainty principle, which make use of an entropy measure to quantify uncertainty. In quantum cryptography, they are often used as convenient tools in security proofs. We propose a new entropic uncertainty relation. It is the first such uncertainty relation that lower bounds the uncertainty in the measurement outcome for all but one choice for the measurement from an arbitrarily large (but specifically chosen) set of possible measurements, and, at the same time, uses the min-entropy as entropy measure, rather t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6212","kind":"arxiv","version":2},"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:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7f3U+ZApjCcLWRYsCE0c0QFslxVSRFZUhhicNcRD3bmZX8rcP/DIpmGoW4VVATEvsM+t7QzEs9a93jYlve8DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:22:49.722090Z"},"content_sha256":"13abe47d4a064cdce78e75d2f8653e689e14027e6069d6c6f8ecdda352c78f5e","schema_version":"1.0","event_id":"sha256:13abe47d4a064cdce78e75d2f8653e689e14027e6069d6c6f8ecdda352c78f5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VONX2GAQV4MN6R7H2C6QZBRRFM/bundle.json","state_url":"https://pith.science/pith/VONX2GAQV4MN6R7H2C6QZBRRFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VONX2GAQV4MN6R7H2C6QZBRRFM/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-03T14:22:49Z","links":{"resolver":"https://pith.science/pith/VONX2GAQV4MN6R7H2C6QZBRRFM","bundle":"https://pith.science/pith/VONX2GAQV4MN6R7H2C6QZBRRFM/bundle.json","state":"https://pith.science/pith/VONX2GAQV4MN6R7H2C6QZBRRFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VONX2GAQV4MN6R7H2C6QZBRRFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VONX2GAQV4MN6R7H2C6QZBRRFM","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":"c5f5c0cb33a742a9cd65eb22d0d4ebc23a153339e3a45fd0014511c49bfce497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-05-31T09:19:09Z","title_canon_sha256":"b197238d65271d5a2e5684e64c9bd148666d709d4bcd16654781b1f505c06d61"},"schema_version":"1.0","source":{"id":"1105.6212","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6212","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6212v2","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6212","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"VONX2GAQV4MN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VONX2GAQV4MN6R7H","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VONX2GAQ","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:13abe47d4a064cdce78e75d2f8653e689e14027e6069d6c6f8ecdda352c78f5e","target":"graph","created_at":"2026-05-18T03:52:54Z","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":"Entropic uncertainty relations are quantitative characterizations of Heisenberg's uncertainty principle, which make use of an entropy measure to quantify uncertainty. In quantum cryptography, they are often used as convenient tools in security proofs. We propose a new entropic uncertainty relation. It is the first such uncertainty relation that lower bounds the uncertainty in the measurement outcome for all but one choice for the measurement from an arbitrarily large (but specifically chosen) set of possible measurements, and, at the same time, uses the min-entropy as entropy measure, rather t","authors_text":"Carlos Gonz\\'alez-Guill\\'en, Christian Schaffner, Niek J. Bouman, Serge Fehr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-05-31T09:19:09Z","title":"An All-But-One Entropic Uncertainty Relation, and Application to Password-based Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6212","kind":"arxiv","version":2},"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:196a7707606ec8608001cef84d8b7c91886c4a424be1051c26548a2203425f57","target":"record","created_at":"2026-05-18T03:52:54Z","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":"c5f5c0cb33a742a9cd65eb22d0d4ebc23a153339e3a45fd0014511c49bfce497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-05-31T09:19:09Z","title_canon_sha256":"b197238d65271d5a2e5684e64c9bd148666d709d4bcd16654781b1f505c06d61"},"schema_version":"1.0","source":{"id":"1105.6212","kind":"arxiv","version":2}},"canonical_sha256":"ab9b7d1810af18df47e7d0bd0c86312b00a0ddd1d8fb351e219f869870f77c0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab9b7d1810af18df47e7d0bd0c86312b00a0ddd1d8fb351e219f869870f77c0b","first_computed_at":"2026-05-18T03:52:54.873334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:54.873334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aoxMPeSdX3Xtt4UhxMAxGKXYl3iRtg7m0KAmf61bu458PSLK35B9PoJaaQbqYivPt+XH0S97FiuXjRq3VpzZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:54.874049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.6212","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:196a7707606ec8608001cef84d8b7c91886c4a424be1051c26548a2203425f57","sha256:13abe47d4a064cdce78e75d2f8653e689e14027e6069d6c6f8ecdda352c78f5e"],"state_sha256":"371f017fe91b5fc8b07ee64b69bd7c2ccb457de2ed88e51282ad5b892435da44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pBfgKgb217hru6LKyIhH9hALV2A55WZkpR1Wj6UnlQ81UEtTvOtwUH7zJbVtHypnkig7fL2oOmsJJaIPZ6CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:22:49.724006Z","bundle_sha256":"80d9d72c169e90afc8b26b2efdd7c5a9b293b717dde6c7471c8619f33ef6aacc"}}