{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3V3TS4W5LDN5PT6CIY6HXJEZN5","short_pith_number":"pith:3V3TS4W5","schema_version":"1.0","canonical_sha256":"dd773972dd58dbd7cfc2463c7ba4996f703a57c3430db9f2210f3509c5733852","source":{"kind":"arxiv","id":"1105.1611","version":5},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.1611","created_at":"2026-05-18T02:43:59.517140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1611v5","created_at":"2026-05-18T02:43:59.517140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1611","created_at":"2026-05-18T02:43:59.517140+00:00"},{"alias_kind":"pith_short_12","alias_value":"3V3TS4W5LDN5","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3V3TS4W5LDN5PT6C","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3V3TS4W5","created_at":"2026-05-18T12:26:20.644004+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/3V3TS4W5LDN5PT6CIY6HXJEZN5","json":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5.json","graph_json":"https://pith.science/api/pith-number/3V3TS4W5LDN5PT6CIY6HXJEZN5/graph.json","events_json":"https://pith.science/api/pith-number/3V3TS4W5LDN5PT6CIY6HXJEZN5/events.json","paper":"https://pith.science/paper/3V3TS4W5"},"agent_actions":{"view_html":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5","download_json":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5.json","view_paper":"https://pith.science/paper/3V3TS4W5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1611&json=true","fetch_graph":"https://pith.science/api/pith-number/3V3TS4W5LDN5PT6CIY6HXJEZN5/graph.json","fetch_events":"https://pith.science/api/pith-number/3V3TS4W5LDN5PT6CIY6HXJEZN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/action/storage_attestation","attest_author":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/action/author_attestation","sign_citation":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/action/citation_signature","submit_replication":"https://pith.science/pith/3V3TS4W5LDN5PT6CIY6HXJEZN5/action/replication_record"}},"created_at":"2026-05-18T02:43:59.517140+00:00","updated_at":"2026-05-18T02:43:59.517140+00:00"}