{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S54SN2RJ2LPDC4ISP25JZ72ZOU","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":"10e6502df95a0d89c63617542299ac9da57bffce950c23f1138d7d8bc27cdfd3","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-22T04:52:06Z","title_canon_sha256":"55eb474bd6f3fc803b9e738676b832def24f8fbd445c24717f1c2fa576ed17f2"},"schema_version":"1.0","source":{"id":"1301.5070","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5070","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5070v2","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5070","created_at":"2026-05-18T03:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"S54SN2RJ2LPD","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S54SN2RJ2LPDC4IS","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S54SN2RJ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:237f381fbd8d81f7ff2f79cd395155741dba36d59a2f59fd7b53bf5142b72f05","target":"graph","created_at":"2026-05-18T03:29:06Z","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":"For a given graph $G$ with positive integral cost and delay on edges, distinct vertices $s$ and $t$, cost bound $C\\in Z^{+}$ and delay bound $D\\in Z^{+}$, the $k$ bi-constraint path ($k$BCP) problem is to compute $k$ disjoint $st$-paths subject to $C$ and $D$. This problem is known NP-hard, even when $k=1$ \\cite{garey1979computers}. This paper first gives a simple approximation algorithm with factor-$(2,2)$, i.e. the algorithm computes a solution with delay and cost bounded by $2*D$ and $2*C$ respectively. Later, a novel improved approximation algorithm with ratio $(1+\\beta,\\,\\max\\{2,\\,1+\\ln\\f","authors_text":"Hong Shen, Kewen Liao, Longkun Guo","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-22T04:52:06Z","title":"Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5070","kind":"arxiv","version":2},"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:0e2c0caf38445ed3c20d2671499fd24c2a244b065853a3969f0e5c4fb17d802b","target":"record","created_at":"2026-05-18T03:29:06Z","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":"10e6502df95a0d89c63617542299ac9da57bffce950c23f1138d7d8bc27cdfd3","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-22T04:52:06Z","title_canon_sha256":"55eb474bd6f3fc803b9e738676b832def24f8fbd445c24717f1c2fa576ed17f2"},"schema_version":"1.0","source":{"id":"1301.5070","kind":"arxiv","version":2}},"canonical_sha256":"977926ea29d2de3171127eba9cff59750ad9842710025574db371e1f51132ec0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"977926ea29d2de3171127eba9cff59750ad9842710025574db371e1f51132ec0","first_computed_at":"2026-05-18T03:29:06.347697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:06.347697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pgxiQR1c8+fgaKwFgcnk6AEUK+w6mL5inLQLYv9dT5eNGDX1CvVpGPklSJYPyEDe6PZSJTPrU8rPAbG9hQZmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:06.348156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5070","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e2c0caf38445ed3c20d2671499fd24c2a244b065853a3969f0e5c4fb17d802b","sha256:237f381fbd8d81f7ff2f79cd395155741dba36d59a2f59fd7b53bf5142b72f05"],"state_sha256":"c721ed922d3c46484494f0f927e3eb36a1aba927e9f3a1e1c70139402dfead12"}