{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RNMQEFNBHWVZXO6JHGCWZT6MND","short_pith_number":"pith:RNMQEFNB","schema_version":"1.0","canonical_sha256":"8b590215a13dab9bbbc939856ccfcc68ce6df7f16a7fab7f401e81458378d33d","source":{"kind":"arxiv","id":"2503.19759","version":1},"attestation_state":"computed","paper":{"title":"Applications of Certified Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Charles Lim, Kaushik Chakraborty, Marco Pistoia, Minzhao Liu, Niraj Kumar, Omar Amer, Pradeep Niroula, Ruslan Shaydulin, Shaltiel Eloul, Shouvanik Chakrabarti, Yash Satsangi","submitted_at":"2025-03-25T15:22:41Z","abstract_excerpt":"Certified randomness can be generated with untrusted remote quantum computers using multiple known protocols, one of which has been recently realized experimentally. Unlike the randomness sources accessible on today's classical computers, the output of these protocols can be certified to be random under certain computational hardness assumptions, with no trust required in the hardware generating the randomness. In this perspective, we explore real-world applications for which the use of certified randomness protocols may lead to improved security and fairness. We identify promising application"},"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":"2503.19759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-25T15:22:41Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"79725f28e329cfb35d86c109633c12b93a5d5356c89e3da11beeac4cab668606","abstract_canon_sha256":"c7d4d8f5803fff4016127a4630adc2a6c50459e5dbba05163b52c2f87ec4972c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:50.861637Z","signature_b64":"sRDPyC268MrmFtRAO7Qm+zZAvLd5x5965hddUsaj/HPY2GXPm7Ob4XVsxF8YryLJPgytc7sGVzChAGO1tfN4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b590215a13dab9bbbc939856ccfcc68ce6df7f16a7fab7f401e81458378d33d","last_reissued_at":"2026-07-05T11:38:50.861142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:50.861142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applications of Certified Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Charles Lim, Kaushik Chakraborty, Marco Pistoia, Minzhao Liu, Niraj Kumar, Omar Amer, Pradeep Niroula, Ruslan Shaydulin, Shaltiel Eloul, Shouvanik Chakrabarti, Yash Satsangi","submitted_at":"2025-03-25T15:22:41Z","abstract_excerpt":"Certified randomness can be generated with untrusted remote quantum computers using multiple known protocols, one of which has been recently realized experimentally. Unlike the randomness sources accessible on today's classical computers, the output of these protocols can be certified to be random under certain computational hardness assumptions, with no trust required in the hardware generating the randomness. In this perspective, we explore real-world applications for which the use of certified randomness protocols may lead to improved security and fairness. We identify promising application"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19759","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.19759/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.19759","created_at":"2026-07-05T11:38:50.861205+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.19759v1","created_at":"2026-07-05T11:38:50.861205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19759","created_at":"2026-07-05T11:38:50.861205+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNMQEFNBHWVZ","created_at":"2026-07-05T11:38:50.861205+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNMQEFNBHWVZXO6J","created_at":"2026-07-05T11:38:50.861205+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNMQEFNB","created_at":"2026-07-05T11:38:50.861205+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.00401","citing_title":"Genuine certifiable randomness from a black-box","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND","json":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND.json","graph_json":"https://pith.science/api/pith-number/RNMQEFNBHWVZXO6JHGCWZT6MND/graph.json","events_json":"https://pith.science/api/pith-number/RNMQEFNBHWVZXO6JHGCWZT6MND/events.json","paper":"https://pith.science/paper/RNMQEFNB"},"agent_actions":{"view_html":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND","download_json":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND.json","view_paper":"https://pith.science/paper/RNMQEFNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.19759&json=true","fetch_graph":"https://pith.science/api/pith-number/RNMQEFNBHWVZXO6JHGCWZT6MND/graph.json","fetch_events":"https://pith.science/api/pith-number/RNMQEFNBHWVZXO6JHGCWZT6MND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND/action/storage_attestation","attest_author":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND/action/author_attestation","sign_citation":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND/action/citation_signature","submit_replication":"https://pith.science/pith/RNMQEFNBHWVZXO6JHGCWZT6MND/action/replication_record"}},"created_at":"2026-07-05T11:38:50.861205+00:00","updated_at":"2026-07-05T11:38:50.861205+00:00"}