{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GMI76EVHCZP3JGUMWLFIHEOJ3N","short_pith_number":"pith:GMI76EVH","schema_version":"1.0","canonical_sha256":"3311ff12a7165fb49a8cb2ca8391c9db727661a519b49b3226abcf6efc8ce411","source":{"kind":"arxiv","id":"2103.14667","version":2},"attestation_state":"computed","paper":{"title":"On objects dual to tree-cut decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Karolina Okrasa, {\\L}ukasz Bo\\.zyk, Micha{\\l} Pilipczuk, Oscar Defrain","submitted_at":"2021-03-26T18:14:59Z","abstract_excerpt":"Tree-cut width is a graph parameter introduced by Wollan that is an analogue of treewidth for the immersion order on graphs in the following sense: the tree-cut width of a graph is functionally equivalent to the largest size of a wall that can be found in it as an immersion. In this work we propose a variant of the definition of tree-cut width that is functionally equivalent to the original one, but for which we can state and prove a tight duality theorem relating it to naturally defined dual objects: appropriately defined brambles and tangles. Using this result we also propose a game characte"},"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":"2103.14667","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-26T18:14:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"28c6e720ce780a93ae288a372a72bf53bdb7249e24617cd187640587e9bc9abb","abstract_canon_sha256":"413db63a4ad73795d72230b9dbb5882ee7c8caf4c9c922fd9a37080358a63a41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:38.439002Z","signature_b64":"0iq0hjMKALh5wsYoymS+ohs5AWEMwZBgzZUjWb6s3SU7c8m87w21sjd4n077BPp70kkNyxPyCQ7aZ3NhsyDwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3311ff12a7165fb49a8cb2ca8391c9db727661a519b49b3226abcf6efc8ce411","last_reissued_at":"2026-07-05T04:47:38.438531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:38.438531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On objects dual to tree-cut decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Karolina Okrasa, {\\L}ukasz Bo\\.zyk, Micha{\\l} Pilipczuk, Oscar Defrain","submitted_at":"2021-03-26T18:14:59Z","abstract_excerpt":"Tree-cut width is a graph parameter introduced by Wollan that is an analogue of treewidth for the immersion order on graphs in the following sense: the tree-cut width of a graph is functionally equivalent to the largest size of a wall that can be found in it as an immersion. In this work we propose a variant of the definition of tree-cut width that is functionally equivalent to the original one, but for which we can state and prove a tight duality theorem relating it to naturally defined dual objects: appropriately defined brambles and tangles. Using this result we also propose a game characte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14667","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.14667/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.14667","created_at":"2026-07-05T04:47:38.438587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.14667v2","created_at":"2026-07-05T04:47:38.438587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14667","created_at":"2026-07-05T04:47:38.438587+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMI76EVHCZP3","created_at":"2026-07-05T04:47:38.438587+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMI76EVHCZP3JGUM","created_at":"2026-07-05T04:47:38.438587+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMI76EVH","created_at":"2026-07-05T04:47:38.438587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.08847","citing_title":"The Structure of Circle Graph States","ref_index":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N","json":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N.json","graph_json":"https://pith.science/api/pith-number/GMI76EVHCZP3JGUMWLFIHEOJ3N/graph.json","events_json":"https://pith.science/api/pith-number/GMI76EVHCZP3JGUMWLFIHEOJ3N/events.json","paper":"https://pith.science/paper/GMI76EVH"},"agent_actions":{"view_html":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N","download_json":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N.json","view_paper":"https://pith.science/paper/GMI76EVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.14667&json=true","fetch_graph":"https://pith.science/api/pith-number/GMI76EVHCZP3JGUMWLFIHEOJ3N/graph.json","fetch_events":"https://pith.science/api/pith-number/GMI76EVHCZP3JGUMWLFIHEOJ3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N/action/storage_attestation","attest_author":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N/action/author_attestation","sign_citation":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N/action/citation_signature","submit_replication":"https://pith.science/pith/GMI76EVHCZP3JGUMWLFIHEOJ3N/action/replication_record"}},"created_at":"2026-07-05T04:47:38.438587+00:00","updated_at":"2026-07-05T04:47:38.438587+00:00"}