{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K6NURRUA4XVMJDLVMEQAEWLOXR","short_pith_number":"pith:K6NURRUA","canonical_record":{"source":{"id":"1707.02650","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-07-09T22:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"6ef10bbe44a2d3e2425da935c53f12b5c54a0532dc886c9399586ec02f9e81e1","abstract_canon_sha256":"f532a01a22eb041a1f0d6179794bfb99f3c38f65a570f228f5190eef8d447375"},"schema_version":"1.0"},"canonical_sha256":"579b48c680e5eac48d75612002596ebc61f9165bf544318a4787aa5174db95fa","source":{"kind":"arxiv","id":"1707.02650","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02650","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02650v4","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02650","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"K6NURRUA4XVM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K6NURRUA4XVMJDLV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K6NURRUA","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K6NURRUA4XVMJDLVMEQAEWLOXR","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02650","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-07-09T22:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"6ef10bbe44a2d3e2425da935c53f12b5c54a0532dc886c9399586ec02f9e81e1","abstract_canon_sha256":"f532a01a22eb041a1f0d6179794bfb99f3c38f65a570f228f5190eef8d447375"},"schema_version":"1.0"},"canonical_sha256":"579b48c680e5eac48d75612002596ebc61f9165bf544318a4787aa5174db95fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:25.015198Z","signature_b64":"psH0espbpoGzOMYHDg0VubxZIg1srfgtT6G2NhprsYGNmVqBIQrA5rsrRh2fbNgRJWkEdPQjKMQgrTW0fzzPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"579b48c680e5eac48d75612002596ebc61f9165bf544318a4787aa5174db95fa","last_reissued_at":"2026-05-18T00:12:25.014482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:25.014482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02650","source_version":4,"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-18T00:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2bw6QFWPELv9XwI/LKP17yEWMuTbbDn7WysjFI0a52Hj9LBks3tNKXxxftdc/7Dsw7AKdEsLl/7rRF+ZXbdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:12:58.195119Z"},"content_sha256":"d4ba8de322f99d69e80ba85732f5b937279e3efc0234d5f501f47c4366847556","schema_version":"1.0","event_id":"sha256:d4ba8de322f99d69e80ba85732f5b937279e3efc0234d5f501f47c4366847556"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K6NURRUA4XVMJDLVMEQAEWLOXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Min-Max-Delay Problem: NP-completeness, Algorithm, and Integrality Gap","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haibo Zeng, Lei Deng, Minghua Chen, Qingyu Liu","submitted_at":"2017-07-09T22:34:44Z","abstract_excerpt":"We study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G(V,E) at a fixed rate R possibly using multiple paths to minimize the maximum end-to-end delay, denoted as the Min-Max-Delay problem. Transmission over an edge incurs a constant delay within the capacity. We prove that Min-Max-Delay is weakly NP-complete, and demonstrate that it becomes strongly NP-complete if we require integer flow solution. We propose an optimal pseudo-polynomial time algorithm for Min-Max-Delay, with time complexity O(\\log (Nd_{\\max}) (N^5d_{\\max}^{2.5})("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02650","kind":"arxiv","version":4},"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-18T00:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ct5sjhQy7sVtKoBrqP2op+4vwRrj+7ysgxiHifR/ZHo9VuCLalHuBgeOq5TVpRRXphniGesjobzqS7VPXsWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:12:58.195774Z"},"content_sha256":"e2d4569fd6a1f70536634b0a0ad8b52dd15b44e37d0f3de633659f8e426129b6","schema_version":"1.0","event_id":"sha256:e2d4569fd6a1f70536634b0a0ad8b52dd15b44e37d0f3de633659f8e426129b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/bundle.json","state_url":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/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-06T20:12:58Z","links":{"resolver":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR","bundle":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/bundle.json","state":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K6NURRUA4XVMJDLVMEQAEWLOXR","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":"f532a01a22eb041a1f0d6179794bfb99f3c38f65a570f228f5190eef8d447375","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-07-09T22:34:44Z","title_canon_sha256":"6ef10bbe44a2d3e2425da935c53f12b5c54a0532dc886c9399586ec02f9e81e1"},"schema_version":"1.0","source":{"id":"1707.02650","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02650","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02650v4","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02650","created_at":"2026-05-18T00:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"K6NURRUA4XVM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K6NURRUA4XVMJDLV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K6NURRUA","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:e2d4569fd6a1f70536634b0a0ad8b52dd15b44e37d0f3de633659f8e426129b6","target":"graph","created_at":"2026-05-18T00:12:25Z","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 study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G(V,E) at a fixed rate R possibly using multiple paths to minimize the maximum end-to-end delay, denoted as the Min-Max-Delay problem. Transmission over an edge incurs a constant delay within the capacity. We prove that Min-Max-Delay is weakly NP-complete, and demonstrate that it becomes strongly NP-complete if we require integer flow solution. We propose an optimal pseudo-polynomial time algorithm for Min-Max-Delay, with time complexity O(\\log (Nd_{\\max}) (N^5d_{\\max}^{2.5})(","authors_text":"Haibo Zeng, Lei Deng, Minghua Chen, Qingyu Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-07-09T22:34:44Z","title":"On the Min-Max-Delay Problem: NP-completeness, Algorithm, and Integrality Gap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02650","kind":"arxiv","version":4},"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:d4ba8de322f99d69e80ba85732f5b937279e3efc0234d5f501f47c4366847556","target":"record","created_at":"2026-05-18T00:12:25Z","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":"f532a01a22eb041a1f0d6179794bfb99f3c38f65a570f228f5190eef8d447375","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-07-09T22:34:44Z","title_canon_sha256":"6ef10bbe44a2d3e2425da935c53f12b5c54a0532dc886c9399586ec02f9e81e1"},"schema_version":"1.0","source":{"id":"1707.02650","kind":"arxiv","version":4}},"canonical_sha256":"579b48c680e5eac48d75612002596ebc61f9165bf544318a4787aa5174db95fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"579b48c680e5eac48d75612002596ebc61f9165bf544318a4787aa5174db95fa","first_computed_at":"2026-05-18T00:12:25.014482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:25.014482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"psH0espbpoGzOMYHDg0VubxZIg1srfgtT6G2NhprsYGNmVqBIQrA5rsrRh2fbNgRJWkEdPQjKMQgrTW0fzzPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:25.015198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02650","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4ba8de322f99d69e80ba85732f5b937279e3efc0234d5f501f47c4366847556","sha256:e2d4569fd6a1f70536634b0a0ad8b52dd15b44e37d0f3de633659f8e426129b6"],"state_sha256":"25a3956b8e26ebff51b5fba5dde4fb9e3436171a6c503e16d878c1900c6ce259"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/H5AAsmI4ZVt3V+BARgZbEjPgP+3AGykSups8ByMoGPK6T8lJBIx45/YbPXBP0Cik8J7WSakEQaOy1jWK2a8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:12:58.199384Z","bundle_sha256":"946480b108254dc3135e1d609a0d1baabc77d10b75cb0460ee972e1161eb4ede"}}