{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UG45X5T7LNW7YAX3RO36GFDQBB","short_pith_number":"pith:UG45X5T7","schema_version":"1.0","canonical_sha256":"a1b9dbf67f5b6dfc02fb8bb7e31470087b5124c2d41a0596fbd52db389335f28","source":{"kind":"arxiv","id":"1704.02315","version":1},"attestation_state":"computed","paper":{"title":"Much Faster Algorithms for Matrix Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Avi Wigderson, Rafael Oliveira, Yuanzhi Li, Zeyuan Allen-Zhu","submitted_at":"2017-04-07T17:57:19Z","abstract_excerpt":"We develop several efficient algorithms for the classical \\emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\\times n$ matrix $A$, this problem asks to find diagonal (scaling) matrices $X$ and $Y$ (if they exist), so that $X A Y$ $\\varepsilon$-approximates a doubly stochastic, or more generally a matrix with prescribed row and column sums.\n  We address the general scaling problem as well as some important special cases. In particular, if $A$ has $m$ nonzero entries, and if there exist $X$ and "},"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":"1704.02315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:57:19Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"cc69f02d5be07d2662435c0d9f966065cdda41291a119107d225878835006dac","abstract_canon_sha256":"f26fea2eee55a38c2d8455c97dbf9a8c50401aadadf71999d16fc93ccb7e43a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.078232Z","signature_b64":"vcy3GtCVAeWvIrpRvH7X3ZzTL+88h3Xoytj56SbuO4IvnjJqMnnZ4e8rasz3LjmLb0T8H7T7WeGqjqdcp6FlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1b9dbf67f5b6dfc02fb8bb7e31470087b5124c2d41a0596fbd52db389335f28","last_reissued_at":"2026-05-18T00:46:50.077490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.077490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Much Faster Algorithms for Matrix Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Avi Wigderson, Rafael Oliveira, Yuanzhi Li, Zeyuan Allen-Zhu","submitted_at":"2017-04-07T17:57:19Z","abstract_excerpt":"We develop several efficient algorithms for the classical \\emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\\times n$ matrix $A$, this problem asks to find diagonal (scaling) matrices $X$ and $Y$ (if they exist), so that $X A Y$ $\\varepsilon$-approximates a doubly stochastic, or more generally a matrix with prescribed row and column sums.\n  We address the general scaling problem as well as some important special cases. In particular, if $A$ has $m$ nonzero entries, and if there exist $X$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02315","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":"1704.02315","created_at":"2026-05-18T00:46:50.077625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02315v1","created_at":"2026-05-18T00:46:50.077625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02315","created_at":"2026-05-18T00:46:50.077625+00:00"},{"alias_kind":"pith_short_12","alias_value":"UG45X5T7LNW7","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UG45X5T7LNW7YAX3","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UG45X5T7","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10340","citing_title":"Flows in Almost Linear Time via Adaptive Preconditioning","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB","json":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB.json","graph_json":"https://pith.science/api/pith-number/UG45X5T7LNW7YAX3RO36GFDQBB/graph.json","events_json":"https://pith.science/api/pith-number/UG45X5T7LNW7YAX3RO36GFDQBB/events.json","paper":"https://pith.science/paper/UG45X5T7"},"agent_actions":{"view_html":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB","download_json":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB.json","view_paper":"https://pith.science/paper/UG45X5T7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02315&json=true","fetch_graph":"https://pith.science/api/pith-number/UG45X5T7LNW7YAX3RO36GFDQBB/graph.json","fetch_events":"https://pith.science/api/pith-number/UG45X5T7LNW7YAX3RO36GFDQBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB/action/storage_attestation","attest_author":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB/action/author_attestation","sign_citation":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB/action/citation_signature","submit_replication":"https://pith.science/pith/UG45X5T7LNW7YAX3RO36GFDQBB/action/replication_record"}},"created_at":"2026-05-18T00:46:50.077625+00:00","updated_at":"2026-05-18T00:46:50.077625+00:00"}