{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OH5XQVNPWDTS5UAB6LGUA5OZPL","short_pith_number":"pith:OH5XQVNP","schema_version":"1.0","canonical_sha256":"71fb7855afb0e72ed001f2cd4075d97ac3ddc7c54413768f4cfbb25029cbaf9b","source":{"kind":"arxiv","id":"1409.7447","version":2},"attestation_state":"computed","paper":{"title":"Near invariance of the hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Hoi Nguyen, Scott Aaronson","submitted_at":"2014-09-26T00:28:36Z","abstract_excerpt":"We give an almost-complete description of orthogonal matrices $M$ of order $n$ that \"rotate a non-negligible fraction of the Boolean hypercube $C_n=\\{-1,1\\}^n$ onto itself,\" in the sense that $$P_{x\\in C_n}(Mx\\in C_n) \\ge n^{-C},\\mbox{ for some positive constant } C,$$ where $x$ is sampled uniformly over $C_n$. In particular, we show that such matrices $M$ must be very close to products of permutation and reflection matrices. This result is a step toward characterizing those orthogonal and unitary matrices with large permanents, a question with applications to linear-optical quantum computing."},"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":"1409.7447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-26T00:28:36Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"02718aa6271bf2960771252bc32885c3a5f3c368c57e1759595a1c9a0e04b3e8","abstract_canon_sha256":"23148a1de3e8e0956e062e472208db9211c073576ed7916c42f30229b8a84a9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:38.011422Z","signature_b64":"Tu2N7ID/VhnCuvo10ETUy/cv59WDpgPJE+pP5OsNMC+EeuoVvqulBkBndWYL8bOOzcgWHPLpB32tSFWYMXTWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71fb7855afb0e72ed001f2cd4075d97ac3ddc7c54413768f4cfbb25029cbaf9b","last_reissued_at":"2026-05-18T02:40:38.010765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:38.010765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near invariance of the hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Hoi Nguyen, Scott Aaronson","submitted_at":"2014-09-26T00:28:36Z","abstract_excerpt":"We give an almost-complete description of orthogonal matrices $M$ of order $n$ that \"rotate a non-negligible fraction of the Boolean hypercube $C_n=\\{-1,1\\}^n$ onto itself,\" in the sense that $$P_{x\\in C_n}(Mx\\in C_n) \\ge n^{-C},\\mbox{ for some positive constant } C,$$ where $x$ is sampled uniformly over $C_n$. In particular, we show that such matrices $M$ must be very close to products of permutation and reflection matrices. This result is a step toward characterizing those orthogonal and unitary matrices with large permanents, a question with applications to linear-optical quantum computing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7447","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1409.7447","created_at":"2026-05-18T02:40:38.010864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7447v2","created_at":"2026-05-18T02:40:38.010864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7447","created_at":"2026-05-18T02:40:38.010864+00:00"},{"alias_kind":"pith_short_12","alias_value":"OH5XQVNPWDTS","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OH5XQVNPWDTS5UAB","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OH5XQVNP","created_at":"2026-05-18T12:28:41.024544+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/OH5XQVNPWDTS5UAB6LGUA5OZPL","json":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL.json","graph_json":"https://pith.science/api/pith-number/OH5XQVNPWDTS5UAB6LGUA5OZPL/graph.json","events_json":"https://pith.science/api/pith-number/OH5XQVNPWDTS5UAB6LGUA5OZPL/events.json","paper":"https://pith.science/paper/OH5XQVNP"},"agent_actions":{"view_html":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL","download_json":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL.json","view_paper":"https://pith.science/paper/OH5XQVNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7447&json=true","fetch_graph":"https://pith.science/api/pith-number/OH5XQVNPWDTS5UAB6LGUA5OZPL/graph.json","fetch_events":"https://pith.science/api/pith-number/OH5XQVNPWDTS5UAB6LGUA5OZPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL/action/storage_attestation","attest_author":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL/action/author_attestation","sign_citation":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL/action/citation_signature","submit_replication":"https://pith.science/pith/OH5XQVNPWDTS5UAB6LGUA5OZPL/action/replication_record"}},"created_at":"2026-05-18T02:40:38.010864+00:00","updated_at":"2026-05-18T02:40:38.010864+00:00"}