{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7Q3Y5AS53YS5WW53TSTCN3EGCL","short_pith_number":"pith:7Q3Y5AS5","schema_version":"1.0","canonical_sha256":"fc378e825dde25db5bbb9ca626ec8612ec7e0f736e75c53288febc356535e574","source":{"kind":"arxiv","id":"1810.05957","version":2},"attestation_state":"computed","paper":{"title":"Approximating optimal transport with linear programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kent Quanrud","submitted_at":"2018-10-14T03:02:25Z","abstract_excerpt":"In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation algorithms for optimal transport."},"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":"1810.05957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-14T03:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"07bb8d90bfc3e105007bc7eb6eca2534cb3cc6b3488a68941b50d594a7eeab53","abstract_canon_sha256":"9c61e3344b14b71d406d6974fb8ff351622e322ac72498368126050e76534ba7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:44.102135Z","signature_b64":"GZSiIWWYYKkORED5fsVr+OxhvDOyIOnt6Zq2GCRtQniFLapJ6dt/NlV8gmULsTn8OmT/dakEJKapsL1fiU7ABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc378e825dde25db5bbb9ca626ec8612ec7e0f736e75c53288febc356535e574","last_reissued_at":"2026-05-18T00:02:44.101690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:44.101690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating optimal transport with linear programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kent Quanrud","submitted_at":"2018-10-14T03:02:25Z","abstract_excerpt":"In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation algorithms for optimal transport."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05957","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":""},"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":"1810.05957","created_at":"2026-05-18T00:02:44.101763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05957v2","created_at":"2026-05-18T00:02:44.101763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05957","created_at":"2026-05-18T00:02:44.101763+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Q3Y5AS53YS5","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Q3Y5AS53YS5WW53","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Q3Y5AS5","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20122","citing_title":"Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL","json":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL.json","graph_json":"https://pith.science/api/pith-number/7Q3Y5AS53YS5WW53TSTCN3EGCL/graph.json","events_json":"https://pith.science/api/pith-number/7Q3Y5AS53YS5WW53TSTCN3EGCL/events.json","paper":"https://pith.science/paper/7Q3Y5AS5"},"agent_actions":{"view_html":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL","download_json":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL.json","view_paper":"https://pith.science/paper/7Q3Y5AS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05957&json=true","fetch_graph":"https://pith.science/api/pith-number/7Q3Y5AS53YS5WW53TSTCN3EGCL/graph.json","fetch_events":"https://pith.science/api/pith-number/7Q3Y5AS53YS5WW53TSTCN3EGCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL/action/storage_attestation","attest_author":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL/action/author_attestation","sign_citation":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL/action/citation_signature","submit_replication":"https://pith.science/pith/7Q3Y5AS53YS5WW53TSTCN3EGCL/action/replication_record"}},"created_at":"2026-05-18T00:02:44.101763+00:00","updated_at":"2026-05-18T00:02:44.101763+00:00"}