{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3K7DS6JGQVD4U6NUG76MDQ47VZ","short_pith_number":"pith:3K7DS6JG","schema_version":"1.0","canonical_sha256":"dabe3979268547ca79b437fcc1c39fae595a7292dad769fbb08e1f800a4f0a09","source":{"kind":"arxiv","id":"1110.6207","version":5},"attestation_state":"computed","paper":{"title":"Profiles of separations: in graphs, matroids and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fabian Hundertmark, Reinhard Diestel, Sahar Lemanczyk","submitted_at":"2011-10-27T22:24:16Z","abstract_excerpt":"We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem for more general combinatorial structures, which has further applications.\n  These include a new approach to cluster analysis and image segmentation. As another illustration for the abstract theorem, we show that applying it to edge-tangles yields the Gomory-Hu theorem."},"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":"1110.6207","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-27T22:24:16Z","cross_cats_sorted":[],"title_canon_sha256":"f3c9a22dfb8fbe3da760c13270c52f7c44df6d247efbaface0473a93eb7aa308","abstract_canon_sha256":"1946714f9d668dbcc5c96a520abd7ea4fd389e4a2ea457ad43590191bb481731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.104307Z","signature_b64":"I/DsSucfUvjjQoNRij+2icWaJwt+6AMM2vbNfKp+LIXAwpSbIDJv98lAlvZhtSYD+V820SXDsV+OEosZ+t7QBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dabe3979268547ca79b437fcc1c39fae595a7292dad769fbb08e1f800a4f0a09","last_reissued_at":"2026-05-18T00:46:17.103710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.103710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Profiles of separations: in graphs, matroids and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fabian Hundertmark, Reinhard Diestel, Sahar Lemanczyk","submitted_at":"2011-10-27T22:24:16Z","abstract_excerpt":"We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem for more general combinatorial structures, which has further applications.\n  These include a new approach to cluster analysis and image segmentation. As another illustration for the abstract theorem, we show that applying it to edge-tangles yields the Gomory-Hu theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6207","kind":"arxiv","version":5},"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":"1110.6207","created_at":"2026-05-18T00:46:17.103827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.6207v5","created_at":"2026-05-18T00:46:17.103827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6207","created_at":"2026-05-18T00:46:17.103827+00:00"},{"alias_kind":"pith_short_12","alias_value":"3K7DS6JGQVD4","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3K7DS6JGQVD4U6NU","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3K7DS6JG","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2304.12078","citing_title":"Optimal trees of tangles: refining the essential parts","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ","json":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ.json","graph_json":"https://pith.science/api/pith-number/3K7DS6JGQVD4U6NUG76MDQ47VZ/graph.json","events_json":"https://pith.science/api/pith-number/3K7DS6JGQVD4U6NUG76MDQ47VZ/events.json","paper":"https://pith.science/paper/3K7DS6JG"},"agent_actions":{"view_html":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ","download_json":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ.json","view_paper":"https://pith.science/paper/3K7DS6JG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.6207&json=true","fetch_graph":"https://pith.science/api/pith-number/3K7DS6JGQVD4U6NUG76MDQ47VZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3K7DS6JGQVD4U6NUG76MDQ47VZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ/action/storage_attestation","attest_author":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ/action/author_attestation","sign_citation":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ/action/citation_signature","submit_replication":"https://pith.science/pith/3K7DS6JGQVD4U6NUG76MDQ47VZ/action/replication_record"}},"created_at":"2026-05-18T00:46:17.103827+00:00","updated_at":"2026-05-18T00:46:17.103827+00:00"}