{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N2PLNU64TDGN33NIZISOB2B3FJ","short_pith_number":"pith:N2PLNU64","schema_version":"1.0","canonical_sha256":"6e9eb6d3dc98ccddeda8ca24e0e83b2a4a2d4517fbeaf8112d187b23995d5ee6","source":{"kind":"arxiv","id":"1804.00588","version":1},"attestation_state":"computed","paper":{"title":"Ends, tangles and critical vertex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.CO","authors_text":"Jan Kurkofka, Max Pitz","submitted_at":"2018-04-02T15:19:51Z","abstract_excerpt":"We show that an arbitrary infinite graph $G$ can be compactified by its ends plus its critical vertex sets, where a finite set $X$ of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to $X$.\n  We further provide a concrete separation system whose $\\aleph_0$-tangles are precisely the ends plus critical vertex sets. Our tangle compactification $\\vert G\\vert_{\\Gamma}$ is a quotient of Diestel's (denoted by $\\vert G\\vert_{\\Theta}$), and both use tangles to compactify a graph in much the same way as the ends of "},"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":"1804.00588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-02T15:19:51Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"99eff598afa1d1c8ddf972607b3b703e5d771bd0298b3d8fd2832e82f7289e4a","abstract_canon_sha256":"ab0607dde862a7134ceb50473ee2363db95c48cf769497ed74ee55a07d19daba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:36.517103Z","signature_b64":"D2Cb9y/6rCy6aohjNfo4LTd1ksum4tni2+QUnSzwNymSUOu+10OU6SCelNkKuZV7CKx0bAmllGlNCxu4yMBuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e9eb6d3dc98ccddeda8ca24e0e83b2a4a2d4517fbeaf8112d187b23995d5ee6","last_reissued_at":"2026-05-18T00:19:36.516518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:36.516518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ends, tangles and critical vertex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.CO","authors_text":"Jan Kurkofka, Max Pitz","submitted_at":"2018-04-02T15:19:51Z","abstract_excerpt":"We show that an arbitrary infinite graph $G$ can be compactified by its ends plus its critical vertex sets, where a finite set $X$ of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to $X$.\n  We further provide a concrete separation system whose $\\aleph_0$-tangles are precisely the ends plus critical vertex sets. Our tangle compactification $\\vert G\\vert_{\\Gamma}$ is a quotient of Diestel's (denoted by $\\vert G\\vert_{\\Theta}$), and both use tangles to compactify a graph in much the same way as the ends of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00588","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":""},"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":"1804.00588","created_at":"2026-05-18T00:19:36.516604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00588v1","created_at":"2026-05-18T00:19:36.516604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00588","created_at":"2026-05-18T00:19:36.516604+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2PLNU64TDGN","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2PLNU64TDGN33NI","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2PLNU64","created_at":"2026-05-18T12:32:40.477152+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/N2PLNU64TDGN33NIZISOB2B3FJ","json":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ.json","graph_json":"https://pith.science/api/pith-number/N2PLNU64TDGN33NIZISOB2B3FJ/graph.json","events_json":"https://pith.science/api/pith-number/N2PLNU64TDGN33NIZISOB2B3FJ/events.json","paper":"https://pith.science/paper/N2PLNU64"},"agent_actions":{"view_html":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ","download_json":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ.json","view_paper":"https://pith.science/paper/N2PLNU64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00588&json=true","fetch_graph":"https://pith.science/api/pith-number/N2PLNU64TDGN33NIZISOB2B3FJ/graph.json","fetch_events":"https://pith.science/api/pith-number/N2PLNU64TDGN33NIZISOB2B3FJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ/action/storage_attestation","attest_author":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ/action/author_attestation","sign_citation":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ/action/citation_signature","submit_replication":"https://pith.science/pith/N2PLNU64TDGN33NIZISOB2B3FJ/action/replication_record"}},"created_at":"2026-05-18T00:19:36.516604+00:00","updated_at":"2026-05-18T00:19:36.516604+00:00"}