{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KQXH6RXNLG6POJ6S2XV64ZE7VT","short_pith_number":"pith:KQXH6RXN","canonical_record":{"source":{"id":"1905.04447","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-05-11T04:42:16Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"d5694534e8033a9b8309f6fb2ab31deb182a89bf3812ce5da9bab1798be6c76e","abstract_canon_sha256":"950d3fb8e6800ca4a1edc91c097d35e2c8481397072786b0f662f341c38a6f1d"},"schema_version":"1.0"},"canonical_sha256":"542e7f46ed59bcf727d2d5ebee649faccad29038656beaefe5320dfc5c29995d","source":{"kind":"arxiv","id":"1905.04447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04447","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04447v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04447","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"KQXH6RXNLG6P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KQXH6RXNLG6POJ6S","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KQXH6RXN","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KQXH6RXNLG6POJ6S2XV64ZE7VT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04447","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-05-11T04:42:16Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"d5694534e8033a9b8309f6fb2ab31deb182a89bf3812ce5da9bab1798be6c76e","abstract_canon_sha256":"950d3fb8e6800ca4a1edc91c097d35e2c8481397072786b0f662f341c38a6f1d"},"schema_version":"1.0"},"canonical_sha256":"542e7f46ed59bcf727d2d5ebee649faccad29038656beaefe5320dfc5c29995d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.818009Z","signature_b64":"+YKgcGjzjI63kGc9GZKXzHEzxp7mPPTfjaf0TurjKa8S19tEMkgxXr0UTr4PUJH9fVHImcIWAbSy2mGSGbozDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"542e7f46ed59bcf727d2d5ebee649faccad29038656beaefe5320dfc5c29995d","last_reissued_at":"2026-05-17T23:46:24.817377Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.817377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04447","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XdGsL7Y9vkMJtQke11fyJMlPTInf2LNyVO1+aoKZD9dw1vxBoNrKSg8j8qJ5x6L6P6AawibAKIm+TR+H+gpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:14:21.121787Z"},"content_sha256":"d59b3f34aabc642f28480b107db6202bb834a7b9df9bbdd3db4e87444f505ca0","schema_version":"1.0","event_id":"sha256:d59b3f34aabc642f28480b107db6202bb834a7b9df9bbdd3db4e87444f505ca0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KQXH6RXNLG6POJ6S2XV64ZE7VT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Empirical Risk Minimization in the Current Matrix Multiplication Time","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ML"],"primary_cat":"cs.DS","authors_text":"Qiuyi Zhang, Yin Tat Lee, Zhao Song","submitted_at":"2019-05-11T04:42:16Z","abstract_excerpt":"Many convex problems in machine learning and computer science share the same form: \\begin{align*} \\min_{x} \\sum_{i} f_i( A_i x + b_i), \\end{align*} where $f_i$ are convex functions on $\\mathbb{R}^{n_i}$ with constant $n_i$, $A_i \\in \\mathbb{R}^{n_i \\times d}$, $b_i \\in \\mathbb{R}^{n_i}$ and $\\sum_i n_i = n$. This problem generalizes linear programming and includes many problems in empirical risk minimization. In this paper, we give an algorithm that runs in time \\begin{align*} O^* ( ( n^{\\omega} + n^{2.5 - \\alpha/2} + n^{2+ 1/6} ) \\log (n / \\delta) ) \\end{align*} where $\\omega$ is the exponent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04447","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXev3NbLH7PnXzJT6BMg0E7Eic0BkurPc5yheOquT7C6Uyzru8wDtp+uILS4R7L4bEWXkte8MhGqji1zFZ4hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:14:21.122426Z"},"content_sha256":"cca9827e9e888b7ab90f25ea2b6823c2dfacdc4e340a19a3438de9c8e83a175e","schema_version":"1.0","event_id":"sha256:cca9827e9e888b7ab90f25ea2b6823c2dfacdc4e340a19a3438de9c8e83a175e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQXH6RXNLG6POJ6S2XV64ZE7VT/bundle.json","state_url":"https://pith.science/pith/KQXH6RXNLG6POJ6S2XV64ZE7VT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQXH6RXNLG6POJ6S2XV64ZE7VT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T21:14:21Z","links":{"resolver":"https://pith.science/pith/KQXH6RXNLG6POJ6S2XV64ZE7VT","bundle":"https://pith.science/pith/KQXH6RXNLG6POJ6S2XV64ZE7VT/bundle.json","state":"https://pith.science/pith/KQXH6RXNLG6POJ6S2XV64ZE7VT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQXH6RXNLG6POJ6S2XV64ZE7VT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KQXH6RXNLG6POJ6S2XV64ZE7VT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"950d3fb8e6800ca4a1edc91c097d35e2c8481397072786b0f662f341c38a6f1d","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-05-11T04:42:16Z","title_canon_sha256":"d5694534e8033a9b8309f6fb2ab31deb182a89bf3812ce5da9bab1798be6c76e"},"schema_version":"1.0","source":{"id":"1905.04447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04447","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04447v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04447","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"KQXH6RXNLG6P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KQXH6RXNLG6POJ6S","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KQXH6RXN","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:cca9827e9e888b7ab90f25ea2b6823c2dfacdc4e340a19a3438de9c8e83a175e","target":"graph","created_at":"2026-05-17T23:46:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Many convex problems in machine learning and computer science share the same form: \\begin{align*} \\min_{x} \\sum_{i} f_i( A_i x + b_i), \\end{align*} where $f_i$ are convex functions on $\\mathbb{R}^{n_i}$ with constant $n_i$, $A_i \\in \\mathbb{R}^{n_i \\times d}$, $b_i \\in \\mathbb{R}^{n_i}$ and $\\sum_i n_i = n$. This problem generalizes linear programming and includes many problems in empirical risk minimization. In this paper, we give an algorithm that runs in time \\begin{align*} O^* ( ( n^{\\omega} + n^{2.5 - \\alpha/2} + n^{2+ 1/6} ) \\log (n / \\delta) ) \\end{align*} where $\\omega$ is the exponent","authors_text":"Qiuyi Zhang, Yin Tat Lee, Zhao Song","cross_cats":["cs.LG","math.OC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-05-11T04:42:16Z","title":"Solving Empirical Risk Minimization in the Current Matrix Multiplication Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04447","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d59b3f34aabc642f28480b107db6202bb834a7b9df9bbdd3db4e87444f505ca0","target":"record","created_at":"2026-05-17T23:46:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"950d3fb8e6800ca4a1edc91c097d35e2c8481397072786b0f662f341c38a6f1d","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-05-11T04:42:16Z","title_canon_sha256":"d5694534e8033a9b8309f6fb2ab31deb182a89bf3812ce5da9bab1798be6c76e"},"schema_version":"1.0","source":{"id":"1905.04447","kind":"arxiv","version":1}},"canonical_sha256":"542e7f46ed59bcf727d2d5ebee649faccad29038656beaefe5320dfc5c29995d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"542e7f46ed59bcf727d2d5ebee649faccad29038656beaefe5320dfc5c29995d","first_computed_at":"2026-05-17T23:46:24.817377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:24.817377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+YKgcGjzjI63kGc9GZKXzHEzxp7mPPTfjaf0TurjKa8S19tEMkgxXr0UTr4PUJH9fVHImcIWAbSy2mGSGbozDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:24.818009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d59b3f34aabc642f28480b107db6202bb834a7b9df9bbdd3db4e87444f505ca0","sha256:cca9827e9e888b7ab90f25ea2b6823c2dfacdc4e340a19a3438de9c8e83a175e"],"state_sha256":"3887ba962f741315ef1dfc35203aa855ffef9881e4c1240ce1d343ba6ca84562"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilBYW7MwvKaROjL6EQYREaGaqYUFdnhQzsI4NwsoO/OX1KBSFyVXquoF+1UDugjQ2gVhO8E43ZC2QWvied/dBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:14:21.125999Z","bundle_sha256":"1c061a8cda0d651640513abf07f6f3954d01fd90fff4e1bf58c895be3fe2925f"}}