{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EQLQ7OAGSN2XRQULXTPKZUOAIT","short_pith_number":"pith:EQLQ7OAG","canonical_record":{"source":{"id":"1601.06259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-23T10:20:58Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"e0e3a0bcb36c96012b64b6ef54b6e7275a71c186de3381ac46e09160fa351f21","abstract_canon_sha256":"008e77a42e9308aaa0ddebeb39ac661c57fae79f1a1acb6db4116bb6b2649fca"},"schema_version":"1.0"},"canonical_sha256":"24170fb806937578c28bbcdeacd1c044c4cd32a90a7e0447eb02a625c1ccdec5","source":{"kind":"arxiv","id":"1601.06259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06259","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06259v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06259","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"EQLQ7OAGSN2X","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQLQ7OAGSN2XRQUL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQLQ7OAG","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EQLQ7OAGSN2XRQULXTPKZUOAIT","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-23T10:20:58Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"e0e3a0bcb36c96012b64b6ef54b6e7275a71c186de3381ac46e09160fa351f21","abstract_canon_sha256":"008e77a42e9308aaa0ddebeb39ac661c57fae79f1a1acb6db4116bb6b2649fca"},"schema_version":"1.0"},"canonical_sha256":"24170fb806937578c28bbcdeacd1c044c4cd32a90a7e0447eb02a625c1ccdec5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:04.923795Z","signature_b64":"7fBwuPRqmuSrMFZO4o3OOH5ML1ampJcSixVS3usujhPCLNVakVZbI6VMiHgp32qlmgAkpVMn9y/SPC8MjLmeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24170fb806937578c28bbcdeacd1c044c4cd32a90a7e0447eb02a625c1ccdec5","last_reissued_at":"2026-05-18T01:22:04.923044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:04.923044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06259","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RyIIVK4hNoGvl+Qz3ONKz9yf22vMqJXwq2jVL6kR0ULywM9jukYPglSGsXPRh1CoRXVpxI2t05scSfqOPZXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:13:49.273936Z"},"content_sha256":"d759f89a3b00eeea26e96811f9969801de4012a96f9d4ac032b6e03a95572389","schema_version":"1.0","event_id":"sha256:d759f89a3b00eeea26e96811f9969801de4012a96f9d4ac032b6e03a95572389"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EQLQ7OAGSN2XRQULXTPKZUOAIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Lower Bounds for Linear Independence Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Aaditya Ramdas, Aarti Singh, David Isenberg, Larry Wasserman","submitted_at":"2016-01-23T10:20:58Z","abstract_excerpt":"Linear independence testing is a fundamental information-theoretic and statistical problem that can be posed as follows: given $n$ points $\\{(X_i,Y_i)\\}^n_{i=1}$ from a $p+q$ dimensional multivariate distribution where $X_i \\in \\mathbb{R}^p$ and $Y_i \\in\\mathbb{R}^q$, determine whether $a^T X$ and $b^T Y$ are uncorrelated for every $a \\in \\mathbb{R}^p, b\\in \\mathbb{R}^q$ or not. We give minimax lower bound for this problem (when $p+q,n \\to \\infty$, $(p+q)/n \\leq \\kappa < \\infty$, without sparsity assumptions). In summary, our results imply that $n$ must be at least as large as $\\sqrt {pq}/\\|\\S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06259","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnNiM6WZPeO2HKJ6F5B6N1jhSbwa/g7mjfgooNH2aJ5SHHizU+xeKTg0sNj8NyuGP6OeNX03reFgNGbdSKhSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:13:49.274427Z"},"content_sha256":"dc0a9b84836c065d4b9007f3db65d40e16ee582ddf24018971049be6cf6434e7","schema_version":"1.0","event_id":"sha256:dc0a9b84836c065d4b9007f3db65d40e16ee582ddf24018971049be6cf6434e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQLQ7OAGSN2XRQULXTPKZUOAIT/bundle.json","state_url":"https://pith.science/pith/EQLQ7OAGSN2XRQULXTPKZUOAIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQLQ7OAGSN2XRQULXTPKZUOAIT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T19:13:49Z","links":{"resolver":"https://pith.science/pith/EQLQ7OAGSN2XRQULXTPKZUOAIT","bundle":"https://pith.science/pith/EQLQ7OAGSN2XRQULXTPKZUOAIT/bundle.json","state":"https://pith.science/pith/EQLQ7OAGSN2XRQULXTPKZUOAIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQLQ7OAGSN2XRQULXTPKZUOAIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EQLQ7OAGSN2XRQULXTPKZUOAIT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"008e77a42e9308aaa0ddebeb39ac661c57fae79f1a1acb6db4116bb6b2649fca","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-23T10:20:58Z","title_canon_sha256":"e0e3a0bcb36c96012b64b6ef54b6e7275a71c186de3381ac46e09160fa351f21"},"schema_version":"1.0","source":{"id":"1601.06259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06259","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06259v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06259","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"EQLQ7OAGSN2X","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQLQ7OAGSN2XRQUL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQLQ7OAG","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:dc0a9b84836c065d4b9007f3db65d40e16ee582ddf24018971049be6cf6434e7","target":"graph","created_at":"2026-05-18T01:22:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Linear independence testing is a fundamental information-theoretic and statistical problem that can be posed as follows: given $n$ points $\\{(X_i,Y_i)\\}^n_{i=1}$ from a $p+q$ dimensional multivariate distribution where $X_i \\in \\mathbb{R}^p$ and $Y_i \\in\\mathbb{R}^q$, determine whether $a^T X$ and $b^T Y$ are uncorrelated for every $a \\in \\mathbb{R}^p, b\\in \\mathbb{R}^q$ or not. We give minimax lower bound for this problem (when $p+q,n \\to \\infty$, $(p+q)/n \\leq \\kappa < \\infty$, without sparsity assumptions). In summary, our results imply that $n$ must be at least as large as $\\sqrt {pq}/\\|\\S","authors_text":"Aaditya Ramdas, Aarti Singh, David Isenberg, Larry Wasserman","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-23T10:20:58Z","title":"Minimax Lower Bounds for Linear Independence Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06259","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d759f89a3b00eeea26e96811f9969801de4012a96f9d4ac032b6e03a95572389","target":"record","created_at":"2026-05-18T01:22:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"008e77a42e9308aaa0ddebeb39ac661c57fae79f1a1acb6db4116bb6b2649fca","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-23T10:20:58Z","title_canon_sha256":"e0e3a0bcb36c96012b64b6ef54b6e7275a71c186de3381ac46e09160fa351f21"},"schema_version":"1.0","source":{"id":"1601.06259","kind":"arxiv","version":1}},"canonical_sha256":"24170fb806937578c28bbcdeacd1c044c4cd32a90a7e0447eb02a625c1ccdec5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24170fb806937578c28bbcdeacd1c044c4cd32a90a7e0447eb02a625c1ccdec5","first_computed_at":"2026-05-18T01:22:04.923044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:04.923044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7fBwuPRqmuSrMFZO4o3OOH5ML1ampJcSixVS3usujhPCLNVakVZbI6VMiHgp32qlmgAkpVMn9y/SPC8MjLmeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:04.923795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d759f89a3b00eeea26e96811f9969801de4012a96f9d4ac032b6e03a95572389","sha256:dc0a9b84836c065d4b9007f3db65d40e16ee582ddf24018971049be6cf6434e7"],"state_sha256":"6232df4cb700b6db1aafc6ba35836a2889fff8024a2b22245a2b8ec19867ca53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1MGih8w+b/sIubj/pqGl5cYtYkpJ9byG/KDbo0dTY42o88L2woWlvpPsWMa6McfCYjAOOuN6rHUeDjrOnNyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:13:49.277605Z","bundle_sha256":"0c708d11ed277319df7ab5a8e25a83d3c8fc673d03eaaa86a17608943a6629f6"}}