{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z54ZHJEK5VPAVP6A3R6TCDNXBP","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":"6bb04cfec8e86d965c6edca12b047637942493f7f41b9abbe2e603ee04a4b9d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:27:01Z","title_canon_sha256":"06968b7f8229fc969d11d1f9914deb9949b07e60e6a667147d76428f5dee3e49"},"schema_version":"1.0","source":{"id":"1607.05127","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05127","created_at":"2026-07-05T02:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05127v4","created_at":"2026-07-05T02:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05127","created_at":"2026-07-05T02:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"Z54ZHJEK5VPA","created_at":"2026-07-05T02:12:27Z"},{"alias_kind":"pith_short_16","alias_value":"Z54ZHJEK5VPAVP6A","created_at":"2026-07-05T02:12:27Z"},{"alias_kind":"pith_short_8","alias_value":"Z54ZHJEK","created_at":"2026-07-05T02:12:27Z"}],"graph_snapshots":[{"event_id":"sha256:c4e2df72aff4da5973df324cd6b53f384f47cf6375ec94d998abe6f64a959bea","target":"graph","created_at":"2026-07-05T02:12:27Z","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/1607.05127/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andreas Karrenbauer, Christoph Lenzen, Ruben Becker, Sebastian Forster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:27:01Z","title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05127","kind":"arxiv","version":4},"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:d0363ddd7c8017d2f6f6738b676289089227a11a458ea774ed7fad02b671caed","target":"record","created_at":"2026-07-05T02:12:27Z","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":"6bb04cfec8e86d965c6edca12b047637942493f7f41b9abbe2e603ee04a4b9d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:27:01Z","title_canon_sha256":"06968b7f8229fc969d11d1f9914deb9949b07e60e6a667147d76428f5dee3e49"},"schema_version":"1.0","source":{"id":"1607.05127","kind":"arxiv","version":4}},"canonical_sha256":"cf7993a48aed5e0abfc0dc7d310db70bf649f583b402a9cf291c7a70bf684af6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf7993a48aed5e0abfc0dc7d310db70bf649f583b402a9cf291c7a70bf684af6","first_computed_at":"2026-07-05T02:12:27.162619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:12:27.162619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0GneNN8MydimgUTZWBe7w9UzT3QpO66NG+wJYUJ4rfcia78FjtZe6neHAJUH3gP8/Qew8w/zWwvl5/qOcWwAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:12:27.163095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05127","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0363ddd7c8017d2f6f6738b676289089227a11a458ea774ed7fad02b671caed","sha256:c4e2df72aff4da5973df324cd6b53f384f47cf6375ec94d998abe6f64a959bea"],"state_sha256":"7281a89a9e928192667703fb17c236987636d50dddec155d202993e7959ca179"}