{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZAEIR2O3ZONZYRPLFMFWR45DJ3","short_pith_number":"pith:ZAEIR2O3","canonical_record":{"source":{"id":"1706.07622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-23T10:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"eae3b4b03968fb4f936e17bfb3fc0f0feb45ec4412742c83ea74ad760658e44a","abstract_canon_sha256":"3945f63d800c1476d4e8d28079977aeac8969790e108c6cec7695baca2ebbec0"},"schema_version":"1.0"},"canonical_sha256":"c80888e9dbcb9b9c45eb2b0b68f3a34efd24fc6e62bc88fb4754f1eb1f5116ba","source":{"kind":"arxiv","id":"1706.07622","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07622","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07622v2","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07622","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZAEIR2O3ZONZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZAEIR2O3ZONZYRPL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZAEIR2O3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZAEIR2O3ZONZYRPLFMFWR45DJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-23T10:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"eae3b4b03968fb4f936e17bfb3fc0f0feb45ec4412742c83ea74ad760658e44a","abstract_canon_sha256":"3945f63d800c1476d4e8d28079977aeac8969790e108c6cec7695baca2ebbec0"},"schema_version":"1.0"},"canonical_sha256":"c80888e9dbcb9b9c45eb2b0b68f3a34efd24fc6e62bc88fb4754f1eb1f5116ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:22.490537Z","signature_b64":"NFWBAC1iSPUecYBZXZs3l04wRBslUh+R0K/q+DmKlqCyCB9OKGPLiiU5C7dEEdMaSn+C4t9ftD6cAxRnFh09BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c80888e9dbcb9b9c45eb2b0b68f3a34efd24fc6e62bc88fb4754f1eb1f5116ba","last_reissued_at":"2026-05-18T00:34:22.490061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:22.490061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07622","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:34:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2IAuiOeXkFeZS0rGe/ZAMVY5b4DjNk4OxcJvDYTXsb1IC7oSAZLugdB6GSXtZpVj2+hnC+HHVKRqzAPsWUdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:20:46.579185Z"},"content_sha256":"16bb1189e60ea546d1897290fa52ac08ed73f583bf62722ab679907a368bbbbc","schema_version":"1.0","event_id":"sha256:16bb1189e60ea546d1897290fa52ac08ed73f583bf62722ab679907a368bbbbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZAEIR2O3ZONZYRPLFMFWR45DJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Similar Triangles Method: a Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Tiurin, Pavel Dvurechensky, Sergey Omelchenko","submitted_at":"2017-06-23T10:01:08Z","abstract_excerpt":"In this paper, we are motivated by two important applications: entropy-regularized optimal transport problem and road or IP traffic demand matrix estimation by entropy model. Both of them include solving a special type of optimization problem with linear equality constraints and objective given as a sum of an entropy regularizer and a linear function. It is known that the state-of-the-art solvers for this problem, which are based on Sinkhorn's method (also known as RSA or balancing method), can fail to work, when the entropy-regularization parameter is small. We consider the above optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07622","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:34:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ij4ZvmmBcf4ztotls46amHLdwHxlL5BTsjCr/db6Wrehnnol0s9yEB4FFqTE36zOPciaWJYZdqeuWcK6nRzVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:20:46.579903Z"},"content_sha256":"819b1edae33f57c4ef4a051d35d72b076496f25aab3c66dbcd847fc6e6d17a2d","schema_version":"1.0","event_id":"sha256:819b1edae33f57c4ef4a051d35d72b076496f25aab3c66dbcd847fc6e6d17a2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAEIR2O3ZONZYRPLFMFWR45DJ3/bundle.json","state_url":"https://pith.science/pith/ZAEIR2O3ZONZYRPLFMFWR45DJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAEIR2O3ZONZYRPLFMFWR45DJ3/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-08T06:20:46Z","links":{"resolver":"https://pith.science/pith/ZAEIR2O3ZONZYRPLFMFWR45DJ3","bundle":"https://pith.science/pith/ZAEIR2O3ZONZYRPLFMFWR45DJ3/bundle.json","state":"https://pith.science/pith/ZAEIR2O3ZONZYRPLFMFWR45DJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAEIR2O3ZONZYRPLFMFWR45DJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZAEIR2O3ZONZYRPLFMFWR45DJ3","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":"3945f63d800c1476d4e8d28079977aeac8969790e108c6cec7695baca2ebbec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-23T10:01:08Z","title_canon_sha256":"eae3b4b03968fb4f936e17bfb3fc0f0feb45ec4412742c83ea74ad760658e44a"},"schema_version":"1.0","source":{"id":"1706.07622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07622","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07622v2","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07622","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZAEIR2O3ZONZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZAEIR2O3ZONZYRPL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZAEIR2O3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:819b1edae33f57c4ef4a051d35d72b076496f25aab3c66dbcd847fc6e6d17a2d","target":"graph","created_at":"2026-05-18T00:34:22Z","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":"In this paper, we are motivated by two important applications: entropy-regularized optimal transport problem and road or IP traffic demand matrix estimation by entropy model. Both of them include solving a special type of optimization problem with linear equality constraints and objective given as a sum of an entropy regularizer and a linear function. It is known that the state-of-the-art solvers for this problem, which are based on Sinkhorn's method (also known as RSA or balancing method), can fail to work, when the entropy-regularization parameter is small. We consider the above optimization","authors_text":"Alexander Gasnikov, Alexander Tiurin, Pavel Dvurechensky, Sergey Omelchenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-23T10:01:08Z","title":"Adaptive Similar Triangles Method: a Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07622","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:16bb1189e60ea546d1897290fa52ac08ed73f583bf62722ab679907a368bbbbc","target":"record","created_at":"2026-05-18T00:34:22Z","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":"3945f63d800c1476d4e8d28079977aeac8969790e108c6cec7695baca2ebbec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-23T10:01:08Z","title_canon_sha256":"eae3b4b03968fb4f936e17bfb3fc0f0feb45ec4412742c83ea74ad760658e44a"},"schema_version":"1.0","source":{"id":"1706.07622","kind":"arxiv","version":2}},"canonical_sha256":"c80888e9dbcb9b9c45eb2b0b68f3a34efd24fc6e62bc88fb4754f1eb1f5116ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c80888e9dbcb9b9c45eb2b0b68f3a34efd24fc6e62bc88fb4754f1eb1f5116ba","first_computed_at":"2026-05-18T00:34:22.490061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:22.490061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NFWBAC1iSPUecYBZXZs3l04wRBslUh+R0K/q+DmKlqCyCB9OKGPLiiU5C7dEEdMaSn+C4t9ftD6cAxRnFh09BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:22.490537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16bb1189e60ea546d1897290fa52ac08ed73f583bf62722ab679907a368bbbbc","sha256:819b1edae33f57c4ef4a051d35d72b076496f25aab3c66dbcd847fc6e6d17a2d"],"state_sha256":"29fbc098bd8d9c09be4bde799fb1eebd666989ea6d5ba0923f6bbd48dc8f3df0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dctqZhLwU96WJOUWa4XrxWoft1xjM3A0e9MlD2ZiAH+h6O7mWZF08eYZyCxsgYSKaIra3s1gyxW21v8wtUIcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:20:46.584173Z","bundle_sha256":"b35a5f2ebf4e4195905a1438dec6f698ae269e8d9fce99d67f7a51207cfc0d03"}}