{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RCCSQOF52PZIS7ICECVA6FVXVJ","short_pith_number":"pith:RCCSQOF5","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"},"canonical_sha256":"88852838bdd3f2897d0220aa0f16b7aa549da4d37be082c2c68e9f3c57d04938","source":{"kind":"arxiv","id":"1801.02790","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RCCSQOF52PZIS7ICECVA6FVXVJ","target":"record","payload":{"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"},"canonical_sha256":"88852838bdd3f2897d0220aa0f16b7aa549da4d37be082c2c68e9f3c57d04938","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"},"source_kind":"arxiv","source_id":"1801.02790","source_version":2,"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-18T00:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqJFoJAMSijOdWx61sPNfEug76gXxv1sUt2Y40Fw8TuCi4OgxvPqjWT7P8MoFO23KRbKL6Ff//g2qWgmyoTuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:36:02.439407Z"},"content_sha256":"eb6e9c6c6dc9b6536ea30b8c00fbae4abd9550b2335b3ab422994778a7204fb3","schema_version":"1.0","event_id":"sha256:eb6e9c6c6dc9b6536ea30b8c00fbae4abd9550b2335b3ab422994778a7204fb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RCCSQOF52PZIS7ICECVA6FVXVJ","target":"graph","payload":{"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"},"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-18T00:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAYf0ng3gByuxX/wf2eH7E7j9/yR7eHIBzoIQ932aMssgLivVJOrtQQrqjt7k8bEiMJDPrfXA98LL4mdOl+vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:36:02.439777Z"},"content_sha256":"2e3c92ab05d745bba132c8c36d3fabc675bfe5f4d2b46563727f4a37afe5274d","schema_version":"1.0","event_id":"sha256:2e3c92ab05d745bba132c8c36d3fabc675bfe5f4d2b46563727f4a37afe5274d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/bundle.json","state_url":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/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-06-02T20:36:02Z","links":{"resolver":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ","bundle":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/bundle.json","state":"https://pith.science/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCCSQOF52PZIS7ICECVA6FVXVJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uGBUGlrVMrzNj0+U3Ig2XU1kSHEj4FXaDhQWqQuFAiE82amEcjnX5IV5LRAuiTrO2+EbGpWxFmF6K0fx6ic/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:36:02.441742Z","bundle_sha256":"f4fe65a37e451808e06b18307b023d4aef83e602d86212b5f48bfea0704118d5"}}