{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BQMUUS47EMMKFJY5YWOXWZFTWY","short_pith_number":"pith:BQMUUS47","schema_version":"1.0","canonical_sha256":"0c194a4b9f2318a2a71dc59d7b64b3b624f8f4e1faf42f2cbfd463acd21e94c7","source":{"kind":"arxiv","id":"1708.08723","version":4},"attestation_state":"computed","paper":{"title":"Beyond Outerplanarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexander Wolff, Andre L\\\"offler, Giuseppe Liotta, Myroslav Kryven, Steven Chaplick","submitted_at":"2017-08-29T12:26:43Z","abstract_excerpt":"We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \\emph{convex drawings}. We consider two families of graph classes with convex drawings: \\emph{outer $k$-planar} graphs, where each edge is crossed by at most $k$ other edges; and \\emph{outer $k$-quasi-planar} graphs, where no $k$ edges can mutually cross.\n  We show that the outer $k$-planar graphs are $\\lfloor3.5\\sqrt{k}\\rfloor$-degenerate, and consequently that every outer $k$-planar graph can be colored with $\\lfloor3.5\\sqrt{k}\\rfloor + 1$ colors. We further show that every outer $k"},"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":"1708.08723","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-29T12:26:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a35991c8c8896c68b2454e68c81471d7d3617245c74e3ee13c718e4f9edbab38","abstract_canon_sha256":"1674d402d82d6e6a011cb924b7eaff3c857411a25082f19112fb6ff5f54a9776"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:03.260614Z","signature_b64":"kkxFHJf08LTNx7NlHl2U08kPAbnTx6L0T34Vp49WvifcNw5t/M0CgNyvv7lFECFFR1aeX/lm5yE4iEq3bFocCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c194a4b9f2318a2a71dc59d7b64b3b624f8f4e1faf42f2cbfd463acd21e94c7","last_reissued_at":"2026-06-02T02:04:03.259148Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:03.259148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Outerplanarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexander Wolff, Andre L\\\"offler, Giuseppe Liotta, Myroslav Kryven, Steven Chaplick","submitted_at":"2017-08-29T12:26:43Z","abstract_excerpt":"We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \\emph{convex drawings}. We consider two families of graph classes with convex drawings: \\emph{outer $k$-planar} graphs, where each edge is crossed by at most $k$ other edges; and \\emph{outer $k$-quasi-planar} graphs, where no $k$ edges can mutually cross.\n  We show that the outer $k$-planar graphs are $\\lfloor3.5\\sqrt{k}\\rfloor$-degenerate, and consequently that every outer $k$-planar graph can be colored with $\\lfloor3.5\\sqrt{k}\\rfloor + 1$ colors. We further show that every outer $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08723","kind":"arxiv","version":4},"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/1708.08723/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":"1708.08723","created_at":"2026-06-02T02:04:03.259222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08723v4","created_at":"2026-06-02T02:04:03.259222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08723","created_at":"2026-06-02T02:04:03.259222+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQMUUS47EMMK","created_at":"2026-06-02T02:04:03.259222+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQMUUS47EMMKFJY5","created_at":"2026-06-02T02:04:03.259222+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQMUUS47","created_at":"2026-06-02T02:04:03.259222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24490","citing_title":"On the maximum number of edges of outer k-planar graphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY","json":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY.json","graph_json":"https://pith.science/api/pith-number/BQMUUS47EMMKFJY5YWOXWZFTWY/graph.json","events_json":"https://pith.science/api/pith-number/BQMUUS47EMMKFJY5YWOXWZFTWY/events.json","paper":"https://pith.science/paper/BQMUUS47"},"agent_actions":{"view_html":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY","download_json":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY.json","view_paper":"https://pith.science/paper/BQMUUS47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08723&json=true","fetch_graph":"https://pith.science/api/pith-number/BQMUUS47EMMKFJY5YWOXWZFTWY/graph.json","fetch_events":"https://pith.science/api/pith-number/BQMUUS47EMMKFJY5YWOXWZFTWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY/action/storage_attestation","attest_author":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY/action/author_attestation","sign_citation":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY/action/citation_signature","submit_replication":"https://pith.science/pith/BQMUUS47EMMKFJY5YWOXWZFTWY/action/replication_record"}},"created_at":"2026-06-02T02:04:03.259222+00:00","updated_at":"2026-06-02T02:04:03.259222+00:00"}