{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M2JIPQFKVBCBYZVBTBUJAKBDA3","short_pith_number":"pith:M2JIPQFK","schema_version":"1.0","canonical_sha256":"669287c0aaa8441c66a1986890282306f2023240337b606febcd2b2a3f9e2153","source":{"kind":"arxiv","id":"2107.01087","version":3},"attestation_state":"computed","paper":{"title":"Point sets and functions inducing tangles of set separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Elbracht, Raphael W. Jacobs, Reinhard Diestel","submitted_at":"2021-07-02T14:02:08Z","abstract_excerpt":"Tangles, as introduced by Robertson and Seymour, were designed as an indirect way of capturing clusters in graphs and matroids. They have since been shown to capture clusters in much broader discrete structures too. But not all tangles are induced by a set of points, let alone a cluster. We characterise those that are: the tangles that are induced by a subset of or function on the set of data points whose connectivity structure they are meant to capture.\n  We offer two such characterisations. The first is in terms of how many small sides of a tangle's separations it takes to cover the ground s"},"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":"2107.01087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-02T14:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"278fb7412de68933984c4556bb86734fa26e0d5b2004723b1ebdab47c53021d6","abstract_canon_sha256":"60bb1516fb52aab2e38ba89df06b1c7ef853127a11bffc42929b66ce0f6f4fc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:44.240023Z","signature_b64":"1sbCjxJtASnKLGVldn0kW3eZIseyp9rjtK44QVUPCVaVj5oJZhVA8dzGRaDs+Y4M54uVK7W7lnmj63QBC2yICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"669287c0aaa8441c66a1986890282306f2023240337b606febcd2b2a3f9e2153","last_reissued_at":"2026-07-05T06:02:44.239639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:44.239639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Point sets and functions inducing tangles of set separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Elbracht, Raphael W. Jacobs, Reinhard Diestel","submitted_at":"2021-07-02T14:02:08Z","abstract_excerpt":"Tangles, as introduced by Robertson and Seymour, were designed as an indirect way of capturing clusters in graphs and matroids. They have since been shown to capture clusters in much broader discrete structures too. But not all tangles are induced by a set of points, let alone a cluster. We characterise those that are: the tangles that are induced by a subset of or function on the set of data points whose connectivity structure they are meant to capture.\n  We offer two such characterisations. The first is in terms of how many small sides of a tangle's separations it takes to cover the ground s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.01087","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/2107.01087/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":"2107.01087","created_at":"2026-07-05T06:02:44.239697+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.01087v3","created_at":"2026-07-05T06:02:44.239697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.01087","created_at":"2026-07-05T06:02:44.239697+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2JIPQFKVBCB","created_at":"2026-07-05T06:02:44.239697+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2JIPQFKVBCBYZVB","created_at":"2026-07-05T06:02:44.239697+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2JIPQFK","created_at":"2026-07-05T06:02:44.239697+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2304.12078","citing_title":"Optimal trees of tangles: refining the essential parts","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3","json":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3.json","graph_json":"https://pith.science/api/pith-number/M2JIPQFKVBCBYZVBTBUJAKBDA3/graph.json","events_json":"https://pith.science/api/pith-number/M2JIPQFKVBCBYZVBTBUJAKBDA3/events.json","paper":"https://pith.science/paper/M2JIPQFK"},"agent_actions":{"view_html":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3","download_json":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3.json","view_paper":"https://pith.science/paper/M2JIPQFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.01087&json=true","fetch_graph":"https://pith.science/api/pith-number/M2JIPQFKVBCBYZVBTBUJAKBDA3/graph.json","fetch_events":"https://pith.science/api/pith-number/M2JIPQFKVBCBYZVBTBUJAKBDA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3/action/storage_attestation","attest_author":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3/action/author_attestation","sign_citation":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3/action/citation_signature","submit_replication":"https://pith.science/pith/M2JIPQFKVBCBYZVBTBUJAKBDA3/action/replication_record"}},"created_at":"2026-07-05T06:02:44.239697+00:00","updated_at":"2026-07-05T06:02:44.239697+00:00"}