{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DMZJGRGQ6ZA3BXMOJLULIECBYT","short_pith_number":"pith:DMZJGRGQ","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"},"canonical_sha256":"1b329344d0f641b0dd8e4ae8b41041c4c7604f91ff48a43b3f5d67a66a039a89","source":{"kind":"arxiv","id":"1405.5613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5613","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5613v1","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5613","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"DMZJGRGQ6ZA3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMZJGRGQ6ZA3BXMO","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMZJGRGQ","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DMZJGRGQ6ZA3BXMOJLULIECBYT","target":"record","payload":{"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"},"canonical_sha256":"1b329344d0f641b0dd8e4ae8b41041c4c7604f91ff48a43b3f5d67a66a039a89","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"},"source_kind":"arxiv","source_id":"1405.5613","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z46CE/tcHnJAuPpGo+sqHZcLH7zyKtPY3yaOatMleDBGQd6ACxSerrwpqhePrfbAaPYHT0BzdAUICipM1ESlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:22:12.887853Z"},"content_sha256":"148c3aa29cf30ac873b4d3d1d7a4f11bfc0bc4a7a176bb52142e5dde743808a1","schema_version":"1.0","event_id":"sha256:148c3aa29cf30ac873b4d3d1d7a4f11bfc0bc4a7a176bb52142e5dde743808a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DMZJGRGQ6ZA3BXMOJLULIECBYT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ds9eLDGQ2/6HKYL3Vdt+j7NxcmU6CTSvUXu+lUVpL2ORWoB/Vse6XvzTpNZfBfslBVNfs9koFoZSRWP04NmzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:22:12.888200Z"},"content_sha256":"7de0382da63588649b6a228342f37138352e2eac8bfe268e7a6d6de66dafae3c","schema_version":"1.0","event_id":"sha256:7de0382da63588649b6a228342f37138352e2eac8bfe268e7a6d6de66dafae3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/bundle.json","state_url":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T20:22:12Z","links":{"resolver":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT","bundle":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/bundle.json","state":"https://pith.science/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMZJGRGQ6ZA3BXMOJLULIECBYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DMZJGRGQ6ZA3BXMOJLULIECBYT","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":"aafc1c7fcd933fc8a4672a979ca0c68b311020a1fa41242a9b420b3771d6ee80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-22T02:31:04Z","title_canon_sha256":"e8d58d766eed4f357e1440336681e75a8cb32dc798708944caffea304b62f061"},"schema_version":"1.0","source":{"id":"1405.5613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5613","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5613v1","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5613","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"DMZJGRGQ6ZA3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMZJGRGQ6ZA3BXMO","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMZJGRGQ","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:7de0382da63588649b6a228342f37138352e2eac8bfe268e7a6d6de66dafae3c","target":"graph","created_at":"2026-05-18T02:51:16Z","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":"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","authors_text":"Mordecai J. Golin, Naoki Katoh, Yuya Higashikawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-22T02:31:04Z","title":"Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5613","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:148c3aa29cf30ac873b4d3d1d7a4f11bfc0bc4a7a176bb52142e5dde743808a1","target":"record","created_at":"2026-05-18T02:51:16Z","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":"aafc1c7fcd933fc8a4672a979ca0c68b311020a1fa41242a9b420b3771d6ee80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-22T02:31:04Z","title_canon_sha256":"e8d58d766eed4f357e1440336681e75a8cb32dc798708944caffea304b62f061"},"schema_version":"1.0","source":{"id":"1405.5613","kind":"arxiv","version":1}},"canonical_sha256":"1b329344d0f641b0dd8e4ae8b41041c4c7604f91ff48a43b3f5d67a66a039a89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b329344d0f641b0dd8e4ae8b41041c4c7604f91ff48a43b3f5d67a66a039a89","first_computed_at":"2026-05-18T02:51:16.137918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:16.137918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BOiUjW5+fAtaOp34OuRa4EsA+K2WkS5CyPoqYU6KiCZrlHnsDTGxEhS9uUMs/q4rATEVPye53i6yW2AXXlByAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:16.138586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:148c3aa29cf30ac873b4d3d1d7a4f11bfc0bc4a7a176bb52142e5dde743808a1","sha256:7de0382da63588649b6a228342f37138352e2eac8bfe268e7a6d6de66dafae3c"],"state_sha256":"022451045c555f66ff4ee62f368cde548acf3b2e33c1ed2554651d394c1985b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mmmukrn8wYkOSvm+oY/nrRQfW3oeMhfSNcFArvEzsWMGJw9u9+uHpK2SKWrrRM5s3P10Dup2YoRIa57ovsYpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:22:12.890080Z","bundle_sha256":"da0b47da687c023d8cafcb4260dd3d16a72c35d2cb5b66a98bd98c6505dcc24c"}}