{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GOCCPBYQHQP3VTQHHOM7Q6NT5I","short_pith_number":"pith:GOCCPBYQ","schema_version":"1.0","canonical_sha256":"33842787103c1fbace073b99f879b3ea29fb84654c57ad277879a495c897c734","source":{"kind":"arxiv","id":"2607.07111","version":1},"attestation_state":"computed","paper":{"title":"A coarse block-cut tree theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Evangelos Protopapas, Jadwiga Czy\\.zewska, J\\'ulia Balig\\'acs, Micha{\\l} Pilipczuk, V\\'aclav Bla\\v{z}ej","submitted_at":"2026-07-08T07:51:50Z","abstract_excerpt":"We prove a coarse analogue of the classic fact that every graph can be decomposed along its cut-vertices into $2$-connected components. Precisely, we prove that for every graph $G$ and a positive integer $d$, $G$ admits a tree decomposition whose adhesion sets have weak diameter at most $3d+2$ so that no two vertices $u,v$ lying in the same bag can be separated by a set of weak diameter at most $d$ whose distance from $u$ and $v$ is more than $d$. By the Coarse Menger's Theorem for two paths, this condition admits also a dual formulation, phrased in terms of the existence of two paths that are"},"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":"2607.07111","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T07:51:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a845f8923269a3d85fb7d7c7baccbb48cc0216a0744c1b384c7a31e6e3cdf9ff","abstract_canon_sha256":"4efe262bd422882b6aa0e1f333548fc4f7798dc0432449d1977a019a099cf454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:14.771048Z","signature_b64":"1oROjSquRJNxV78BfBeC/MHA4PClYTLOjxGPHuzQTrxGR6rSRvROSyvIVZgGcClXwZzrC+knVkhXd/J0aHVxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33842787103c1fbace073b99f879b3ea29fb84654c57ad277879a495c897c734","last_reissued_at":"2026-07-09T01:20:14.770634Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:14.770634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A coarse block-cut tree theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Evangelos Protopapas, Jadwiga Czy\\.zewska, J\\'ulia Balig\\'acs, Micha{\\l} Pilipczuk, V\\'aclav Bla\\v{z}ej","submitted_at":"2026-07-08T07:51:50Z","abstract_excerpt":"We prove a coarse analogue of the classic fact that every graph can be decomposed along its cut-vertices into $2$-connected components. Precisely, we prove that for every graph $G$ and a positive integer $d$, $G$ admits a tree decomposition whose adhesion sets have weak diameter at most $3d+2$ so that no two vertices $u,v$ lying in the same bag can be separated by a set of weak diameter at most $d$ whose distance from $u$ and $v$ is more than $d$. By the Coarse Menger's Theorem for two paths, this condition admits also a dual formulation, phrased in terms of the existence of two paths that are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07111","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07111/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.07111","created_at":"2026-07-09T01:20:14.770695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07111v1","created_at":"2026-07-09T01:20:14.770695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07111","created_at":"2026-07-09T01:20:14.770695+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOCCPBYQHQP3","created_at":"2026-07-09T01:20:14.770695+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOCCPBYQHQP3VTQH","created_at":"2026-07-09T01:20:14.770695+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOCCPBYQ","created_at":"2026-07-09T01:20:14.770695+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/GOCCPBYQHQP3VTQHHOM7Q6NT5I","json":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I.json","graph_json":"https://pith.science/api/pith-number/GOCCPBYQHQP3VTQHHOM7Q6NT5I/graph.json","events_json":"https://pith.science/api/pith-number/GOCCPBYQHQP3VTQHHOM7Q6NT5I/events.json","paper":"https://pith.science/paper/GOCCPBYQ"},"agent_actions":{"view_html":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I","download_json":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I.json","view_paper":"https://pith.science/paper/GOCCPBYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07111&json=true","fetch_graph":"https://pith.science/api/pith-number/GOCCPBYQHQP3VTQHHOM7Q6NT5I/graph.json","fetch_events":"https://pith.science/api/pith-number/GOCCPBYQHQP3VTQHHOM7Q6NT5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/action/storage_attestation","attest_author":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/action/author_attestation","sign_citation":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/action/citation_signature","submit_replication":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/action/replication_record"}},"created_at":"2026-07-09T01:20:14.770695+00:00","updated_at":"2026-07-09T01:20:14.770695+00:00"}