{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YRZHFVFX64EFTL62MJWBK7ZCRV","short_pith_number":"pith:YRZHFVFX","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"},"canonical_sha256":"c47272d4b7f70859afda626c157f228d59f0ddc8a5ba6356446900907c1710b1","source":{"kind":"arxiv","id":"2309.00902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.00902","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"2309.00902v2","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.00902","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"YRZHFVFX64EF","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"pith_short_16","alias_value":"YRZHFVFX64EFTL62","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"pith_short_8","alias_value":"YRZHFVFX","created_at":"2026-07-05T11:16:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YRZHFVFX64EFTL62MJWBK7ZCRV","target":"record","payload":{"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"},"canonical_sha256":"c47272d4b7f70859afda626c157f228d59f0ddc8a5ba6356446900907c1710b1","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"},"source_kind":"arxiv","source_id":"2309.00902","source_version":2,"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-07-05T11:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaClVXW7I/2dHQMWWEu/i3VaWv3rRe9tKXDY+F1z1ETJaaNauXVpwG4wSXponnpM+4bSH1F/7N5b5qism/CtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:21:37.211352Z"},"content_sha256":"ee7229b488f7a4a409bb6e2ed0bfd3044095a79391523d40bb1867d0c6518c96","schema_version":"1.0","event_id":"sha256:ee7229b488f7a4a409bb6e2ed0bfd3044095a79391523d40bb1867d0c6518c96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YRZHFVFX64EFTL62MJWBK7ZCRV","target":"graph","payload":{"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"},"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-07-05T11:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dPksxPYPD2PF1XhrsT7QP3T1NPhIXnoQLxkfkNqKQOPNkfDV1YpYdmRc1cCpGulafadPs+0Jk5mGnfQupz4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:21:37.213019Z"},"content_sha256":"44c623a5992a2440de2dceb40b343718ee1ace15d19668f55f9943afc7e65543","schema_version":"1.0","event_id":"sha256:44c623a5992a2440de2dceb40b343718ee1ace15d19668f55f9943afc7e65543"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/bundle.json","state_url":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/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-08-13T08:21:37Z","links":{"resolver":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV","bundle":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/bundle.json","state":"https://pith.science/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRZHFVFX64EFTL62MJWBK7ZCRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YRZHFVFX64EFTL62MJWBK7ZCRV","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":"fab54c507f6ff8f62df052793d5d5eacc5a360b9284ebc7bb732a08313aad7a4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-02T10:39:50Z","title_canon_sha256":"ac407bfdea7b0cb3e66415cbc4dae253db26de490c55b9b53004f64b5f570ecf"},"schema_version":"1.0","source":{"id":"2309.00902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.00902","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"2309.00902v2","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.00902","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"YRZHFVFX64EF","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"pith_short_16","alias_value":"YRZHFVFX64EFTL62","created_at":"2026-07-05T11:16:47Z"},{"alias_kind":"pith_short_8","alias_value":"YRZHFVFX","created_at":"2026-07-05T11:16:47Z"}],"graph_snapshots":[{"event_id":"sha256:44c623a5992a2440de2dceb40b343718ee1ace15d19668f55f9943afc7e65543","target":"graph","created_at":"2026-07-05T11:16:47Z","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/2309.00902/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Jan Kurkofka, Johannes Carmesin","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-02T10:39:50Z","title":"Characterising 4-tangles through a connectivity property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.00902","kind":"arxiv","version":2},"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:ee7229b488f7a4a409bb6e2ed0bfd3044095a79391523d40bb1867d0c6518c96","target":"record","created_at":"2026-07-05T11:16:47Z","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":"fab54c507f6ff8f62df052793d5d5eacc5a360b9284ebc7bb732a08313aad7a4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-02T10:39:50Z","title_canon_sha256":"ac407bfdea7b0cb3e66415cbc4dae253db26de490c55b9b53004f64b5f570ecf"},"schema_version":"1.0","source":{"id":"2309.00902","kind":"arxiv","version":2}},"canonical_sha256":"c47272d4b7f70859afda626c157f228d59f0ddc8a5ba6356446900907c1710b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c47272d4b7f70859afda626c157f228d59f0ddc8a5ba6356446900907c1710b1","first_computed_at":"2026-07-05T11:16:47.818557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:47.818557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u5vqUKDtbzgamRo5kW0a9qGGSFkHdue7pC4Pvfe4ugJSZK22EErc9qd9S7DqX3BaTH7COpIvDdAgen0NtCo4AA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:47.819047Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.00902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee7229b488f7a4a409bb6e2ed0bfd3044095a79391523d40bb1867d0c6518c96","sha256:44c623a5992a2440de2dceb40b343718ee1ace15d19668f55f9943afc7e65543"],"state_sha256":"637380b5caf58b19ef6b8ced43a052e049b015f803bd3263e9200a87cabd20bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnknJQzK6cN7J2mkU/c+wtoEJGmM6tZKcoOMSM0Pxp5pcLm0a88r9QClQfgeAzDDU6DFG7LP1zZ6Vp4vZkv0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:21:37.222460Z","bundle_sha256":"905f102f50cf330e0a98f267d42487f40e7f6c38bdab29fec103a3d6da050eb2"}}