{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GR5DT4NJUZR2BTSLLW7H3ACSDM","short_pith_number":"pith:GR5DT4NJ","schema_version":"1.0","canonical_sha256":"347a39f1a9a663a0ce4b5dbe7d80521b1283d87158b8a2138b3a7d2ae754db12","source":{"kind":"arxiv","id":"1506.04380","version":2},"attestation_state":"computed","paper":{"title":"Structure of Graphs with Locally Restricted Crossings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"David Eppstein, David R. Wood, Vida Dujmovi\\'c","submitted_at":"2015-06-14T11:17:47Z","abstract_excerpt":"We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most $k$ crossings per edge has treewidth $O(\\sqrt{(g+1)(k+1)n})$ and layered treewidth $O((g+1)k)$, and that these bounds are tight up to a constant factor. As a special case, the $k$-planar graphs with $n$ vertices have treewidth $O(\\sqrt{(k+1)n})$ and layered treewidth $O(k+1)$, which are tight bounds that improve a previously known $O((k+1)^{3/4}n^{1/2})$ tr"},"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":"1506.04380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-14T11:17:47Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"b655d998b0ad8da65f5f4c1b63575e8e157a6ac03e2932bd3740c3f64ca7262a","abstract_canon_sha256":"b8ecf1817aebf0f12635947efe579e78b20a72de7b4b1f6858afa09270563251"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:14.240429Z","signature_b64":"UorGEVYipf/Pecj3B9oM9v43gbJDZQ6Bl9sMJURA5utVQiGjghHmLAExBCu83usnm5Ma8vsRpLQAJnUic1tDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"347a39f1a9a663a0ce4b5dbe7d80521b1283d87158b8a2138b3a7d2ae754db12","last_reissued_at":"2026-05-18T00:40:14.239725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:14.239725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure of Graphs with Locally Restricted Crossings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"David Eppstein, David R. Wood, Vida Dujmovi\\'c","submitted_at":"2015-06-14T11:17:47Z","abstract_excerpt":"We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most $k$ crossings per edge has treewidth $O(\\sqrt{(g+1)(k+1)n})$ and layered treewidth $O((g+1)k)$, and that these bounds are tight up to a constant factor. As a special case, the $k$-planar graphs with $n$ vertices have treewidth $O(\\sqrt{(k+1)n})$ and layered treewidth $O(k+1)$, which are tight bounds that improve a previously known $O((k+1)^{3/4}n^{1/2})$ tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04380","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":"1506.04380","created_at":"2026-05-18T00:40:14.239823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04380v2","created_at":"2026-05-18T00:40:14.239823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04380","created_at":"2026-05-18T00:40:14.239823+00:00"},{"alias_kind":"pith_short_12","alias_value":"GR5DT4NJUZR2","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GR5DT4NJUZR2BTSL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GR5DT4NJ","created_at":"2026-05-18T12:29:22.688609+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/GR5DT4NJUZR2BTSLLW7H3ACSDM","json":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM.json","graph_json":"https://pith.science/api/pith-number/GR5DT4NJUZR2BTSLLW7H3ACSDM/graph.json","events_json":"https://pith.science/api/pith-number/GR5DT4NJUZR2BTSLLW7H3ACSDM/events.json","paper":"https://pith.science/paper/GR5DT4NJ"},"agent_actions":{"view_html":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM","download_json":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM.json","view_paper":"https://pith.science/paper/GR5DT4NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04380&json=true","fetch_graph":"https://pith.science/api/pith-number/GR5DT4NJUZR2BTSLLW7H3ACSDM/graph.json","fetch_events":"https://pith.science/api/pith-number/GR5DT4NJUZR2BTSLLW7H3ACSDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM/action/storage_attestation","attest_author":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM/action/author_attestation","sign_citation":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM/action/citation_signature","submit_replication":"https://pith.science/pith/GR5DT4NJUZR2BTSLLW7H3ACSDM/action/replication_record"}},"created_at":"2026-05-18T00:40:14.239823+00:00","updated_at":"2026-05-18T00:40:14.239823+00:00"}