{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2H6HM7QGOGJE2OYZEY7XLMLXHO","short_pith_number":"pith:2H6HM7QG","schema_version":"1.0","canonical_sha256":"d1fc767e0671924d3b19263f75b1773bbb6a96081044f684ad24643593f4308f","source":{"kind":"arxiv","id":"1606.05975","version":2},"attestation_state":"computed","paper":{"title":"Cutwidth: obstructions and algorithmic aspects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Archontia C. Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2016-06-20T05:31:39Z","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"},"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":"1606.05975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-20T05:31:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a1e1d5db827c8267d5c5996f71f4c21b42f1e0ae74c42b621a73f04d7bc4b15a","abstract_canon_sha256":"f8b4c5c44f7dee46065fcb537d797acbbf02bacc31d6a29ece1852fb602ef645"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:42.717433Z","signature_b64":"KPQXov7h86hCM2Rz0UDgexpeDj7rWN7UxCYCftlxF3r/G8d10WSkq4iBzYmeTb42Xbp+xjcVfIPx8fgmgfjNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1fc767e0671924d3b19263f75b1773bbb6a96081044f684ad24643593f4308f","last_reissued_at":"2026-05-18T00:50:42.716712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:42.716712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutwidth: obstructions and algorithmic aspects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Archontia C. Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2016-06-20T05:31:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05975","kind":"arxiv","version":2},"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":"1606.05975","created_at":"2026-05-18T00:50:42.716813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05975v2","created_at":"2026-05-18T00:50:42.716813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05975","created_at":"2026-05-18T00:50:42.716813+00:00"},{"alias_kind":"pith_short_12","alias_value":"2H6HM7QGOGJE","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2H6HM7QGOGJE2OYZ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2H6HM7QG","created_at":"2026-05-18T12:29:55.572404+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/2H6HM7QGOGJE2OYZEY7XLMLXHO","json":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO.json","graph_json":"https://pith.science/api/pith-number/2H6HM7QGOGJE2OYZEY7XLMLXHO/graph.json","events_json":"https://pith.science/api/pith-number/2H6HM7QGOGJE2OYZEY7XLMLXHO/events.json","paper":"https://pith.science/paper/2H6HM7QG"},"agent_actions":{"view_html":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO","download_json":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO.json","view_paper":"https://pith.science/paper/2H6HM7QG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05975&json=true","fetch_graph":"https://pith.science/api/pith-number/2H6HM7QGOGJE2OYZEY7XLMLXHO/graph.json","fetch_events":"https://pith.science/api/pith-number/2H6HM7QGOGJE2OYZEY7XLMLXHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/action/storage_attestation","attest_author":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/action/author_attestation","sign_citation":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/action/citation_signature","submit_replication":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/action/replication_record"}},"created_at":"2026-05-18T00:50:42.716813+00:00","updated_at":"2026-05-18T00:50:42.716813+00:00"}