{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6WHK24BQGWKORUQMLIP2F62YZT","short_pith_number":"pith:6WHK24BQ","schema_version":"1.0","canonical_sha256":"f58ead70303594e8d20c5a1fa2fb58ccd35c86cb575e4f1a741b3e9ee85eabf8","source":{"kind":"arxiv","id":"1509.02475","version":3},"attestation_state":"computed","paper":{"title":"On the size of planarly connected crossing graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Eyal Ackerman, Mate Vizer","submitted_at":"2015-09-08T18:05:23Z","abstract_excerpt":"We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges. Graphs that admit such drawings are related to quasi-planar graphs and to maximal $1$-planar and fan-planar graphs."},"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":"1509.02475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-08T18:05:23Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"49fec8f9d4872832de94fd3c6099b0d4bfcb41d7ab2f350a63b402fbb30df516","abstract_canon_sha256":"616ec155f0a34419ef38c333fb9a7af9404393bb486e055984adf4c29f0a1479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:21.094278Z","signature_b64":"2grtcLUXpleg6R6MnfufhlsD6rUQbJGAyhH1a7zIrXtTJvuuT5A49wpB3L2OWl0Zyh2MX59NSF7/yRnVuIe8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f58ead70303594e8d20c5a1fa2fb58ccd35c86cb575e4f1a741b3e9ee85eabf8","last_reissued_at":"2026-05-18T01:07:21.093746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:21.093746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the size of planarly connected crossing graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Eyal Ackerman, Mate Vizer","submitted_at":"2015-09-08T18:05:23Z","abstract_excerpt":"We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges. Graphs that admit such drawings are related to quasi-planar graphs and to maximal $1$-planar and fan-planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02475","kind":"arxiv","version":3},"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":"1509.02475","created_at":"2026-05-18T01:07:21.093839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02475v3","created_at":"2026-05-18T01:07:21.093839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02475","created_at":"2026-05-18T01:07:21.093839+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WHK24BQGWKO","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WHK24BQGWKORUQM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WHK24BQ","created_at":"2026-05-18T12:29:07.941421+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/6WHK24BQGWKORUQMLIP2F62YZT","json":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT.json","graph_json":"https://pith.science/api/pith-number/6WHK24BQGWKORUQMLIP2F62YZT/graph.json","events_json":"https://pith.science/api/pith-number/6WHK24BQGWKORUQMLIP2F62YZT/events.json","paper":"https://pith.science/paper/6WHK24BQ"},"agent_actions":{"view_html":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT","download_json":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT.json","view_paper":"https://pith.science/paper/6WHK24BQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02475&json=true","fetch_graph":"https://pith.science/api/pith-number/6WHK24BQGWKORUQMLIP2F62YZT/graph.json","fetch_events":"https://pith.science/api/pith-number/6WHK24BQGWKORUQMLIP2F62YZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT/action/storage_attestation","attest_author":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT/action/author_attestation","sign_citation":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT/action/citation_signature","submit_replication":"https://pith.science/pith/6WHK24BQGWKORUQMLIP2F62YZT/action/replication_record"}},"created_at":"2026-05-18T01:07:21.093839+00:00","updated_at":"2026-05-18T01:07:21.093839+00:00"}