{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZLA7HDXRFCTCIVFTXL7E2KVWXZ","short_pith_number":"pith:ZLA7HDXR","schema_version":"1.0","canonical_sha256":"cac1f38ef128a62454b3bafe4d2ab6be53fb38a716e4ddf4a3458e461b203fb3","source":{"kind":"arxiv","id":"1011.2136","version":1},"attestation_state":"computed","paper":{"title":"A lower bound for the tree-width of planar graphs with vital linkages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Isolde Adler, Philipp Klaus Krause","submitted_at":"2010-11-09T16:29:47Z","abstract_excerpt":"The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s_0,t_0), ...,(s_k,t_k), whether there are k+1 pairwise disjoint paths P_0, ...,P_k, such that P_i connects s_i to t_i. Robertson and Seymour have proven that the problem can be solved in polynomial time if k is fixed. Nevertheless, the constants involved are huge, and the algorithm is far from implementable. The algorithm uses a bound on the tree-width of graphs with vital linkages, and deletion of irrelevant vertices. We give single exponential lower bounds both for the tree-width of planar graphs with vital link"},"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":"1011.2136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-09T16:29:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"637a50531a202442d9d85fa34d2bc37744d9dac8bcee81b5550ae20e9cecd705","abstract_canon_sha256":"4ea210afc81eac85b967ed40bc8a9b73af05619957c40f48740049bfc31049f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:42.494689Z","signature_b64":"bm4liuiDAxiNrLEDScOcwbxju3i4fV3Qc2OZa3XAcM6fb4bFJ1/YYv9wnpvzN8cJsfiyaioVE0G3VrnD9B4vAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac1f38ef128a62454b3bafe4d2ab6be53fb38a716e4ddf4a3458e461b203fb3","last_reissued_at":"2026-05-18T04:36:42.494137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:42.494137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound for the tree-width of planar graphs with vital linkages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Isolde Adler, Philipp Klaus Krause","submitted_at":"2010-11-09T16:29:47Z","abstract_excerpt":"The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s_0,t_0), ...,(s_k,t_k), whether there are k+1 pairwise disjoint paths P_0, ...,P_k, such that P_i connects s_i to t_i. Robertson and Seymour have proven that the problem can be solved in polynomial time if k is fixed. Nevertheless, the constants involved are huge, and the algorithm is far from implementable. The algorithm uses a bound on the tree-width of graphs with vital linkages, and deletion of irrelevant vertices. We give single exponential lower bounds both for the tree-width of planar graphs with vital link"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2136","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":"1011.2136","created_at":"2026-05-18T04:36:42.494226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2136v1","created_at":"2026-05-18T04:36:42.494226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2136","created_at":"2026-05-18T04:36:42.494226+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLA7HDXRFCTC","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLA7HDXRFCTCIVFT","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLA7HDXR","created_at":"2026-05-18T12:26:18.847500+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/ZLA7HDXRFCTCIVFTXL7E2KVWXZ","json":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ.json","graph_json":"https://pith.science/api/pith-number/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/graph.json","events_json":"https://pith.science/api/pith-number/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/events.json","paper":"https://pith.science/paper/ZLA7HDXR"},"agent_actions":{"view_html":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ","download_json":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ.json","view_paper":"https://pith.science/paper/ZLA7HDXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2136&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZLA7HDXRFCTCIVFTXL7E2KVWXZ/action/replication_record"}},"created_at":"2026-05-18T04:36:42.494226+00:00","updated_at":"2026-05-18T04:36:42.494226+00:00"}