{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JTEMKLMJYJLCJQQXA5KMUS3EAD","short_pith_number":"pith:JTEMKLMJ","schema_version":"1.0","canonical_sha256":"4cc8c52d89c25624c2170754ca4b6400dc910ce7f871b411fcd0a84388b1f1a4","source":{"kind":"arxiv","id":"1504.05519","version":1},"attestation_state":"computed","paper":{"title":"Efficient Approximation Algorithms for Computing \\emph{k} Disjoint Restricted Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DM","authors_text":"Hong Shen, Kewen Liao, Longkun Guo, Peng Li","submitted_at":"2015-04-21T17:37:07Z","abstract_excerpt":"Network applications, such as multimedia streaming and video conferencing, impose growing requirements over Quality of Service (QoS), including bandwidth, delay, jitter, etc. Meanwhile, networks are expected to be load-balanced, energy-efficient, and resilient to some degree of failures. It is observed that the above requirements could be better met with multiple disjoint QoS paths than a single one. Let $G=(V,\\, E)$ be a digraph with nonnegative integral cost and delay on every edge, $s,\\, t\\in V$ be two specified vertices, and $D\\in\\mathbb{Z}_{0}^{+}$ be a delay bound (or some other constrai"},"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":"1504.05519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-21T17:37:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"c45216b6140a70bdbbd1507fd6a8163856229ba3e264479962cc849c784177cf","abstract_canon_sha256":"7a7f1937e270b653fe0d01450f8428f24df415b56363d59f0c4bf2ff811d13d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.089589Z","signature_b64":"lrTyI4QJcU1sBBkwANxYYQDYKPWaaJU/u8c3IBkq6fI76+qXnffsSUHlVYOcQLOYOPqC2ct94iVbYcbmz8NbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc8c52d89c25624c2170754ca4b6400dc910ce7f871b411fcd0a84388b1f1a4","last_reissued_at":"2026-05-18T02:18:14.089194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.089194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Approximation Algorithms for Computing \\emph{k} Disjoint Restricted Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DM","authors_text":"Hong Shen, Kewen Liao, Longkun Guo, Peng Li","submitted_at":"2015-04-21T17:37:07Z","abstract_excerpt":"Network applications, such as multimedia streaming and video conferencing, impose growing requirements over Quality of Service (QoS), including bandwidth, delay, jitter, etc. Meanwhile, networks are expected to be load-balanced, energy-efficient, and resilient to some degree of failures. It is observed that the above requirements could be better met with multiple disjoint QoS paths than a single one. Let $G=(V,\\, E)$ be a digraph with nonnegative integral cost and delay on every edge, $s,\\, t\\in V$ be two specified vertices, and $D\\in\\mathbb{Z}_{0}^{+}$ be a delay bound (or some other constrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05519","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.05519","created_at":"2026-05-18T02:18:14.089247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05519v1","created_at":"2026-05-18T02:18:14.089247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05519","created_at":"2026-05-18T02:18:14.089247+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTEMKLMJYJLC","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTEMKLMJYJLCJQQX","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTEMKLMJ","created_at":"2026-05-18T12:29:27.538025+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/JTEMKLMJYJLCJQQXA5KMUS3EAD","json":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD.json","graph_json":"https://pith.science/api/pith-number/JTEMKLMJYJLCJQQXA5KMUS3EAD/graph.json","events_json":"https://pith.science/api/pith-number/JTEMKLMJYJLCJQQXA5KMUS3EAD/events.json","paper":"https://pith.science/paper/JTEMKLMJ"},"agent_actions":{"view_html":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD","download_json":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD.json","view_paper":"https://pith.science/paper/JTEMKLMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05519&json=true","fetch_graph":"https://pith.science/api/pith-number/JTEMKLMJYJLCJQQXA5KMUS3EAD/graph.json","fetch_events":"https://pith.science/api/pith-number/JTEMKLMJYJLCJQQXA5KMUS3EAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/action/storage_attestation","attest_author":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/action/author_attestation","sign_citation":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/action/citation_signature","submit_replication":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/action/replication_record"}},"created_at":"2026-05-18T02:18:14.089247+00:00","updated_at":"2026-05-18T02:18:14.089247+00:00"}