{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QMH7MGJHWMUX3BH4J4KIK4RJHW","short_pith_number":"pith:QMH7MGJH","schema_version":"1.0","canonical_sha256":"830ff61927b3297d84fc4f148572293d9dcb6a957bd411994624cdf8e20087d4","source":{"kind":"arxiv","id":"2606.22034","version":1},"attestation_state":"computed","paper":{"title":"Auditing Combinatorial Randomness from Finite Transcripts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","math.IT","stat.ME"],"primary_cat":"cs.IT","authors_text":"Faruk Alpay, Levent Sarioglu","submitted_at":"2026-06-20T13:17:44Z","abstract_excerpt":"Public randomness is a security primitive whose deployed behavior is often observable only through a finite transcript. We study black-box auditing of $k$-subset draws from $m$ labels under the exact uniform-without-replacement null. The outcome space has size $\\binom{m}{k}$, and unrestricted uniformity testing therefore requires $\\Theta(\\sqrt{\\binom{m}{k}}/\\varepsilon^2)$ samples, establishing an information-theoretic limit on transcript-only certification. For structured faults, we construct generator-agnostic audits on the hypersimplex using marginal chi-square, pair maxima, serial overlap,"},"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":"2606.22034","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-20T13:17:44Z","cross_cats_sorted":["cs.CR","math.IT","stat.ME"],"title_canon_sha256":"2e840ffb913281b4d00e64a011b249ec241f9d00d253bc456b82cc62b335cc11","abstract_canon_sha256":"fe4cfaf540c3c6fe1307edd8e754fe2ec93e0a691076f5b3bfb0896f4be122fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:06.076329Z","signature_b64":"DLMAF8j7O9SR+pSVC6joDWbmraVXqFhzcO6QoWjNtqrtriAenh30yztyeSOj+NoIQ/HQ6qedHyCKJait5f9XCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"830ff61927b3297d84fc4f148572293d9dcb6a957bd411994624cdf8e20087d4","last_reissued_at":"2026-06-23T02:13:06.075917Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:06.075917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auditing Combinatorial Randomness from Finite Transcripts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","math.IT","stat.ME"],"primary_cat":"cs.IT","authors_text":"Faruk Alpay, Levent Sarioglu","submitted_at":"2026-06-20T13:17:44Z","abstract_excerpt":"Public randomness is a security primitive whose deployed behavior is often observable only through a finite transcript. We study black-box auditing of $k$-subset draws from $m$ labels under the exact uniform-without-replacement null. The outcome space has size $\\binom{m}{k}$, and unrestricted uniformity testing therefore requires $\\Theta(\\sqrt{\\binom{m}{k}}/\\varepsilon^2)$ samples, establishing an information-theoretic limit on transcript-only certification. For structured faults, we construct generator-agnostic audits on the hypersimplex using marginal chi-square, pair maxima, serial overlap,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22034","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/2606.22034/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":"2606.22034","created_at":"2026-06-23T02:13:06.075974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22034v1","created_at":"2026-06-23T02:13:06.075974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22034","created_at":"2026-06-23T02:13:06.075974+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMH7MGJHWMUX","created_at":"2026-06-23T02:13:06.075974+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMH7MGJHWMUX3BH4","created_at":"2026-06-23T02:13:06.075974+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMH7MGJH","created_at":"2026-06-23T02:13:06.075974+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/QMH7MGJHWMUX3BH4J4KIK4RJHW","json":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW.json","graph_json":"https://pith.science/api/pith-number/QMH7MGJHWMUX3BH4J4KIK4RJHW/graph.json","events_json":"https://pith.science/api/pith-number/QMH7MGJHWMUX3BH4J4KIK4RJHW/events.json","paper":"https://pith.science/paper/QMH7MGJH"},"agent_actions":{"view_html":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW","download_json":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW.json","view_paper":"https://pith.science/paper/QMH7MGJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22034&json=true","fetch_graph":"https://pith.science/api/pith-number/QMH7MGJHWMUX3BH4J4KIK4RJHW/graph.json","fetch_events":"https://pith.science/api/pith-number/QMH7MGJHWMUX3BH4J4KIK4RJHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW/action/storage_attestation","attest_author":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW/action/author_attestation","sign_citation":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW/action/citation_signature","submit_replication":"https://pith.science/pith/QMH7MGJHWMUX3BH4J4KIK4RJHW/action/replication_record"}},"created_at":"2026-06-23T02:13:06.075974+00:00","updated_at":"2026-06-23T02:13:06.075974+00:00"}