{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OPTZHDSSC6GNNVZANEJYDJXGCT","short_pith_number":"pith:OPTZHDSS","schema_version":"1.0","canonical_sha256":"73e7938e52178cd6d720691381a6e614ff1c3df92843d84212b08bdd7173ddbd","source":{"kind":"arxiv","id":"1701.02651","version":3},"attestation_state":"computed","paper":{"title":"Tangle-tree duality: in graphs, matroids and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Reinhard Diestel, Sang-il Oum","submitted_at":"2017-01-10T15:54:40Z","abstract_excerpt":"We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data sets.\n  Our applications to graphs include new, tangle-type, duality theorems for tree-width, path-width, and tree-decompositions of small adhesion. Conversely, we show that carving width is dual to edge-tangles. For matroids we obtain a duality theorem for tree-width.\n  Our results can be used to derive short proofs of all the classical duality theorems fo"},"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":"1701.02651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-10T15:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"0f73e20965eae550bfce6f5bd11852467e137d21f400beb10df40e035967543d","abstract_canon_sha256":"7c7e80e3572aa28bead54bbaa9bd98774c438a1ba60b14c8f76eb37938ff1819"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:08.858114Z","signature_b64":"BURakMcqhWBrjXAiZmwjxImTBFi/BjG0LWKX2TtGY1IA0LVv4UWwXMIYEOEyMzycoadLEzVy9+rqJ1+C72SlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e7938e52178cd6d720691381a6e614ff1c3df92843d84212b08bdd7173ddbd","last_reissued_at":"2026-07-05T00:35:08.857673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:08.857673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tangle-tree duality: in graphs, matroids and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Reinhard Diestel, Sang-il Oum","submitted_at":"2017-01-10T15:54:40Z","abstract_excerpt":"We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data sets.\n  Our applications to graphs include new, tangle-type, duality theorems for tree-width, path-width, and tree-decompositions of small adhesion. Conversely, we show that carving width is dual to edge-tangles. For matroids we obtain a duality theorem for tree-width.\n  Our results can be used to derive short proofs of all the classical duality theorems fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02651","kind":"arxiv","version":3},"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/1701.02651/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":"1701.02651","created_at":"2026-07-05T00:35:08.857732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02651v3","created_at":"2026-07-05T00:35:08.857732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02651","created_at":"2026-07-05T00:35:08.857732+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPTZHDSSC6GN","created_at":"2026-07-05T00:35:08.857732+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPTZHDSSC6GNNVZA","created_at":"2026-07-05T00:35:08.857732+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPTZHDSS","created_at":"2026-07-05T00:35:08.857732+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.07341","citing_title":"Tangles in the social sciences","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2304.12078","citing_title":"Optimal trees of tangles: refining the essential parts","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT","json":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT.json","graph_json":"https://pith.science/api/pith-number/OPTZHDSSC6GNNVZANEJYDJXGCT/graph.json","events_json":"https://pith.science/api/pith-number/OPTZHDSSC6GNNVZANEJYDJXGCT/events.json","paper":"https://pith.science/paper/OPTZHDSS"},"agent_actions":{"view_html":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT","download_json":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT.json","view_paper":"https://pith.science/paper/OPTZHDSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02651&json=true","fetch_graph":"https://pith.science/api/pith-number/OPTZHDSSC6GNNVZANEJYDJXGCT/graph.json","fetch_events":"https://pith.science/api/pith-number/OPTZHDSSC6GNNVZANEJYDJXGCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT/action/storage_attestation","attest_author":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT/action/author_attestation","sign_citation":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT/action/citation_signature","submit_replication":"https://pith.science/pith/OPTZHDSSC6GNNVZANEJYDJXGCT/action/replication_record"}},"created_at":"2026-07-05T00:35:08.857732+00:00","updated_at":"2026-07-05T00:35:08.857732+00:00"}