{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QAV7GNVUWTQJKQUPCIAUFIPYCW","short_pith_number":"pith:QAV7GNVU","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"},"canonical_sha256":"802bf336b4b4e095428f120142a1f815a53ecfdd703843d426833d53682458d2","source":{"kind":"arxiv","id":"1202.4419","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4419","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4419v2","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4419","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"QAV7GNVUWTQJ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QAV7GNVUWTQJKQUP","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QAV7GNVU","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QAV7GNVUWTQJKQUPCIAUFIPYCW","target":"record","payload":{"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"},"canonical_sha256":"802bf336b4b4e095428f120142a1f815a53ecfdd703843d426833d53682458d2","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"},"source_kind":"arxiv","source_id":"1202.4419","source_version":2,"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-18T02:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HKLDcJ/FrHrTtHMSR6cljh7r1o7HRYM3RGvDNJAo5BqAi5J7S9LeHzrlXii5oSERAzkV/anzrXD2pzFFXTLRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:52.639245Z"},"content_sha256":"e4fcb2d4479aa87a429b03311a537de24e833260d5feba78a959a66b0dd9cf91","schema_version":"1.0","event_id":"sha256:e4fcb2d4479aa87a429b03311a537de24e833260d5feba78a959a66b0dd9cf91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QAV7GNVUWTQJKQUPCIAUFIPYCW","target":"graph","payload":{"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"},"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-18T02:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XY94AAAlIGsigLO6Pfy3DGidrC3tarWNXsKgi4leXk9isNmA5ddd2sNZtBaFj3/3uRVLqWzZqInsy11B0A7bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:52.639897Z"},"content_sha256":"10f1fde8f4f2060cb0eecb3114129c0ddc6370b1250d555093e18ad964bb5ec7","schema_version":"1.0","event_id":"sha256:10f1fde8f4f2060cb0eecb3114129c0ddc6370b1250d555093e18ad964bb5ec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/bundle.json","state_url":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/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-25T22:21:52Z","links":{"resolver":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW","bundle":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/bundle.json","state":"https://pith.science/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAV7GNVUWTQJKQUPCIAUFIPYCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QAV7GNVUWTQJKQUPCIAUFIPYCW","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":"df2207fa2e576928b484a08ddeadf54730db4daa126a9753d113894487cab5e9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-20T19:00:14Z","title_canon_sha256":"6d6f8b1159fbd03d20b0f1d322d48de5c4bfe9ace47967261e88a5cf28f28711"},"schema_version":"1.0","source":{"id":"1202.4419","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4419","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4419v2","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4419","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"QAV7GNVUWTQJ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QAV7GNVUWTQJKQUP","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QAV7GNVU","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:10f1fde8f4f2060cb0eecb3114129c0ddc6370b1250d555093e18ad964bb5ec7","target":"graph","created_at":"2026-05-18T02:57:00Z","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":"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","authors_text":"Daniel Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-20T19:00:14Z","title":"Induced Disjoint Paths in Claw-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4419","kind":"arxiv","version":2},"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:e4fcb2d4479aa87a429b03311a537de24e833260d5feba78a959a66b0dd9cf91","target":"record","created_at":"2026-05-18T02:57:00Z","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":"df2207fa2e576928b484a08ddeadf54730db4daa126a9753d113894487cab5e9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-20T19:00:14Z","title_canon_sha256":"6d6f8b1159fbd03d20b0f1d322d48de5c4bfe9ace47967261e88a5cf28f28711"},"schema_version":"1.0","source":{"id":"1202.4419","kind":"arxiv","version":2}},"canonical_sha256":"802bf336b4b4e095428f120142a1f815a53ecfdd703843d426833d53682458d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"802bf336b4b4e095428f120142a1f815a53ecfdd703843d426833d53682458d2","first_computed_at":"2026-05-18T02:57:00.233911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:00.233911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXBjTEtA/mQ460oWUaQbIc3811PwRw+PkDi8No2E6VTjPdStYM5YpHCvB0wFPhzsbQdrNltKQ8Cxzi9G3Q/RBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:00.234407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4419","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4fcb2d4479aa87a429b03311a537de24e833260d5feba78a959a66b0dd9cf91","sha256:10f1fde8f4f2060cb0eecb3114129c0ddc6370b1250d555093e18ad964bb5ec7"],"state_sha256":"0f4d8d88157b41800cd31a20e1b3a00ffe4be03754c6a4da6f568ae1430d7b0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQALvme0RMMib6Ct+RXzrVGIkq/HEmluT7XKHXpj1kQPg61/TTorGFpVMk8Sd7Rkc3sk4nCela8GEtOwk+pQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:21:52.643207Z","bundle_sha256":"8180dea5451c779dd457a6dcfef97a3af4c4764aada74324f089435efb00b306"}}