{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z54ZHJEK5VPAVP6A3R6TCDNXBP","short_pith_number":"pith:Z54ZHJEK","schema_version":"1.0","canonical_sha256":"cf7993a48aed5e0abfc0dc7d310db70bf649f583b402a9cf291c7a70bf684af6","source":{"kind":"arxiv","id":"1607.05127","version":4},"attestation_state":"computed","paper":{"title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Karrenbauer, Christoph Lenzen, Ruben Becker, Sebastian Forster","submitted_at":"2016-07-18T15:27:01Z","abstract_excerpt":"We present a method for solving the transshipment problem - also known as uncapacitated minimum cost flow - up to a multiplicative error of $1 + \\varepsilon$ in undirected graphs with non-negative edge weights using a tailored gradient descent algorithm. Using $\\tilde{O}(\\cdot)$ to hide polylogarithmic factors in $n$ (the number of nodes in the graph), our gradient descent algorithm takes $\\tilde O(\\varepsilon^{-2})$ iterations, and in each iteration it solves an instance of the transshipment problem up to a multiplicative error of $\\operatorname{polylog} n$. In particular, this allows us to p"},"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":"1607.05127","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:27:01Z","cross_cats_sorted":[],"title_canon_sha256":"06968b7f8229fc969d11d1f9914deb9949b07e60e6a667147d76428f5dee3e49","abstract_canon_sha256":"6bb04cfec8e86d965c6edca12b047637942493f7f41b9abbe2e603ee04a4b9d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:27.163095Z","signature_b64":"R0GneNN8MydimgUTZWBe7w9UzT3QpO66NG+wJYUJ4rfcia78FjtZe6neHAJUH3gP8/Qew8w/zWwvl5/qOcWwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf7993a48aed5e0abfc0dc7d310db70bf649f583b402a9cf291c7a70bf684af6","last_reissued_at":"2026-07-05T02:12:27.162619Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:27.162619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Karrenbauer, Christoph Lenzen, Ruben Becker, Sebastian Forster","submitted_at":"2016-07-18T15:27:01Z","abstract_excerpt":"We present a method for solving the transshipment problem - also known as uncapacitated minimum cost flow - up to a multiplicative error of $1 + \\varepsilon$ in undirected graphs with non-negative edge weights using a tailored gradient descent algorithm. Using $\\tilde{O}(\\cdot)$ to hide polylogarithmic factors in $n$ (the number of nodes in the graph), our gradient descent algorithm takes $\\tilde O(\\varepsilon^{-2})$ iterations, and in each iteration it solves an instance of the transshipment problem up to a multiplicative error of $\\operatorname{polylog} n$. In particular, this allows us to p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05127","kind":"arxiv","version":4},"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/1607.05127/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.05127","created_at":"2026-07-05T02:12:27.162675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05127v4","created_at":"2026-07-05T02:12:27.162675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05127","created_at":"2026-07-05T02:12:27.162675+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z54ZHJEK5VPA","created_at":"2026-07-05T02:12:27.162675+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z54ZHJEK5VPAVP6A","created_at":"2026-07-05T02:12:27.162675+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z54ZHJEK","created_at":"2026-07-05T02:12:27.162675+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.10340","citing_title":"Flows in Almost Linear Time via Adaptive Preconditioning","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP","json":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP.json","graph_json":"https://pith.science/api/pith-number/Z54ZHJEK5VPAVP6A3R6TCDNXBP/graph.json","events_json":"https://pith.science/api/pith-number/Z54ZHJEK5VPAVP6A3R6TCDNXBP/events.json","paper":"https://pith.science/paper/Z54ZHJEK"},"agent_actions":{"view_html":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP","download_json":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP.json","view_paper":"https://pith.science/paper/Z54ZHJEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05127&json=true","fetch_graph":"https://pith.science/api/pith-number/Z54ZHJEK5VPAVP6A3R6TCDNXBP/graph.json","fetch_events":"https://pith.science/api/pith-number/Z54ZHJEK5VPAVP6A3R6TCDNXBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP/action/storage_attestation","attest_author":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP/action/author_attestation","sign_citation":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP/action/citation_signature","submit_replication":"https://pith.science/pith/Z54ZHJEK5VPAVP6A3R6TCDNXBP/action/replication_record"}},"created_at":"2026-07-05T02:12:27.162675+00:00","updated_at":"2026-07-05T02:12:27.162675+00:00"}