{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7HSV6QQZN65WTZPS7BIL52PQII","short_pith_number":"pith:7HSV6QQZ","schema_version":"1.0","canonical_sha256":"f9e55f42196fbb69e5f2f850bee9f0422eb628bff27ad3a0a3f6b67eeffcf879","source":{"kind":"arxiv","id":"2607.04062","version":1},"attestation_state":"computed","paper":{"title":"Fast, Parallel, Query-Efficient Binary Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"math.OC","authors_text":"Aaron Sidford, Ishani Karmarkar, Liam O'Carroll","submitted_at":"2026-07-05T00:18:56Z","abstract_excerpt":"We study the fundamental classification problem of computing a separating hyperplane for a binary-labeled dataset of size $n$ with normalized $d$-dimensional features. Letting $\\Phi \\in \\mathbb{R}^{n \\times d}$ denote the feature matrix and $\\gamma$ the margin of the maximum-margin separating hyperplane, we present a randomized algorithm that solves this problem in $\\tilde{O}(\\gamma^{-2/3}\\, \\operatorname{nnz}(\\Phi) + \\gamma^{-2(\\omega+1)/3})$-sequential running time (work), $\\tilde{O}(\\gamma^{-2/3})$-parallel (computational) depth, and accesses $\\Phi$ only through $\\tilde{O}(\\gamma^{-2/3})$-m"},"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":"2607.04062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-05T00:18:56Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"2fc9c68bd0991fd6b26be85a8632fdbebea040b0c97297eb5781a330614cbacc","abstract_canon_sha256":"b9d15f5f18cc1193ae90478a14aacf5659b20f9e770489748232254ae84bdc25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:55.480086Z","signature_b64":"RmYPq4VT8No/V31yAfIfkmvk5ayiJ5AXciZrlV6KM4COhYwWqk7y4JdB5axj7tln5B9Xd8ZggKJndl0Ei5l2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9e55f42196fbb69e5f2f850bee9f0422eb628bff27ad3a0a3f6b67eeffcf879","last_reissued_at":"2026-07-07T02:18:55.479488Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:55.479488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast, Parallel, Query-Efficient Binary Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"math.OC","authors_text":"Aaron Sidford, Ishani Karmarkar, Liam O'Carroll","submitted_at":"2026-07-05T00:18:56Z","abstract_excerpt":"We study the fundamental classification problem of computing a separating hyperplane for a binary-labeled dataset of size $n$ with normalized $d$-dimensional features. Letting $\\Phi \\in \\mathbb{R}^{n \\times d}$ denote the feature matrix and $\\gamma$ the margin of the maximum-margin separating hyperplane, we present a randomized algorithm that solves this problem in $\\tilde{O}(\\gamma^{-2/3}\\, \\operatorname{nnz}(\\Phi) + \\gamma^{-2(\\omega+1)/3})$-sequential running time (work), $\\tilde{O}(\\gamma^{-2/3})$-parallel (computational) depth, and accesses $\\Phi$ only through $\\tilde{O}(\\gamma^{-2/3})$-m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04062","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/2607.04062/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":"2607.04062","created_at":"2026-07-07T02:18:55.479584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04062v1","created_at":"2026-07-07T02:18:55.479584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04062","created_at":"2026-07-07T02:18:55.479584+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HSV6QQZN65W","created_at":"2026-07-07T02:18:55.479584+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HSV6QQZN65WTZPS","created_at":"2026-07-07T02:18:55.479584+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HSV6QQZ","created_at":"2026-07-07T02:18:55.479584+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/7HSV6QQZN65WTZPS7BIL52PQII","json":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII.json","graph_json":"https://pith.science/api/pith-number/7HSV6QQZN65WTZPS7BIL52PQII/graph.json","events_json":"https://pith.science/api/pith-number/7HSV6QQZN65WTZPS7BIL52PQII/events.json","paper":"https://pith.science/paper/7HSV6QQZ"},"agent_actions":{"view_html":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII","download_json":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII.json","view_paper":"https://pith.science/paper/7HSV6QQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04062&json=true","fetch_graph":"https://pith.science/api/pith-number/7HSV6QQZN65WTZPS7BIL52PQII/graph.json","fetch_events":"https://pith.science/api/pith-number/7HSV6QQZN65WTZPS7BIL52PQII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII/action/storage_attestation","attest_author":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII/action/author_attestation","sign_citation":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII/action/citation_signature","submit_replication":"https://pith.science/pith/7HSV6QQZN65WTZPS7BIL52PQII/action/replication_record"}},"created_at":"2026-07-07T02:18:55.479584+00:00","updated_at":"2026-07-07T02:18:55.479584+00:00"}