{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JTEMKLMJYJLCJQQXA5KMUS3EAD","short_pith_number":"pith:JTEMKLMJ","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"},"canonical_sha256":"4cc8c52d89c25624c2170754ca4b6400dc910ce7f871b411fcd0a84388b1f1a4","source":{"kind":"arxiv","id":"1504.05519","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05519","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05519v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05519","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"JTEMKLMJYJLC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JTEMKLMJYJLCJQQX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JTEMKLMJ","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JTEMKLMJYJLCJQQXA5KMUS3EAD","target":"record","payload":{"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"},"canonical_sha256":"4cc8c52d89c25624c2170754ca4b6400dc910ce7f871b411fcd0a84388b1f1a4","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"},"source_kind":"arxiv","source_id":"1504.05519","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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fh//E8kb2imoTW/2PEFezDGiv93hZA5XC9TXyu5pc+rFmw66dqk321z9kdsLfF6H5rEXVAU2DdrxtZI1ai9FCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:22:00.792092Z"},"content_sha256":"971a1d3edcf16959aa42b565ef7ebd09c68ddb68f546f1fe2bad64ab72a8acdf","schema_version":"1.0","event_id":"sha256:971a1d3edcf16959aa42b565ef7ebd09c68ddb68f546f1fe2bad64ab72a8acdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JTEMKLMJYJLCJQQXA5KMUS3EAD","target":"graph","payload":{"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"},"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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7t1X3xzf1vfaCAf1F7ftEQgaIGv9mhw5/CUoIqvdURL/53l5Y60An8WdOWcjQbHPlxFqvf55Yk25/0A0k7wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:22:00.792614Z"},"content_sha256":"6c578a4fbe455ea176f0e54675b4c23e427cf6787427b77b1f6b49135ef5800a","schema_version":"1.0","event_id":"sha256:6c578a4fbe455ea176f0e54675b4c23e427cf6787427b77b1f6b49135ef5800a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/bundle.json","state_url":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/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-05-29T21:22:00Z","links":{"resolver":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD","bundle":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/bundle.json","state":"https://pith.science/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTEMKLMJYJLCJQQXA5KMUS3EAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JTEMKLMJYJLCJQQXA5KMUS3EAD","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":"7a7f1937e270b653fe0d01450f8428f24df415b56363d59f0c4bf2ff811d13d2","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-21T17:37:07Z","title_canon_sha256":"c45216b6140a70bdbbd1507fd6a8163856229ba3e264479962cc849c784177cf"},"schema_version":"1.0","source":{"id":"1504.05519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05519","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05519v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05519","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"JTEMKLMJYJLC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JTEMKLMJYJLCJQQX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JTEMKLMJ","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:6c578a4fbe455ea176f0e54675b4c23e427cf6787427b77b1f6b49135ef5800a","target":"graph","created_at":"2026-05-18T02:18:14Z","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":"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","authors_text":"Hong Shen, Kewen Liao, Longkun Guo, Peng Li","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-21T17:37:07Z","title":"Efficient Approximation Algorithms for Computing \\emph{k} Disjoint Restricted Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05519","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:971a1d3edcf16959aa42b565ef7ebd09c68ddb68f546f1fe2bad64ab72a8acdf","target":"record","created_at":"2026-05-18T02:18:14Z","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":"7a7f1937e270b653fe0d01450f8428f24df415b56363d59f0c4bf2ff811d13d2","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-21T17:37:07Z","title_canon_sha256":"c45216b6140a70bdbbd1507fd6a8163856229ba3e264479962cc849c784177cf"},"schema_version":"1.0","source":{"id":"1504.05519","kind":"arxiv","version":1}},"canonical_sha256":"4cc8c52d89c25624c2170754ca4b6400dc910ce7f871b411fcd0a84388b1f1a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cc8c52d89c25624c2170754ca4b6400dc910ce7f871b411fcd0a84388b1f1a4","first_computed_at":"2026-05-18T02:18:14.089194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.089194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrTyI4QJcU1sBBkwANxYYQDYKPWaaJU/u8c3IBkq6fI76+qXnffsSUHlVYOcQLOYOPqC2ct94iVbYcbmz8NbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.089589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:971a1d3edcf16959aa42b565ef7ebd09c68ddb68f546f1fe2bad64ab72a8acdf","sha256:6c578a4fbe455ea176f0e54675b4c23e427cf6787427b77b1f6b49135ef5800a"],"state_sha256":"47d2de2c22a92ee7b3af632a14c01b609d41afbb9dc14ecb006adaa35376d75d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MiOTJphDLW5sH63ax1U7F4AElel9u9PSWiUXM2zUJGb9lYIB6f8KgFj6QOce6aahXzpK9vL9HOUQF0jmvympCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:22:00.795040Z","bundle_sha256":"a5af485da127a82e4744f41ab00985598136c20fb2f77a2181f68998a64e7f98"}}