{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2H6HM7QGOGJE2OYZEY7XLMLXHO","short_pith_number":"pith:2H6HM7QG","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"},"canonical_sha256":"d1fc767e0671924d3b19263f75b1773bbb6a96081044f684ad24643593f4308f","source":{"kind":"arxiv","id":"1606.05975","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2H6HM7QGOGJE2OYZEY7XLMLXHO","target":"record","payload":{"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"},"canonical_sha256":"d1fc767e0671924d3b19263f75b1773bbb6a96081044f684ad24643593f4308f","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"},"source_kind":"arxiv","source_id":"1606.05975","source_version":2,"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-18T00:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwNlUbvM7FRQW1GQuwhxaKbqnmhVrBpJzqzIiJ1AytRmwUMdZ9mUAJIut9hiAV2o+i0hnybVQvTu3Ut1otXPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:30.413197Z"},"content_sha256":"6a93d0265b4cdb58c3e92cab644c45e826bcee695332d7ee2d7c0d4270566c76","schema_version":"1.0","event_id":"sha256:6a93d0265b4cdb58c3e92cab644c45e826bcee695332d7ee2d7c0d4270566c76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2H6HM7QGOGJE2OYZEY7XLMLXHO","target":"graph","payload":{"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"},"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-18T00:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCLvf+A4IoOwIOQwLs1wlIRkGkm/MnoPlqukb/JMewgtvOi6Z9rc24WBZ+7GxAgKOAMUTzL3k9/NSehDZcJzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:30.413616Z"},"content_sha256":"0c2060aaa0e1b750d9fa14af1be11fd02fa808f869671c2a63904a2b763c5031","schema_version":"1.0","event_id":"sha256:0c2060aaa0e1b750d9fa14af1be11fd02fa808f869671c2a63904a2b763c5031"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/bundle.json","state_url":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/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-25T17:58:30Z","links":{"resolver":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO","bundle":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/bundle.json","state":"https://pith.science/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2H6HM7QGOGJE2OYZEY7XLMLXHO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDCoekpvdrIXglVmPtVK6cZsO8JmOjI7QrCVXHqdBH82VXempWymsXiydQ4m25hS071sm3CHh5ZcF9qbWTviBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:58:30.416355Z","bundle_sha256":"46f66674667c75024831583e9e3872b2f32bfdfc033fddc2a5316cd761ddc0d0"}}