{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BW72P4R4REGOF5EPWWWDQT43JL","short_pith_number":"pith:BW72P4R4","schema_version":"1.0","canonical_sha256":"0dbfa7f23c890ce2f48fb5ac384f9b4aef764e55233923caf7a6329b729c6b18","source":{"kind":"arxiv","id":"1607.03714","version":2},"attestation_state":"computed","paper":{"title":"Sampling on the Sphere by Mutually Orthogonal Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Uri Grupel","submitted_at":"2016-07-13T13:11:15Z","abstract_excerpt":"The purpose of this paper is twofold. First, we provide an optimal $\\Omega(\\sqrt{n})$ bits lower bound for any two-way protocol for the Vector in Subspace Communication Problem which is of bounded total rank. This result complements Raz's $O(\\sqrt{n})$ protocol, which has a simple variant of bounded total rank. Second, we present a plausible mathematical conjecture on a measure concentration phenomenon that implies an $\\Omega(\\sqrt{n})$ lower bound for a general protocol. We prove the conjecture for the subclass of sets that depend only on $O(\\sqrt{n})$ directions."},"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":"1607.03714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-13T13:11:15Z","cross_cats_sorted":[],"title_canon_sha256":"b2d66af2795356ea0ed49e07f4f8b752e0ffa89e22d3153895fb08fb7cdaab6e","abstract_canon_sha256":"5f61ff7dc87d71446f2abe74536add7d80481c6f2da14de8388d128633f46a79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:48.038851Z","signature_b64":"Xnd7SlsD2kJXEztOaXjSujxCIIIHpElBPUdzU/uJtLPWsg48OHWr+8P71RrkbMtIMi9f+Bn1pkDwdtZ+TVYVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dbfa7f23c890ce2f48fb5ac384f9b4aef764e55233923caf7a6329b729c6b18","last_reissued_at":"2026-05-18T00:51:48.038127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:48.038127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling on the Sphere by Mutually Orthogonal Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Uri Grupel","submitted_at":"2016-07-13T13:11:15Z","abstract_excerpt":"The purpose of this paper is twofold. First, we provide an optimal $\\Omega(\\sqrt{n})$ bits lower bound for any two-way protocol for the Vector in Subspace Communication Problem which is of bounded total rank. This result complements Raz's $O(\\sqrt{n})$ protocol, which has a simple variant of bounded total rank. Second, we present a plausible mathematical conjecture on a measure concentration phenomenon that implies an $\\Omega(\\sqrt{n})$ lower bound for a general protocol. We prove the conjecture for the subclass of sets that depend only on $O(\\sqrt{n})$ directions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03714","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":"1607.03714","created_at":"2026-05-18T00:51:48.038239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03714v2","created_at":"2026-05-18T00:51:48.038239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03714","created_at":"2026-05-18T00:51:48.038239+00:00"},{"alias_kind":"pith_short_12","alias_value":"BW72P4R4REGO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BW72P4R4REGOF5EP","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BW72P4R4","created_at":"2026-05-18T12:30:09.641336+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/BW72P4R4REGOF5EPWWWDQT43JL","json":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL.json","graph_json":"https://pith.science/api/pith-number/BW72P4R4REGOF5EPWWWDQT43JL/graph.json","events_json":"https://pith.science/api/pith-number/BW72P4R4REGOF5EPWWWDQT43JL/events.json","paper":"https://pith.science/paper/BW72P4R4"},"agent_actions":{"view_html":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL","download_json":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL.json","view_paper":"https://pith.science/paper/BW72P4R4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03714&json=true","fetch_graph":"https://pith.science/api/pith-number/BW72P4R4REGOF5EPWWWDQT43JL/graph.json","fetch_events":"https://pith.science/api/pith-number/BW72P4R4REGOF5EPWWWDQT43JL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL/action/storage_attestation","attest_author":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL/action/author_attestation","sign_citation":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL/action/citation_signature","submit_replication":"https://pith.science/pith/BW72P4R4REGOF5EPWWWDQT43JL/action/replication_record"}},"created_at":"2026-05-18T00:51:48.038239+00:00","updated_at":"2026-05-18T00:51:48.038239+00:00"}