{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D5TYRAHDPUN76VLBUATBN6AV6P","short_pith_number":"pith:D5TYRAHD","schema_version":"1.0","canonical_sha256":"1f678880e37d1bff5561a02616f815f3ff8b23c9df223f1b352a42b629ed7af4","source":{"kind":"arxiv","id":"1808.08496","version":1},"attestation_state":"computed","paper":{"title":"Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, Fabrizio Montecchiani, Lena Schlipf, Philipp Kindermann","submitted_at":"2018-08-26T02:29:28Z","abstract_excerpt":"We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least $\\pi/4$. On the other hand, if the embedding is fixed, then there is a 3-connected cubic 1-planar graph that needs 3 slopes when drawn with at most 1 bend per edge. We also show that 2 slopes always suffice for 1-planar drawings of subcubic 1-planar graphs with at most 2 bends per edge. This bound is obtained with vertex resolution $\\pi/2$ and the drawing is"},"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":"1808.08496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-26T02:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"887eef4a769e570ac438a19809629e88f4d006581ed8214479653b88d6dc0968","abstract_canon_sha256":"4e7bffed5a17b56d8732725748e89f8d23c6b5c5fcd3e720e5724231a1bde36b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:16.322729Z","signature_b64":"BBUZzZcoT1fI5aGujHuOfDf9co+PoRtb6QVFciNmmPQ0lMn+deh8ZgIjYeCkbZo8/U1u2bNjdCO0ewSH2eeRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f678880e37d1bff5561a02616f815f3ff8b23c9df223f1b352a42b629ed7af4","last_reissued_at":"2026-05-18T00:07:16.322042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:16.322042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, Fabrizio Montecchiani, Lena Schlipf, Philipp Kindermann","submitted_at":"2018-08-26T02:29:28Z","abstract_excerpt":"We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least $\\pi/4$. On the other hand, if the embedding is fixed, then there is a 3-connected cubic 1-planar graph that needs 3 slopes when drawn with at most 1 bend per edge. We also show that 2 slopes always suffice for 1-planar drawings of subcubic 1-planar graphs with at most 2 bends per edge. This bound is obtained with vertex resolution $\\pi/2$ and the drawing is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08496","kind":"arxiv","version":1},"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":"1808.08496","created_at":"2026-05-18T00:07:16.322160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08496v1","created_at":"2026-05-18T00:07:16.322160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08496","created_at":"2026-05-18T00:07:16.322160+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5TYRAHDPUN7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5TYRAHDPUN76VLB","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5TYRAHD","created_at":"2026-05-18T12:32:19.392346+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/D5TYRAHDPUN76VLBUATBN6AV6P","json":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P.json","graph_json":"https://pith.science/api/pith-number/D5TYRAHDPUN76VLBUATBN6AV6P/graph.json","events_json":"https://pith.science/api/pith-number/D5TYRAHDPUN76VLBUATBN6AV6P/events.json","paper":"https://pith.science/paper/D5TYRAHD"},"agent_actions":{"view_html":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P","download_json":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P.json","view_paper":"https://pith.science/paper/D5TYRAHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08496&json=true","fetch_graph":"https://pith.science/api/pith-number/D5TYRAHDPUN76VLBUATBN6AV6P/graph.json","fetch_events":"https://pith.science/api/pith-number/D5TYRAHDPUN76VLBUATBN6AV6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/action/storage_attestation","attest_author":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/action/author_attestation","sign_citation":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/action/citation_signature","submit_replication":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/action/replication_record"}},"created_at":"2026-05-18T00:07:16.322160+00:00","updated_at":"2026-05-18T00:07:16.322160+00:00"}