{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZPO2JUZI247LBZHQPFUQRDDVQR","short_pith_number":"pith:ZPO2JUZI","schema_version":"1.0","canonical_sha256":"cbdda4d328d73eb0e4f07969088c758452d355e3f2618ed9eca03b4c63de70bc","source":{"kind":"arxiv","id":"1704.02310","version":2},"attestation_state":"computed","paper":{"title":"Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Aleksander Madry, Dimitris Tsipras, Michael B. Cohen","submitted_at":"2017-04-07T17:50:43Z","abstract_excerpt":"In this paper, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring logarithmic factors involving the dimension of the input matrix and the size of its entries, both run in time $\\widetilde{O}\\left(m\\log \\kappa \\log^2 (1/\\epsilon)\\right)$ where $\\epsilon$ is the amount of error we are willing to tolerate. Here, $\\kappa$ represents the ratio between the largest and the smallest entries of the optimal scalings. This implies that our"},"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.02310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:50:43Z","cross_cats_sorted":[],"title_canon_sha256":"23ccc1b901e53ea5c3c4d7a1d3cd292feace627e76b7e0beb158a364d075f668","abstract_canon_sha256":"160c28b6dfe72a275de84bfdcd5ecd295a0c6b502ae490b02f250d94a835312a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:47.619226Z","signature_b64":"h+QQOKZOZ9a7+4Fk5YBe/yewpPE/DLXbnOE8DJQ2zH224fiMDGDASWaWfbV7YeWxGXK3H6u20vd77wna0rYLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbdda4d328d73eb0e4f07969088c758452d355e3f2618ed9eca03b4c63de70bc","last_reissued_at":"2026-05-18T00:37:47.618572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:47.618572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Aleksander Madry, Dimitris Tsipras, Michael B. Cohen","submitted_at":"2017-04-07T17:50:43Z","abstract_excerpt":"In this paper, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring logarithmic factors involving the dimension of the input matrix and the size of its entries, both run in time $\\widetilde{O}\\left(m\\log \\kappa \\log^2 (1/\\epsilon)\\right)$ where $\\epsilon$ is the amount of error we are willing to tolerate. Here, $\\kappa$ represents the ratio between the largest and the smallest entries of the optimal scalings. This implies that our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02310","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":""},"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.02310","created_at":"2026-05-18T00:37:47.618707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02310v2","created_at":"2026-05-18T00:37:47.618707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02310","created_at":"2026-05-18T00:37:47.618707+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPO2JUZI247L","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPO2JUZI247LBZHQ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPO2JUZI","created_at":"2026-05-18T12:31:59.375834+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":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR","json":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR.json","graph_json":"https://pith.science/api/pith-number/ZPO2JUZI247LBZHQPFUQRDDVQR/graph.json","events_json":"https://pith.science/api/pith-number/ZPO2JUZI247LBZHQPFUQRDDVQR/events.json","paper":"https://pith.science/paper/ZPO2JUZI"},"agent_actions":{"view_html":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR","download_json":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR.json","view_paper":"https://pith.science/paper/ZPO2JUZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02310&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPO2JUZI247LBZHQPFUQRDDVQR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPO2JUZI247LBZHQPFUQRDDVQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/action/storage_attestation","attest_author":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/action/author_attestation","sign_citation":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/action/citation_signature","submit_replication":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/action/replication_record"}},"created_at":"2026-05-18T00:37:47.618707+00:00","updated_at":"2026-05-18T00:37:47.618707+00:00"}