{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DMZJGRGQ6ZA3BXMOJLULIECBYT","short_pith_number":"pith:DMZJGRGQ","schema_version":"1.0","canonical_sha256":"1b329344d0f641b0dd8e4ae8b41041c4c7604f91ff48a43b3f5d67a66a039a89","source":{"kind":"arxiv","id":"1405.5613","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mordecai J. Golin, Naoki Katoh, Yuya Higashikawa","submitted_at":"2014-05-22T02:31:04Z","abstract_excerpt":"This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths, uniform edge capacity, and positive vertex supplies. Here, each vertex supply corresponds to a set of evacuees. Then, the problem requires to find the optimal location of $k$ sinks in a given path so that each evacuee is sent to one of k sinks. Let x denote a k-sink location. Under the optimal evacuation for a given x, there exists a (k-1)-dimensional vector d, called (k-1)-divider, such that each component represents the bou"},"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":"1405.5613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-22T02:31:04Z","cross_cats_sorted":[],"title_canon_sha256":"e8d58d766eed4f357e1440336681e75a8cb32dc798708944caffea304b62f061","abstract_canon_sha256":"aafc1c7fcd933fc8a4672a979ca0c68b311020a1fa41242a9b420b3771d6ee80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:16.138586Z","signature_b64":"BOiUjW5+fAtaOp34OuRa4EsA+K2WkS5CyPoqYU6KiCZrlHnsDTGxEhS9uUMs/q4rATEVPye53i6yW2AXXlByAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b329344d0f641b0dd8e4ae8b41041c4c7604f91ff48a43b3f5d67a66a039a89","last_reissued_at":"2026-05-18T02:51:16.137918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:16.137918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mordecai J. Golin, Naoki Katoh, Yuya Higashikawa","submitted_at":"2014-05-22T02:31:04Z","abstract_excerpt":"This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths, uniform edge capacity, and positive vertex supplies. Here, each vertex supply corresponds to a set of evacuees. Then, the problem requires to find the optimal location of $k$ sinks in a given path so that each evacuee is sent to one of k sinks. Let x denote a k-sink location. Under the optimal evacuation for a given x, there exists a (k-1)-dimensional vector d, called (k-1)-divider, such that each component represents the bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5613","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":"1405.5613","created_at":"2026-05-18T02:51:16.138055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5613v1","created_at":"2026-05-18T02:51:16.138055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5613","created_at":"2026-05-18T02:51:16.138055+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMZJGRGQ6ZA3","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMZJGRGQ6ZA3BXMO","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMZJGRGQ","created_at":"2026-05-18T12:28:25.294606+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/DMZJGRGQ6ZA3BXMOJLULIECBYT","json":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT.json","graph_json":"https://pith.science/api/pith-number/DMZJGRGQ6ZA3BXMOJLULIECBYT/graph.json","events_json":"https://pith.science/api/pith-number/DMZJGRGQ6ZA3BXMOJLULIECBYT/events.json","paper":"https://pith.science/paper/DMZJGRGQ"},"agent_actions":{"view_html":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT","download_json":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT.json","view_paper":"https://pith.science/paper/DMZJGRGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5613&json=true","fetch_graph":"https://pith.science/api/pith-number/DMZJGRGQ6ZA3BXMOJLULIECBYT/graph.json","fetch_events":"https://pith.science/api/pith-number/DMZJGRGQ6ZA3BXMOJLULIECBYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/action/storage_attestation","attest_author":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/action/author_attestation","sign_citation":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/action/citation_signature","submit_replication":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/action/replication_record"}},"created_at":"2026-05-18T02:51:16.138055+00:00","updated_at":"2026-05-18T02:51:16.138055+00:00"}