{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BO7SJ6XF7U2XOKH6DGBRYDLHUU","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":"c03e3eee8e85fbb69f3f9339ad6ab7121fa0156fd4bde8216e6e488588af4aa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-10T09:52:52Z","title_canon_sha256":"5d371a5a21633e947ecc6507c6fbdee218237af4417ef2bea7bd71257b71ec9b"},"schema_version":"1.0","source":{"id":"1503.02835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02835","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02835v1","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02835","created_at":"2026-05-18T02:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"BO7SJ6XF7U2X","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BO7SJ6XF7U2XOKH6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BO7SJ6XF","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:f55b23f6429660979335295467afdda66ec7261756bd82c55ab103592897cb11","target":"graph","created_at":"2026-05-18T02:25:12Z","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"},"paper":{"abstract_excerpt":"A dynamic network ${\\cal N} = (G,c,\\tau,S)$ where $G=(V,E)$ is a graph, integers $\\tau(e)$ and $c(e)$ represent, for each edge $e\\in E$, the time required to traverse edge $e$ and its nonnegative capacity, and the set $S\\subseteq V$ is a set of sources. In the $k$-{\\sc Sink Location} problem, one is given as input a dynamic network ${\\cal N}$ where every source $u\\in S$ is given a nonnegative supply value $\\sigma(u)$. The task is then to find a set of sinks $X = \\{x_1,\\ldots,x_k\\}$ in $G$ that minimizes the routing time of all supply to $X$. Note that, in the case where $G$ is an undirected gr","authors_text":"Naoki Katoh, R\\'emy Belmonte, Yoshio Okamoto, Yuya Higashikawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-10T09:52:52Z","title":"Polynomial-time approximability of the k-Sink Location problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02835","kind":"arxiv","version":1},"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:9ca2bf3ad226bef64dd715e981b282030865506ba28a519479eb67ac64cf1ea9","target":"record","created_at":"2026-05-18T02:25:12Z","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":"c03e3eee8e85fbb69f3f9339ad6ab7121fa0156fd4bde8216e6e488588af4aa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-10T09:52:52Z","title_canon_sha256":"5d371a5a21633e947ecc6507c6fbdee218237af4417ef2bea7bd71257b71ec9b"},"schema_version":"1.0","source":{"id":"1503.02835","kind":"arxiv","version":1}},"canonical_sha256":"0bbf24fae5fd357728fe19831c0d67a52c7b8d3f9bd97e65f6ed3d872471218b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bbf24fae5fd357728fe19831c0d67a52c7b8d3f9bd97e65f6ed3d872471218b","first_computed_at":"2026-05-18T02:25:12.989060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:12.989060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A3alTI6HWKOe1xWE+L/TuIrAKeGcgvMCJjbw4PWpef833n2riNkFkUR4JuuaAGFGPG2TguGRMx6dZekTXA1UBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:12.989698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ca2bf3ad226bef64dd715e981b282030865506ba28a519479eb67ac64cf1ea9","sha256:f55b23f6429660979335295467afdda66ec7261756bd82c55ab103592897cb11"],"state_sha256":"690e9cb94f4285cc5da5f75ef0572a97e7c1fb84cfc6db604cce7aa986a61986"}