{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BO7SJ6XF7U2XOKH6DGBRYDLHUU","short_pith_number":"pith:BO7SJ6XF","schema_version":"1.0","canonical_sha256":"0bbf24fae5fd357728fe19831c0d67a52c7b8d3f9bd97e65f6ed3d872471218b","source":{"kind":"arxiv","id":"1503.02835","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-time approximability of the k-Sink Location problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naoki Katoh, R\\'emy Belmonte, Yoshio Okamoto, Yuya Higashikawa","submitted_at":"2015-03-10T09:52:52Z","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"},"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":"1503.02835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-10T09:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"5d371a5a21633e947ecc6507c6fbdee218237af4417ef2bea7bd71257b71ec9b","abstract_canon_sha256":"c03e3eee8e85fbb69f3f9339ad6ab7121fa0156fd4bde8216e6e488588af4aa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:12.989698Z","signature_b64":"A3alTI6HWKOe1xWE+L/TuIrAKeGcgvMCJjbw4PWpef833n2riNkFkUR4JuuaAGFGPG2TguGRMx6dZekTXA1UBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bbf24fae5fd357728fe19831c0d67a52c7b8d3f9bd97e65f6ed3d872471218b","last_reissued_at":"2026-05-18T02:25:12.989060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:12.989060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time approximability of the k-Sink Location problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naoki Katoh, R\\'emy Belmonte, Yoshio Okamoto, Yuya Higashikawa","submitted_at":"2015-03-10T09:52:52Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02835","kind":"arxiv","version":1},"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":"1503.02835","created_at":"2026-05-18T02:25:12.989155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02835v1","created_at":"2026-05-18T02:25:12.989155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02835","created_at":"2026-05-18T02:25:12.989155+00:00"},{"alias_kind":"pith_short_12","alias_value":"BO7SJ6XF7U2X","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BO7SJ6XF7U2XOKH6","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BO7SJ6XF","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU","json":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU.json","graph_json":"https://pith.science/api/pith-number/BO7SJ6XF7U2XOKH6DGBRYDLHUU/graph.json","events_json":"https://pith.science/api/pith-number/BO7SJ6XF7U2XOKH6DGBRYDLHUU/events.json","paper":"https://pith.science/paper/BO7SJ6XF"},"agent_actions":{"view_html":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU","download_json":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU.json","view_paper":"https://pith.science/paper/BO7SJ6XF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02835&json=true","fetch_graph":"https://pith.science/api/pith-number/BO7SJ6XF7U2XOKH6DGBRYDLHUU/graph.json","fetch_events":"https://pith.science/api/pith-number/BO7SJ6XF7U2XOKH6DGBRYDLHUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU/action/storage_attestation","attest_author":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU/action/author_attestation","sign_citation":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU/action/citation_signature","submit_replication":"https://pith.science/pith/BO7SJ6XF7U2XOKH6DGBRYDLHUU/action/replication_record"}},"created_at":"2026-05-18T02:25:12.989155+00:00","updated_at":"2026-05-18T02:25:12.989155+00:00"}