{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O7OITO5R5A2VEO2OS3DKIXZT7T","short_pith_number":"pith:O7OITO5R","canonical_record":{"source":{"id":"1211.7353","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T19:50:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be7b01399944dffa86a10f767a2fa23b86aa64f4ffc37c07ef45fe9feedbaa0e","abstract_canon_sha256":"a41a2181cffa919579d6776951bd55c90adb6022fd423595a56bf8b08df0d479"},"schema_version":"1.0"},"canonical_sha256":"77dc89bbb1e835523b4e96c6a45f33fcc9982cfc4b961495126a8801a67b2f04","source":{"kind":"arxiv","id":"1211.7353","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7353","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7353v3","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7353","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"O7OITO5R5A2V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O7OITO5R5A2VEO2O","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O7OITO5R","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O7OITO5R5A2VEO2OS3DKIXZT7T","target":"record","payload":{"canonical_record":{"source":{"id":"1211.7353","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T19:50:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be7b01399944dffa86a10f767a2fa23b86aa64f4ffc37c07ef45fe9feedbaa0e","abstract_canon_sha256":"a41a2181cffa919579d6776951bd55c90adb6022fd423595a56bf8b08df0d479"},"schema_version":"1.0"},"canonical_sha256":"77dc89bbb1e835523b4e96c6a45f33fcc9982cfc4b961495126a8801a67b2f04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:15.823055Z","signature_b64":"U+F5xJDQnK4vfl9UH3g5hpRmxOJKb7Gh0+CGH2EkopiuG5+M/Z9sv4qmFIxzDKiQNNNyilsNyUucOcSCgzhvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77dc89bbb1e835523b4e96c6a45f33fcc9982cfc4b961495126a8801a67b2f04","last_reissued_at":"2026-05-18T01:30:15.822408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:15.822408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.7353","source_version":3,"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:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fH7jf085nUtTpLq5adkIZLKuaaUPG/AHBj5vWaM0zUGLPdfDpOuTAjcP3zzXh04LuqiEO1n0Lex0WHFhQ3V8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:41:08.581650Z"},"content_sha256":"329c42dbb30f02b201d2bb7ade952eec0967e7e40e68e86148af5f033c784334","schema_version":"1.0","event_id":"sha256:329c42dbb30f02b201d2bb7ade952eec0967e7e40e68e86148af5f033c784334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O7OITO5R5A2VEO2OS3DKIXZT7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Malte M\\\"uller, Reinhard Diestel","submitted_at":"2012-11-30T19:50:07Z","abstract_excerpt":"The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has small connected tree-width if and only if it has small tree-width and contains no long geodesic cycle.\n  We further prove a connected analogue of the duality theorem for tree-width: a finite graph has small connected tree-width if and only if it has no bramble whose connected covers are all large. Both these results are qualitative: the bounds are good but n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7353","kind":"arxiv","version":3},"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:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLDx2UYicpkMVLlBQOWU0lVl5LOd/2wjw7PSvVXHhlqM7YhVJZICtGUf6PZ25ipayFlkhtI4LjxLm4yXE9ESAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:41:08.582326Z"},"content_sha256":"e4a60cd958d54e75de1bb0f4cd5e28b3ce04ec4c3632ddd19d69e086751c7dab","schema_version":"1.0","event_id":"sha256:e4a60cd958d54e75de1bb0f4cd5e28b3ce04ec4c3632ddd19d69e086751c7dab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/bundle.json","state_url":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/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-30T07:41:08Z","links":{"resolver":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T","bundle":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/bundle.json","state":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O7OITO5R5A2VEO2OS3DKIXZT7T","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":"a41a2181cffa919579d6776951bd55c90adb6022fd423595a56bf8b08df0d479","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T19:50:07Z","title_canon_sha256":"be7b01399944dffa86a10f767a2fa23b86aa64f4ffc37c07ef45fe9feedbaa0e"},"schema_version":"1.0","source":{"id":"1211.7353","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7353","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7353v3","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7353","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"O7OITO5R5A2V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O7OITO5R5A2VEO2O","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O7OITO5R","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:e4a60cd958d54e75de1bb0f4cd5e28b3ce04ec4c3632ddd19d69e086751c7dab","target":"graph","created_at":"2026-05-18T01:30:15Z","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":"The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has small connected tree-width if and only if it has small tree-width and contains no long geodesic cycle.\n  We further prove a connected analogue of the duality theorem for tree-width: a finite graph has small connected tree-width if and only if it has no bramble whose connected covers are all large. Both these results are qualitative: the bounds are good but n","authors_text":"Malte M\\\"uller, Reinhard Diestel","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T19:50:07Z","title":"Connected tree-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7353","kind":"arxiv","version":3},"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:329c42dbb30f02b201d2bb7ade952eec0967e7e40e68e86148af5f033c784334","target":"record","created_at":"2026-05-18T01:30:15Z","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":"a41a2181cffa919579d6776951bd55c90adb6022fd423595a56bf8b08df0d479","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T19:50:07Z","title_canon_sha256":"be7b01399944dffa86a10f767a2fa23b86aa64f4ffc37c07ef45fe9feedbaa0e"},"schema_version":"1.0","source":{"id":"1211.7353","kind":"arxiv","version":3}},"canonical_sha256":"77dc89bbb1e835523b4e96c6a45f33fcc9982cfc4b961495126a8801a67b2f04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77dc89bbb1e835523b4e96c6a45f33fcc9982cfc4b961495126a8801a67b2f04","first_computed_at":"2026-05-18T01:30:15.822408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:15.822408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U+F5xJDQnK4vfl9UH3g5hpRmxOJKb7Gh0+CGH2EkopiuG5+M/Z9sv4qmFIxzDKiQNNNyilsNyUucOcSCgzhvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:15.823055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.7353","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:329c42dbb30f02b201d2bb7ade952eec0967e7e40e68e86148af5f033c784334","sha256:e4a60cd958d54e75de1bb0f4cd5e28b3ce04ec4c3632ddd19d69e086751c7dab"],"state_sha256":"b2dc4431382b055e7da2d0a82c3e3fd54e5680bfc8eaccf6deb49488963de46a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0K5pw2Ghrl7WgzWN4/vawdwEM8A4qcdgGdN+NpLP0S0/2fCdcG+A7ioF8gRQ/EKHyDZS29W4PiMI66ujhAyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:41:08.586015Z","bundle_sha256":"e4ec9b509a7a13e730e93588f31a99e1af173cc1cd3789ebb2a58074de9ff23e"}}