{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R44VFROVAU44LYSISXZIWYE4KE","short_pith_number":"pith:R44VFROV","schema_version":"1.0","canonical_sha256":"8f3952c5d50539c5e24895f28b609c512b50a983219d6f839e1e29363df5fff6","source":{"kind":"arxiv","id":"1506.02904","version":1},"attestation_state":"computed","paper":{"title":"Canonical tree-decompositions of a graph that display its $k$-blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin, Pascal Gollin","submitted_at":"2015-06-09T13:38:40Z","abstract_excerpt":"A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by removing less than $k$ vertices. It is separable if there exists a tree-decomposition of adhesion less than $k$ of $G$ in which this $k$-block appears as a part.\n  Carmesin, Diestel, Hamann, Hundertmark and Stein proved that every finite graph has a canonical tree-decomposition of adhesion less than $k$ that distinguishes all its $k$-blocks and tangles of order $k$. We construct such tree-decompositions with the additional property that every separable $k$-block is equal to the uniqu"},"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":"1506.02904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T13:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"58546100665cbe50a21b2b3f1c5f9d72447e11610dd6def2141b5802a256dd1d","abstract_canon_sha256":"d31fabc4443cd3859f135bc09687eb0b4144649dfd729fc0bff090350f67ff41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.574934Z","signature_b64":"VUqnj7uexF9+CRmE9su6zgc2jHyh4XOSmag5NQdU4fGHuxoQGHInhT2RGXawPXwONPxiusOAz93ef8t5fVY7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f3952c5d50539c5e24895f28b609c512b50a983219d6f839e1e29363df5fff6","last_reissued_at":"2026-05-18T01:55:40.574181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.574181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Canonical tree-decompositions of a graph that display its $k$-blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin, Pascal Gollin","submitted_at":"2015-06-09T13:38:40Z","abstract_excerpt":"A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by removing less than $k$ vertices. It is separable if there exists a tree-decomposition of adhesion less than $k$ of $G$ in which this $k$-block appears as a part.\n  Carmesin, Diestel, Hamann, Hundertmark and Stein proved that every finite graph has a canonical tree-decomposition of adhesion less than $k$ that distinguishes all its $k$-blocks and tangles of order $k$. We construct such tree-decompositions with the additional property that every separable $k$-block is equal to the uniqu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02904","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":"1506.02904","created_at":"2026-05-18T01:55:40.574299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02904v1","created_at":"2026-05-18T01:55:40.574299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02904","created_at":"2026-05-18T01:55:40.574299+00:00"},{"alias_kind":"pith_short_12","alias_value":"R44VFROVAU44","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R44VFROVAU44LYSI","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R44VFROV","created_at":"2026-05-18T12:29:39.896362+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":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE","json":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE.json","graph_json":"https://pith.science/api/pith-number/R44VFROVAU44LYSISXZIWYE4KE/graph.json","events_json":"https://pith.science/api/pith-number/R44VFROVAU44LYSISXZIWYE4KE/events.json","paper":"https://pith.science/paper/R44VFROV"},"agent_actions":{"view_html":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE","download_json":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE.json","view_paper":"https://pith.science/paper/R44VFROV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02904&json=true","fetch_graph":"https://pith.science/api/pith-number/R44VFROVAU44LYSISXZIWYE4KE/graph.json","fetch_events":"https://pith.science/api/pith-number/R44VFROVAU44LYSISXZIWYE4KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/action/storage_attestation","attest_author":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/action/author_attestation","sign_citation":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/action/citation_signature","submit_replication":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/action/replication_record"}},"created_at":"2026-05-18T01:55:40.574299+00:00","updated_at":"2026-05-18T01:55:40.574299+00:00"}