{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R44VFROVAU44LYSISXZIWYE4KE","short_pith_number":"pith:R44VFROV","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"},"canonical_sha256":"8f3952c5d50539c5e24895f28b609c512b50a983219d6f839e1e29363df5fff6","source":{"kind":"arxiv","id":"1506.02904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02904","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02904v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02904","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"R44VFROVAU44","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R44VFROVAU44LYSI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R44VFROV","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R44VFROVAU44LYSISXZIWYE4KE","target":"record","payload":{"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"},"canonical_sha256":"8f3952c5d50539c5e24895f28b609c512b50a983219d6f839e1e29363df5fff6","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"},"source_kind":"arxiv","source_id":"1506.02904","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-05-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S59g+sATKYJ2/bbS8JFUcrEnU2xtQgPnYZkvFQhou8W7EwwpiQdxP4G0UtirKUQfZt5CkPixROQfrBYltTh/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:58:53.388662Z"},"content_sha256":"92d8272a367df469b0c1b17a82816f01e2bfbd85937a88811e8f3e9e7717acc2","schema_version":"1.0","event_id":"sha256:92d8272a367df469b0c1b17a82816f01e2bfbd85937a88811e8f3e9e7717acc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R44VFROVAU44LYSISXZIWYE4KE","target":"graph","payload":{"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"},"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-05-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pleaE1dZVrU99qPT74lKAIk7cl2S1YQYsP56bGy5y+EP3UzpsUJu9QPOOtMUjuv0p+nyRqcvOsmJpzPj96qjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:58:53.389013Z"},"content_sha256":"8442e8630383b59321393df7e7c36f3f5eed6bf49b44e6631c7d4524491fd1f9","schema_version":"1.0","event_id":"sha256:8442e8630383b59321393df7e7c36f3f5eed6bf49b44e6631c7d4524491fd1f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/bundle.json","state_url":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R44VFROVAU44LYSISXZIWYE4KE/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-06-23T22:58:53Z","links":{"resolver":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE","bundle":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/bundle.json","state":"https://pith.science/pith/R44VFROVAU44LYSISXZIWYE4KE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R44VFROVAU44LYSISXZIWYE4KE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R44VFROVAU44LYSISXZIWYE4KE","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":"d31fabc4443cd3859f135bc09687eb0b4144649dfd729fc0bff090350f67ff41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T13:38:40Z","title_canon_sha256":"58546100665cbe50a21b2b3f1c5f9d72447e11610dd6def2141b5802a256dd1d"},"schema_version":"1.0","source":{"id":"1506.02904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02904","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02904v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02904","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"R44VFROVAU44","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R44VFROVAU44LYSI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R44VFROV","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:8442e8630383b59321393df7e7c36f3f5eed6bf49b44e6631c7d4524491fd1f9","target":"graph","created_at":"2026-05-18T01:55:40Z","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"},"paper":{"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","authors_text":"Johannes Carmesin, Pascal Gollin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T13:38:40Z","title":"Canonical tree-decompositions of a graph that display its $k$-blocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02904","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:92d8272a367df469b0c1b17a82816f01e2bfbd85937a88811e8f3e9e7717acc2","target":"record","created_at":"2026-05-18T01:55:40Z","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":"d31fabc4443cd3859f135bc09687eb0b4144649dfd729fc0bff090350f67ff41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-09T13:38:40Z","title_canon_sha256":"58546100665cbe50a21b2b3f1c5f9d72447e11610dd6def2141b5802a256dd1d"},"schema_version":"1.0","source":{"id":"1506.02904","kind":"arxiv","version":1}},"canonical_sha256":"8f3952c5d50539c5e24895f28b609c512b50a983219d6f839e1e29363df5fff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f3952c5d50539c5e24895f28b609c512b50a983219d6f839e1e29363df5fff6","first_computed_at":"2026-05-18T01:55:40.574181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:40.574181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VUqnj7uexF9+CRmE9su6zgc2jHyh4XOSmag5NQdU4fGHuxoQGHInhT2RGXawPXwONPxiusOAz93ef8t5fVY7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:40.574934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92d8272a367df469b0c1b17a82816f01e2bfbd85937a88811e8f3e9e7717acc2","sha256:8442e8630383b59321393df7e7c36f3f5eed6bf49b44e6631c7d4524491fd1f9"],"state_sha256":"f6865fbec8ece9bd71198694daa0d223e09d70255dce682899d3f479c47e95fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cv3X+yZ3Y2V+QPPiE150of0abR3QrEz0DtHcO1FlAHWn22QVdDZujYzj927eLUanZgH7AIxqb51+/8RsIEg9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T22:58:53.390986Z","bundle_sha256":"9f0b73e1321046f984c754eb6bfe765f156748c099358ce02d075e946279c721"}}