{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YHSJNHX2T2PRH5YKRS3L7HJW6T","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":"106e3551df7832f173ce9a247dc9f746fe8e17d037da1246e1d38d7d5cd56125","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-15T05:34:53Z","title_canon_sha256":"c10ad83fd09e86f6842c490a9e36200222dc430216fb233d59a53cfe900ca452"},"schema_version":"1.0","source":{"id":"2309.08169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.08169","created_at":"2026-07-05T06:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"2309.08169v1","created_at":"2026-07-05T06:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08169","created_at":"2026-07-05T06:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"YHSJNHX2T2PR","created_at":"2026-07-05T06:51:02Z"},{"alias_kind":"pith_short_16","alias_value":"YHSJNHX2T2PRH5YK","created_at":"2026-07-05T06:51:02Z"},{"alias_kind":"pith_short_8","alias_value":"YHSJNHX2","created_at":"2026-07-05T06:51:02Z"}],"graph_snapshots":[{"event_id":"sha256:281d48dfb9d1a283b96fb99a1b04f0a5f6fb31419e968931110ff24d709adc3a","target":"graph","created_at":"2026-07-05T06:51:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.08169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $A$ and $B$ be sets of vertices in a graph $G$. Menger's theorem states that for every positive integer $k$, either there exists a collection of $k$ vertex-disjoint paths between $A$ and $B$, or $A$ can be separated from $B$ by a set of at most $k-1$ vertices. Let $\\Delta$ be the maximum degree of $G$. We show that there exists a function $f(\\Delta) = (\\Delta+1)^{\\Delta^2+1}$, so that for every positive integer $k$, either there exists a collection of $k$ vertex-disjoint and pairwise anticomplete paths between $A$ and $B$, or $A$ can be separated from $B$ by a set of at most $k \\cdot f(\\De","authors_text":"Daniel Lokshtanov, Peter Gartland, Tuukka Korhonen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-15T05:34:53Z","title":"On Induced Versions of Menger's Theorem on Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08169","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:c53c9157cb8e05d7b0ded0c8442287236b1866d20b2e21ecff61a4ace3f1e851","target":"record","created_at":"2026-07-05T06:51:02Z","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":"106e3551df7832f173ce9a247dc9f746fe8e17d037da1246e1d38d7d5cd56125","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-15T05:34:53Z","title_canon_sha256":"c10ad83fd09e86f6842c490a9e36200222dc430216fb233d59a53cfe900ca452"},"schema_version":"1.0","source":{"id":"2309.08169","kind":"arxiv","version":1}},"canonical_sha256":"c1e4969efa9e9f13f70a8cb6bf9d36f4f46ff14c956dbd49da0593078851037c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e4969efa9e9f13f70a8cb6bf9d36f4f46ff14c956dbd49da0593078851037c","first_computed_at":"2026-07-05T06:51:02.877688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:02.877688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"450Zi3ZMz4bgsy45u24Q1cvBA+1zAvuxmgf1b3ydNYtF9hHPNuCho+4NcXyoWlCzvRiwOGMf0WQrXGFpMEDYAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:02.878088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.08169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c53c9157cb8e05d7b0ded0c8442287236b1866d20b2e21ecff61a4ace3f1e851","sha256:281d48dfb9d1a283b96fb99a1b04f0a5f6fb31419e968931110ff24d709adc3a"],"state_sha256":"adcc2035496745a444c6277c78d498f26dbabc1030de7e82d2f5cc609576acaa"}