{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:N7F5UH63LMIGM2VBPMV7A3MPTA","short_pith_number":"pith:N7F5UH63","schema_version":"1.0","canonical_sha256":"6fcbda1fdb5b10666aa17b2bf06d8f981f584c91b6dbf2254372c5c456679176","source":{"kind":"arxiv","id":"2311.01630","version":1},"attestation_state":"computed","paper":{"title":"Generalizations of Matrix Multiplication can solve the Light Bulb Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Josh Alman","submitted_at":"2023-11-02T22:49:41Z","abstract_excerpt":"In the light bulb problem, one is given uniformly random vectors $x_1, \\ldots, x_n, y_1, \\ldots, y_n \\in \\{-1,1\\}^d$. They are all chosen independently except a planted pair $(x_{i^*}, y_{j^*})$ is chosen with correlation $\\rho>0$. The goal is to find the planted pair. This problem was introduced over 30 years ago by L.~Valiant, and is known to have many applications in data analysis, statistics, and learning theory.\n  The naive algorithm runs in $\\Omega(n^2)$ time, and algorithms based on Locality-Sensitive Hashing approach quadratic time as $\\rho \\to 0$. In 2012, G.~Valiant gave a breakthrou"},"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":"2311.01630","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-02T22:49:41Z","cross_cats_sorted":[],"title_canon_sha256":"a2558844abd89c6f74feb420ce6840a9792897c843300d53db53730343f5403e","abstract_canon_sha256":"4dd7c7426602f08159ba7ce223f98815233b77913a89b7ee616cdcc92d6640d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:32.147833Z","signature_b64":"3LYCdpEAj0TG+PBPeQZBXYgrqsLvEQD34hZMiHdbK0aJ3zPfJ0ry3nn7785fug6CpmIgBulOOjzUhg2dMwIMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fcbda1fdb5b10666aa17b2bf06d8f981f584c91b6dbf2254372c5c456679176","last_reissued_at":"2026-07-05T07:08:32.147433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:32.147433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizations of Matrix Multiplication can solve the Light Bulb Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hengjie Zhang, Josh Alman","submitted_at":"2023-11-02T22:49:41Z","abstract_excerpt":"In the light bulb problem, one is given uniformly random vectors $x_1, \\ldots, x_n, y_1, \\ldots, y_n \\in \\{-1,1\\}^d$. They are all chosen independently except a planted pair $(x_{i^*}, y_{j^*})$ is chosen with correlation $\\rho>0$. The goal is to find the planted pair. This problem was introduced over 30 years ago by L.~Valiant, and is known to have many applications in data analysis, statistics, and learning theory.\n  The naive algorithm runs in $\\Omega(n^2)$ time, and algorithms based on Locality-Sensitive Hashing approach quadratic time as $\\rho \\to 0$. In 2012, G.~Valiant gave a breakthrou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01630","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/2311.01630/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":"2311.01630","created_at":"2026-07-05T07:08:32.147492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.01630v1","created_at":"2026-07-05T07:08:32.147492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01630","created_at":"2026-07-05T07:08:32.147492+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7F5UH63LMIG","created_at":"2026-07-05T07:08:32.147492+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7F5UH63LMIGM2VB","created_at":"2026-07-05T07:08:32.147492+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7F5UH63","created_at":"2026-07-05T07:08:32.147492+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14676","citing_title":"Depth-first search for tensor rank and border rank over finite fields","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA","json":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA.json","graph_json":"https://pith.science/api/pith-number/N7F5UH63LMIGM2VBPMV7A3MPTA/graph.json","events_json":"https://pith.science/api/pith-number/N7F5UH63LMIGM2VBPMV7A3MPTA/events.json","paper":"https://pith.science/paper/N7F5UH63"},"agent_actions":{"view_html":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA","download_json":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA.json","view_paper":"https://pith.science/paper/N7F5UH63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.01630&json=true","fetch_graph":"https://pith.science/api/pith-number/N7F5UH63LMIGM2VBPMV7A3MPTA/graph.json","fetch_events":"https://pith.science/api/pith-number/N7F5UH63LMIGM2VBPMV7A3MPTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA/action/storage_attestation","attest_author":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA/action/author_attestation","sign_citation":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA/action/citation_signature","submit_replication":"https://pith.science/pith/N7F5UH63LMIGM2VBPMV7A3MPTA/action/replication_record"}},"created_at":"2026-07-05T07:08:32.147492+00:00","updated_at":"2026-07-05T07:08:32.147492+00:00"}