{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RCCSQOF52PZIS7ICECVA6FVXVJ","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":"732b6dcc71355f070fd9b76cd4515dc4ba7dc588fa516ac1d0b9e4c7fed0b496","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-09T04:24:01Z","title_canon_sha256":"b0af9d5a01d6c7f668adc92b6f7f35276ae7d25a19b93d984b9c793f70c13a47"},"schema_version":"1.0","source":{"id":"1801.02790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02790","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02790v2","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02790","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"RCCSQOF52PZI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCCSQOF52PZIS7IC","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCCSQOF5","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:2e3c92ab05d745bba132c8c36d3fabc675bfe5f4d2b46563727f4a37afe5274d","target":"graph","created_at":"2026-05-18T00:23:11Z","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":"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","authors_text":"Deeparnab Chakrabarty, Sanjeev Khanna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-09T04:24:01Z","title":"Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02790","kind":"arxiv","version":2},"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:eb6e9c6c6dc9b6536ea30b8c00fbae4abd9550b2335b3ab422994778a7204fb3","target":"record","created_at":"2026-05-18T00:23:11Z","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":"732b6dcc71355f070fd9b76cd4515dc4ba7dc588fa516ac1d0b9e4c7fed0b496","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-09T04:24:01Z","title_canon_sha256":"b0af9d5a01d6c7f668adc92b6f7f35276ae7d25a19b93d984b9c793f70c13a47"},"schema_version":"1.0","source":{"id":"1801.02790","kind":"arxiv","version":2}},"canonical_sha256":"88852838bdd3f2897d0220aa0f16b7aa549da4d37be082c2c68e9f3c57d04938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88852838bdd3f2897d0220aa0f16b7aa549da4d37be082c2c68e9f3c57d04938","first_computed_at":"2026-05-18T00:23:11.509640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:11.509640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQxz+NC6Js8ybF9oWLyI2cMDJzo5zHfAp6X/79RqHfcPaLkS+AWySkTM774R2h1WVm4qtwEgOige4bf3Os3UCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:11.510163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb6e9c6c6dc9b6536ea30b8c00fbae4abd9550b2335b3ab422994778a7204fb3","sha256:2e3c92ab05d745bba132c8c36d3fabc675bfe5f4d2b46563727f4a37afe5274d"],"state_sha256":"3f414fe62ae1bf29e5971bd50fb9e63987af81dd3644387f0b2f8194f41c30ea"}