{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5TBER4PKD56BYU36KK34575PLM","short_pith_number":"pith:5TBER4PK","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"},"canonical_sha256":"ecc248f1ea1f7c1c537e52b7ceffaf5b3ba59c0ac953e3ae0ba972293a088457","source":{"kind":"arxiv","id":"1104.3830","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3830","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3830v2","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3830","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"5TBER4PKD56B","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TBER4PKD56BYU36","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TBER4PK","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5TBER4PKD56BYU36KK34575PLM","target":"record","payload":{"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"},"canonical_sha256":"ecc248f1ea1f7c1c537e52b7ceffaf5b3ba59c0ac953e3ae0ba972293a088457","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"},"source_kind":"arxiv","source_id":"1104.3830","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-18T03:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1kDnyafV+sm7Alu/5wd2/FuyX9EZQNx+NZMLmjq2h2wfgpleIGkfbFmTpiYNiUPEp8bYZyin16rk8hW2PnSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:39:32.116077Z"},"content_sha256":"4ab386d7347e3642b58dc6c043cb4f9851e5e7bdb745e65e61fee1c39eee723c","schema_version":"1.0","event_id":"sha256:4ab386d7347e3642b58dc6c043cb4f9851e5e7bdb745e65e61fee1c39eee723c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5TBER4PKD56BYU36KK34575PLM","target":"graph","payload":{"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"},"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-18T03:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lW1I8jQr5Z3JgWWqWzojtaSqaauNsw+/w1yIlQoeOqgaEpiyj7cK4w55FMGVR1qUPEzHTtCSPHzQ2ULhrAMuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:39:32.116434Z"},"content_sha256":"c2be411d52904a075ce542ed2ab0378cabf617d9d44a987553a3bdc07295727b","schema_version":"1.0","event_id":"sha256:c2be411d52904a075ce542ed2ab0378cabf617d9d44a987553a3bdc07295727b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/bundle.json","state_url":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TBER4PKD56BYU36KK34575PLM/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-30T04:39:32Z","links":{"resolver":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM","bundle":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/bundle.json","state":"https://pith.science/pith/5TBER4PKD56BYU36KK34575PLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TBER4PKD56BYU36KK34575PLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5TBER4PKD56BYU36KK34575PLM","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":"e653f2069dd1aa3456561dc88c981f3c432e28f1bef2fc0644dc5730f306c6bd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-19T18:33:13Z","title_canon_sha256":"65a45b47e25242c9b20c12f6f66194c355087f95babfde79041b350d7c9fa7e7"},"schema_version":"1.0","source":{"id":"1104.3830","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3830","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3830v2","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3830","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"5TBER4PKD56B","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TBER4PKD56BYU36","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TBER4PK","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:c2be411d52904a075ce542ed2ab0378cabf617d9d44a987553a3bdc07295727b","target":"graph","created_at":"2026-05-18T03:08:14Z","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":"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","authors_text":"Laura Grigori, Meisam Sharify, St\\'ephane Gaubert","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-19T18:33:13Z","title":"Solution of the optimal assignment problem by diagonal scaling algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3830","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:4ab386d7347e3642b58dc6c043cb4f9851e5e7bdb745e65e61fee1c39eee723c","target":"record","created_at":"2026-05-18T03:08:14Z","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":"e653f2069dd1aa3456561dc88c981f3c432e28f1bef2fc0644dc5730f306c6bd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-04-19T18:33:13Z","title_canon_sha256":"65a45b47e25242c9b20c12f6f66194c355087f95babfde79041b350d7c9fa7e7"},"schema_version":"1.0","source":{"id":"1104.3830","kind":"arxiv","version":2}},"canonical_sha256":"ecc248f1ea1f7c1c537e52b7ceffaf5b3ba59c0ac953e3ae0ba972293a088457","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecc248f1ea1f7c1c537e52b7ceffaf5b3ba59c0ac953e3ae0ba972293a088457","first_computed_at":"2026-05-18T03:08:14.830116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:14.830116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2SByFahUESY+S3mRg20X/83mL0NYWaLI0XJ/2sjCH2yWjJ2O6S1tlHe0qVqxVDt3eDOboWrxDYPsXhA6F8NAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:14.830967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3830","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ab386d7347e3642b58dc6c043cb4f9851e5e7bdb745e65e61fee1c39eee723c","sha256:c2be411d52904a075ce542ed2ab0378cabf617d9d44a987553a3bdc07295727b"],"state_sha256":"81e8f172f91f0dd6b426f0c55465555f88bd221de5a4ce3bcded617f0b265c03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HQlxwecJ1TFWqX1IqTxV+jlZOxN+IQ5bXEUQWEzL4j6deovRu93kiul7J58uIvEgsclqa7sFEsY0oc6K0+KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T04:39:32.118452Z","bundle_sha256":"0d16adefc053cb8a1c46ccd25e8e84478a770d3dbf09fd247ceeaa0969fae508"}}