{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2H6HM7QGOGJE2OYZEY7XLMLXHO","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":"f8b4c5c44f7dee46065fcb537d797acbbf02bacc31d6a29ece1852fb602ef645","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-20T05:31:39Z","title_canon_sha256":"a1e1d5db827c8267d5c5996f71f4c21b42f1e0ae74c42b621a73f04d7bc4b15a"},"schema_version":"1.0","source":{"id":"1606.05975","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05975","created_at":"2026-05-18T00:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05975v2","created_at":"2026-05-18T00:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05975","created_at":"2026-05-18T00:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"2H6HM7QGOGJE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2H6HM7QGOGJE2OYZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2H6HM7QG","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:0c2060aaa0e1b750d9fa14af1be11fd02fa808f869671c2a63904a2b763c5031","target":"graph","created_at":"2026-05-18T00:50:42Z","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":"Cutwidth is one of the classic layout parameters for graphs. It measures how well one can order the vertices of a graph in a linear manner, so that the maximum number of edges between any prefix and its complement suffix is minimized. As graphs of cutwidth at most $k$ are closed under taking immersions, the results of Robertson and Seymour imply that there is a finite list of minimal immersion obstructions for admitting a cut layout of width at most $k$. We prove that every minimal immersion obstruction for cutwidth at most $k$ has size at most $2^{O(k^3\\log k)}$.\n  As an interesting algorithm","authors_text":"Archontia C. Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna, Micha{\\l} Pilipczuk","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-20T05:31:39Z","title":"Cutwidth: obstructions and algorithmic aspects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05975","kind":"arxiv","version":2},"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:6a93d0265b4cdb58c3e92cab644c45e826bcee695332d7ee2d7c0d4270566c76","target":"record","created_at":"2026-05-18T00:50:42Z","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":"f8b4c5c44f7dee46065fcb537d797acbbf02bacc31d6a29ece1852fb602ef645","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-20T05:31:39Z","title_canon_sha256":"a1e1d5db827c8267d5c5996f71f4c21b42f1e0ae74c42b621a73f04d7bc4b15a"},"schema_version":"1.0","source":{"id":"1606.05975","kind":"arxiv","version":2}},"canonical_sha256":"d1fc767e0671924d3b19263f75b1773bbb6a96081044f684ad24643593f4308f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1fc767e0671924d3b19263f75b1773bbb6a96081044f684ad24643593f4308f","first_computed_at":"2026-05-18T00:50:42.716712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:42.716712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KPQXov7h86hCM2Rz0UDgexpeDj7rWN7UxCYCftlxF3r/G8d10WSkq4iBzYmeTb42Xbp+xjcVfIPx8fgmgfjNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:42.717433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05975","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a93d0265b4cdb58c3e92cab644c45e826bcee695332d7ee2d7c0d4270566c76","sha256:0c2060aaa0e1b750d9fa14af1be11fd02fa808f869671c2a63904a2b763c5031"],"state_sha256":"c9dff320be128fe3c151a1f487fb83be901e6adbf7d0967c1ad15946bd07133a"}