{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CMJCRMM324FAPTEQMXVSQW6NZ3","short_pith_number":"pith:CMJCRMM3","canonical_record":{"source":{"id":"1706.08330","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T11:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"10e2525f7acdb6a1ed6621db4c949e726dfb39c92eb05969d1a031295381f3c5","abstract_canon_sha256":"fcb78ccce8b736ebd83ca479c983c951ed6a959f7fcca80f2ab13fba86415c22"},"schema_version":"1.0"},"canonical_sha256":"131228b19bd70a07cc9065eb285bcdcefd98f95e345a9c021917efe97f71dcbd","source":{"kind":"arxiv","id":"1706.08330","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08330","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08330v3","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08330","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"CMJCRMM324FA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMJCRMM324FAPTEQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMJCRMM3","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CMJCRMM324FAPTEQMXVSQW6NZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08330","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T11:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"10e2525f7acdb6a1ed6621db4c949e726dfb39c92eb05969d1a031295381f3c5","abstract_canon_sha256":"fcb78ccce8b736ebd83ca479c983c951ed6a959f7fcca80f2ab13fba86415c22"},"schema_version":"1.0"},"canonical_sha256":"131228b19bd70a07cc9065eb285bcdcefd98f95e345a9c021917efe97f71dcbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:37.574902Z","signature_b64":"ZBA6B+6PnIBktaYfQg6n1Vh04thgSY+WPUfGNmyRYhAb2YQjjWzyWV73jnmeJy6ZqlEwozbUa8GXd1VzyGDlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"131228b19bd70a07cc9065eb285bcdcefd98f95e345a9c021917efe97f71dcbd","last_reissued_at":"2026-05-18T00:15:37.574421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:37.574421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08330","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-18T00:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNx+YYEBgZQ6312il8WznKXT5MrmwNMjyafKcazlGNGGaN4UtCJ1b8iw5RQzarSwFv+K0JI6/N1QEptaJ7CbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:22:38.348363Z"},"content_sha256":"de73d0a702aa6b3a3f529322052cedda555d78f422355c90200f49ef313117d5","schema_version":"1.0","event_id":"sha256:de73d0a702aa6b3a3f529322052cedda555d78f422355c90200f49ef313117d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CMJCRMM324FAPTEQMXVSQW6NZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On tree-decompositions of one-ended graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Johannes Carmesin, R\\\"ognvaldur G. M\\\"oller","submitted_at":"2017-06-26T11:34:46Z","abstract_excerpt":"A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\\em dominates} a ray in the end if there are infinitely many paths connecting $v$ to the ray such that any two of these paths have only the vertex $v$ in common. We prove that if a one-ended graph contains no ray which is dominated by a vertex and no infinite family of pairwise disjoint rays, then it has a tree-decomposition such that the decomposition tree is one-ended and the tree-deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08330","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-18T00:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yjo69qnTYrgaNAOeI+GipPSoBwJ84OKWwmgVFRbpeWtjN/gVfBRAdGq4vZWh5c0IrZK9s0lWzB9CHb2TBP6vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:22:38.349047Z"},"content_sha256":"0aebcf443e59586d1e0a7a2fc5bc5c0da1b70d298833c742246da856229a5adc","schema_version":"1.0","event_id":"sha256:0aebcf443e59586d1e0a7a2fc5bc5c0da1b70d298833c742246da856229a5adc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMJCRMM324FAPTEQMXVSQW6NZ3/bundle.json","state_url":"https://pith.science/pith/CMJCRMM324FAPTEQMXVSQW6NZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMJCRMM324FAPTEQMXVSQW6NZ3/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-12T02:22:38Z","links":{"resolver":"https://pith.science/pith/CMJCRMM324FAPTEQMXVSQW6NZ3","bundle":"https://pith.science/pith/CMJCRMM324FAPTEQMXVSQW6NZ3/bundle.json","state":"https://pith.science/pith/CMJCRMM324FAPTEQMXVSQW6NZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMJCRMM324FAPTEQMXVSQW6NZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CMJCRMM324FAPTEQMXVSQW6NZ3","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":"fcb78ccce8b736ebd83ca479c983c951ed6a959f7fcca80f2ab13fba86415c22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T11:34:46Z","title_canon_sha256":"10e2525f7acdb6a1ed6621db4c949e726dfb39c92eb05969d1a031295381f3c5"},"schema_version":"1.0","source":{"id":"1706.08330","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08330","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08330v3","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08330","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"CMJCRMM324FA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMJCRMM324FAPTEQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMJCRMM3","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:0aebcf443e59586d1e0a7a2fc5bc5c0da1b70d298833c742246da856229a5adc","target":"graph","created_at":"2026-05-18T00:15:37Z","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 graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\\em dominates} a ray in the end if there are infinitely many paths connecting $v$ to the ray such that any two of these paths have only the vertex $v$ in common. We prove that if a one-ended graph contains no ray which is dominated by a vertex and no infinite family of pairwise disjoint rays, then it has a tree-decomposition such that the decomposition tree is one-ended and the tree-deco","authors_text":"Florian Lehner, Johannes Carmesin, R\\\"ognvaldur G. M\\\"oller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T11:34:46Z","title":"On tree-decompositions of one-ended graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08330","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:de73d0a702aa6b3a3f529322052cedda555d78f422355c90200f49ef313117d5","target":"record","created_at":"2026-05-18T00:15:37Z","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":"fcb78ccce8b736ebd83ca479c983c951ed6a959f7fcca80f2ab13fba86415c22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T11:34:46Z","title_canon_sha256":"10e2525f7acdb6a1ed6621db4c949e726dfb39c92eb05969d1a031295381f3c5"},"schema_version":"1.0","source":{"id":"1706.08330","kind":"arxiv","version":3}},"canonical_sha256":"131228b19bd70a07cc9065eb285bcdcefd98f95e345a9c021917efe97f71dcbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"131228b19bd70a07cc9065eb285bcdcefd98f95e345a9c021917efe97f71dcbd","first_computed_at":"2026-05-18T00:15:37.574421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:37.574421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZBA6B+6PnIBktaYfQg6n1Vh04thgSY+WPUfGNmyRYhAb2YQjjWzyWV73jnmeJy6ZqlEwozbUa8GXd1VzyGDlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:37.574902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08330","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de73d0a702aa6b3a3f529322052cedda555d78f422355c90200f49ef313117d5","sha256:0aebcf443e59586d1e0a7a2fc5bc5c0da1b70d298833c742246da856229a5adc"],"state_sha256":"345c1179449f8e4f7ba08548247fdfc9698414f3d30072e5ad6364274ae2ff65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JyzmgORhPwyi+M1EPT5XXV7PODgmisF2S53h06G8MolcEMQ1NlvGIotLZO9Y9wUS0PMs1+hB6eUQvUn+kVO5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:22:38.353084Z","bundle_sha256":"0201818a979ac098432c3e128a9ebf85175b8dcb14b7f7067736d07ef7c163bc"}}