{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SIZJ4C34HL55QGZQSJ34UZJ67R","short_pith_number":"pith:SIZJ4C34","schema_version":"1.0","canonical_sha256":"92329e0b7c3afbd81b309277ca653efc62361f66003c446817e1174b1acc37e5","source":{"kind":"arxiv","id":"2210.16456","version":1},"attestation_state":"computed","paper":{"title":"Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Jason M. Altschuler","submitted_at":"2022-10-29T01:04:19Z","abstract_excerpt":"In this short expository note, we describe a unified algorithmic perspective on several classical problems which have traditionally been studied in different communities. This perspective views the main characters -- the problems of Optimal Transport, Minimum Mean Cycle, Matrix Scaling, and Matrix Balancing -- through the same lens of optimization problems over joint probability distributions P(x,y) with constrained marginals. While this is how Optimal Transport is typically introduced, this lens is markedly less conventional for the other three problems. This perspective leads to a simple and"},"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":"2210.16456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-29T01:04:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b18a3fc8fcaaf9a8c6a440203ac3ba9f44c97c56a5b3104b903c2b6fcb2cffb6","abstract_canon_sha256":"d5b4f263b84d6f0fa0c50cd02f693fc365f2b4b29fc0d226349b9a718fc92051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:46.554101Z","signature_b64":"p7cMr1sb4Qrp2WGv9sj3tbMA+1VWiwr39IZ0b8Jjwz/RRr6mygy17yxkGrRY8I61JEpexGgbxCyyCAjgasVUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92329e0b7c3afbd81b309277ca653efc62361f66003c446817e1174b1acc37e5","last_reissued_at":"2026-07-05T05:11:46.553571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:46.553571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Jason M. Altschuler","submitted_at":"2022-10-29T01:04:19Z","abstract_excerpt":"In this short expository note, we describe a unified algorithmic perspective on several classical problems which have traditionally been studied in different communities. This perspective views the main characters -- the problems of Optimal Transport, Minimum Mean Cycle, Matrix Scaling, and Matrix Balancing -- through the same lens of optimization problems over joint probability distributions P(x,y) with constrained marginals. While this is how Optimal Transport is typically introduced, this lens is markedly less conventional for the other three problems. This perspective leads to a simple and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.16456","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.16456/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.16456","created_at":"2026-07-05T05:11:46.553629+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.16456v1","created_at":"2026-07-05T05:11:46.553629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.16456","created_at":"2026-07-05T05:11:46.553629+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIZJ4C34HL55","created_at":"2026-07-05T05:11:46.553629+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIZJ4C34HL55QGZQ","created_at":"2026-07-05T05:11:46.553629+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIZJ4C34","created_at":"2026-07-05T05:11:46.553629+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.11359","citing_title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11170","citing_title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R","json":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R.json","graph_json":"https://pith.science/api/pith-number/SIZJ4C34HL55QGZQSJ34UZJ67R/graph.json","events_json":"https://pith.science/api/pith-number/SIZJ4C34HL55QGZQSJ34UZJ67R/events.json","paper":"https://pith.science/paper/SIZJ4C34"},"agent_actions":{"view_html":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R","download_json":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R.json","view_paper":"https://pith.science/paper/SIZJ4C34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.16456&json=true","fetch_graph":"https://pith.science/api/pith-number/SIZJ4C34HL55QGZQSJ34UZJ67R/graph.json","fetch_events":"https://pith.science/api/pith-number/SIZJ4C34HL55QGZQSJ34UZJ67R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R/action/storage_attestation","attest_author":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R/action/author_attestation","sign_citation":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R/action/citation_signature","submit_replication":"https://pith.science/pith/SIZJ4C34HL55QGZQSJ34UZJ67R/action/replication_record"}},"created_at":"2026-07-05T05:11:46.553629+00:00","updated_at":"2026-07-05T05:11:46.553629+00:00"}