{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5TBER4PKD56BYU36KK34575PLM","short_pith_number":"pith:5TBER4PK","schema_version":"1.0","canonical_sha256":"ecc248f1ea1f7c1c537e52b7ceffaf5b3ba59c0ac953e3ae0ba972293a088457","source":{"kind":"arxiv","id":"1104.3830","version":2},"attestation_state":"computed","paper":{"title":"Solution of the optimal assignment problem by diagonal scaling algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Laura Grigori, Meisam Sharify, St\\'ephane Gaubert","submitted_at":"2011-04-19T18:33:13Z","abstract_excerpt":"We show that a solution of the optimal assignment problem can be obtained as the limit of the solution of an entropy maximization problem, as a deformation parameter tends to infinity. This allows us to apply entropy maximization algorithms to the optimal assignment problem. In particular, the Sinkhorn algorithm leads to a parallelizable method, which can be used as a preprocessing to handle large dense optimal assignment problems. This parallel preprocessing allows one to delete entries which do not belong to optimal permutations, leading to a reduced instance which becomes solvable with limi"},"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":"1104.3830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-19T18:33:13Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"65a45b47e25242c9b20c12f6f66194c355087f95babfde79041b350d7c9fa7e7","abstract_canon_sha256":"e653f2069dd1aa3456561dc88c981f3c432e28f1bef2fc0644dc5730f306c6bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:14.830967Z","signature_b64":"m2SByFahUESY+S3mRg20X/83mL0NYWaLI0XJ/2sjCH2yWjJ2O6S1tlHe0qVqxVDt3eDOboWrxDYPsXhA6F8NAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecc248f1ea1f7c1c537e52b7ceffaf5b3ba59c0ac953e3ae0ba972293a088457","last_reissued_at":"2026-05-18T03:08:14.830116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:14.830116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution of the optimal assignment problem by diagonal scaling algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Laura Grigori, Meisam Sharify, St\\'ephane Gaubert","submitted_at":"2011-04-19T18:33:13Z","abstract_excerpt":"We show that a solution of the optimal assignment problem can be obtained as the limit of the solution of an entropy maximization problem, as a deformation parameter tends to infinity. This allows us to apply entropy maximization algorithms to the optimal assignment problem. In particular, the Sinkhorn algorithm leads to a parallelizable method, which can be used as a preprocessing to handle large dense optimal assignment problems. This parallel preprocessing allows one to delete entries which do not belong to optimal permutations, leading to a reduced instance which becomes solvable with limi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3830","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":"1104.3830","created_at":"2026-05-18T03:08:14.830237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3830v2","created_at":"2026-05-18T03:08:14.830237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3830","created_at":"2026-05-18T03:08:14.830237+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TBER4PKD56B","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TBER4PKD56BYU36","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TBER4PK","created_at":"2026-05-18T12:26:20.644004+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/5TBER4PKD56BYU36KK34575PLM","json":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM.json","graph_json":"https://pith.science/api/pith-number/5TBER4PKD56BYU36KK34575PLM/graph.json","events_json":"https://pith.science/api/pith-number/5TBER4PKD56BYU36KK34575PLM/events.json","paper":"https://pith.science/paper/5TBER4PK"},"agent_actions":{"view_html":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM","download_json":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM.json","view_paper":"https://pith.science/paper/5TBER4PK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3830&json=true","fetch_graph":"https://pith.science/api/pith-number/5TBER4PKD56BYU36KK34575PLM/graph.json","fetch_events":"https://pith.science/api/pith-number/5TBER4PKD56BYU36KK34575PLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/action/storage_attestation","attest_author":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/action/author_attestation","sign_citation":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/action/citation_signature","submit_replication":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/action/replication_record"}},"created_at":"2026-05-18T03:08:14.830237+00:00","updated_at":"2026-05-18T03:08:14.830237+00:00"}