{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Y42FOHJD636FNGP27W3L6ZPQI6","short_pith_number":"pith:Y42FOHJD","schema_version":"1.0","canonical_sha256":"c734571d23f6fc5699fafdb6bf65f047ae5f325c3d5b1efcd4e29aa9ed6a9b7b","source":{"kind":"arxiv","id":"2605.09782","version":2},"attestation_state":"computed","paper":{"title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"GenusSink delivers near-linear time approximate Sinkhorn algorithms for bounded-genus graphs with shortest-path costs.","cross_cats":["stat.ME"],"primary_cat":"cs.DS","authors_text":"Ananya Parashar, Derek Long, Dwaipayan Saha, Krzysztof Choromanski","submitted_at":"2026-05-10T22:00:42Z","abstract_excerpt":"We present GenusSink, a new class of approximate generalized Sinkhorn algorithms with shortest-path-distance costs for bounded genus (e.g. planar) graphs, providing near-linear time: (1) pre-processing, (2) iteration step, (3) final transport plan matrix querying and near-linear memory. Graphs handled by GenusSink include in particular planar graphs and bounded-genus meshes approximating 3D objects. GenusSink addresses total quadratic time complexity of its brute-force counterpart by leveraging separator-based decomposition of graphs, computational geometry techniques, and new results on fast "},"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":"2605.09782","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T22:00:42Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"966a4fbefcc228d5e38205447f001f520a1b9299bfc4b8153abd97c054e0190f","abstract_canon_sha256":"8b9b47fc4942d71929d7fd8f56aa9d70d8409c2e0ccf478d35560f28e09fb5a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:46.804247Z","signature_b64":"VYFch6oNA65zz1aXtebOK3aoYcR1Hqlf6ShDNxMfZ4HY0WhF273dFJtzMNdXp0pKp8Jx7IoKBSQnZOFd6UxUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c734571d23f6fc5699fafdb6bf65f047ae5f325c3d5b1efcd4e29aa9ed6a9b7b","last_reissued_at":"2026-05-20T00:05:46.803628Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:46.803628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"GenusSink delivers near-linear time approximate Sinkhorn algorithms for bounded-genus graphs with shortest-path costs.","cross_cats":["stat.ME"],"primary_cat":"cs.DS","authors_text":"Ananya Parashar, Derek Long, Dwaipayan Saha, Krzysztof Choromanski","submitted_at":"2026-05-10T22:00:42Z","abstract_excerpt":"We present GenusSink, a new class of approximate generalized Sinkhorn algorithms with shortest-path-distance costs for bounded genus (e.g. planar) graphs, providing near-linear time: (1) pre-processing, (2) iteration step, (3) final transport plan matrix querying and near-linear memory. Graphs handled by GenusSink include in particular planar graphs and bounded-genus meshes approximating 3D objects. GenusSink addresses total quadratic time complexity of its brute-force counterpart by leveraging separator-based decomposition of graphs, computational geometry techniques, and new results on fast "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"GenusSink provides near-linear time (1) pre-processing, (2) iteration step, (3) final transport plan matrix querying and near-linear memory for approximate generalized Sinkhorn algorithms with shortest-path-distance costs on bounded genus graphs, and is numerically equivalent to the brute-force geodesic Sinkhorn algorithm on n-vertex graphs with treewidth O(log log n).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Bounded-genus graphs admit separator decompositions that allow approximation of their metrics by small-treewidth metrics while preserving the structure needed for fast generalized distance matrix multiplications without accumulating unacceptable error in the Sinkhorn iterations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"GenusSink achieves near-linear time approximate generalized Sinkhorn for geodesic optimal transport on bounded-genus graphs by combining separator-based decompositions with Fourier and low-displacement-rank matrix-vector multiplications.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"GenusSink delivers near-linear time approximate Sinkhorn algorithms for bounded-genus graphs with shortest-path costs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ba4cc4849adea5d4f6b7668404ea1534cb81b70db99819abcd39d7ccca056575"},"source":{"id":"2605.09782","kind":"arxiv","version":2},"verdict":{"id":"c49c60df-1da7-409e-bc4e-413138513d4f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T03:05:08.325874Z","strongest_claim":"GenusSink provides near-linear time (1) pre-processing, (2) iteration step, (3) final transport plan matrix querying and near-linear memory for approximate generalized Sinkhorn algorithms with shortest-path-distance costs on bounded genus graphs, and is numerically equivalent to the brute-force geodesic Sinkhorn algorithm on n-vertex graphs with treewidth O(log log n).","one_line_summary":"GenusSink achieves near-linear time approximate generalized Sinkhorn for geodesic optimal transport on bounded-genus graphs by combining separator-based decompositions with Fourier and low-displacement-rank matrix-vector multiplications.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Bounded-genus graphs admit separator decompositions that allow approximation of their metrics by small-treewidth metrics while preserving the structure needed for fast generalized distance matrix multiplications without accumulating unacceptable error in the Sinkhorn iterations.","pith_extraction_headline":"GenusSink delivers near-linear time approximate Sinkhorn algorithms for bounded-genus graphs with shortest-path costs."},"integrity":{"clean":false,"summary":{"advisory":1,"critical":0,"by_detector":{"doi_compliance":{"total":1,"advisory":1,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.09782/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1162/NECO\\_A\\_01178) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":4,"audited_at":"2026-05-19T09:58:03.522819Z","detected_doi":"10.1162/NECO\\_A\\_01178","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T16:36:27.024854Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T12:31:17.887793Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T09:58:03.522819Z","status":"completed","version":"1.0.0","findings_count":1}],"snapshot_sha256":"ba9caa278960a6937f7275e4a012bfdebffb30d5fb43c2948f140b3950f1887f"},"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":"2605.09782","created_at":"2026-05-20T00:05:46.803722+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.09782v2","created_at":"2026-05-20T00:05:46.803722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09782","created_at":"2026-05-20T00:05:46.803722+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y42FOHJD636F","created_at":"2026-05-20T00:05:46.803722+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y42FOHJD636FNGP2","created_at":"2026-05-20T00:05:46.803722+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y42FOHJD","created_at":"2026-05-20T00:05:46.803722+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/Y42FOHJD636FNGP27W3L6ZPQI6","json":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6.json","graph_json":"https://pith.science/api/pith-number/Y42FOHJD636FNGP27W3L6ZPQI6/graph.json","events_json":"https://pith.science/api/pith-number/Y42FOHJD636FNGP27W3L6ZPQI6/events.json","paper":"https://pith.science/paper/Y42FOHJD"},"agent_actions":{"view_html":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6","download_json":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6.json","view_paper":"https://pith.science/paper/Y42FOHJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.09782&json=true","fetch_graph":"https://pith.science/api/pith-number/Y42FOHJD636FNGP27W3L6ZPQI6/graph.json","fetch_events":"https://pith.science/api/pith-number/Y42FOHJD636FNGP27W3L6ZPQI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/action/storage_attestation","attest_author":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/action/author_attestation","sign_citation":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/action/citation_signature","submit_replication":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/action/replication_record"}},"created_at":"2026-05-20T00:05:46.803722+00:00","updated_at":"2026-05-20T00:05:46.803722+00:00"}