{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OW3BLMNX63K2ENA5RD53ZIT2T6","short_pith_number":"pith:OW3BLMNX","canonical_record":{"source":{"id":"1509.07600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T06:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"1d5038105adc53bb76f0d8d2b1b04dd464d502dc4f85798a728e7068b25c5c45","abstract_canon_sha256":"a8ddb46151f1597f4a63e6376cbcce45399c62fa1325eee4792d7cf52be220a6"},"schema_version":"1.0"},"canonical_sha256":"75b615b1b7f6d5a2341d88fbbca27a9faa645f1d5b5d6229a65d056d3bff178c","source":{"kind":"arxiv","id":"1509.07600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07600","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07600v1","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07600","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"pith_short_12","alias_value":"OW3BLMNX63K2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OW3BLMNX63K2ENA5","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OW3BLMNX","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OW3BLMNX63K2ENA5RD53ZIT2T6","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T06:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"1d5038105adc53bb76f0d8d2b1b04dd464d502dc4f85798a728e7068b25c5c45","abstract_canon_sha256":"a8ddb46151f1597f4a63e6376cbcce45399c62fa1325eee4792d7cf52be220a6"},"schema_version":"1.0"},"canonical_sha256":"75b615b1b7f6d5a2341d88fbbca27a9faa645f1d5b5d6229a65d056d3bff178c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:02.375888Z","signature_b64":"uLidIfh2Vjc5toi4rQLfRGD308oIIy+tO6fPC3cJWF2tEoWUufLgltDjBDOl8ta1tDB9l0RwdKfgzuDzQmpwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b615b1b7f6d5a2341d88fbbca27a9faa645f1d5b5d6229a65d056d3bff178c","last_reissued_at":"2026-05-18T01:32:02.375420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:02.375420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07600","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-18T01:32:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kXU0YutBDJiZz5nJGqdYASosLoE+6C6C8hS3+yV0+ZOMFsJdl3Bc1j7rm3Zu0vmbWgtwiaY5C6a/+WAr2NCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:49:02.394579Z"},"content_sha256":"9d852d96233c6f9b3d435caf25dffa1e2648912961a76872153a87ce007ec4df","schema_version":"1.0","event_id":"sha256:9d852d96233c6f9b3d435caf25dffa1e2648912961a76872153a87ce007ec4df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OW3BLMNX63K2ENA5RD53ZIT2T6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Regret 1-Median Problem in Dynamic Path Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naoki Katoh, Shun Saburi, Siu-Wing Cheng, Tsunehiko Kameda, Yuya Higashikawa","submitted_at":"2015-09-25T06:46:36Z","abstract_excerpt":"This paper considers the minimax regret 1-median problem in dynamic path networks. In our model, we are given a dynamic path network consisting of an undirected path with positive edge lengths, uniform positive edge capacity, and nonnegative vertex supplies. Here, each vertex supply is unknown but only an interval of supply is known. A particular assignment of supply to each vertex is called a scenario. Given a scenario s and a sink location x in a dynamic path network, let us consider the evacuation time to x of a unit supply given on a vertex by s. The cost of x under s is defined as the sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07600","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-18T01:32:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQsRsJxPKI7Cv+BjwRn80PJRiUnMmdmvRPzdm5MLrD4cduUoNzG8fILd9/Mzrr8gm5s5Zb/hpsyaSQk+AcOdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:49:02.395257Z"},"content_sha256":"a83c371f847da53570eeae79367e90d083b5d85948adaa4e8612fe02c2438847","schema_version":"1.0","event_id":"sha256:a83c371f847da53570eeae79367e90d083b5d85948adaa4e8612fe02c2438847"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OW3BLMNX63K2ENA5RD53ZIT2T6/bundle.json","state_url":"https://pith.science/pith/OW3BLMNX63K2ENA5RD53ZIT2T6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OW3BLMNX63K2ENA5RD53ZIT2T6/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-06T08:49:02Z","links":{"resolver":"https://pith.science/pith/OW3BLMNX63K2ENA5RD53ZIT2T6","bundle":"https://pith.science/pith/OW3BLMNX63K2ENA5RD53ZIT2T6/bundle.json","state":"https://pith.science/pith/OW3BLMNX63K2ENA5RD53ZIT2T6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OW3BLMNX63K2ENA5RD53ZIT2T6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OW3BLMNX63K2ENA5RD53ZIT2T6","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":"a8ddb46151f1597f4a63e6376cbcce45399c62fa1325eee4792d7cf52be220a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T06:46:36Z","title_canon_sha256":"1d5038105adc53bb76f0d8d2b1b04dd464d502dc4f85798a728e7068b25c5c45"},"schema_version":"1.0","source":{"id":"1509.07600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07600","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07600v1","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07600","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"pith_short_12","alias_value":"OW3BLMNX63K2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OW3BLMNX63K2ENA5","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OW3BLMNX","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:a83c371f847da53570eeae79367e90d083b5d85948adaa4e8612fe02c2438847","target":"graph","created_at":"2026-05-18T01:32:02Z","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 minimax regret 1-median problem in dynamic path networks. In our model, we are given a dynamic path network consisting of an undirected path with positive edge lengths, uniform positive edge capacity, and nonnegative vertex supplies. Here, each vertex supply is unknown but only an interval of supply is known. A particular assignment of supply to each vertex is called a scenario. Given a scenario s and a sink location x in a dynamic path network, let us consider the evacuation time to x of a unit supply given on a vertex by s. The cost of x under s is defined as the sum","authors_text":"Naoki Katoh, Shun Saburi, Siu-Wing Cheng, Tsunehiko Kameda, Yuya Higashikawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T06:46:36Z","title":"Minimax Regret 1-Median Problem in Dynamic Path Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07600","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:9d852d96233c6f9b3d435caf25dffa1e2648912961a76872153a87ce007ec4df","target":"record","created_at":"2026-05-18T01:32:02Z","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":"a8ddb46151f1597f4a63e6376cbcce45399c62fa1325eee4792d7cf52be220a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T06:46:36Z","title_canon_sha256":"1d5038105adc53bb76f0d8d2b1b04dd464d502dc4f85798a728e7068b25c5c45"},"schema_version":"1.0","source":{"id":"1509.07600","kind":"arxiv","version":1}},"canonical_sha256":"75b615b1b7f6d5a2341d88fbbca27a9faa645f1d5b5d6229a65d056d3bff178c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75b615b1b7f6d5a2341d88fbbca27a9faa645f1d5b5d6229a65d056d3bff178c","first_computed_at":"2026-05-18T01:32:02.375420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:02.375420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uLidIfh2Vjc5toi4rQLfRGD308oIIy+tO6fPC3cJWF2tEoWUufLgltDjBDOl8ta1tDB9l0RwdKfgzuDzQmpwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:02.375888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d852d96233c6f9b3d435caf25dffa1e2648912961a76872153a87ce007ec4df","sha256:a83c371f847da53570eeae79367e90d083b5d85948adaa4e8612fe02c2438847"],"state_sha256":"672b037d1ff1a93c9c348e0e7a4348f2af912be17d105f8aa2a5784d8abe9ecf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7oZNwgSv90zGWin+bGcNnVgIECZPeulGbMC8c+GS7+Keh2tWtcKCfRPoQ7hV4+rb8FRQwvF+gmUISleuKVQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:49:02.399083Z","bundle_sha256":"58d6fee24f703195389974aadefd3cff3bac4fb421d2b1cc8307c8d7edad5898"}}