{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SIX2JXXT7LAEQUFR6P2SML4EDM","short_pith_number":"pith:SIX2JXXT","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"},"canonical_sha256":"922fa4def3fac04850b1f3f5262f841b26e8f451bbccebb9b6fd0ea1ac59a764","source":{"kind":"arxiv","id":"1310.2378","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2378","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2378v4","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2378","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"SIX2JXXT7LAE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SIX2JXXT7LAEQUFR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SIX2JXXT","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SIX2JXXT7LAEQUFR6P2SML4EDM","target":"record","payload":{"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"},"canonical_sha256":"922fa4def3fac04850b1f3f5262f841b26e8f451bbccebb9b6fd0ea1ac59a764","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"},"source_kind":"arxiv","source_id":"1310.2378","source_version":4,"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-18T01:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWIrah/tRZzepxTiMplcFAKDvOPJfX/0y98Ral3YG6wUBg62+kckbCmNyKe0FktYlYq4Ah7JEdQAWjyFfcuZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:59:29.388731Z"},"content_sha256":"facf67813d44dcbbb00b8e2be6c307c280d8376ddb2352470d89cd59cae2650a","schema_version":"1.0","event_id":"sha256:facf67813d44dcbbb00b8e2be6c307c280d8376ddb2352470d89cd59cae2650a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SIX2JXXT7LAEQUFR6P2SML4EDM","target":"graph","payload":{"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"},"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-18T01:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hpqyq2UzMJ+fpOnd5riTQ8XPJdjq5It9+h6SZr2ppusp+CESySLvC0A39O9Qfu+4MiCPlY6QninlJdo13BIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:59:29.389386Z"},"content_sha256":"1994d34271d0e72332e002a154c256604eaa03160c01a5f90db6c0d41934092e","schema_version":"1.0","event_id":"sha256:1994d34271d0e72332e002a154c256604eaa03160c01a5f90db6c0d41934092e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/bundle.json","state_url":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/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-26T07:59:29Z","links":{"resolver":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM","bundle":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/bundle.json","state":"https://pith.science/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIX2JXXT7LAEQUFR6P2SML4EDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SIX2JXXT7LAEQUFR6P2SML4EDM","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":"9e8b8b303aedf574a5ab7c188d44273648309cbb16a48b2e8489bacde05d8ab6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T07:27:46Z","title_canon_sha256":"f9e424df5b1b82eff09575d402cbf0900a820693b8bd390fb615312d2677b954"},"schema_version":"1.0","source":{"id":"1310.2378","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2378","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2378v4","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2378","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"SIX2JXXT7LAE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SIX2JXXT7LAEQUFR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SIX2JXXT","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:1994d34271d0e72332e002a154c256604eaa03160c01a5f90db6c0d41934092e","target":"graph","created_at":"2026-05-18T01:12:18Z","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":"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","authors_text":"Daniel Lokshtanov, Dimitrios M. Thilikos, Isolde Adler, Philipp Klaus Krause, Saket Saurabhh, Stavros G. Kolliopoulos","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T07:27:46Z","title":"Irrelevant Vertices for the Planar Disjoint Paths Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2378","kind":"arxiv","version":4},"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:facf67813d44dcbbb00b8e2be6c307c280d8376ddb2352470d89cd59cae2650a","target":"record","created_at":"2026-05-18T01:12:18Z","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":"9e8b8b303aedf574a5ab7c188d44273648309cbb16a48b2e8489bacde05d8ab6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T07:27:46Z","title_canon_sha256":"f9e424df5b1b82eff09575d402cbf0900a820693b8bd390fb615312d2677b954"},"schema_version":"1.0","source":{"id":"1310.2378","kind":"arxiv","version":4}},"canonical_sha256":"922fa4def3fac04850b1f3f5262f841b26e8f451bbccebb9b6fd0ea1ac59a764","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"922fa4def3fac04850b1f3f5262f841b26e8f451bbccebb9b6fd0ea1ac59a764","first_computed_at":"2026-05-18T01:12:18.923378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:18.923378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"96ywEY5hyHtE+/1eKalJlwTzkjckJYTwZwfwEbViE3mlokjNbi+kDz9EYwGnGv1uH+qMJHQDYyHH4fr0UoL6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:18.923750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2378","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:facf67813d44dcbbb00b8e2be6c307c280d8376ddb2352470d89cd59cae2650a","sha256:1994d34271d0e72332e002a154c256604eaa03160c01a5f90db6c0d41934092e"],"state_sha256":"52b09f97521135f6d08d92f60c40715bf4c3c991e0f090e88987c4c251a9a0b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJ+n2rd5svzB6C0IDDK6U09SFHYNS6NvyTKsbgb3wfMLz9y3E//h8mqK3sSX6kvtSqBnDltnF5mP4hh13TOWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:59:29.393271Z","bundle_sha256":"e73a571466da4577dd13659b4e6de5897ddb9b034102f7cd4d39e7f722a39e94"}}