{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KHL2E5ATB6A2EHGUHYTHNIJZXV","short_pith_number":"pith:KHL2E5AT","canonical_record":{"source":{"id":"1104.4370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T01:23:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"dc6171a039b64cdee6e2be0814820e80b48fc1cbb5bcfb474d165e9098bcba75","abstract_canon_sha256":"4689fe217a4e670d47d7cd53359a0708707e1f594e4e562dda6dd36d157b85ee"},"schema_version":"1.0"},"canonical_sha256":"51d7a274130f81a21cd43e2676a139bd4ba6377de9f7848fe248e68a31939664","source":{"kind":"arxiv","id":"1104.4370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4370","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4370v1","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4370","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"KHL2E5ATB6A2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KHL2E5ATB6A2EHGU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KHL2E5AT","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KHL2E5ATB6A2EHGUHYTHNIJZXV","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T01:23:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"dc6171a039b64cdee6e2be0814820e80b48fc1cbb5bcfb474d165e9098bcba75","abstract_canon_sha256":"4689fe217a4e670d47d7cd53359a0708707e1f594e4e562dda6dd36d157b85ee"},"schema_version":"1.0"},"canonical_sha256":"51d7a274130f81a21cd43e2676a139bd4ba6377de9f7848fe248e68a31939664","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:38.283610Z","signature_b64":"Fw/aSToep92mkk+XLI6YmuEgh00Fz6ThDiZcpN1H+9Zt5DeuY2rO1c8bt51op0hA4NW/Y/KHzY+GTZIp9E33Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d7a274130f81a21cd43e2676a139bd4ba6377de9f7848fe248e68a31939664","last_reissued_at":"2026-05-18T03:59:38.282815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:38.282815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4370","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-18T03:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHtIVcUN5wNQSgbaK379lZGan1IYK8dV6Hq8p2pY5996XxhxZsHHK7vPyn4SKFmRmIa7z1I7HxICxg0CadKHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:34:30.710070Z"},"content_sha256":"8ebc779536cd60760db89bab5c061dd778652b73724530555210b9f0d7b263c5","schema_version":"1.0","event_id":"sha256:8ebc779536cd60760db89bab5c061dd778652b73724530555210b9f0d7b263c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KHL2E5ATB6A2EHGUHYTHNIJZXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum disjoint paths problem on multi-relations social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu","submitted_at":"2011-04-22T01:23:06Z","abstract_excerpt":"Motivated by applications to social network analysis (SNA), we study the problem of finding the maximum number of disjoint uni-color paths in an edge-colored graph. We show the NP-hardness and the approximability of the problem, and both approximation and exact algorithms are proposed. Since short paths are much more significant in SNA, we also study the length-bounded version of the problem, in which the lengths of paths are required to be upper bounded by a fixed integer $l$. It is shown that the problem can be solved in polynomial time for $l=3$ and is NP-hard for $l\\geq 4$. We also show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4370","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-18T03:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qh+4BtHEpLEdKlLJFlBsSSpWu59iVFo0qqBD95Bbqg4lgF/yuK0VLz4XlrJ395m4iGEAqjwmzCKhgKeq7x7tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:34:30.710439Z"},"content_sha256":"ca6952b9520fc151437a64324440ac7c72fa6eddc0f5120aecf1dc17fdc0d5a5","schema_version":"1.0","event_id":"sha256:ca6952b9520fc151437a64324440ac7c72fa6eddc0f5120aecf1dc17fdc0d5a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/bundle.json","state_url":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/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-25T21:34:30Z","links":{"resolver":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV","bundle":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/bundle.json","state":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KHL2E5ATB6A2EHGUHYTHNIJZXV","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":"4689fe217a4e670d47d7cd53359a0708707e1f594e4e562dda6dd36d157b85ee","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T01:23:06Z","title_canon_sha256":"dc6171a039b64cdee6e2be0814820e80b48fc1cbb5bcfb474d165e9098bcba75"},"schema_version":"1.0","source":{"id":"1104.4370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4370","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4370v1","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4370","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"KHL2E5ATB6A2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KHL2E5ATB6A2EHGU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KHL2E5AT","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:ca6952b9520fc151437a64324440ac7c72fa6eddc0f5120aecf1dc17fdc0d5a5","target":"graph","created_at":"2026-05-18T03:59:38Z","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":"Motivated by applications to social network analysis (SNA), we study the problem of finding the maximum number of disjoint uni-color paths in an edge-colored graph. We show the NP-hardness and the approximability of the problem, and both approximation and exact algorithms are proposed. Since short paths are much more significant in SNA, we also study the length-bounded version of the problem, in which the lengths of paths are required to be upper bounded by a fixed integer $l$. It is shown that the problem can be solved in polynomial time for $l=3$ and is NP-hard for $l\\geq 4$. We also show th","authors_text":"Bang Ye Wu","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T01:23:06Z","title":"The maximum disjoint paths problem on multi-relations social networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4370","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:8ebc779536cd60760db89bab5c061dd778652b73724530555210b9f0d7b263c5","target":"record","created_at":"2026-05-18T03:59:38Z","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":"4689fe217a4e670d47d7cd53359a0708707e1f594e4e562dda6dd36d157b85ee","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-22T01:23:06Z","title_canon_sha256":"dc6171a039b64cdee6e2be0814820e80b48fc1cbb5bcfb474d165e9098bcba75"},"schema_version":"1.0","source":{"id":"1104.4370","kind":"arxiv","version":1}},"canonical_sha256":"51d7a274130f81a21cd43e2676a139bd4ba6377de9f7848fe248e68a31939664","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d7a274130f81a21cd43e2676a139bd4ba6377de9f7848fe248e68a31939664","first_computed_at":"2026-05-18T03:59:38.282815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:38.282815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fw/aSToep92mkk+XLI6YmuEgh00Fz6ThDiZcpN1H+9Zt5DeuY2rO1c8bt51op0hA4NW/Y/KHzY+GTZIp9E33Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:38.283610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ebc779536cd60760db89bab5c061dd778652b73724530555210b9f0d7b263c5","sha256:ca6952b9520fc151437a64324440ac7c72fa6eddc0f5120aecf1dc17fdc0d5a5"],"state_sha256":"81b78e3fca5cdb96282ad145786cf0f12348030294c9de42e3ec5f85473bf331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+a27dRIdRHDWuE55PaE2UA7USHSFPQYCsL0kH11kAIcllCbk1x3iZb1G2E9kGWyTQEoNNyWlGuX3MGlaF8baBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:34:30.712632Z","bundle_sha256":"2913e14d135b0fd948974d75adc80995fc5a95985d47b725ed5ebf760ee74a94"}}