{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Y42FOHJD636FNGP27W3L6ZPQI6","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8b9b47fc4942d71929d7fd8f56aa9d70d8409c2e0ccf478d35560f28e09fb5a5","cross_cats_sorted":["stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T22:00:42Z","title_canon_sha256":"966a4fbefcc228d5e38205447f001f520a1b9299bfc4b8153abd97c054e0190f"},"schema_version":"1.0","source":{"id":"2605.09782","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09782","created_at":"2026-05-20T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09782v2","created_at":"2026-05-20T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09782","created_at":"2026-05-20T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"Y42FOHJD636F","created_at":"2026-05-20T00:05:46Z"},{"alias_kind":"pith_short_16","alias_value":"Y42FOHJD636FNGP2","created_at":"2026-05-20T00:05:46Z"},{"alias_kind":"pith_short_8","alias_value":"Y42FOHJD","created_at":"2026-05-20T00:05:46Z"}],"graph_snapshots":[{"event_id":"sha256:35cb55c63a2b63d6097f4bae3e83e0fbe950d1b3b2b619c1bbfddbd486036687","target":"graph","created_at":"2026-05-20T00:05:46Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"GenusSink delivers near-linear time approximate Sinkhorn algorithms for bounded-genus graphs with shortest-path costs."}],"snapshot_sha256":"ba4cc4849adea5d4f6b7668404ea1534cb81b70db99819abcd39d7ccca056575"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"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":1,"name":"doi_compliance","ran_at":"2026-05-19T09:58:03.522819Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.09782/integrity.json","findings":[{"audited_at":"2026-05-19T09:58:03.522819Z","detected_arxiv_id":null,"detected_doi":"10.1162/NECO\\_A\\_01178","detector":"doi_compliance","finding_type":"recoverable_identifier","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.","ref_index":4,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"ba9caa278960a6937f7275e4a012bfdebffb30d5fb43c2948f140b3950f1887f","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":0,"informational":0,"total":1}},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Ananya Parashar, Derek Long, Dwaipayan Saha, Krzysztof Choromanski","cross_cats":["stat.ME"],"headline":"GenusSink delivers near-linear time approximate Sinkhorn algorithms for bounded-genus graphs with shortest-path costs.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T22:00:42Z","title":"Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.09782","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T03:05:08.325874Z","id":"c49c60df-1da7-409e-bc4e-413138513d4f","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"GenusSink delivers near-linear time approximate Sinkhorn algorithms for bounded-genus graphs with shortest-path costs.","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).","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."}},"verdict_id":"c49c60df-1da7-409e-bc4e-413138513d4f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e422274f65ef41ea69e1434201a6c5af89c1f4d8fde761017c3a5c01a2e0c1c7","target":"record","created_at":"2026-05-20T00:05:46Z","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":"8b9b47fc4942d71929d7fd8f56aa9d70d8409c2e0ccf478d35560f28e09fb5a5","cross_cats_sorted":["stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T22:00:42Z","title_canon_sha256":"966a4fbefcc228d5e38205447f001f520a1b9299bfc4b8153abd97c054e0190f"},"schema_version":"1.0","source":{"id":"2605.09782","kind":"arxiv","version":2}},"canonical_sha256":"c734571d23f6fc5699fafdb6bf65f047ae5f325c3d5b1efcd4e29aa9ed6a9b7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c734571d23f6fc5699fafdb6bf65f047ae5f325c3d5b1efcd4e29aa9ed6a9b7b","first_computed_at":"2026-05-20T00:05:46.803628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:46.803628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VYFch6oNA65zz1aXtebOK3aoYcR1Hqlf6ShDNxMfZ4HY0WhF273dFJtzMNdXp0pKp8Jx7IoKBSQnZOFd6UxUBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:46.804247Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.09782","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:156d761343c93ae331189525f800dc394f9ecc524775a332f08c2dec79996456","sha256:e422274f65ef41ea69e1434201a6c5af89c1f4d8fde761017c3a5c01a2e0c1c7","sha256:35cb55c63a2b63d6097f4bae3e83e0fbe950d1b3b2b619c1bbfddbd486036687"],"state_sha256":"0b0b14fc152f3dc735223fc1ca08ffa78059026b241595082abaaeab81f108f8"}