{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A3CAKJKVRBTBHWIQ2RTYSKRGVZ","short_pith_number":"pith:A3CAKJKV","schema_version":"1.0","canonical_sha256":"06c4052555886613d910d467892a26ae678cbe967b86b1428b28bbd8bc507139","source":{"kind":"arxiv","id":"2308.13091","version":1},"attestation_state":"computed","paper":{"title":"Quantum Analog of Shannon's Lower Bound Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Laxmi Parida, Saugata Basu","submitted_at":"2023-08-24T21:31:40Z","abstract_excerpt":"Shannon proved that almost all Boolean functions require a circuit of size $\\Theta(2^n/n)$. We prove a quantum analog of this classical result. Unlike in the classical case the number of quantum circuits of any fixed size that we allow is uncountably infinite. Our main tool is a classical result in real algebraic geometry bounding the number of realizable sign conditions of any finite set of real polynomials in many variables."},"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":"2308.13091","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-24T21:31:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b0047aca359789f4d0b87dda134f3309006b69b47e16d27d5ab0a535cec1f3e2","abstract_canon_sha256":"d1295fc32352ed1ad89e79ae35628edf49cda15e8883360fc80a0755b6a83a56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:38.500427Z","signature_b64":"gjhxYvtN2tksv4hkRnAKEvioumBBLgCF9jizHtcxZvQ9CrZiLljcfZikk0+UfP0ACrCO9wD6GwfpAC7KYxRmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06c4052555886613d910d467892a26ae678cbe967b86b1428b28bbd8bc507139","last_reissued_at":"2026-07-05T06:44:38.499869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:38.499869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Analog of Shannon's Lower Bound Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Laxmi Parida, Saugata Basu","submitted_at":"2023-08-24T21:31:40Z","abstract_excerpt":"Shannon proved that almost all Boolean functions require a circuit of size $\\Theta(2^n/n)$. We prove a quantum analog of this classical result. Unlike in the classical case the number of quantum circuits of any fixed size that we allow is uncountably infinite. Our main tool is a classical result in real algebraic geometry bounding the number of realizable sign conditions of any finite set of real polynomials in many variables."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13091","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/2308.13091/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":"2308.13091","created_at":"2026-07-05T06:44:38.499926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13091v1","created_at":"2026-07-05T06:44:38.499926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13091","created_at":"2026-07-05T06:44:38.499926+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3CAKJKVRBTB","created_at":"2026-07-05T06:44:38.499926+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3CAKJKVRBTBHWIQ","created_at":"2026-07-05T06:44:38.499926+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3CAKJKV","created_at":"2026-07-05T06:44:38.499926+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.07619","citing_title":"Counting Martingales for Measure and Dimension in Complexity Classes","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ","json":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ.json","graph_json":"https://pith.science/api/pith-number/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/graph.json","events_json":"https://pith.science/api/pith-number/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/events.json","paper":"https://pith.science/paper/A3CAKJKV"},"agent_actions":{"view_html":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ","download_json":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ.json","view_paper":"https://pith.science/paper/A3CAKJKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13091&json=true","fetch_graph":"https://pith.science/api/pith-number/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/action/storage_attestation","attest_author":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/action/author_attestation","sign_citation":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/action/citation_signature","submit_replication":"https://pith.science/pith/A3CAKJKVRBTBHWIQ2RTYSKRGVZ/action/replication_record"}},"created_at":"2026-07-05T06:44:38.499926+00:00","updated_at":"2026-07-05T06:44:38.499926+00:00"}