{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Y42FOHJD636FNGP27W3L6ZPQI6","short_pith_number":"pith:Y42FOHJD","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"},"canonical_sha256":"c734571d23f6fc5699fafdb6bf65f047ae5f325c3d5b1efcd4e29aa9ed6a9b7b","source":{"kind":"arxiv","id":"2605.09782","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Y42FOHJD636FNGP27W3L6ZPQI6","target":"record","payload":{"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"},"canonical_sha256":"c734571d23f6fc5699fafdb6bf65f047ae5f325c3d5b1efcd4e29aa9ed6a9b7b","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"},"source_kind":"arxiv","source_id":"2605.09782","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-20T00:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBX+jB3lsJ97lPKjNmz6s6JmMkCBo5Lyv6ZqfNx8EghbjaxRoOR6Tvwlh2gr+TQywW054IHRTWQSvZZ5hRQ6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:59:39.383474Z"},"content_sha256":"e422274f65ef41ea69e1434201a6c5af89c1f4d8fde761017c3a5c01a2e0c1c7","schema_version":"1.0","event_id":"sha256:e422274f65ef41ea69e1434201a6c5af89c1f4d8fde761017c3a5c01a2e0c1c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Y42FOHJD636FNGP27W3L6ZPQI6","target":"graph","payload":{"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"},"verdict_id":"c49c60df-1da7-409e-bc4e-413138513d4f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANtvs5mHHsdmt0UWaBthslJU+Ow4JVmlct6D26QGdiUls5iCkvpjPHCfpBT05ue7FNm73TUd9G7Rd5qiE8H0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:59:39.384525Z"},"content_sha256":"35cb55c63a2b63d6097f4bae3e83e0fbe950d1b3b2b619c1bbfddbd486036687","schema_version":"1.0","event_id":"sha256:35cb55c63a2b63d6097f4bae3e83e0fbe950d1b3b2b619c1bbfddbd486036687"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:Y42FOHJD636FNGP27W3L6ZPQI6","target":"integrity","payload":{"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.","snippet":"doi: 10.1162/NECO\\_A\\_01178. URLhttps://doi.org/10.1162/neco_a_01178","arxiv_id":"2605.09782","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"doi: 10.1162/NECO\\_A\\_01178. URLhttps://doi.org/10.1162/neco_a_01178","reconstructed_doi":"10.1162/NECO\\_A\\_01178"},"severity":"advisory","ref_index":4,"audited_at":"2026-05-19T09:58:03.522819Z","event_type":"pith.integrity.v1","detected_doi":"10.1162/NECO\\_A\\_01178","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"abbd1eb7a4051143611949596598d74dc07530f3d2b59f96581f0857e11d6db8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":731,"payload_sha256":"f2090409c202aaa3ecf6cce5433458bce8931f0d09db7cec7227c4a9a1558512","signature_b64":"FV/zU+WDQ1htPTp/GgZrQEDkmqCjclpeZM1K2L6pA36iw6eFXjoDiur9u/YfkyrD+et2EWfn9jqvVmUXowXECA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T10:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WE1l3VZnwbvGRwmp2uJGu57Qg8I7EkMLfxyH5oQ5u+3eMbHtMGvarL7xZugvuOaImuTx6W97/JeVy+5wSEwJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:59:39.386093Z"},"content_sha256":"156d761343c93ae331189525f800dc394f9ecc524775a332f08c2dec79996456","schema_version":"1.0","event_id":"sha256:156d761343c93ae331189525f800dc394f9ecc524775a332f08c2dec79996456"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/bundle.json","state_url":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y42FOHJD636FNGP27W3L6ZPQI6/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-05-22T09:59:39Z","links":{"resolver":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6","bundle":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/bundle.json","state":"https://pith.science/pith/Y42FOHJD636FNGP27W3L6ZPQI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y42FOHJD636FNGP27W3L6ZPQI6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79bQuvQr4q5E7nmATom/ZXVyRut+FOPXDP57YV4WFd9fDvy+UZAN5w84lZNL8duYyryrvBp8bWGB7AncOOGNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T09:59:39.390604Z","bundle_sha256":"0b202ed269a1620269306cfeb7e0fbed4eb67f5acab2ca756a804fbd8b7bf976"}}