{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KKZIBDUB4USIJGHWGWQ4Q5DPO3","short_pith_number":"pith:KKZIBDUB","canonical_record":{"source":{"id":"1609.01373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-06T02:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"baff0d215a1694c5a1b1ffe95ccc77a2164f6bb488b7050310a4facc60d33436","abstract_canon_sha256":"c189610696470a481cf8797a56d04cfa75500b7b44616552ca84341629d1be86"},"schema_version":"1.0"},"canonical_sha256":"52b2808e81e5248498f635a1c8746f76f1a8155292b23ea0765b70041e97342f","source":{"kind":"arxiv","id":"1609.01373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01373","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01373v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01373","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"KKZIBDUB4USI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKZIBDUB4USIJGHW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKZIBDUB","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KKZIBDUB4USIJGHWGWQ4Q5DPO3","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-06T02:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"baff0d215a1694c5a1b1ffe95ccc77a2164f6bb488b7050310a4facc60d33436","abstract_canon_sha256":"c189610696470a481cf8797a56d04cfa75500b7b44616552ca84341629d1be86"},"schema_version":"1.0"},"canonical_sha256":"52b2808e81e5248498f635a1c8746f76f1a8155292b23ea0765b70041e97342f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:39.753639Z","signature_b64":"5kvAYpfk5bK84cP/U2PLkMtgUoQl4LJCRSiPYSuAmKq5nYZSRSgP8Qer1rJXLnqNRYYgzBMDmR2CpHRSQ2X/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b2808e81e5248498f635a1c8746f76f1a8155292b23ea0765b70041e97342f","last_reissued_at":"2026-05-18T01:05:39.753198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:39.753198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01373","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:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLYtqGjuI4VIkMNmLbXypQkfJVl3pPRqD4kYDOYwXnz6z5IHVX5sbAmZhvM6ZPzNaVLlyuvut0NpEwEagBFtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:41:54.536027Z"},"content_sha256":"d18b29f7b3c0bb3aa05840a5b33d61cf411481f9f451117bce59691f7e0577bf","schema_version":"1.0","event_id":"sha256:d18b29f7b3c0bb3aa05840a5b33d61cf411481f9f451117bce59691f7e0577bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KKZIBDUB4USIJGHWGWQ4Q5DPO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Computing $k$-Sink on Dynamic Path Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Binay Bhattacharya, Mordecai J. Golin, Naoki Katoh, Tsunehiko Kameda, Yuya Higashikawa","submitted_at":"2016-09-06T02:19:29Z","abstract_excerpt":"We present a novel approach to finding the $k$-sink on dynamic path networks with general edge capacities. Our first algorithm runs in $O(n \\log n + k^2 \\log^4 n)$ time, where $n$ is the number of vertices on the given path, and our second algorithm runs in $O(n \\log^3 n)$ time. Together, they improve upon the previously most efficient $O(kn \\log^2 n)$ time algorithm due to Arumugam et al. for all values of $k$. In the case where all the edges have the same capacity, we again present two algorithms that run in $O(n + k^2 \\log^2n)$ time and $O(n \\log n)$ time, respectively, and they together im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01373","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:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfqIrmBy5Q4HG3eCWETp4fCxnShgxBQd22nELhnSRG/fJaKy/5IDgSNV2SUmAO2O4tn1XONC2tXifIbZcDteDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:41:54.536637Z"},"content_sha256":"7158af9ff490f047fc6e92a6ff14ae82676b9b3d04d2460a4cf36a1e11670da8","schema_version":"1.0","event_id":"sha256:7158af9ff490f047fc6e92a6ff14ae82676b9b3d04d2460a4cf36a1e11670da8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKZIBDUB4USIJGHWGWQ4Q5DPO3/bundle.json","state_url":"https://pith.science/pith/KKZIBDUB4USIJGHWGWQ4Q5DPO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKZIBDUB4USIJGHWGWQ4Q5DPO3/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-07-01T02:41:54Z","links":{"resolver":"https://pith.science/pith/KKZIBDUB4USIJGHWGWQ4Q5DPO3","bundle":"https://pith.science/pith/KKZIBDUB4USIJGHWGWQ4Q5DPO3/bundle.json","state":"https://pith.science/pith/KKZIBDUB4USIJGHWGWQ4Q5DPO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKZIBDUB4USIJGHWGWQ4Q5DPO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KKZIBDUB4USIJGHWGWQ4Q5DPO3","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":"c189610696470a481cf8797a56d04cfa75500b7b44616552ca84341629d1be86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-06T02:19:29Z","title_canon_sha256":"baff0d215a1694c5a1b1ffe95ccc77a2164f6bb488b7050310a4facc60d33436"},"schema_version":"1.0","source":{"id":"1609.01373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01373","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01373v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01373","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"KKZIBDUB4USI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKZIBDUB4USIJGHW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKZIBDUB","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:7158af9ff490f047fc6e92a6ff14ae82676b9b3d04d2460a4cf36a1e11670da8","target":"graph","created_at":"2026-05-18T01:05:39Z","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":"We present a novel approach to finding the $k$-sink on dynamic path networks with general edge capacities. Our first algorithm runs in $O(n \\log n + k^2 \\log^4 n)$ time, where $n$ is the number of vertices on the given path, and our second algorithm runs in $O(n \\log^3 n)$ time. Together, they improve upon the previously most efficient $O(kn \\log^2 n)$ time algorithm due to Arumugam et al. for all values of $k$. In the case where all the edges have the same capacity, we again present two algorithms that run in $O(n + k^2 \\log^2n)$ time and $O(n \\log n)$ time, respectively, and they together im","authors_text":"Binay Bhattacharya, Mordecai J. Golin, Naoki Katoh, Tsunehiko Kameda, Yuya Higashikawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-06T02:19:29Z","title":"Improved Algorithms for Computing $k$-Sink on Dynamic Path Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01373","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:d18b29f7b3c0bb3aa05840a5b33d61cf411481f9f451117bce59691f7e0577bf","target":"record","created_at":"2026-05-18T01:05:39Z","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":"c189610696470a481cf8797a56d04cfa75500b7b44616552ca84341629d1be86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-06T02:19:29Z","title_canon_sha256":"baff0d215a1694c5a1b1ffe95ccc77a2164f6bb488b7050310a4facc60d33436"},"schema_version":"1.0","source":{"id":"1609.01373","kind":"arxiv","version":1}},"canonical_sha256":"52b2808e81e5248498f635a1c8746f76f1a8155292b23ea0765b70041e97342f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52b2808e81e5248498f635a1c8746f76f1a8155292b23ea0765b70041e97342f","first_computed_at":"2026-05-18T01:05:39.753198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:39.753198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5kvAYpfk5bK84cP/U2PLkMtgUoQl4LJCRSiPYSuAmKq5nYZSRSgP8Qer1rJXLnqNRYYgzBMDmR2CpHRSQ2X/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:39.753639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d18b29f7b3c0bb3aa05840a5b33d61cf411481f9f451117bce59691f7e0577bf","sha256:7158af9ff490f047fc6e92a6ff14ae82676b9b3d04d2460a4cf36a1e11670da8"],"state_sha256":"160f6c0087772bb47d3448f4ab73e6b6f9b05e0b9de18e6ec132c339a801f13b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvQ9SgR2qVzUVDrwj0mUzTM0Xadqk87Aj6+aimHzQO0BPQ6vahee1I/d8XMqftuyfsb02nVCA1/u7c1hNt+DCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:41:54.539258Z","bundle_sha256":"57e0eb55bac30253ec26c377bb72f5f791b74c514aa837d743aa1f4be9495817"}}