{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GOCCPBYQHQP3VTQHHOM7Q6NT5I","short_pith_number":"pith:GOCCPBYQ","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"},"canonical_sha256":"33842787103c1fbace073b99f879b3ea29fb84654c57ad277879a495c897c734","source":{"kind":"arxiv","id":"2607.07111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07111","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07111v1","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07111","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"pith_short_12","alias_value":"GOCCPBYQHQP3","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"pith_short_16","alias_value":"GOCCPBYQHQP3VTQH","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"pith_short_8","alias_value":"GOCCPBYQ","created_at":"2026-07-09T01:20:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GOCCPBYQHQP3VTQHHOM7Q6NT5I","target":"record","payload":{"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"},"canonical_sha256":"33842787103c1fbace073b99f879b3ea29fb84654c57ad277879a495c897c734","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"},"source_kind":"arxiv","source_id":"2607.07111","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T01:20:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aezYaB0QAbypHi+6iMRALjNE4ey9p4mboTIoaBT4OWXKMHivc4wmyhG25v1goEy3J2ypXXkGuhtRbwZKg0jSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:00:21.965659Z"},"content_sha256":"3d8d998c26e83590d1df015fc4280738055371bc195684aa4799d5a1c30f4f74","schema_version":"1.0","event_id":"sha256:3d8d998c26e83590d1df015fc4280738055371bc195684aa4799d5a1c30f4f74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GOCCPBYQHQP3VTQHHOM7Q6NT5I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T01:20:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hadw+xMMNjRdwkDD4hXxWfV3ygnNtd67G+Aq7QRIEZBGDkYhwCQU75sfX3sTfcmpQ+uE5411Eb2QgajAnQoQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:00:21.966380Z"},"content_sha256":"2cd7131232c18cbd06fb1166223ad8ca5015e0d6a47a4831f3b2e2c41455df2f","schema_version":"1.0","event_id":"sha256:2cd7131232c18cbd06fb1166223ad8ca5015e0d6a47a4831f3b2e2c41455df2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/bundle.json","state_url":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T12:00:21Z","links":{"resolver":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I","bundle":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/bundle.json","state":"https://pith.science/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOCCPBYQHQP3VTQHHOM7Q6NT5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GOCCPBYQHQP3VTQHHOM7Q6NT5I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4efe262bd422882b6aa0e1f333548fc4f7798dc0432449d1977a019a099cf454","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T07:51:50Z","title_canon_sha256":"a845f8923269a3d85fb7d7c7baccbb48cc0216a0744c1b384c7a31e6e3cdf9ff"},"schema_version":"1.0","source":{"id":"2607.07111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07111","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07111v1","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07111","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"pith_short_12","alias_value":"GOCCPBYQHQP3","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"pith_short_16","alias_value":"GOCCPBYQHQP3VTQH","created_at":"2026-07-09T01:20:14Z"},{"alias_kind":"pith_short_8","alias_value":"GOCCPBYQ","created_at":"2026-07-09T01:20:14Z"}],"graph_snapshots":[{"event_id":"sha256:2cd7131232c18cbd06fb1166223ad8ca5015e0d6a47a4831f3b2e2c41455df2f","target":"graph","created_at":"2026-07-09T01:20:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.07111/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Evangelos Protopapas, Jadwiga Czy\\.zewska, J\\'ulia Balig\\'acs, Micha{\\l} Pilipczuk, V\\'aclav Bla\\v{z}ej","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T07:51:50Z","title":"A coarse block-cut tree theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07111","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d8d998c26e83590d1df015fc4280738055371bc195684aa4799d5a1c30f4f74","target":"record","created_at":"2026-07-09T01:20:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4efe262bd422882b6aa0e1f333548fc4f7798dc0432449d1977a019a099cf454","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T07:51:50Z","title_canon_sha256":"a845f8923269a3d85fb7d7c7baccbb48cc0216a0744c1b384c7a31e6e3cdf9ff"},"schema_version":"1.0","source":{"id":"2607.07111","kind":"arxiv","version":1}},"canonical_sha256":"33842787103c1fbace073b99f879b3ea29fb84654c57ad277879a495c897c734","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33842787103c1fbace073b99f879b3ea29fb84654c57ad277879a495c897c734","first_computed_at":"2026-07-09T01:20:14.770634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:14.770634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1oROjSquRJNxV78BfBeC/MHA4PClYTLOjxGPHuzQTrxGR6rSRvROSyvIVZgGcClXwZzrC+knVkhXd/J0aHVxCA==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:14.771048Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d8d998c26e83590d1df015fc4280738055371bc195684aa4799d5a1c30f4f74","sha256:2cd7131232c18cbd06fb1166223ad8ca5015e0d6a47a4831f3b2e2c41455df2f"],"state_sha256":"ab9d0153b9ce7966565af1e4c1a017e231700f3fd9803371c996edaeb32917c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DtSE2xN4sbAn20uvID/YgOxAYyoFLd7H+fcuRuKcq6YHMC/iKEHaOeRkd3Djr6MTVTVYulcMkt1wcZttAyAbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:00:21.975479Z","bundle_sha256":"f5149f172c311127670e33520da603e61db1031a3f5c313351799bf9a8e9f691"}}