{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A7ECJMBRP2KJSWA7QIP6S7ANK4","short_pith_number":"pith:A7ECJMBR","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"},"canonical_sha256":"07c824b0317e9499581f821fe97c0d57094c5a41555a296273933fa0c5a40198","source":{"kind":"arxiv","id":"1406.2726","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2726","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2726v2","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2726","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"A7ECJMBRP2KJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A7ECJMBRP2KJSWA7","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A7ECJMBR","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A7ECJMBRP2KJSWA7QIP6S7ANK4","target":"record","payload":{"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"},"canonical_sha256":"07c824b0317e9499581f821fe97c0d57094c5a41555a296273933fa0c5a40198","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"},"source_kind":"arxiv","source_id":"1406.2726","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-05-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXBc8GOS2jYirmKgkQ7TNxb83BAPBpf9370Nxw6HSxlNjBPscVNps8wFPO19ZOYUzdhkKAyeeQ29zvTMKQHCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:35.008562Z"},"content_sha256":"6aa1df6cb42b6ce88e582f7d9ed1139db35d1e06b14f8bd96f5e8095357b5f68","schema_version":"1.0","event_id":"sha256:6aa1df6cb42b6ce88e582f7d9ed1139db35d1e06b14f8bd96f5e8095357b5f68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A7ECJMBRP2KJSWA7QIP6S7ANK4","target":"graph","payload":{"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"},"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-05-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ad2jGnyIc3PI5VomX6Jm8FjjQMsima3TBDtmwHTyzg4FXyhCvCgbwKnYcMEhBDOXAD7UUSIvMK85aU+/bCeVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:35.009225Z"},"content_sha256":"e076ed404c8a90ed2ca2aa71e2b6f0099a4b5ae27bb148cc62d775505d29e222","schema_version":"1.0","event_id":"sha256:e076ed404c8a90ed2ca2aa71e2b6f0099a4b5ae27bb148cc62d775505d29e222"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/bundle.json","state_url":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/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-05-27T16:50:35Z","links":{"resolver":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4","bundle":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/bundle.json","state":"https://pith.science/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7ECJMBRP2KJSWA7QIP6S7ANK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A7ECJMBRP2KJSWA7QIP6S7ANK4","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":"a1c9482faab209cc4ae652f97ad32c2d8889acaf93b5a3541bb5afef7df84b1f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T21:18:50Z","title_canon_sha256":"72f3aef3dba3ae56bbd1d1ba48e0a6c2ea066af3c935ec4f046f86bbdb1b2900"},"schema_version":"1.0","source":{"id":"1406.2726","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2726","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2726v2","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2726","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"A7ECJMBRP2KJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A7ECJMBRP2KJSWA7","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A7ECJMBR","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:e076ed404c8a90ed2ca2aa71e2b6f0099a4b5ae27bb148cc62d775505d29e222","target":"graph","created_at":"2026-05-18T01:34:55Z","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"},"paper":{"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 ","authors_text":"Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. T\\'oth","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T21:18:50Z","title":"Disjoint edges in topological graphs and the tangled-thrackle conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2726","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:6aa1df6cb42b6ce88e582f7d9ed1139db35d1e06b14f8bd96f5e8095357b5f68","target":"record","created_at":"2026-05-18T01:34:55Z","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":"a1c9482faab209cc4ae652f97ad32c2d8889acaf93b5a3541bb5afef7df84b1f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T21:18:50Z","title_canon_sha256":"72f3aef3dba3ae56bbd1d1ba48e0a6c2ea066af3c935ec4f046f86bbdb1b2900"},"schema_version":"1.0","source":{"id":"1406.2726","kind":"arxiv","version":2}},"canonical_sha256":"07c824b0317e9499581f821fe97c0d57094c5a41555a296273933fa0c5a40198","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07c824b0317e9499581f821fe97c0d57094c5a41555a296273933fa0c5a40198","first_computed_at":"2026-05-18T01:34:55.464784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:55.464784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cew4vfxriA3FWQIWku1ZHmapODaqUb5msifGPZAh9R/dqax7MAjj/bAIkblga4OlCHIBEru1cXw82Rs+4K7iCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:55.465505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2726","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aa1df6cb42b6ce88e582f7d9ed1139db35d1e06b14f8bd96f5e8095357b5f68","sha256:e076ed404c8a90ed2ca2aa71e2b6f0099a4b5ae27bb148cc62d775505d29e222"],"state_sha256":"e3204c94bf7e828cb6c21ec58211381a082cca24f6f4b5f6e4206225fad1023e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMUL/CW0MV4iJneDoRzaqzJKZ2kZFjlXCHj0Bj1NB8Bq3H6yuBN0rAQnVV59UaXq1AvRC2r0T5c2KExW9ddzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:50:35.012684Z","bundle_sha256":"f2bf6721f4d2bd1d968fdd9abe874910ddd05918b4b4a05ae46206eb9e07132d"}}