{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K6NURRUA4XVMJDLVMEQAEWLOXR","short_pith_number":"pith:K6NURRUA","schema_version":"1.0","canonical_sha256":"579b48c680e5eac48d75612002596ebc61f9165bf544318a4787aa5174db95fa","source":{"kind":"arxiv","id":"1707.02650","version":4},"attestation_state":"computed","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})("},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.02650","created_at":"2026-05-18T00:12:25.014584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02650v4","created_at":"2026-05-18T00:12:25.014584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02650","created_at":"2026-05-18T00:12:25.014584+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6NURRUA4XVM","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6NURRUA4XVMJDLV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6NURRUA","created_at":"2026-05-18T12:31:24.725408+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/K6NURRUA4XVMJDLVMEQAEWLOXR","json":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR.json","graph_json":"https://pith.science/api/pith-number/K6NURRUA4XVMJDLVMEQAEWLOXR/graph.json","events_json":"https://pith.science/api/pith-number/K6NURRUA4XVMJDLVMEQAEWLOXR/events.json","paper":"https://pith.science/paper/K6NURRUA"},"agent_actions":{"view_html":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR","download_json":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR.json","view_paper":"https://pith.science/paper/K6NURRUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02650&json=true","fetch_graph":"https://pith.science/api/pith-number/K6NURRUA4XVMJDLVMEQAEWLOXR/graph.json","fetch_events":"https://pith.science/api/pith-number/K6NURRUA4XVMJDLVMEQAEWLOXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/action/storage_attestation","attest_author":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/action/author_attestation","sign_citation":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/action/citation_signature","submit_replication":"https://pith.science/pith/K6NURRUA4XVMJDLVMEQAEWLOXR/action/replication_record"}},"created_at":"2026-05-18T00:12:25.014584+00:00","updated_at":"2026-05-18T00:12:25.014584+00:00"}