{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WVANOQ47BQHSEA54VC6YN4JYPN","short_pith_number":"pith:WVANOQ47","canonical_record":{"source":{"id":"1312.2483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:02:40Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"42f3caff655b4c03b862171c68197277c1ca2ca200599d514b13f38c5d55722b","abstract_canon_sha256":"b129db6fbeed51f580b695f50c1d4984dd19d00b715366c60f19c36aac9879e3"},"schema_version":"1.0"},"canonical_sha256":"b540d7439f0c0f2203bca8bd86f1387b4470c2e7d86b38e214f914f69acf22eb","source":{"kind":"arxiv","id":"1312.2483","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2483","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2483v2","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2483","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"WVANOQ47BQHS","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WVANOQ47BQHSEA54","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WVANOQ47","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WVANOQ47BQHSEA54VC6YN4JYPN","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:02:40Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"42f3caff655b4c03b862171c68197277c1ca2ca200599d514b13f38c5d55722b","abstract_canon_sha256":"b129db6fbeed51f580b695f50c1d4984dd19d00b715366c60f19c36aac9879e3"},"schema_version":"1.0"},"canonical_sha256":"b540d7439f0c0f2203bca8bd86f1387b4470c2e7d86b38e214f914f69acf22eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:48.102504Z","signature_b64":"iMHgK8ajzhsq7CFh1V3ubKBRF2751/aLvShuczt99X+W9M9/LlmUM+iU130Uv0eXAa8Mdq26dkiGm8qZVCn1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b540d7439f0c0f2203bca8bd86f1387b4470c2e7d86b38e214f914f69acf22eb","last_reissued_at":"2026-05-18T02:55:48.101935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:48.101935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2483","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-18T02:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/RJJneUhsaQve3nEA6dd8Gvne4ZS+Nvgqn0sODBXSgomPh+rpc9/IIYgJuhkQBMrMsq0t8o67tWjQhRDbcIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:42:10.911250Z"},"content_sha256":"d5936d5561f5355b0cd9d6044fb5e67e2fab1966fd1af02b83be471058662a3e","schema_version":"1.0","event_id":"sha256:d5936d5561f5355b0cd9d6044fb5e67e2fab1966fd1af02b83be471058662a3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WVANOQ47BQHSEA54VC6YN4JYPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Protocol for Generating Random Elements with their Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Robin K\\\"unzler, Thomas Holenstein","submitted_at":"2013-12-09T16:02:40Z","abstract_excerpt":"We give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x, P(x)) with probability close to P(x). In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (x, p), then the probability that the verifier outputs x is close to p. Simple examples show that this cannot be achieved. Instead, we show that the following weaker condition holds (in a well defined sense) on average: If (x, p) is output, then p is an upper bound on the probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2483","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-18T02:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XeJUXh5I/33WmiZYR7fVGGH2re80ptF9XDvMPVbr4o9D0AhBoQi8rNILPonGyJV/tERcMNNEebUmE0lj+w5KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:42:10.911622Z"},"content_sha256":"2a79e1d5fc8c27fd737dc164b3baf895dd7165ef1b863b7c3c958e180422988b","schema_version":"1.0","event_id":"sha256:2a79e1d5fc8c27fd737dc164b3baf895dd7165ef1b863b7c3c958e180422988b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVANOQ47BQHSEA54VC6YN4JYPN/bundle.json","state_url":"https://pith.science/pith/WVANOQ47BQHSEA54VC6YN4JYPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVANOQ47BQHSEA54VC6YN4JYPN/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-05T16:42:10Z","links":{"resolver":"https://pith.science/pith/WVANOQ47BQHSEA54VC6YN4JYPN","bundle":"https://pith.science/pith/WVANOQ47BQHSEA54VC6YN4JYPN/bundle.json","state":"https://pith.science/pith/WVANOQ47BQHSEA54VC6YN4JYPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVANOQ47BQHSEA54VC6YN4JYPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WVANOQ47BQHSEA54VC6YN4JYPN","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":"b129db6fbeed51f580b695f50c1d4984dd19d00b715366c60f19c36aac9879e3","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:02:40Z","title_canon_sha256":"42f3caff655b4c03b862171c68197277c1ca2ca200599d514b13f38c5d55722b"},"schema_version":"1.0","source":{"id":"1312.2483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2483","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2483v2","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2483","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"WVANOQ47BQHS","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WVANOQ47BQHSEA54","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WVANOQ47","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:2a79e1d5fc8c27fd737dc164b3baf895dd7165ef1b863b7c3c958e180422988b","target":"graph","created_at":"2026-05-18T02:55:48Z","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 give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x, P(x)) with probability close to P(x). In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (x, p), then the probability that the verifier outputs x is close to p. Simple examples show that this cannot be achieved. Instead, we show that the following weaker condition holds (in a well defined sense) on average: If (x, p) is output, then p is an upper bound on the probabi","authors_text":"Robin K\\\"unzler, Thomas Holenstein","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:02:40Z","title":"A Protocol for Generating Random Elements with their Probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2483","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:d5936d5561f5355b0cd9d6044fb5e67e2fab1966fd1af02b83be471058662a3e","target":"record","created_at":"2026-05-18T02:55:48Z","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":"b129db6fbeed51f580b695f50c1d4984dd19d00b715366c60f19c36aac9879e3","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:02:40Z","title_canon_sha256":"42f3caff655b4c03b862171c68197277c1ca2ca200599d514b13f38c5d55722b"},"schema_version":"1.0","source":{"id":"1312.2483","kind":"arxiv","version":2}},"canonical_sha256":"b540d7439f0c0f2203bca8bd86f1387b4470c2e7d86b38e214f914f69acf22eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b540d7439f0c0f2203bca8bd86f1387b4470c2e7d86b38e214f914f69acf22eb","first_computed_at":"2026-05-18T02:55:48.101935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:48.101935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iMHgK8ajzhsq7CFh1V3ubKBRF2751/aLvShuczt99X+W9M9/LlmUM+iU130Uv0eXAa8Mdq26dkiGm8qZVCn1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:48.102504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5936d5561f5355b0cd9d6044fb5e67e2fab1966fd1af02b83be471058662a3e","sha256:2a79e1d5fc8c27fd737dc164b3baf895dd7165ef1b863b7c3c958e180422988b"],"state_sha256":"2830f14224b3e1e9120a73206682ec3e078fc94974bd7aeb032d7a11fb6b1283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFBjhUl4WSwZky1BdW7pZ1xqODS0sP7h3mFOF1Im3aLwyT+wf0QdKsADf7FGI9l2FIqEs59jjQtAiSOXhXXQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:42:10.913649Z","bundle_sha256":"b7fe9586739d2053aa5bda071ca0b8316e2612fa07d7ee4a042c62076d89e77c"}}