{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2DKPJJCJUS56KGN6KHPFV4ANFL","short_pith_number":"pith:2DKPJJCJ","schema_version":"1.0","canonical_sha256":"d0d4f4a449a4bbe519be51de5af00d2afa6fd4bbbff80e04829af9da01bc2cad","source":{"kind":"arxiv","id":"2607.26734","version":1},"attestation_state":"computed","paper":{"title":"Verifiable Random Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anthony Alexiades Armenakas, Ruslan Shaydulin, Shaltiel Eloul, Soorya Rethinasamy, Yash Satsangi, Yeoh Wei Zhu","submitted_at":"2026-07-29T10:27:08Z","abstract_excerpt":"Verifiable random functions (VRF) underpin a wide range of applications that require publicly verifiable evaluations of a pseudorandom function on a given input. However, once the public key is published, the induced function is fixed and is a deterministic function of the input. This determinism can enable collusion and grinding-style attacks in which adversaries precompute and selectively exploit favorable input-output pairs. To address these limitations, we introduce the formal notion of verifiable random sampling (VRS). We propose a concrete VRS construction based on random quantum circuit"},"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":"2607.26734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-07-29T10:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"1ed2540a33ce7131dc5ebd9a0fa8a2743b3134c0e267056ae63c48327f2949bd","abstract_canon_sha256":"0f65eba006c2fa2926ba60cd3b5f5d644a8c1dcea4d4eea1376941ef5d2265c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d4f4a449a4bbe519be51de5af00d2afa6fd4bbbff80e04829af9da01bc2cad","last_reissued_at":"2026-07-30T01:22:08.269422Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:22:08.269422Z"},"graph_snapshot":{"paper":{"title":"Verifiable Random Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anthony Alexiades Armenakas, Ruslan Shaydulin, Shaltiel Eloul, Soorya Rethinasamy, Yash Satsangi, Yeoh Wei Zhu","submitted_at":"2026-07-29T10:27:08Z","abstract_excerpt":"Verifiable random functions (VRF) underpin a wide range of applications that require publicly verifiable evaluations of a pseudorandom function on a given input. However, once the public key is published, the induced function is fixed and is a deterministic function of the input. This determinism can enable collusion and grinding-style attacks in which adversaries precompute and selectively exploit favorable input-output pairs. To address these limitations, we introduce the formal notion of verifiable random sampling (VRS). We propose a concrete VRS construction based on random quantum circuit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26734","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/2607.26734/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":"2607.26734","created_at":"2026-07-30T01:22:08.274397+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26734v1","created_at":"2026-07-30T01:22:08.274397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26734","created_at":"2026-07-30T01:22:08.274397+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DKPJJCJUS56","created_at":"2026-07-30T01:22:08.274397+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DKPJJCJUS56KGN6","created_at":"2026-07-30T01:22:08.274397+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DKPJJCJ","created_at":"2026-07-30T01:22:08.274397+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/2DKPJJCJUS56KGN6KHPFV4ANFL","json":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL.json","graph_json":"https://pith.science/api/pith-number/2DKPJJCJUS56KGN6KHPFV4ANFL/graph.json","events_json":"https://pith.science/api/pith-number/2DKPJJCJUS56KGN6KHPFV4ANFL/events.json","paper":"https://pith.science/paper/2DKPJJCJ"},"agent_actions":{"view_html":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL","download_json":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL.json","view_paper":"https://pith.science/paper/2DKPJJCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26734&json=true","fetch_graph":"https://pith.science/api/pith-number/2DKPJJCJUS56KGN6KHPFV4ANFL/graph.json","fetch_events":"https://pith.science/api/pith-number/2DKPJJCJUS56KGN6KHPFV4ANFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL/action/storage_attestation","attest_author":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL/action/author_attestation","sign_citation":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL/action/citation_signature","submit_replication":"https://pith.science/pith/2DKPJJCJUS56KGN6KHPFV4ANFL/action/replication_record"}},"created_at":"2026-07-30T01:22:08.274397+00:00","updated_at":"2026-07-30T01:22:08.274397+00:00"}