{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QAV7GNVUWTQJKQUPCIAUFIPYCW","short_pith_number":"pith:QAV7GNVU","schema_version":"1.0","canonical_sha256":"802bf336b4b4e095428f120142a1f815a53ecfdd703843d426833d53682458d2","source":{"kind":"arxiv","id":"1202.4419","version":2},"attestation_state":"computed","paper":{"title":"Induced Disjoint Paths in Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Daniel Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","submitted_at":"2012-02-20T19:00:14Z","abstract_excerpt":"Paths P1,...,Pk in a graph G=(V,E) are said to be mutually induced if for any 1 <= i < j <= k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test whether a graph G with k pairs of specified vertices (si,ti) contains k mutually induced paths Pi such that Pi connects si and ti for i=1,...,k. We show that this problem is fixed-parameter tractable for claw-free graphs when parameterized by k. Several related problems, such as the k-in-a-Path problem, are proven to be fixed-parameter tractable for claw-free"},"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":"1202.4419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-20T19:00:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6d6f8b1159fbd03d20b0f1d322d48de5c4bfe9ace47967261e88a5cf28f28711","abstract_canon_sha256":"df2207fa2e576928b484a08ddeadf54730db4daa126a9753d113894487cab5e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:00.234407Z","signature_b64":"gXBjTEtA/mQ460oWUaQbIc3811PwRw+PkDi8No2E6VTjPdStYM5YpHCvB0wFPhzsbQdrNltKQ8Cxzi9G3Q/RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"802bf336b4b4e095428f120142a1f815a53ecfdd703843d426833d53682458d2","last_reissued_at":"2026-05-18T02:57:00.233911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:00.233911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced Disjoint Paths in Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Daniel Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","submitted_at":"2012-02-20T19:00:14Z","abstract_excerpt":"Paths P1,...,Pk in a graph G=(V,E) are said to be mutually induced if for any 1 <= i < j <= k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test whether a graph G with k pairs of specified vertices (si,ti) contains k mutually induced paths Pi such that Pi connects si and ti for i=1,...,k. We show that this problem is fixed-parameter tractable for claw-free graphs when parameterized by k. Several related problems, such as the k-in-a-Path problem, are proven to be fixed-parameter tractable for claw-free"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4419","kind":"arxiv","version":2},"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":"1202.4419","created_at":"2026-05-18T02:57:00.233987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4419v2","created_at":"2026-05-18T02:57:00.233987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4419","created_at":"2026-05-18T02:57:00.233987+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAV7GNVUWTQJ","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAV7GNVUWTQJKQUP","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAV7GNVU","created_at":"2026-05-18T12:27:18.751474+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/QAV7GNVUWTQJKQUPCIAUFIPYCW","json":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW.json","graph_json":"https://pith.science/api/pith-number/QAV7GNVUWTQJKQUPCIAUFIPYCW/graph.json","events_json":"https://pith.science/api/pith-number/QAV7GNVUWTQJKQUPCIAUFIPYCW/events.json","paper":"https://pith.science/paper/QAV7GNVU"},"agent_actions":{"view_html":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW","download_json":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW.json","view_paper":"https://pith.science/paper/QAV7GNVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4419&json=true","fetch_graph":"https://pith.science/api/pith-number/QAV7GNVUWTQJKQUPCIAUFIPYCW/graph.json","fetch_events":"https://pith.science/api/pith-number/QAV7GNVUWTQJKQUPCIAUFIPYCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/action/storage_attestation","attest_author":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/action/author_attestation","sign_citation":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/action/citation_signature","submit_replication":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/action/replication_record"}},"created_at":"2026-05-18T02:57:00.233987+00:00","updated_at":"2026-05-18T02:57:00.233987+00:00"}