{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BJCOF6BJSHJD2TBZVN6NOFOYOD","short_pith_number":"pith:BJCOF6BJ","schema_version":"1.0","canonical_sha256":"0a44e2f82991d23d4c39ab7cd715d870f36ec2a33abb22abeffc3a84a3a8aec4","source":{"kind":"arxiv","id":"2104.06423","version":1},"attestation_state":"computed","paper":{"title":"Permanent of random matrices from representation theory: moments, numerics, concentration, and comments on hardness of boson-sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR","math.RT"],"primary_cat":"quant-ph","authors_text":"Sepehr Nezami","submitted_at":"2021-04-13T18:00:06Z","abstract_excerpt":"Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, \"anti-concentration\" of this distribution is an unproven input for the proof of hardness of the task of boson-sampling. We study permanents of random i.i.d. complex Gaussian matrices, and more broadly, submatrices of random unitary matrices. Using a hybrid representation-theoretic and combinatorial approach, we prove strong lower bounds for all moments of the permanent distribution. We provide substantial evidence that our bounds are close to being tight a"},"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":"2104.06423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-04-13T18:00:06Z","cross_cats_sorted":["math.CO","math.PR","math.RT"],"title_canon_sha256":"567303d9ff0293ae82206440fa99d96ca321f2fd197995e023d7e118e7fc3a6f","abstract_canon_sha256":"b12b45f3dd59b5b7eee1ed03d757bd7b61522412df261a333ea98dab24596674"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:05.663836Z","signature_b64":"pDHODF9r+oKuCvDMainBVCF192O6Qw2dD/fDa+TH68bdFwN5suyqT2/Gav7rOvIell4mAGT3SVjABE7dZTvjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a44e2f82991d23d4c39ab7cd715d870f36ec2a33abb22abeffc3a84a3a8aec4","last_reissued_at":"2026-07-05T02:32:05.663344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:05.663344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permanent of random matrices from representation theory: moments, numerics, concentration, and comments on hardness of boson-sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR","math.RT"],"primary_cat":"quant-ph","authors_text":"Sepehr Nezami","submitted_at":"2021-04-13T18:00:06Z","abstract_excerpt":"Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, \"anti-concentration\" of this distribution is an unproven input for the proof of hardness of the task of boson-sampling. We study permanents of random i.i.d. complex Gaussian matrices, and more broadly, submatrices of random unitary matrices. Using a hybrid representation-theoretic and combinatorial approach, we prove strong lower bounds for all moments of the permanent distribution. We provide substantial evidence that our bounds are close to being tight a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.06423","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/2104.06423/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":"2104.06423","created_at":"2026-07-05T02:32:05.663404+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.06423v1","created_at":"2026-07-05T02:32:05.663404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.06423","created_at":"2026-07-05T02:32:05.663404+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJCOF6BJSHJD","created_at":"2026-07-05T02:32:05.663404+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJCOF6BJSHJD2TBZ","created_at":"2026-07-05T02:32:05.663404+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJCOF6BJ","created_at":"2026-07-05T02:32:05.663404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15258","citing_title":"General framework for anticoncentration and linear cross-entropy benchmarking in photonic quantum advantage experiments","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD","json":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD.json","graph_json":"https://pith.science/api/pith-number/BJCOF6BJSHJD2TBZVN6NOFOYOD/graph.json","events_json":"https://pith.science/api/pith-number/BJCOF6BJSHJD2TBZVN6NOFOYOD/events.json","paper":"https://pith.science/paper/BJCOF6BJ"},"agent_actions":{"view_html":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD","download_json":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD.json","view_paper":"https://pith.science/paper/BJCOF6BJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.06423&json=true","fetch_graph":"https://pith.science/api/pith-number/BJCOF6BJSHJD2TBZVN6NOFOYOD/graph.json","fetch_events":"https://pith.science/api/pith-number/BJCOF6BJSHJD2TBZVN6NOFOYOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD/action/storage_attestation","attest_author":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD/action/author_attestation","sign_citation":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD/action/citation_signature","submit_replication":"https://pith.science/pith/BJCOF6BJSHJD2TBZVN6NOFOYOD/action/replication_record"}},"created_at":"2026-07-05T02:32:05.663404+00:00","updated_at":"2026-07-05T02:32:05.663404+00:00"}