{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2DDS6GMQGQM76WRKVN73RI2XNF","short_pith_number":"pith:2DDS6GMQ","canonical_record":{"source":{"id":"1810.07717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T18:08:30Z","cross_cats_sorted":[],"title_canon_sha256":"c4ac3536c05cc6570bf570bd222994e4076cfa12fbcccb49fd7d62e4cba8c724","abstract_canon_sha256":"9b5cee1d3cf50f74e7adbc2df74ef64f13cbe964cd5560088d55eb4ae03d85b1"},"schema_version":"1.0"},"canonical_sha256":"d0c72f19903419ff5a2aab7fb8a357696c8905048c36968678da2ec43f8ad0cf","source":{"kind":"arxiv","id":"1810.07717","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07717","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07717v3","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07717","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"2DDS6GMQGQM7","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"pith_short_16","alias_value":"2DDS6GMQGQM76WRK","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"pith_short_8","alias_value":"2DDS6GMQ","created_at":"2026-07-05T00:36:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2DDS6GMQGQM76WRKVN73RI2XNF","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T18:08:30Z","cross_cats_sorted":[],"title_canon_sha256":"c4ac3536c05cc6570bf570bd222994e4076cfa12fbcccb49fd7d62e4cba8c724","abstract_canon_sha256":"9b5cee1d3cf50f74e7adbc2df74ef64f13cbe964cd5560088d55eb4ae03d85b1"},"schema_version":"1.0"},"canonical_sha256":"d0c72f19903419ff5a2aab7fb8a357696c8905048c36968678da2ec43f8ad0cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:36:16.601329Z","signature_b64":"pL1ggAxwgx85Eiosz5sFEfPUtGq/Dh4w8/pxMO6stBpAJm0ia3C0Pn2j9lN8oxEojn4227/VXzzBW7MbDe8sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0c72f19903419ff5a2aab7fb8a357696c8905048c36968678da2ec43f8ad0cf","last_reissued_at":"2026-07-05T00:36:16.600812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:36:16.600812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07717","source_version":3,"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-07-05T00:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nf2T5CuM6OAqEGYGQjADJOZqrgU1zAJ+HPp9RjVJan6pnE0fnY85HDI+g6RwDxmy68RwgMLehJjKovEhaKPSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:36:50.334586Z"},"content_sha256":"91cfafcb21ba4d3d034ed5faf577d955885cee80478b97cf7e0c312da265a5c0","schema_version":"1.0","event_id":"sha256:91cfafcb21ba4d3d034ed5faf577d955885cee80478b97cf7e0c312da265a5c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2DDS6GMQGQM76WRKVN73RI2XNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Optimal Running Times for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Carson Kent, Jose Blanchet","submitted_at":"2018-10-17T18:08:30Z","abstract_excerpt":"In this work, we provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions $\\mu, \\nu \\in \\Delta^n$. Given a cost function $C : [n] \\times [n] \\to \\mathbb{R}_{\\geq 0}$ where $C(i,j) \\leq 1$ quantifies the penalty of transporting a unit of mass from $i$ to $j$, we show how to compute a coupling $X$ between $r$ and $c$ in time $\\widetilde{O}\\left(n^2 /\\epsilon \\right)$ whose expected transportation cost is within an additive $\\epsilon$ of optimal. This improves upon the previously best known running time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07717","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/1810.07717/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJMcv7WzRDhnBk7/I1lckouzt/73GM78OhpDXdpkNOkos09QIuewI/teFvN8PWEf2f74AtBNsZWXjv+HIFgcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:36:50.335091Z"},"content_sha256":"eb1f1c6b7f2b1250e423f0d11d0dd765aa52e03d8582ccf47eb7a77db2d8b0c4","schema_version":"1.0","event_id":"sha256:eb1f1c6b7f2b1250e423f0d11d0dd765aa52e03d8582ccf47eb7a77db2d8b0c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/bundle.json","state_url":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DDS6GMQGQM76WRKVN73RI2XNF/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-08-21T09:36:50Z","links":{"resolver":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF","bundle":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/bundle.json","state":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DDS6GMQGQM76WRKVN73RI2XNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2DDS6GMQGQM76WRKVN73RI2XNF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9b5cee1d3cf50f74e7adbc2df74ef64f13cbe964cd5560088d55eb4ae03d85b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T18:08:30Z","title_canon_sha256":"c4ac3536c05cc6570bf570bd222994e4076cfa12fbcccb49fd7d62e4cba8c724"},"schema_version":"1.0","source":{"id":"1810.07717","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07717","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07717v3","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07717","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"2DDS6GMQGQM7","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"pith_short_16","alias_value":"2DDS6GMQGQM76WRK","created_at":"2026-07-05T00:36:16Z"},{"alias_kind":"pith_short_8","alias_value":"2DDS6GMQ","created_at":"2026-07-05T00:36:16Z"}],"graph_snapshots":[{"event_id":"sha256:eb1f1c6b7f2b1250e423f0d11d0dd765aa52e03d8582ccf47eb7a77db2d8b0c4","target":"graph","created_at":"2026-07-05T00:36:16Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.07717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions $\\mu, \\nu \\in \\Delta^n$. Given a cost function $C : [n] \\times [n] \\to \\mathbb{R}_{\\geq 0}$ where $C(i,j) \\leq 1$ quantifies the penalty of transporting a unit of mass from $i$ to $j$, we show how to compute a coupling $X$ between $r$ and $c$ in time $\\widetilde{O}\\left(n^2 /\\epsilon \\right)$ whose expected transportation cost is within an additive $\\epsilon$ of optimal. This improves upon the previously best known running time","authors_text":"Aaron Sidford, Arun Jambulapati, Carson Kent, Jose Blanchet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T18:08:30Z","title":"Towards Optimal Running Times for Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07717","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:91cfafcb21ba4d3d034ed5faf577d955885cee80478b97cf7e0c312da265a5c0","target":"record","created_at":"2026-07-05T00:36:16Z","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":"9b5cee1d3cf50f74e7adbc2df74ef64f13cbe964cd5560088d55eb4ae03d85b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T18:08:30Z","title_canon_sha256":"c4ac3536c05cc6570bf570bd222994e4076cfa12fbcccb49fd7d62e4cba8c724"},"schema_version":"1.0","source":{"id":"1810.07717","kind":"arxiv","version":3}},"canonical_sha256":"d0c72f19903419ff5a2aab7fb8a357696c8905048c36968678da2ec43f8ad0cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0c72f19903419ff5a2aab7fb8a357696c8905048c36968678da2ec43f8ad0cf","first_computed_at":"2026-07-05T00:36:16.600812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:36:16.600812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pL1ggAxwgx85Eiosz5sFEfPUtGq/Dh4w8/pxMO6stBpAJm0ia3C0Pn2j9lN8oxEojn4227/VXzzBW7MbDe8sDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:36:16.601329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07717","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91cfafcb21ba4d3d034ed5faf577d955885cee80478b97cf7e0c312da265a5c0","sha256:eb1f1c6b7f2b1250e423f0d11d0dd765aa52e03d8582ccf47eb7a77db2d8b0c4"],"state_sha256":"ac456a48d4f9362889062c0c08e98a53d8180b65ce992bcc187d59c11702fe0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYtQCr0AoFEMKtQyS1jBE5rRQ1sJWtTstGIcuzVUlQNHjIXMW5wM0U8b9Lx/3i7isMhmBz37XqRB84NBrM0QCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T09:36:50.339401Z","bundle_sha256":"3be645d73b1ac0d5ffd1798d3c94e2ec7ae4500bd0f5db5dfd05da761658c216"}}