{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3VQQ4RTQ4LUSTABDIFRUDSWTOL","short_pith_number":"pith:3VQQ4RTQ","schema_version":"1.0","canonical_sha256":"dd610e4670e2e9298023416341cad372da3d9511ed0359c97a796fac6087fba6","source":{"kind":"arxiv","id":"1703.03756","version":1},"attestation_state":"computed","paper":{"title":"A unified treatment of linked and lean tree-decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joshua Erde","submitted_at":"2017-03-10T16:41:22Z","abstract_excerpt":"There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$ the existence of a linked tree-decompositon of width tw$(G)$. We prove a general theorem on the existence of linked and lean tree-decompositions, providing a unifying proof of many known results in the field, as well as implying some new results. In particular we prove that every matroid $M$ admits a lean tree-decomposition of width tw$(M)$, generalizing th"},"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":"1703.03756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T16:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"cc7b907fa4d0950033f05d1a5718e8f98632984fcc69ff281d3f0ea1f6abc651","abstract_canon_sha256":"48c09b2674a6478d225c68d4043dfc62eab93082cef5e33dce384cec426f670b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:55.857141Z","signature_b64":"gSeXDxE0SPClyl2nsKrm3wUL0gV4c1nCbvFuHns9y3OKgHMeCGba7McX2mQWPSsvEEO+eIo8At8kMkVNAwrFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd610e4670e2e9298023416341cad372da3d9511ed0359c97a796fac6087fba6","last_reissued_at":"2026-05-18T00:48:55.856417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:55.856417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified treatment of linked and lean tree-decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joshua Erde","submitted_at":"2017-03-10T16:41:22Z","abstract_excerpt":"There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$ the existence of a linked tree-decompositon of width tw$(G)$. We prove a general theorem on the existence of linked and lean tree-decompositions, providing a unifying proof of many known results in the field, as well as implying some new results. In particular we prove that every matroid $M$ admits a lean tree-decomposition of width tw$(M)$, generalizing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03756","kind":"arxiv","version":1},"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":"1703.03756","created_at":"2026-05-18T00:48:55.856535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03756v1","created_at":"2026-05-18T00:48:55.856535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03756","created_at":"2026-05-18T00:48:55.856535+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VQQ4RTQ4LUS","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VQQ4RTQ4LUSTABD","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VQQ4RTQ","created_at":"2026-05-18T12:30:58.224056+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/3VQQ4RTQ4LUSTABDIFRUDSWTOL","json":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL.json","graph_json":"https://pith.science/api/pith-number/3VQQ4RTQ4LUSTABDIFRUDSWTOL/graph.json","events_json":"https://pith.science/api/pith-number/3VQQ4RTQ4LUSTABDIFRUDSWTOL/events.json","paper":"https://pith.science/paper/3VQQ4RTQ"},"agent_actions":{"view_html":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL","download_json":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL.json","view_paper":"https://pith.science/paper/3VQQ4RTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03756&json=true","fetch_graph":"https://pith.science/api/pith-number/3VQQ4RTQ4LUSTABDIFRUDSWTOL/graph.json","fetch_events":"https://pith.science/api/pith-number/3VQQ4RTQ4LUSTABDIFRUDSWTOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL/action/storage_attestation","attest_author":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL/action/author_attestation","sign_citation":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL/action/citation_signature","submit_replication":"https://pith.science/pith/3VQQ4RTQ4LUSTABDIFRUDSWTOL/action/replication_record"}},"created_at":"2026-05-18T00:48:55.856535+00:00","updated_at":"2026-05-18T00:48:55.856535+00:00"}