{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WFO2QFVEMR4Y5JAL7BCL5EKS45","short_pith_number":"pith:WFO2QFVE","schema_version":"1.0","canonical_sha256":"b15da816a464798ea40bf844be9152e778c44fb2f02526c3c9e70f0ee47d92e1","source":{"kind":"arxiv","id":"2409.02789","version":2},"attestation_state":"computed","paper":{"title":"The entries of the Sinkhorn limit of an $m \\times n$ matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.CO"],"primary_cat":"math.NT","authors_text":"Eric Rowland, Jason Wu","submitted_at":"2024-09-04T15:04:18Z","abstract_excerpt":"We use a variety of computational tools to obtain a degree-$\\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \\times n$ matrix. The degree of this equation has a combinatorial interpretation as the number of minors of an $(m - 1) \\times (n - 1)$ matrix, and the coefficients involve a determinant formula that reflects new combinatorial structure on sets of minor specifications. The tools we use include Gr\\\"obner bases, which produce equations for small matrices; the PSLQ algorithm, which produces equations for larg"},"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":"2409.02789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-09-04T15:04:18Z","cross_cats_sorted":["math.AC","math.CO"],"title_canon_sha256":"7eae098fd0bd6ef6a25fd970b03ee039f3a41932da3bdb0821e8f5d3eb586dc2","abstract_canon_sha256":"dc236b0cac4a035e137a038fda20e289d448f1414bb470563f68f27f2c832afc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:00.088597Z","signature_b64":"fVarHchFFaArp8490wJZgaqxO+28weOQtJA9M/5f+XdUse56HdcG98JUPXJC8tCjmIOtFN665Q5WsObXcm2VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b15da816a464798ea40bf844be9152e778c44fb2f02526c3c9e70f0ee47d92e1","last_reissued_at":"2026-07-05T11:09:00.088099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:00.088099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The entries of the Sinkhorn limit of an $m \\times n$ matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.CO"],"primary_cat":"math.NT","authors_text":"Eric Rowland, Jason Wu","submitted_at":"2024-09-04T15:04:18Z","abstract_excerpt":"We use a variety of computational tools to obtain a degree-$\\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \\times n$ matrix. The degree of this equation has a combinatorial interpretation as the number of minors of an $(m - 1) \\times (n - 1)$ matrix, and the coefficients involve a determinant formula that reflects new combinatorial structure on sets of minor specifications. The tools we use include Gr\\\"obner bases, which produce equations for small matrices; the PSLQ algorithm, which produces equations for larg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02789","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.02789/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":"2409.02789","created_at":"2026-07-05T11:09:00.088159+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02789v2","created_at":"2026-07-05T11:09:00.088159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02789","created_at":"2026-07-05T11:09:00.088159+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFO2QFVEMR4Y","created_at":"2026-07-05T11:09:00.088159+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFO2QFVEMR4Y5JAL","created_at":"2026-07-05T11:09:00.088159+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFO2QFVE","created_at":"2026-07-05T11:09:00.088159+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":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45","json":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45.json","graph_json":"https://pith.science/api/pith-number/WFO2QFVEMR4Y5JAL7BCL5EKS45/graph.json","events_json":"https://pith.science/api/pith-number/WFO2QFVEMR4Y5JAL7BCL5EKS45/events.json","paper":"https://pith.science/paper/WFO2QFVE"},"agent_actions":{"view_html":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45","download_json":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45.json","view_paper":"https://pith.science/paper/WFO2QFVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02789&json=true","fetch_graph":"https://pith.science/api/pith-number/WFO2QFVEMR4Y5JAL7BCL5EKS45/graph.json","fetch_events":"https://pith.science/api/pith-number/WFO2QFVEMR4Y5JAL7BCL5EKS45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45/action/storage_attestation","attest_author":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45/action/author_attestation","sign_citation":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45/action/citation_signature","submit_replication":"https://pith.science/pith/WFO2QFVEMR4Y5JAL7BCL5EKS45/action/replication_record"}},"created_at":"2026-07-05T11:09:00.088159+00:00","updated_at":"2026-07-05T11:09:00.088159+00:00"}