{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YRZHFVFX64EFTL62MJWBK7ZCRV","short_pith_number":"pith:YRZHFVFX","schema_version":"1.0","canonical_sha256":"c47272d4b7f70859afda626c157f228d59f0ddc8a5ba6356446900907c1710b1","source":{"kind":"arxiv","id":"2309.00902","version":2},"attestation_state":"computed","paper":{"title":"Characterising 4-tangles through a connectivity property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Kurkofka, Johannes Carmesin","submitted_at":"2023-09-02T10:39:50Z","abstract_excerpt":"Every large $k$-connected graph-minor induces a $k$-tangle in its ambient graph. The converse holds for $k\\le 3$, but fails for $k\\ge 4$. This raises the question whether `$k$-connected' can be relaxed to obtain a characterisation of $k$-tangles through highly cohesive graph-minors. We show that this can be achieved for $k=4$ by proving that internally 4-connected graphs have unique 4-tangles, and that every graph with a 4-tangle $\\tau$ has an internally 4-connected minor whose unique 4-tangle lifts to $\\tau$."},"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":"2309.00902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-02T10:39:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ac407bfdea7b0cb3e66415cbc4dae253db26de490c55b9b53004f64b5f570ecf","abstract_canon_sha256":"fab54c507f6ff8f62df052793d5d5eacc5a360b9284ebc7bb732a08313aad7a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:47.819047Z","signature_b64":"u5vqUKDtbzgamRo5kW0a9qGGSFkHdue7pC4Pvfe4ugJSZK22EErc9qd9S7DqX3BaTH7COpIvDdAgen0NtCo4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c47272d4b7f70859afda626c157f228d59f0ddc8a5ba6356446900907c1710b1","last_reissued_at":"2026-07-05T11:16:47.818557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:47.818557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterising 4-tangles through a connectivity property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Kurkofka, Johannes Carmesin","submitted_at":"2023-09-02T10:39:50Z","abstract_excerpt":"Every large $k$-connected graph-minor induces a $k$-tangle in its ambient graph. The converse holds for $k\\le 3$, but fails for $k\\ge 4$. This raises the question whether `$k$-connected' can be relaxed to obtain a characterisation of $k$-tangles through highly cohesive graph-minors. We show that this can be achieved for $k=4$ by proving that internally 4-connected graphs have unique 4-tangles, and that every graph with a 4-tangle $\\tau$ has an internally 4-connected minor whose unique 4-tangle lifts to $\\tau$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.00902","kind":"arxiv","version":2},"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/2309.00902/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":"2309.00902","created_at":"2026-07-05T11:16:47.818615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.00902v2","created_at":"2026-07-05T11:16:47.818615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.00902","created_at":"2026-07-05T11:16:47.818615+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRZHFVFX64EF","created_at":"2026-07-05T11:16:47.818615+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRZHFVFX64EFTL62","created_at":"2026-07-05T11:16:47.818615+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRZHFVFX","created_at":"2026-07-05T11:16:47.818615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13656","citing_title":"On vertex sets inducing tangles","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV","json":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV.json","graph_json":"https://pith.science/api/pith-number/YRZHFVFX64EFTL62MJWBK7ZCRV/graph.json","events_json":"https://pith.science/api/pith-number/YRZHFVFX64EFTL62MJWBK7ZCRV/events.json","paper":"https://pith.science/paper/YRZHFVFX"},"agent_actions":{"view_html":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV","download_json":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV.json","view_paper":"https://pith.science/paper/YRZHFVFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.00902&json=true","fetch_graph":"https://pith.science/api/pith-number/YRZHFVFX64EFTL62MJWBK7ZCRV/graph.json","fetch_events":"https://pith.science/api/pith-number/YRZHFVFX64EFTL62MJWBK7ZCRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/action/storage_attestation","attest_author":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/action/author_attestation","sign_citation":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/action/citation_signature","submit_replication":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/action/replication_record"}},"created_at":"2026-07-05T11:16:47.818615+00:00","updated_at":"2026-07-05T11:16:47.818615+00:00"}