{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GOSB3WMXUTJSOCSKHCYHUJXCJR","short_pith_number":"pith:GOSB3WMX","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"},"canonical_sha256":"33a41dd997a4d3270a4a38b07a26e24c54ce0e3a6c3f45fa09cc5ffb698da115","source":{"kind":"arxiv","id":"1901.04325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04325","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04325v1","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04325","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"GOSB3WMXUTJS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GOSB3WMXUTJSOCSK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GOSB3WMX","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GOSB3WMXUTJSOCSKHCYHUJXCJR","target":"record","payload":{"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"},"canonical_sha256":"33a41dd997a4d3270a4a38b07a26e24c54ce0e3a6c3f45fa09cc5ffb698da115","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"},"source_kind":"arxiv","source_id":"1901.04325","source_version":1,"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-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6qO7LKfqOnPgRgu6Vr+4K/eoHLILP8db1MSkbSfknuglU3VRnzI8KJNGk4wT7K8b6XHQfuf9NlVc4YTpJB7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:01:21.544957Z"},"content_sha256":"826e7bcca90b8c5f7ae7749ebba87cc9d270ebd1ce3b524da2ac646071623646","schema_version":"1.0","event_id":"sha256:826e7bcca90b8c5f7ae7749ebba87cc9d270ebd1ce3b524da2ac646071623646"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GOSB3WMXUTJSOCSKHCYHUJXCJR","target":"graph","payload":{"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"},"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-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ME815Hm0X25k4b29aMDM7KVD8kMksehj9FFrZL5usQwFCxr92tSjo8AafWDYyVvIQ+auPXOAf/PU6tQrGvI9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:01:21.545327Z"},"content_sha256":"72787bcddd671ab13946083e96ed6a377ed678f56e7bde2bccd1efc95f3d694d","schema_version":"1.0","event_id":"sha256:72787bcddd671ab13946083e96ed6a377ed678f56e7bde2bccd1efc95f3d694d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/bundle.json","state_url":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/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-06-02T10:01:21Z","links":{"resolver":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR","bundle":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/bundle.json","state":"https://pith.science/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOSB3WMXUTJSOCSKHCYHUJXCJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GOSB3WMXUTJSOCSKHCYHUJXCJR","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":"361419d703ce5c504863aa100e6c8c644745bccbeb88c4f3f7483a24bb2bf793","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2019-01-14T14:00:22Z","title_canon_sha256":"deca52b0188100df40c78d241c54933c81381b6472e5163c38fb3df786d5ee11"},"schema_version":"1.0","source":{"id":"1901.04325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04325","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04325v1","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04325","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"GOSB3WMXUTJS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GOSB3WMXUTJSOCSK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GOSB3WMX","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:72787bcddd671ab13946083e96ed6a377ed678f56e7bde2bccd1efc95f3d694d","target":"graph","created_at":"2026-05-17T23:56:25Z","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":"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.","authors_text":"Isolde Adler, Philipp Klaus Krause","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2019-01-14T14:00:22Z","title":"A lower bound on the tree-width of graphs with irrelevant vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04325","kind":"arxiv","version":1},"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:826e7bcca90b8c5f7ae7749ebba87cc9d270ebd1ce3b524da2ac646071623646","target":"record","created_at":"2026-05-17T23:56:25Z","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":"361419d703ce5c504863aa100e6c8c644745bccbeb88c4f3f7483a24bb2bf793","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2019-01-14T14:00:22Z","title_canon_sha256":"deca52b0188100df40c78d241c54933c81381b6472e5163c38fb3df786d5ee11"},"schema_version":"1.0","source":{"id":"1901.04325","kind":"arxiv","version":1}},"canonical_sha256":"33a41dd997a4d3270a4a38b07a26e24c54ce0e3a6c3f45fa09cc5ffb698da115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33a41dd997a4d3270a4a38b07a26e24c54ce0e3a6c3f45fa09cc5ffb698da115","first_computed_at":"2026-05-17T23:56:25.821229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:25.821229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AMhmwk0dYimP/KEn88xnVieq+3mpbq6n11/o6EInqb6smz4n9Z7wVIJVj5kjP2ZbINtU/S/oYY3dxX3sBMBDAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:25.821852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:826e7bcca90b8c5f7ae7749ebba87cc9d270ebd1ce3b524da2ac646071623646","sha256:72787bcddd671ab13946083e96ed6a377ed678f56e7bde2bccd1efc95f3d694d"],"state_sha256":"08ad61fe209b5ac7f0d16efe3d75c20daaecdcb666dda658cf5d4d38afc48920"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPiWIPwBScMv/MZvPbklIHuiWw+bVgHQ8NMLMg7xkIX3DK7IhJn2fqiIjz5qdXQ5adRjufEYMs2mAJY0t1zhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:01:21.547298Z","bundle_sha256":"d985aff8abbb6e2b8aaa6092e561eda9c1906943f16eb81785ebf39d501cd4c2"}}