{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CZNZ7J55MZH4P2G53UKAYVFNNF","short_pith_number":"pith:CZNZ7J55","schema_version":"1.0","canonical_sha256":"165b9fa7bd664fc7e8dddd140c54ad6972d751a922c0804057d6e32ba839073e","source":{"kind":"arxiv","id":"1703.04300","version":1},"attestation_state":"computed","paper":{"title":"A Note on the Inapproximability of Induced Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gaoxiu Dong, Weidong Chen","submitted_at":"2017-03-13T09:26:05Z","abstract_excerpt":"We study the inapproximability of the induced disjoint paths problem on an arbitrary $n$-node $m$-edge undirected graph, which is to connect the maximum number of the $k$ source-sink pairs given in the graph via induced disjoint paths. It is known that the problem is NP-hard to approximate within $m^{{1\\over 2}-\\varepsilon}$ for a general $k$ and any $\\varepsilon>0$. In this paper, we prove that the problem is NP-hard to approximate within $n^{1-\\varepsilon}$ for a general $k$ and any $\\varepsilon>0$ by giving a simple reduction from the independent set problem."},"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":"1703.04300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-13T09:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"bc55311a4944222191127d8fa47042caf0e4ec5e418ddd24bc30e1143d98c1e3","abstract_canon_sha256":"15ac3a6925d55a459e96fd265570a3cf4dcbcde45a10847a86c420b7d7252373"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:49.186562Z","signature_b64":"EgTxnGjOYkNWnRy25T3THMT3jdMb9gWJef9mcnLrVye3dmDExbJM32B8cMsAb0RL1BIIxF8/Gxlox/f1ot+TDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"165b9fa7bd664fc7e8dddd140c54ad6972d751a922c0804057d6e32ba839073e","last_reissued_at":"2026-05-18T00:48:49.185809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:49.185809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Inapproximability of Induced Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gaoxiu Dong, Weidong Chen","submitted_at":"2017-03-13T09:26:05Z","abstract_excerpt":"We study the inapproximability of the induced disjoint paths problem on an arbitrary $n$-node $m$-edge undirected graph, which is to connect the maximum number of the $k$ source-sink pairs given in the graph via induced disjoint paths. It is known that the problem is NP-hard to approximate within $m^{{1\\over 2}-\\varepsilon}$ for a general $k$ and any $\\varepsilon>0$. In this paper, we prove that the problem is NP-hard to approximate within $n^{1-\\varepsilon}$ for a general $k$ and any $\\varepsilon>0$ by giving a simple reduction from the independent set problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04300","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":"1703.04300","created_at":"2026-05-18T00:48:49.185923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04300v1","created_at":"2026-05-18T00:48:49.185923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04300","created_at":"2026-05-18T00:48:49.185923+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZNZ7J55MZH4","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZNZ7J55MZH4P2G5","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZNZ7J55","created_at":"2026-05-18T12:31:10.602751+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/CZNZ7J55MZH4P2G53UKAYVFNNF","json":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF.json","graph_json":"https://pith.science/api/pith-number/CZNZ7J55MZH4P2G53UKAYVFNNF/graph.json","events_json":"https://pith.science/api/pith-number/CZNZ7J55MZH4P2G53UKAYVFNNF/events.json","paper":"https://pith.science/paper/CZNZ7J55"},"agent_actions":{"view_html":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF","download_json":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF.json","view_paper":"https://pith.science/paper/CZNZ7J55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04300&json=true","fetch_graph":"https://pith.science/api/pith-number/CZNZ7J55MZH4P2G53UKAYVFNNF/graph.json","fetch_events":"https://pith.science/api/pith-number/CZNZ7J55MZH4P2G53UKAYVFNNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/action/storage_attestation","attest_author":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/action/author_attestation","sign_citation":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/action/citation_signature","submit_replication":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/action/replication_record"}},"created_at":"2026-05-18T00:48:49.185923+00:00","updated_at":"2026-05-18T00:48:49.185923+00:00"}