{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3V3TS4W5LDN5PT6CIY6HXJEZN5","short_pith_number":"pith:3V3TS4W5","canonical_record":{"source":{"id":"1105.1611","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T09:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"5e4f29fea0b7515f1eacf657298f695b94d60447a8b29229dab2aa1414572f48","abstract_canon_sha256":"67896241b55bc2a5fa5a130b3b5b356f607a0429280d1f0bf5597abad29e96d5"},"schema_version":"1.0"},"canonical_sha256":"dd773972dd58dbd7cfc2463c7ba4996f703a57c3430db9f2210f3509c5733852","source":{"kind":"arxiv","id":"1105.1611","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1611","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1611v5","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1611","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"pith_short_12","alias_value":"3V3TS4W5LDN5","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3V3TS4W5LDN5PT6C","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3V3TS4W5","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3V3TS4W5LDN5PT6CIY6HXJEZN5","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1611","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T09:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"5e4f29fea0b7515f1eacf657298f695b94d60447a8b29229dab2aa1414572f48","abstract_canon_sha256":"67896241b55bc2a5fa5a130b3b5b356f607a0429280d1f0bf5597abad29e96d5"},"schema_version":"1.0"},"canonical_sha256":"dd773972dd58dbd7cfc2463c7ba4996f703a57c3430db9f2210f3509c5733852","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:59.517595Z","signature_b64":"MbwFh1p+Hx1VFSau3wsnPHecYHSgwhpAEq4Hk6O+8p+34FofNAuV7uTm7Qrtf1aO4bV5N3VpR9KG7tLXmAopCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd773972dd58dbd7cfc2463c7ba4996f703a57c3430db9f2210f3509c5733852","last_reissued_at":"2026-05-18T02:43:59.517055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:59.517055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1611","source_version":5,"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-18T02:43:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIRyu7jK5SP/SlejAmOuEE91j2KcTBdAJAKipDa6zfe2JgPnZXF3R7KpKpsmJFuNTe0ADZOuPR39J54JuwYHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:26:06.874472Z"},"content_sha256":"301dad80ec9110040be81f9ec319ec164362517d9c1d778025e60095c30a0915","schema_version":"1.0","event_id":"sha256:301dad80ec9110040be81f9ec319ec164362517d9c1d778025e60095c30a0915"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3V3TS4W5LDN5PT6CIY6HXJEZN5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity and tree structure in finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fabian Hundertmark, Johannes Carmesin, Maya Stein, Reinhard Diestel","submitted_at":"2011-05-09T09:59:21Z","abstract_excerpt":"Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested subsystem that still separates those sets and is invariant under the automorphisms of the graph.\n  As an application, we show that the $k$-blocks -- the maximal vertex sets that cannot be separated by at most $k$ vertices -- of a graph $G$ live in distinct parts of a suitable tree-decomposition of $G$ of adhesion at most $k$, whose decomposition tree is invarian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1611","kind":"arxiv","version":5},"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-18T02:43:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYBmqRIPCUiQAzdFwmhmcx057Swd001Qu5kUJFp0lVUaE4zYs7/s8/0DPtmwhAqY1UTAMo7PCzJrroorqlV4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:26:06.875114Z"},"content_sha256":"c791c3ac81962314dd6e13f49b333b56b7d75a8178f514662f3da6822b58600d","schema_version":"1.0","event_id":"sha256:c791c3ac81962314dd6e13f49b333b56b7d75a8178f514662f3da6822b58600d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/bundle.json","state_url":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/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-05-28T20:26:06Z","links":{"resolver":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5","bundle":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/bundle.json","state":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3V3TS4W5LDN5PT6CIY6HXJEZN5","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":"67896241b55bc2a5fa5a130b3b5b356f607a0429280d1f0bf5597abad29e96d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T09:59:21Z","title_canon_sha256":"5e4f29fea0b7515f1eacf657298f695b94d60447a8b29229dab2aa1414572f48"},"schema_version":"1.0","source":{"id":"1105.1611","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1611","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1611v5","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1611","created_at":"2026-05-18T02:43:59Z"},{"alias_kind":"pith_short_12","alias_value":"3V3TS4W5LDN5","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3V3TS4W5LDN5PT6C","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3V3TS4W5","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:c791c3ac81962314dd6e13f49b333b56b7d75a8178f514662f3da6822b58600d","target":"graph","created_at":"2026-05-18T02:43:59Z","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":"Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested subsystem that still separates those sets and is invariant under the automorphisms of the graph.\n  As an application, we show that the $k$-blocks -- the maximal vertex sets that cannot be separated by at most $k$ vertices -- of a graph $G$ live in distinct parts of a suitable tree-decomposition of $G$ of adhesion at most $k$, whose decomposition tree is invarian","authors_text":"Fabian Hundertmark, Johannes Carmesin, Maya Stein, Reinhard Diestel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T09:59:21Z","title":"Connectivity and tree structure in finite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1611","kind":"arxiv","version":5},"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:301dad80ec9110040be81f9ec319ec164362517d9c1d778025e60095c30a0915","target":"record","created_at":"2026-05-18T02:43:59Z","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":"67896241b55bc2a5fa5a130b3b5b356f607a0429280d1f0bf5597abad29e96d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T09:59:21Z","title_canon_sha256":"5e4f29fea0b7515f1eacf657298f695b94d60447a8b29229dab2aa1414572f48"},"schema_version":"1.0","source":{"id":"1105.1611","kind":"arxiv","version":5}},"canonical_sha256":"dd773972dd58dbd7cfc2463c7ba4996f703a57c3430db9f2210f3509c5733852","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd773972dd58dbd7cfc2463c7ba4996f703a57c3430db9f2210f3509c5733852","first_computed_at":"2026-05-18T02:43:59.517055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:59.517055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MbwFh1p+Hx1VFSau3wsnPHecYHSgwhpAEq4Hk6O+8p+34FofNAuV7uTm7Qrtf1aO4bV5N3VpR9KG7tLXmAopCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:59.517595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1611","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:301dad80ec9110040be81f9ec319ec164362517d9c1d778025e60095c30a0915","sha256:c791c3ac81962314dd6e13f49b333b56b7d75a8178f514662f3da6822b58600d"],"state_sha256":"e850dc495feeff91de2ddf74ee797e108997dd0e59af581a4fa406e1a5072f4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+xa3H0lKFyukpQxd3UtNsW6szETSA2HYnJx40J28IaWWRkWiaYY/MjLLasvg0fGem1birUg/QoT0CN76h+pDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:26:06.878573Z","bundle_sha256":"a77adcef48da0e35c938cfac08223696b214ce087e315a7f4952c2ed22899fe5"}}