{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LKUTVI3IRFFQV2Y2LGET2X3BLC","short_pith_number":"pith:LKUTVI3I","schema_version":"1.0","canonical_sha256":"5aa93aa368894b0aeb1a59893d5f615894c02112f9d307a9e65e08a1a114219a","source":{"kind":"arxiv","id":"1810.06740","version":1},"attestation_state":"computed","paper":{"title":"An Illuminating Algorithm for the Light Bulb Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Josh Alman","submitted_at":"2018-10-15T22:51:50Z","abstract_excerpt":"The Light Bulb Problem is one of the most basic problems in data analysis. One is given as input $n$ vectors in $\\{-1,1\\}^d$, which are all independently and uniformly random, except for a planted pair of vectors with inner product at least $\\rho \\cdot d$ for some constant $\\rho > 0$. The task is to find the planted pair. The most straightforward algorithm leads to a runtime of $\\Omega(n^2)$. Algorithms based on techniques like Locality-Sensitive Hashing achieve runtimes of $n^{2 - O(\\rho)}$; as $\\rho$ gets small, these approach quadratic.\n  Building on prior work, we give a new algorithm for "},"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":"1810.06740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-15T22:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"59552ec26d177c760ae1c4dc3165605d6ba9df00ee65f54835579488b9dd05ad","abstract_canon_sha256":"97ec8026b161cf83cfc8cf69a5a6449c9c74b9255e316211ef3ae7fb43b5ad46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:11.730553Z","signature_b64":"g/g1PN0JzczfaX0XXb6VFLXCwehU25ZTOubWRMOoT6Ib7IV5sXaVb5r6veNLxfiCIl96HroiMLQ8iFQFafKKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa93aa368894b0aeb1a59893d5f615894c02112f9d307a9e65e08a1a114219a","last_reissued_at":"2026-05-18T00:03:11.729801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:11.729801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Illuminating Algorithm for the Light Bulb Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Josh Alman","submitted_at":"2018-10-15T22:51:50Z","abstract_excerpt":"The Light Bulb Problem is one of the most basic problems in data analysis. One is given as input $n$ vectors in $\\{-1,1\\}^d$, which are all independently and uniformly random, except for a planted pair of vectors with inner product at least $\\rho \\cdot d$ for some constant $\\rho > 0$. The task is to find the planted pair. The most straightforward algorithm leads to a runtime of $\\Omega(n^2)$. Algorithms based on techniques like Locality-Sensitive Hashing achieve runtimes of $n^{2 - O(\\rho)}$; as $\\rho$ gets small, these approach quadratic.\n  Building on prior work, we give a new algorithm for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06740","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.06740","created_at":"2026-05-18T00:03:11.729934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06740v1","created_at":"2026-05-18T00:03:11.729934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06740","created_at":"2026-05-18T00:03:11.729934+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKUTVI3IRFFQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKUTVI3IRFFQV2Y2","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKUTVI3I","created_at":"2026-05-18T12:32:37.024351+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/LKUTVI3IRFFQV2Y2LGET2X3BLC","json":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC.json","graph_json":"https://pith.science/api/pith-number/LKUTVI3IRFFQV2Y2LGET2X3BLC/graph.json","events_json":"https://pith.science/api/pith-number/LKUTVI3IRFFQV2Y2LGET2X3BLC/events.json","paper":"https://pith.science/paper/LKUTVI3I"},"agent_actions":{"view_html":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC","download_json":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC.json","view_paper":"https://pith.science/paper/LKUTVI3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06740&json=true","fetch_graph":"https://pith.science/api/pith-number/LKUTVI3IRFFQV2Y2LGET2X3BLC/graph.json","fetch_events":"https://pith.science/api/pith-number/LKUTVI3IRFFQV2Y2LGET2X3BLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/action/storage_attestation","attest_author":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/action/author_attestation","sign_citation":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/action/citation_signature","submit_replication":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/action/replication_record"}},"created_at":"2026-05-18T00:03:11.729934+00:00","updated_at":"2026-05-18T00:03:11.729934+00:00"}