{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GOSB3WMXUTJSOCSKHCYHUJXCJR","short_pith_number":"pith:GOSB3WMX","schema_version":"1.0","canonical_sha256":"33a41dd997a4d3270a4a38b07a26e24c54ce0e3a6c3f45fa09cc5ffb698da115","source":{"kind":"arxiv","id":"1901.04325","version":1},"attestation_state":"computed","paper":{"title":"A lower bound on the tree-width of graphs with irrelevant vertices","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Isolde Adler, Philipp Klaus Krause","submitted_at":"2019-01-14T14:00:22Z","abstract_excerpt":"For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function $f$ such that if the tree-width of a graph $G$ with $k$ pairs of terminals is at least $f(k)$, then $G$ contains a solution-irrelevant vertex (Graph Minors. XXII., JCTB 2012). We give a single-exponential lower bound on $f$. This bound even holds for planar graphs."},"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":"1901.04325","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2019-01-14T14:00:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"deca52b0188100df40c78d241c54933c81381b6472e5163c38fb3df786d5ee11","abstract_canon_sha256":"361419d703ce5c504863aa100e6c8c644745bccbeb88c4f3f7483a24bb2bf793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:25.821852Z","signature_b64":"AMhmwk0dYimP/KEn88xnVieq+3mpbq6n11/o6EInqb6smz4n9Z7wVIJVj5kjP2ZbINtU/S/oYY3dxX3sBMBDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33a41dd997a4d3270a4a38b07a26e24c54ce0e3a6c3f45fa09cc5ffb698da115","last_reissued_at":"2026-05-17T23:56:25.821229Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:25.821229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the tree-width of graphs with irrelevant vertices","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Isolde Adler, Philipp Klaus Krause","submitted_at":"2019-01-14T14:00:22Z","abstract_excerpt":"For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function $f$ such that if the tree-width of a graph $G$ with $k$ pairs of terminals is at least $f(k)$, then $G$ contains a solution-irrelevant vertex (Graph Minors. XXII., JCTB 2012). We give a single-exponential lower bound on $f$. This bound even holds for planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04325","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":"1901.04325","created_at":"2026-05-17T23:56:25.821338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04325v1","created_at":"2026-05-17T23:56:25.821338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04325","created_at":"2026-05-17T23:56:25.821338+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOSB3WMXUTJS","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOSB3WMXUTJSOCSK","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOSB3WMX","created_at":"2026-05-18T12:33:18.533446+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/GOSB3WMXUTJSOCSKHCYHUJXCJR","json":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR.json","graph_json":"https://pith.science/api/pith-number/GOSB3WMXUTJSOCSKHCYHUJXCJR/graph.json","events_json":"https://pith.science/api/pith-number/GOSB3WMXUTJSOCSKHCYHUJXCJR/events.json","paper":"https://pith.science/paper/GOSB3WMX"},"agent_actions":{"view_html":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR","download_json":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR.json","view_paper":"https://pith.science/paper/GOSB3WMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04325&json=true","fetch_graph":"https://pith.science/api/pith-number/GOSB3WMXUTJSOCSKHCYHUJXCJR/graph.json","fetch_events":"https://pith.science/api/pith-number/GOSB3WMXUTJSOCSKHCYHUJXCJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/action/storage_attestation","attest_author":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/action/author_attestation","sign_citation":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/action/citation_signature","submit_replication":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/action/replication_record"}},"created_at":"2026-05-17T23:56:25.821338+00:00","updated_at":"2026-05-17T23:56:25.821338+00:00"}