{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SIX2JXXT7LAEQUFR6P2SML4EDM","short_pith_number":"pith:SIX2JXXT","schema_version":"1.0","canonical_sha256":"922fa4def3fac04850b1f3f5262f841b26e8f451bbccebb9b6fd0ea1ac59a764","source":{"kind":"arxiv","id":"1310.2378","version":4},"attestation_state":"computed","paper":{"title":"Irrelevant Vertices for the Planar Disjoint Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Daniel Lokshtanov, Dimitrios M. Thilikos, Isolde Adler, Philipp Klaus Krause, Saket Saurabhh, Stavros G. Kolliopoulos","submitted_at":"2013-10-09T07:27:46Z","abstract_excerpt":"The Disjoint Paths Problem asks, given a graph $G$ and a set of pairs of terminals $(s_{1},t_{1}),\\ldots,(s_{k},t_{k})$, whether there is a collection of $k$ pairwise vertex-disjoint paths linking $s_{i}$ and $t_{i}$, for $i=1,\\ldots,k.$ In their $f(k)\\cdot n^{3}$ algorithm for this problem, Robertson and Seymour introduced the irrelevant vertex technique according to which in every instance of treewidth greater than $g(k)$ there is an \"irrelevant\" vertex whose removal creates an equivalent instance of the problem. This fact is based on the celebrated Unique Linkage Theorem, whose - very techn"},"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":"1310.2378","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T07:27:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f9e424df5b1b82eff09575d402cbf0900a820693b8bd390fb615312d2677b954","abstract_canon_sha256":"9e8b8b303aedf574a5ab7c188d44273648309cbb16a48b2e8489bacde05d8ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:18.923750Z","signature_b64":"96ywEY5hyHtE+/1eKalJlwTzkjckJYTwZwfwEbViE3mlokjNbi+kDz9EYwGnGv1uH+qMJHQDYyHH4fr0UoL6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"922fa4def3fac04850b1f3f5262f841b26e8f451bbccebb9b6fd0ea1ac59a764","last_reissued_at":"2026-05-18T01:12:18.923378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:18.923378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irrelevant Vertices for the Planar Disjoint Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Daniel Lokshtanov, Dimitrios M. Thilikos, Isolde Adler, Philipp Klaus Krause, Saket Saurabhh, Stavros G. Kolliopoulos","submitted_at":"2013-10-09T07:27:46Z","abstract_excerpt":"The Disjoint Paths Problem asks, given a graph $G$ and a set of pairs of terminals $(s_{1},t_{1}),\\ldots,(s_{k},t_{k})$, whether there is a collection of $k$ pairwise vertex-disjoint paths linking $s_{i}$ and $t_{i}$, for $i=1,\\ldots,k.$ In their $f(k)\\cdot n^{3}$ algorithm for this problem, Robertson and Seymour introduced the irrelevant vertex technique according to which in every instance of treewidth greater than $g(k)$ there is an \"irrelevant\" vertex whose removal creates an equivalent instance of the problem. This fact is based on the celebrated Unique Linkage Theorem, whose - very techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2378","kind":"arxiv","version":4},"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":"1310.2378","created_at":"2026-05-18T01:12:18.923435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2378v4","created_at":"2026-05-18T01:12:18.923435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2378","created_at":"2026-05-18T01:12:18.923435+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIX2JXXT7LAE","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIX2JXXT7LAEQUFR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIX2JXXT","created_at":"2026-05-18T12:27:59.945178+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/SIX2JXXT7LAEQUFR6P2SML4EDM","json":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM.json","graph_json":"https://pith.science/api/pith-number/SIX2JXXT7LAEQUFR6P2SML4EDM/graph.json","events_json":"https://pith.science/api/pith-number/SIX2JXXT7LAEQUFR6P2SML4EDM/events.json","paper":"https://pith.science/paper/SIX2JXXT"},"agent_actions":{"view_html":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM","download_json":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM.json","view_paper":"https://pith.science/paper/SIX2JXXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2378&json=true","fetch_graph":"https://pith.science/api/pith-number/SIX2JXXT7LAEQUFR6P2SML4EDM/graph.json","fetch_events":"https://pith.science/api/pith-number/SIX2JXXT7LAEQUFR6P2SML4EDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/action/storage_attestation","attest_author":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/action/author_attestation","sign_citation":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/action/citation_signature","submit_replication":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/action/replication_record"}},"created_at":"2026-05-18T01:12:18.923435+00:00","updated_at":"2026-05-18T01:12:18.923435+00:00"}