{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ROC25TF6HCTHBANVAWQ7Q7UNXB","short_pith_number":"pith:ROC25TF6","canonical_record":{"source":{"id":"2606.20452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T16:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"93d4c391c267469b8ea31fc59cc8331486c733d67ca33d7af0e067fab6b43c02","abstract_canon_sha256":"a0daf759e61a9c4a433d8598a705e80e9359702242d903372eda09eab5cdff6a"},"schema_version":"1.0"},"canonical_sha256":"8b85aeccbe38a67081b505a1f87e8db85ec0e04e94a9d41572d9cb1635a524d5","source":{"kind":"arxiv","id":"2606.20452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20452","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20452v1","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20452","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"ROC25TF6HCTH","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"pith_short_16","alias_value":"ROC25TF6HCTHBANV","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"pith_short_8","alias_value":"ROC25TF6","created_at":"2026-06-19T16:13:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ROC25TF6HCTHBANVAWQ7Q7UNXB","target":"record","payload":{"canonical_record":{"source":{"id":"2606.20452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T16:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"93d4c391c267469b8ea31fc59cc8331486c733d67ca33d7af0e067fab6b43c02","abstract_canon_sha256":"a0daf759e61a9c4a433d8598a705e80e9359702242d903372eda09eab5cdff6a"},"schema_version":"1.0"},"canonical_sha256":"8b85aeccbe38a67081b505a1f87e8db85ec0e04e94a9d41572d9cb1635a524d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:12.763628Z","signature_b64":"jva1kgIpEIo48xgm6SKwQPa3VAfpC5mimmeLpmDda4nedqUJ7e5nrtdkWJ2eopDoT6ZFWV7hmqGKfF/Uw6xnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b85aeccbe38a67081b505a1f87e8db85ec0e04e94a9d41572d9cb1635a524d5","last_reissued_at":"2026-06-19T16:13:12.763145Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:12.763145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.20452","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-06-19T16:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMwNPO66NQ7e5fKmI99nvSPnD/zBYo/+U/BRn/4ujh1Fo6i8Bk4/8KwJp3XSvDXpKFPRIzEYfMAfeqEzPF7ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:29:56.000814Z"},"content_sha256":"ae1acbbef58e2a793bc2fc19f51a61567c8b5809b62ba06a3a9253853dcdf159","schema_version":"1.0","event_id":"sha256:ae1acbbef58e2a793bc2fc19f51a61567c8b5809b62ba06a3a9253853dcdf159"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ROC25TF6HCTHBANVAWQ7Q7UNXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-cut decompositions for displaying undominated edge-ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Real, Max Pitz","submitted_at":"2026-06-18T16:30:09Z","abstract_excerpt":"We prove that every graph admits a linked, componental, rooted tree-cut decomposition of finite adhesion that displays all undominated edge-ends. As a first application, we deduce that this tree-cut decomposition also displays the edge-degrees of all undominated edge-ends. For locally finite graphs $-$ where every end is an undominated edge-end $-$ this yields a linked tree-cut decomposition of finite adhesion into $\\textit{finite}$ parts that displays all ends and their edge-degrees. As a second application, this latter tree-cut decomposition yields short, unified deductions of Thomassen's th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20452","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.20452/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-19T16:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ud9+EyhyNdbjLSJYWVCcs5JTTyyGJc4IAc7RWuL/2PRTV/ZFLd5hWCkN+gXq6rskR49qHMWrJsV1XLZhQfFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:29:56.001193Z"},"content_sha256":"5d9c6316d82c1fccbe7dcaaf7e6f1f22ec249dab3cf447d564a012beeff6886b","schema_version":"1.0","event_id":"sha256:5d9c6316d82c1fccbe7dcaaf7e6f1f22ec249dab3cf447d564a012beeff6886b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/bundle.json","state_url":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/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-21T02:29:56Z","links":{"resolver":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB","bundle":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/bundle.json","state":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ROC25TF6HCTHBANVAWQ7Q7UNXB","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":"a0daf759e61a9c4a433d8598a705e80e9359702242d903372eda09eab5cdff6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T16:30:09Z","title_canon_sha256":"93d4c391c267469b8ea31fc59cc8331486c733d67ca33d7af0e067fab6b43c02"},"schema_version":"1.0","source":{"id":"2606.20452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20452","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20452v1","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20452","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"ROC25TF6HCTH","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"pith_short_16","alias_value":"ROC25TF6HCTHBANV","created_at":"2026-06-19T16:13:12Z"},{"alias_kind":"pith_short_8","alias_value":"ROC25TF6","created_at":"2026-06-19T16:13:12Z"}],"graph_snapshots":[{"event_id":"sha256:5d9c6316d82c1fccbe7dcaaf7e6f1f22ec249dab3cf447d564a012beeff6886b","target":"graph","created_at":"2026-06-19T16:13:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.20452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that every graph admits a linked, componental, rooted tree-cut decomposition of finite adhesion that displays all undominated edge-ends. As a first application, we deduce that this tree-cut decomposition also displays the edge-degrees of all undominated edge-ends. For locally finite graphs $-$ where every end is an undominated edge-end $-$ this yields a linked tree-cut decomposition of finite adhesion into $\\textit{finite}$ parts that displays all ends and their edge-degrees. As a second application, this latter tree-cut decomposition yields short, unified deductions of Thomassen's th","authors_text":"Lucas Real, Max Pitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T16:30:09Z","title":"Tree-cut decompositions for displaying undominated edge-ends"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20452","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:ae1acbbef58e2a793bc2fc19f51a61567c8b5809b62ba06a3a9253853dcdf159","target":"record","created_at":"2026-06-19T16:13:12Z","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":"a0daf759e61a9c4a433d8598a705e80e9359702242d903372eda09eab5cdff6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T16:30:09Z","title_canon_sha256":"93d4c391c267469b8ea31fc59cc8331486c733d67ca33d7af0e067fab6b43c02"},"schema_version":"1.0","source":{"id":"2606.20452","kind":"arxiv","version":1}},"canonical_sha256":"8b85aeccbe38a67081b505a1f87e8db85ec0e04e94a9d41572d9cb1635a524d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b85aeccbe38a67081b505a1f87e8db85ec0e04e94a9d41572d9cb1635a524d5","first_computed_at":"2026-06-19T16:13:12.763145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:12.763145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jva1kgIpEIo48xgm6SKwQPa3VAfpC5mimmeLpmDda4nedqUJ7e5nrtdkWJ2eopDoT6ZFWV7hmqGKfF/Uw6xnAA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:12.763628Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae1acbbef58e2a793bc2fc19f51a61567c8b5809b62ba06a3a9253853dcdf159","sha256:5d9c6316d82c1fccbe7dcaaf7e6f1f22ec249dab3cf447d564a012beeff6886b"],"state_sha256":"48fa295367e2951e9ddd1bb9e3cc247aac4241bc27eba12559288a25fb4ccee8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E02NN+2pyW/KgtOAt7ipIURbUwgORs4EECGPnMzDuLS+KLLRO1DnJBQLqTHcrEYKg1ngObFLvWajfRS3j4i0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T02:29:56.003242Z","bundle_sha256":"f4b3b7806b5b46f403b2f02e18d75d163dfaf831035d1d54e7f82ac4b387e174"}}