{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WSRAK47FRBS5IUVJMRGKXHCRRK","short_pith_number":"pith:WSRAK47F","schema_version":"1.0","canonical_sha256":"b4a20573e58865d452a9644cab9c518aaa434559ec1fc40e1854e7a33c6e2552","source":{"kind":"arxiv","id":"2311.11429","version":1},"attestation_state":"computed","paper":{"title":"Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lianke Qin, Saayan Mitra, Tianyi Zhou, Yuanyuan Yang, Zhao Song","submitted_at":"2023-11-19T21:40:16Z","abstract_excerpt":"In this paper, we consider a heavy inner product identification problem, which generalizes the Light Bulb problem~(\\cite{prr89}): Given two sets $A \\subset \\{-1,+1\\}^d$ and $B \\subset \\{-1,+1\\}^d$ with $|A|=|B| = n$, if there are exact $k$ pairs whose inner product passes a certain threshold, i.e., $\\{(a_1, b_1), \\cdots, (a_k, b_k)\\} \\subset A \\times B$ such that $\\forall i \\in [k], \\langle a_i,b_i \\rangle \\geq \\rho \\cdot d$, for a threshold $\\rho \\in (0,1)$, the goal is to identify those $k$ heavy inner products. We provide an algorithm that runs in $O(n^{2 \\omega / 3+ o(1)})$ time to find th"},"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.11429","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-19T21:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"1eccf5960cb39185a2337e18e4e6a8bb24185784e07137077d37457473adc7e3","abstract_canon_sha256":"7e436ca598a85a32f7f5ec19acf47523d3a3d9f4d70aeecbf673610b34ad384e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:32.960608Z","signature_b64":"0kf0RpfEDI2YcGaUjD/YJNwzEHJu/iZRc0h64/VkNakcqCXYaFfu/3XuWR9D7rQxS5UUwtftcVhaVOV4xX/KAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4a20573e58865d452a9644cab9c518aaa434559ec1fc40e1854e7a33c6e2552","last_reissued_at":"2026-07-05T07:14:32.960042Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:32.960042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lianke Qin, Saayan Mitra, Tianyi Zhou, Yuanyuan Yang, Zhao Song","submitted_at":"2023-11-19T21:40:16Z","abstract_excerpt":"In this paper, we consider a heavy inner product identification problem, which generalizes the Light Bulb problem~(\\cite{prr89}): Given two sets $A \\subset \\{-1,+1\\}^d$ and $B \\subset \\{-1,+1\\}^d$ with $|A|=|B| = n$, if there are exact $k$ pairs whose inner product passes a certain threshold, i.e., $\\{(a_1, b_1), \\cdots, (a_k, b_k)\\} \\subset A \\times B$ such that $\\forall i \\in [k], \\langle a_i,b_i \\rangle \\geq \\rho \\cdot d$, for a threshold $\\rho \\in (0,1)$, the goal is to identify those $k$ heavy inner products. We provide an algorithm that runs in $O(n^{2 \\omega / 3+ o(1)})$ time to find th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.11429","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.11429/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.11429","created_at":"2026-07-05T07:14:32.960116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.11429v1","created_at":"2026-07-05T07:14:32.960116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.11429","created_at":"2026-07-05T07:14:32.960116+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSRAK47FRBS5","created_at":"2026-07-05T07:14:32.960116+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSRAK47FRBS5IUVJ","created_at":"2026-07-05T07:14:32.960116+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSRAK47F","created_at":"2026-07-05T07:14:32.960116+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/WSRAK47FRBS5IUVJMRGKXHCRRK","json":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK.json","graph_json":"https://pith.science/api/pith-number/WSRAK47FRBS5IUVJMRGKXHCRRK/graph.json","events_json":"https://pith.science/api/pith-number/WSRAK47FRBS5IUVJMRGKXHCRRK/events.json","paper":"https://pith.science/paper/WSRAK47F"},"agent_actions":{"view_html":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK","download_json":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK.json","view_paper":"https://pith.science/paper/WSRAK47F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.11429&json=true","fetch_graph":"https://pith.science/api/pith-number/WSRAK47FRBS5IUVJMRGKXHCRRK/graph.json","fetch_events":"https://pith.science/api/pith-number/WSRAK47FRBS5IUVJMRGKXHCRRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK/action/storage_attestation","attest_author":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK/action/author_attestation","sign_citation":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK/action/citation_signature","submit_replication":"https://pith.science/pith/WSRAK47FRBS5IUVJMRGKXHCRRK/action/replication_record"}},"created_at":"2026-07-05T07:14:32.960116+00:00","updated_at":"2026-07-05T07:14:32.960116+00:00"}