{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CZNZ7J55MZH4P2G53UKAYVFNNF","short_pith_number":"pith:CZNZ7J55","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"},"canonical_sha256":"165b9fa7bd664fc7e8dddd140c54ad6972d751a922c0804057d6e32ba839073e","source":{"kind":"arxiv","id":"1703.04300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04300","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04300v1","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04300","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"CZNZ7J55MZH4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CZNZ7J55MZH4P2G5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CZNZ7J55","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CZNZ7J55MZH4P2G53UKAYVFNNF","target":"record","payload":{"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"},"canonical_sha256":"165b9fa7bd664fc7e8dddd140c54ad6972d751a922c0804057d6e32ba839073e","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"},"source_kind":"arxiv","source_id":"1703.04300","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-18T00:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+A98+SfRIEvg2oALp05TxrIk1gSKxL8A+nuaH6pVeKa6nFYebHYC3W7qWm30YcIEgLFpy4pBfXpfzSeNjXFCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:23:59.961804Z"},"content_sha256":"d6a0624feaba238ea3169400d1c209f84db20600b7cdb0790d04598414a40b6e","schema_version":"1.0","event_id":"sha256:d6a0624feaba238ea3169400d1c209f84db20600b7cdb0790d04598414a40b6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CZNZ7J55MZH4P2G53UKAYVFNNF","target":"graph","payload":{"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"},"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-18T00:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGp2dTel6XtzC8E27P9KSNhoPbsRqBzfWoH0hPZa7jPR7UGvObKICz+18HL+B1Wo4I0pXsPr++sK7804bW1CAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:23:59.962550Z"},"content_sha256":"73a7d37ee9795ff0ad665447090c04605245c884c79cf5e2bac4193a1c093c27","schema_version":"1.0","event_id":"sha256:73a7d37ee9795ff0ad665447090c04605245c884c79cf5e2bac4193a1c093c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/bundle.json","state_url":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/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-29T19:23:59Z","links":{"resolver":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF","bundle":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/bundle.json","state":"https://pith.science/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZNZ7J55MZH4P2G53UKAYVFNNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CZNZ7J55MZH4P2G53UKAYVFNNF","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":"15ac3a6925d55a459e96fd265570a3cf4dcbcde45a10847a86c420b7d7252373","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-13T09:26:05Z","title_canon_sha256":"bc55311a4944222191127d8fa47042caf0e4ec5e418ddd24bc30e1143d98c1e3"},"schema_version":"1.0","source":{"id":"1703.04300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04300","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04300v1","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04300","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"CZNZ7J55MZH4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CZNZ7J55MZH4P2G5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CZNZ7J55","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:73a7d37ee9795ff0ad665447090c04605245c884c79cf5e2bac4193a1c093c27","target":"graph","created_at":"2026-05-18T00:48:49Z","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":"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.","authors_text":"Gaoxiu Dong, Weidong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-13T09:26:05Z","title":"A Note on the Inapproximability of Induced Disjoint Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04300","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:d6a0624feaba238ea3169400d1c209f84db20600b7cdb0790d04598414a40b6e","target":"record","created_at":"2026-05-18T00:48:49Z","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":"15ac3a6925d55a459e96fd265570a3cf4dcbcde45a10847a86c420b7d7252373","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-13T09:26:05Z","title_canon_sha256":"bc55311a4944222191127d8fa47042caf0e4ec5e418ddd24bc30e1143d98c1e3"},"schema_version":"1.0","source":{"id":"1703.04300","kind":"arxiv","version":1}},"canonical_sha256":"165b9fa7bd664fc7e8dddd140c54ad6972d751a922c0804057d6e32ba839073e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"165b9fa7bd664fc7e8dddd140c54ad6972d751a922c0804057d6e32ba839073e","first_computed_at":"2026-05-18T00:48:49.185809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:49.185809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EgTxnGjOYkNWnRy25T3THMT3jdMb9gWJef9mcnLrVye3dmDExbJM32B8cMsAb0RL1BIIxF8/Gxlox/f1ot+TDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:49.186562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6a0624feaba238ea3169400d1c209f84db20600b7cdb0790d04598414a40b6e","sha256:73a7d37ee9795ff0ad665447090c04605245c884c79cf5e2bac4193a1c093c27"],"state_sha256":"444a0399d68fc22dc3fe8d4cfdb52621e0e6746ea362b3097f70e09105bc9ff0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4bHtworpv0s86QyvHNPdB7sihltLp5CbGI30JUJTMWrwLF/ZbuZ8PmbBmWXh8Lj3+Eo8yvSGXJa545f7RmfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:23:59.966360Z","bundle_sha256":"db60f1c19aa2546e351f500d58ae5e6fa867a088aa99b6ee2de4a1c61a823bd8"}}