{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KHL2E5ATB6A2EHGUHYTHNIJZXV","short_pith_number":"pith:KHL2E5AT","schema_version":"1.0","canonical_sha256":"51d7a274130f81a21cd43e2676a139bd4ba6377de9f7848fe248e68a31939664","source":{"kind":"arxiv","id":"1104.4370","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.4370","created_at":"2026-05-18T03:59:38.282940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4370v1","created_at":"2026-05-18T03:59:38.282940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4370","created_at":"2026-05-18T03:59:38.282940+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHL2E5ATB6A2","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHL2E5ATB6A2EHGU","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHL2E5AT","created_at":"2026-05-18T12:26:32.869790+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/KHL2E5ATB6A2EHGUHYTHNIJZXV","json":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV.json","graph_json":"https://pith.science/api/pith-number/KHL2E5ATB6A2EHGUHYTHNIJZXV/graph.json","events_json":"https://pith.science/api/pith-number/KHL2E5ATB6A2EHGUHYTHNIJZXV/events.json","paper":"https://pith.science/paper/KHL2E5AT"},"agent_actions":{"view_html":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV","download_json":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV.json","view_paper":"https://pith.science/paper/KHL2E5AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4370&json=true","fetch_graph":"https://pith.science/api/pith-number/KHL2E5ATB6A2EHGUHYTHNIJZXV/graph.json","fetch_events":"https://pith.science/api/pith-number/KHL2E5ATB6A2EHGUHYTHNIJZXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/action/storage_attestation","attest_author":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/action/author_attestation","sign_citation":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/action/citation_signature","submit_replication":"https://pith.science/pith/KHL2E5ATB6A2EHGUHYTHNIJZXV/action/replication_record"}},"created_at":"2026-05-18T03:59:38.282940+00:00","updated_at":"2026-05-18T03:59:38.282940+00:00"}