{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R647EHJU7SCGHB4MW7DTX7Q47W","short_pith_number":"pith:R647EHJU","schema_version":"1.0","canonical_sha256":"8fb9f21d34fc8463878cb7c73bfe1cfdb7012fd38a86ebe265b368cd64afa0dd","source":{"kind":"arxiv","id":"2408.00796","version":2},"attestation_state":"computed","paper":{"title":"Discrepancy Algorithms for the Binary Perceptron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP","math.PR"],"primary_cat":"cs.DS","authors_text":"Kangjie Zhou, Shuangping Li, Tselil Schramm","submitted_at":"2024-07-19T00:45:17Z","abstract_excerpt":"The binary perceptron problem asks us to find a sign vector in the intersection of independently chosen random halfspaces with intercept $-\\kappa$. We analyze the performance of the canonical discrepancy minimization algorithms of Lovett-Meka and Rothvoss/Eldan-Singh for the asymmetric binary perceptron problem. We obtain new algorithmic results in the $\\kappa = 0$ case and in the large-$|\\kappa|$ case. In the $\\kappa\\to-\\infty$ case, we additionally characterize the storage capacity and complement our algorithmic results with an almost-matching overlap-gap lower bound."},"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":"2408.00796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-19T00:45:17Z","cross_cats_sorted":["cs.CC","math-ph","math.MP","math.PR"],"title_canon_sha256":"5239936c758f8852c2c03de9cfed94d76ce58530e03eaad80a416bdc03780ff1","abstract_canon_sha256":"b464a713dd8438fccd30ccd5bafde40171c49e9920a4078163daa9977c01b83a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:38.526560Z","signature_b64":"NGuH2w+SCyMtVOTA5ixa9H3TCCItZhtQmskNQBP9n76dLFnt2PXlah5OSQ/QPrdzWEKUAfW/C3wLq8bLeJH6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb9f21d34fc8463878cb7c73bfe1cfdb7012fd38a86ebe265b368cd64afa0dd","last_reissued_at":"2026-07-05T11:08:38.526052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:38.526052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrepancy Algorithms for the Binary Perceptron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP","math.PR"],"primary_cat":"cs.DS","authors_text":"Kangjie Zhou, Shuangping Li, Tselil Schramm","submitted_at":"2024-07-19T00:45:17Z","abstract_excerpt":"The binary perceptron problem asks us to find a sign vector in the intersection of independently chosen random halfspaces with intercept $-\\kappa$. We analyze the performance of the canonical discrepancy minimization algorithms of Lovett-Meka and Rothvoss/Eldan-Singh for the asymmetric binary perceptron problem. We obtain new algorithmic results in the $\\kappa = 0$ case and in the large-$|\\kappa|$ case. In the $\\kappa\\to-\\infty$ case, we additionally characterize the storage capacity and complement our algorithmic results with an almost-matching overlap-gap lower bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00796","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.00796/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":"2408.00796","created_at":"2026-07-05T11:08:38.526123+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.00796v2","created_at":"2026-07-05T11:08:38.526123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00796","created_at":"2026-07-05T11:08:38.526123+00:00"},{"alias_kind":"pith_short_12","alias_value":"R647EHJU7SCG","created_at":"2026-07-05T11:08:38.526123+00:00"},{"alias_kind":"pith_short_16","alias_value":"R647EHJU7SCGHB4M","created_at":"2026-07-05T11:08:38.526123+00:00"},{"alias_kind":"pith_short_8","alias_value":"R647EHJU","created_at":"2026-07-05T11:08:38.526123+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05618","citing_title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","ref_index":86,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W","json":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W.json","graph_json":"https://pith.science/api/pith-number/R647EHJU7SCGHB4MW7DTX7Q47W/graph.json","events_json":"https://pith.science/api/pith-number/R647EHJU7SCGHB4MW7DTX7Q47W/events.json","paper":"https://pith.science/paper/R647EHJU"},"agent_actions":{"view_html":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W","download_json":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W.json","view_paper":"https://pith.science/paper/R647EHJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.00796&json=true","fetch_graph":"https://pith.science/api/pith-number/R647EHJU7SCGHB4MW7DTX7Q47W/graph.json","fetch_events":"https://pith.science/api/pith-number/R647EHJU7SCGHB4MW7DTX7Q47W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W/action/storage_attestation","attest_author":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W/action/author_attestation","sign_citation":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W/action/citation_signature","submit_replication":"https://pith.science/pith/R647EHJU7SCGHB4MW7DTX7Q47W/action/replication_record"}},"created_at":"2026-07-05T11:08:38.526123+00:00","updated_at":"2026-07-05T11:08:38.526123+00:00"}