{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LBEUSFATLR4F243VE4WRZEQZCE","short_pith_number":"pith:LBEUSFAT","schema_version":"1.0","canonical_sha256":"58494914135c785d7375272d1c9219113c1d65999aeb04f662bef3f5edb2237a","source":{"kind":"arxiv","id":"2310.13597","version":1},"attestation_state":"computed","paper":{"title":"Explicit orthogonal and unitary designs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pedro Paredes, Rocco A. Servedio, Ryan O'Donnell","submitted_at":"2023-10-20T15:46:15Z","abstract_excerpt":"We give a strongly explicit construction of $\\varepsilon$-approximate $k$-designs for the orthogonal group $\\mathrm{O}(N)$ and the unitary group $\\mathrm{U}(N)$, for $N=2^n$. Our designs are of cardinality $\\mathrm{poly}(N^k/\\varepsilon)$ (equivalently, they have seed length $O(nk + \\log(1/\\varepsilon)))$; up to the polynomial, this matches the number of design elements used by the construction consisting of completely random matrices."},"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":"2310.13597","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-10-20T15:46:15Z","cross_cats_sorted":[],"title_canon_sha256":"5a772ee09713ca3a8c069f1c8d140140ce2ae0319b8a10dc7a03b991fefdec1a","abstract_canon_sha256":"1a38a38db70391228e7fda135e89974e1c781580e1b4bf0b43701fc6707313c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:12.910944Z","signature_b64":"l9uWOumw4i+nYlH49HiKEG4xN7z0N9FiWqyYqNE/+iOD3OsSZ8OEqQtLlxsMjz27DsN7oT4a2x+Gakey4itqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58494914135c785d7375272d1c9219113c1d65999aeb04f662bef3f5edb2237a","last_reissued_at":"2026-07-05T07:03:12.910442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:12.910442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit orthogonal and unitary designs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pedro Paredes, Rocco A. Servedio, Ryan O'Donnell","submitted_at":"2023-10-20T15:46:15Z","abstract_excerpt":"We give a strongly explicit construction of $\\varepsilon$-approximate $k$-designs for the orthogonal group $\\mathrm{O}(N)$ and the unitary group $\\mathrm{U}(N)$, for $N=2^n$. Our designs are of cardinality $\\mathrm{poly}(N^k/\\varepsilon)$ (equivalently, they have seed length $O(nk + \\log(1/\\varepsilon)))$; up to the polynomial, this matches the number of design elements used by the construction consisting of completely random matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.13597","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/2310.13597/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":"2310.13597","created_at":"2026-07-05T07:03:12.910494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.13597v1","created_at":"2026-07-05T07:03:12.910494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.13597","created_at":"2026-07-05T07:03:12.910494+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBEUSFATLR4F","created_at":"2026-07-05T07:03:12.910494+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBEUSFATLR4F243V","created_at":"2026-07-05T07:03:12.910494+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBEUSFAT","created_at":"2026-07-05T07:03:12.910494+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05754","citing_title":"Quantum One-Way Functions and Related Cryptographic Primitives","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE","json":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE.json","graph_json":"https://pith.science/api/pith-number/LBEUSFATLR4F243VE4WRZEQZCE/graph.json","events_json":"https://pith.science/api/pith-number/LBEUSFATLR4F243VE4WRZEQZCE/events.json","paper":"https://pith.science/paper/LBEUSFAT"},"agent_actions":{"view_html":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE","download_json":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE.json","view_paper":"https://pith.science/paper/LBEUSFAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.13597&json=true","fetch_graph":"https://pith.science/api/pith-number/LBEUSFATLR4F243VE4WRZEQZCE/graph.json","fetch_events":"https://pith.science/api/pith-number/LBEUSFATLR4F243VE4WRZEQZCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE/action/storage_attestation","attest_author":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE/action/author_attestation","sign_citation":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE/action/citation_signature","submit_replication":"https://pith.science/pith/LBEUSFATLR4F243VE4WRZEQZCE/action/replication_record"}},"created_at":"2026-07-05T07:03:12.910494+00:00","updated_at":"2026-07-05T07:03:12.910494+00:00"}