{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N6NF4KQNAK7GDF2MUMKBYJ5YBA","short_pith_number":"pith:N6NF4KQN","schema_version":"1.0","canonical_sha256":"6f9a5e2a0d02be61974ca3141c27b8080c89a1e81a730e8b8718cb5e04839985","source":{"kind":"arxiv","id":"1512.02499","version":2},"attestation_state":"computed","paper":{"title":"Refining a Tree-Decomposition which Distinguishes Tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joshua Erde","submitted_at":"2015-12-08T15:09:53Z","abstract_excerpt":"Roberston and Seymour introduced tangles of order $k$ as objects representing highly connected parts of a graph and showed that every graph admits a tree-decomposition of adhesion $<k$ in which each tangle of order $k$ is contained in a different part. Recently, Carmesin, Diestel, Hamann and Hundertmark showed that such a tree-decomposition can be constructed in a canonical way, which makes it invariant under automorphisms of the graph. These canonical tree-decompositions necessarily have parts which contain no tangle of order $k$. We call these parts inessential. Diestel asked what could be 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":"1512.02499","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-08T15:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"6aef6fb1f5bc32dc1fecfda03deb2f571c055be052e85ecfbff5e725279dc4a0","abstract_canon_sha256":"41ac416d4c2b1f41b3203bd0e6a76ebbb1764110f1f46be034e7217b6bcbca59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:36.850361Z","signature_b64":"xAtCziV4BMVn3hLoz7mXqGnUqLdt48jRruXzxvYTUBfTVKuy2smQ9Fa16C+IHn85MBVozoaTddBIKTCkVL3WDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9a5e2a0d02be61974ca3141c27b8080c89a1e81a730e8b8718cb5e04839985","last_reissued_at":"2026-05-18T00:49:36.849618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:36.849618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refining a Tree-Decomposition which Distinguishes Tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joshua Erde","submitted_at":"2015-12-08T15:09:53Z","abstract_excerpt":"Roberston and Seymour introduced tangles of order $k$ as objects representing highly connected parts of a graph and showed that every graph admits a tree-decomposition of adhesion $<k$ in which each tangle of order $k$ is contained in a different part. Recently, Carmesin, Diestel, Hamann and Hundertmark showed that such a tree-decomposition can be constructed in a canonical way, which makes it invariant under automorphisms of the graph. These canonical tree-decompositions necessarily have parts which contain no tangle of order $k$. We call these parts inessential. Diestel asked what could be s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02499","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.02499","created_at":"2026-05-18T00:49:36.849730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02499v2","created_at":"2026-05-18T00:49:36.849730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02499","created_at":"2026-05-18T00:49:36.849730+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6NF4KQNAK7G","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6NF4KQNAK7GDF2M","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6NF4KQN","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA","json":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA.json","graph_json":"https://pith.science/api/pith-number/N6NF4KQNAK7GDF2MUMKBYJ5YBA/graph.json","events_json":"https://pith.science/api/pith-number/N6NF4KQNAK7GDF2MUMKBYJ5YBA/events.json","paper":"https://pith.science/paper/N6NF4KQN"},"agent_actions":{"view_html":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA","download_json":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA.json","view_paper":"https://pith.science/paper/N6NF4KQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02499&json=true","fetch_graph":"https://pith.science/api/pith-number/N6NF4KQNAK7GDF2MUMKBYJ5YBA/graph.json","fetch_events":"https://pith.science/api/pith-number/N6NF4KQNAK7GDF2MUMKBYJ5YBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA/action/storage_attestation","attest_author":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA/action/author_attestation","sign_citation":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA/action/citation_signature","submit_replication":"https://pith.science/pith/N6NF4KQNAK7GDF2MUMKBYJ5YBA/action/replication_record"}},"created_at":"2026-05-18T00:49:36.849730+00:00","updated_at":"2026-05-18T00:49:36.849730+00:00"}