{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RCCSQOF52PZIS7ICECVA6FVXVJ","short_pith_number":"pith:RCCSQOF5","schema_version":"1.0","canonical_sha256":"88852838bdd3f2897d0220aa0f16b7aa549da4d37be082c2c68e9f3c57d04938","source":{"kind":"arxiv","id":"1801.02790","version":2},"attestation_state":"computed","paper":{"title":"Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Sanjeev Khanna","submitted_at":"2018-01-09T04:24:01Z","abstract_excerpt":"Given a non-negative $n \\times m$ real matrix $A$, the {\\em matrix scaling} problem is to determine if it is possible to scale the rows and columns so that each row and each column sums to a specified target value for it. This problem arises in many algorithmic applications, perhaps most notably as a preconditioning step in solving a linear system of equations. One of the most natural and by now classical approach to matrix scaling is the Sinkhorn-Knopp algorithm (also known as the RAS method) where one alternately scales either all rows or all columns to meet the target values. In addition to"},"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":"1801.02790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-09T04:24:01Z","cross_cats_sorted":[],"title_canon_sha256":"b0af9d5a01d6c7f668adc92b6f7f35276ae7d25a19b93d984b9c793f70c13a47","abstract_canon_sha256":"732b6dcc71355f070fd9b76cd4515dc4ba7dc588fa516ac1d0b9e4c7fed0b496"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:11.510163Z","signature_b64":"XQxz+NC6Js8ybF9oWLyI2cMDJzo5zHfAp6X/79RqHfcPaLkS+AWySkTM774R2h1WVm4qtwEgOige4bf3Os3UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88852838bdd3f2897d0220aa0f16b7aa549da4d37be082c2c68e9f3c57d04938","last_reissued_at":"2026-05-18T00:23:11.509640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:11.509640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Sanjeev Khanna","submitted_at":"2018-01-09T04:24:01Z","abstract_excerpt":"Given a non-negative $n \\times m$ real matrix $A$, the {\\em matrix scaling} problem is to determine if it is possible to scale the rows and columns so that each row and each column sums to a specified target value for it. This problem arises in many algorithmic applications, perhaps most notably as a preconditioning step in solving a linear system of equations. One of the most natural and by now classical approach to matrix scaling is the Sinkhorn-Knopp algorithm (also known as the RAS method) where one alternately scales either all rows or all columns to meet the target values. In addition to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02790","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":"1801.02790","created_at":"2026-05-18T00:23:11.509714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02790v2","created_at":"2026-05-18T00:23:11.509714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02790","created_at":"2026-05-18T00:23:11.509714+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCCSQOF52PZI","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCCSQOF52PZIS7IC","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCCSQOF5","created_at":"2026-05-18T12:32:50.500415+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/RCCSQOF52PZIS7ICECVA6FVXVJ","json":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ.json","graph_json":"https://pith.science/api/pith-number/RCCSQOF52PZIS7ICECVA6FVXVJ/graph.json","events_json":"https://pith.science/api/pith-number/RCCSQOF52PZIS7ICECVA6FVXVJ/events.json","paper":"https://pith.science/paper/RCCSQOF5"},"agent_actions":{"view_html":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ","download_json":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ.json","view_paper":"https://pith.science/paper/RCCSQOF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02790&json=true","fetch_graph":"https://pith.science/api/pith-number/RCCSQOF52PZIS7ICECVA6FVXVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RCCSQOF52PZIS7ICECVA6FVXVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/action/storage_attestation","attest_author":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/action/author_attestation","sign_citation":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/action/citation_signature","submit_replication":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/action/replication_record"}},"created_at":"2026-05-18T00:23:11.509714+00:00","updated_at":"2026-05-18T00:23:11.509714+00:00"}