{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LFA5HGJISVARQ7YFTYQLA222TJ","short_pith_number":"pith:LFA5HGJI","schema_version":"1.0","canonical_sha256":"5941d399289541187f059e20b06b5a9a47869dec770a96f0a4389131067ad0de","source":{"kind":"arxiv","id":"1812.11930","version":3},"attestation_state":"computed","paper":{"title":"Alternate minimization and doubly stochastic matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Melvyn B. Nathanson","submitted_at":"2018-12-31T18:11:20Z","abstract_excerpt":"Sinkhorn's alternative minimization algorithm applied to a positive $n\\times n$ matrix converges to a doubly stochastic matrix. If the algorithm, applied to a $2\\times 2$ matrix, converges in a finite number of iterations, then it converges in at most two iterations, and the structure of such matrices is determined."},"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":"1812.11930","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-31T18:11:20Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"ac09c684189f7c013bb4411d6e16a507d29806d81280c72b42a4b95b20e14407","abstract_canon_sha256":"d4e9b0d364d69d8866d06560bc60ad6100b32503e53aa836b7acec0a58374db1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:25.426836Z","signature_b64":"Q7/RCILlm3YhAou+mpsCf32Xa68d5+01le+m6l2yUf/BrsGw2AV4GmCjkEQXNclNLY6oJjnTc2BnM46ux2ElAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5941d399289541187f059e20b06b5a9a47869dec770a96f0a4389131067ad0de","last_reissued_at":"2026-07-05T01:54:25.426505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:25.426505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternate minimization and doubly stochastic matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Melvyn B. Nathanson","submitted_at":"2018-12-31T18:11:20Z","abstract_excerpt":"Sinkhorn's alternative minimization algorithm applied to a positive $n\\times n$ matrix converges to a doubly stochastic matrix. If the algorithm, applied to a $2\\times 2$ matrix, converges in a finite number of iterations, then it converges in at most two iterations, and the structure of such matrices is determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11930","kind":"arxiv","version":3},"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/1812.11930/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":"1812.11930","created_at":"2026-07-05T01:54:25.426564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11930v3","created_at":"2026-07-05T01:54:25.426564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11930","created_at":"2026-07-05T01:54:25.426564+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFA5HGJISVAR","created_at":"2026-07-05T01:54:25.426564+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFA5HGJISVARQ7YF","created_at":"2026-07-05T01:54:25.426564+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFA5HGJI","created_at":"2026-07-05T01:54:25.426564+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06338","citing_title":"Closed Form of a Generalized Sinkhorn Limit","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ","json":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ.json","graph_json":"https://pith.science/api/pith-number/LFA5HGJISVARQ7YFTYQLA222TJ/graph.json","events_json":"https://pith.science/api/pith-number/LFA5HGJISVARQ7YFTYQLA222TJ/events.json","paper":"https://pith.science/paper/LFA5HGJI"},"agent_actions":{"view_html":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ","download_json":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ.json","view_paper":"https://pith.science/paper/LFA5HGJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11930&json=true","fetch_graph":"https://pith.science/api/pith-number/LFA5HGJISVARQ7YFTYQLA222TJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LFA5HGJISVARQ7YFTYQLA222TJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ/action/storage_attestation","attest_author":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ/action/author_attestation","sign_citation":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ/action/citation_signature","submit_replication":"https://pith.science/pith/LFA5HGJISVARQ7YFTYQLA222TJ/action/replication_record"}},"created_at":"2026-07-05T01:54:25.426564+00:00","updated_at":"2026-07-05T01:54:25.426564+00:00"}