{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A7ECJMBRP2KJSWA7QIP6S7ANK4","short_pith_number":"pith:A7ECJMBR","schema_version":"1.0","canonical_sha256":"07c824b0317e9499581f821fe97c0d57094c5a41555a296273933fa0c5a40198","source":{"kind":"arxiv","id":"1406.2726","version":2},"attestation_state":"computed","paper":{"title":"Disjoint edges in topological graphs and the tangled-thrackle conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. T\\'oth","submitted_at":"2014-06-10T21:18:50Z","abstract_excerpt":"It is shown that for a constant $t\\in \\mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the complement of the intersection graph of the edges is $K_{t,t}$-free). As an application, we settle the \\emph{tangled-thrackle} conjecture formulated by Pach, Radoi\\v{c}i\\'c, and T\\'oth: Every $n$-vertex graph drawn in the plane such that every pair of edges have precisely one point in common, where this point is either a common endpoint, a crossing, or a point "},"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":"1406.2726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T21:18:50Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"72f3aef3dba3ae56bbd1d1ba48e0a6c2ea066af3c935ec4f046f86bbdb1b2900","abstract_canon_sha256":"a1c9482faab209cc4ae652f97ad32c2d8889acaf93b5a3541bb5afef7df84b1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:55.465505Z","signature_b64":"cew4vfxriA3FWQIWku1ZHmapODaqUb5msifGPZAh9R/dqax7MAjj/bAIkblga4OlCHIBEru1cXw82Rs+4K7iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07c824b0317e9499581f821fe97c0d57094c5a41555a296273933fa0c5a40198","last_reissued_at":"2026-05-18T01:34:55.464784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:55.464784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint edges in topological graphs and the tangled-thrackle conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. T\\'oth","submitted_at":"2014-06-10T21:18:50Z","abstract_excerpt":"It is shown that for a constant $t\\in \\mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the complement of the intersection graph of the edges is $K_{t,t}$-free). As an application, we settle the \\emph{tangled-thrackle} conjecture formulated by Pach, Radoi\\v{c}i\\'c, and T\\'oth: Every $n$-vertex graph drawn in the plane such that every pair of edges have precisely one point in common, where this point is either a common endpoint, a crossing, or a point "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2726","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":""},"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":"1406.2726","created_at":"2026-05-18T01:34:55.464897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2726v2","created_at":"2026-05-18T01:34:55.464897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2726","created_at":"2026-05-18T01:34:55.464897+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7ECJMBRP2KJ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7ECJMBRP2KJSWA7","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7ECJMBR","created_at":"2026-05-18T12:28:19.803747+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/A7ECJMBRP2KJSWA7QIP6S7ANK4","json":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4.json","graph_json":"https://pith.science/api/pith-number/A7ECJMBRP2KJSWA7QIP6S7ANK4/graph.json","events_json":"https://pith.science/api/pith-number/A7ECJMBRP2KJSWA7QIP6S7ANK4/events.json","paper":"https://pith.science/paper/A7ECJMBR"},"agent_actions":{"view_html":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4","download_json":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4.json","view_paper":"https://pith.science/paper/A7ECJMBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2726&json=true","fetch_graph":"https://pith.science/api/pith-number/A7ECJMBRP2KJSWA7QIP6S7ANK4/graph.json","fetch_events":"https://pith.science/api/pith-number/A7ECJMBRP2KJSWA7QIP6S7ANK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/action/storage_attestation","attest_author":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/action/author_attestation","sign_citation":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/action/citation_signature","submit_replication":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/action/replication_record"}},"created_at":"2026-05-18T01:34:55.464897+00:00","updated_at":"2026-05-18T01:34:55.464897+00:00"}