{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ROC25TF6HCTHBANVAWQ7Q7UNXB","short_pith_number":"pith:ROC25TF6","schema_version":"1.0","canonical_sha256":"8b85aeccbe38a67081b505a1f87e8db85ec0e04e94a9d41572d9cb1635a524d5","source":{"kind":"arxiv","id":"2606.20452","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.20452","created_at":"2026-06-19T16:13:12.763201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20452v1","created_at":"2026-06-19T16:13:12.763201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20452","created_at":"2026-06-19T16:13:12.763201+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROC25TF6HCTH","created_at":"2026-06-19T16:13:12.763201+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROC25TF6HCTHBANV","created_at":"2026-06-19T16:13:12.763201+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROC25TF6","created_at":"2026-06-19T16:13:12.763201+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/ROC25TF6HCTHBANVAWQ7Q7UNXB","json":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB.json","graph_json":"https://pith.science/api/pith-number/ROC25TF6HCTHBANVAWQ7Q7UNXB/graph.json","events_json":"https://pith.science/api/pith-number/ROC25TF6HCTHBANVAWQ7Q7UNXB/events.json","paper":"https://pith.science/paper/ROC25TF6"},"agent_actions":{"view_html":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB","download_json":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB.json","view_paper":"https://pith.science/paper/ROC25TF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20452&json=true","fetch_graph":"https://pith.science/api/pith-number/ROC25TF6HCTHBANVAWQ7Q7UNXB/graph.json","fetch_events":"https://pith.science/api/pith-number/ROC25TF6HCTHBANVAWQ7Q7UNXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/action/storage_attestation","attest_author":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/action/author_attestation","sign_citation":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/action/citation_signature","submit_replication":"https://pith.science/pith/ROC25TF6HCTHBANVAWQ7Q7UNXB/action/replication_record"}},"created_at":"2026-06-19T16:13:12.763201+00:00","updated_at":"2026-06-19T16:13:12.763201+00:00"}