{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6QG72NF5H5N4T6PM4EHRRO7WKJ","short_pith_number":"pith:6QG72NF5","schema_version":"1.0","canonical_sha256":"f40dfd34bd3f5bc9f9ece10f18bbf6526c73d647677fe33e8a2637f4db4a2685","source":{"kind":"arxiv","id":"1511.02734","version":2},"attestation_state":"computed","paper":{"title":"A short proof that every finite graph has a tree-decomposition displaying its tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin","submitted_at":"2015-11-09T16:10:00Z","abstract_excerpt":"We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles.\n  This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to matroids is due to Geelen, Gerards and Whittle."},"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":"1511.02734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-09T16:10:00Z","cross_cats_sorted":[],"title_canon_sha256":"47187376cafb731227b9cb8598d0d323b0396738c76663bc511fb72e33c1a899","abstract_canon_sha256":"eb47cb0f4ca9f98a00e4aeb7f822a83b04bf255c24893474478c49b33bcf3025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:16.347704Z","signature_b64":"RjPVLa06deoBCoM/luXq0A+qQdLrs9xtZ7sl6P3RvT3+LUuzCfFnI44of+4jJJ4EBsQjysxCJFKwNykrmEylCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f40dfd34bd3f5bc9f9ece10f18bbf6526c73d647677fe33e8a2637f4db4a2685","last_reissued_at":"2026-05-18T01:13:16.347283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:16.347283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short proof that every finite graph has a tree-decomposition displaying its tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin","submitted_at":"2015-11-09T16:10:00Z","abstract_excerpt":"We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles.\n  This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to matroids is due to Geelen, Gerards and Whittle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02734","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":"1511.02734","created_at":"2026-05-18T01:13:16.347352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02734v2","created_at":"2026-05-18T01:13:16.347352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02734","created_at":"2026-05-18T01:13:16.347352+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QG72NF5H5N4","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QG72NF5H5N4T6PM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QG72NF5","created_at":"2026-05-18T12:29:07.941421+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/6QG72NF5H5N4T6PM4EHRRO7WKJ","json":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ.json","graph_json":"https://pith.science/api/pith-number/6QG72NF5H5N4T6PM4EHRRO7WKJ/graph.json","events_json":"https://pith.science/api/pith-number/6QG72NF5H5N4T6PM4EHRRO7WKJ/events.json","paper":"https://pith.science/paper/6QG72NF5"},"agent_actions":{"view_html":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ","download_json":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ.json","view_paper":"https://pith.science/paper/6QG72NF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02734&json=true","fetch_graph":"https://pith.science/api/pith-number/6QG72NF5H5N4T6PM4EHRRO7WKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6QG72NF5H5N4T6PM4EHRRO7WKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ/action/storage_attestation","attest_author":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ/action/author_attestation","sign_citation":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ/action/citation_signature","submit_replication":"https://pith.science/pith/6QG72NF5H5N4T6PM4EHRRO7WKJ/action/replication_record"}},"created_at":"2026-05-18T01:13:16.347352+00:00","updated_at":"2026-05-18T01:13:16.347352+00:00"}