{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UOBZTYURTBSIXKAFVUSILEV2TR","short_pith_number":"pith:UOBZTYUR","schema_version":"1.0","canonical_sha256":"a38399e29198648ba805ad248592ba9c7f38718de740c18e2a2fc1da24182698","source":{"kind":"arxiv","id":"2411.13656","version":1},"attestation_state":"computed","paper":{"title":"On vertex sets inducing tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hanno von Bergen, Paul Knappe, Paul Wollan, Raphael W. Jacobs, Sandra Albrechtsen","submitted_at":"2024-11-20T19:02:30Z","abstract_excerpt":"Diestel, Hundertmark and Lemanczyk asked whether every $k$-tangle in a graph is induced by a set of vertices by majority vote. We reduce their question to graphs whose size is bounded by a function in $k$. Additionally, we show that if for any fixed $k$ this problem has a positive answer, then every $k$-tangle is induced by a vertex set whose size is bounded in $k$. More generally, we prove for all $k$ that every $k$-tangle in a graph $G$ is induced by a weight function $V(G) \\to \\mathbb{N}$ whose total weight is bounded in $k$. As the key step of our proofs, we show that any given $k$-tangle "},"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":"2411.13656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T19:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"dc249620c44c8bc68bdadc4b66d408b65bb53377bae9082e7e119dedf0735b91","abstract_canon_sha256":"0d55c41285c3bfdc4d16c57b0932be60f853b4c4086085a10f36c0572f7a11db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:35.118958Z","signature_b64":"HtaqD5AUZZ0CbTdTrRtFcedIkRVYOI6iKhYPj6ToaRrfwP8z0RuShtQUep2BQRl1n9hkNmIbxHO6MiYV8dHnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a38399e29198648ba805ad248592ba9c7f38718de740c18e2a2fc1da24182698","last_reissued_at":"2026-07-05T09:38:35.118547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:35.118547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On vertex sets inducing tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hanno von Bergen, Paul Knappe, Paul Wollan, Raphael W. Jacobs, Sandra Albrechtsen","submitted_at":"2024-11-20T19:02:30Z","abstract_excerpt":"Diestel, Hundertmark and Lemanczyk asked whether every $k$-tangle in a graph is induced by a set of vertices by majority vote. We reduce their question to graphs whose size is bounded by a function in $k$. Additionally, we show that if for any fixed $k$ this problem has a positive answer, then every $k$-tangle is induced by a vertex set whose size is bounded in $k$. More generally, we prove for all $k$ that every $k$-tangle in a graph $G$ is induced by a weight function $V(G) \\to \\mathbb{N}$ whose total weight is bounded in $k$. As the key step of our proofs, we show that any given $k$-tangle "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13656","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/2411.13656/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":"2411.13656","created_at":"2026-07-05T09:38:35.118603+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13656v1","created_at":"2026-07-05T09:38:35.118603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13656","created_at":"2026-07-05T09:38:35.118603+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOBZTYURTBSI","created_at":"2026-07-05T09:38:35.118603+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOBZTYURTBSIXKAF","created_at":"2026-07-05T09:38:35.118603+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOBZTYUR","created_at":"2026-07-05T09:38:35.118603+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/UOBZTYURTBSIXKAFVUSILEV2TR","json":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR.json","graph_json":"https://pith.science/api/pith-number/UOBZTYURTBSIXKAFVUSILEV2TR/graph.json","events_json":"https://pith.science/api/pith-number/UOBZTYURTBSIXKAFVUSILEV2TR/events.json","paper":"https://pith.science/paper/UOBZTYUR"},"agent_actions":{"view_html":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR","download_json":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR.json","view_paper":"https://pith.science/paper/UOBZTYUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13656&json=true","fetch_graph":"https://pith.science/api/pith-number/UOBZTYURTBSIXKAFVUSILEV2TR/graph.json","fetch_events":"https://pith.science/api/pith-number/UOBZTYURTBSIXKAFVUSILEV2TR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR/action/storage_attestation","attest_author":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR/action/author_attestation","sign_citation":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR/action/citation_signature","submit_replication":"https://pith.science/pith/UOBZTYURTBSIXKAFVUSILEV2TR/action/replication_record"}},"created_at":"2026-07-05T09:38:35.118603+00:00","updated_at":"2026-07-05T09:38:35.118603+00:00"}