{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D5TYRAHDPUN76VLBUATBN6AV6P","short_pith_number":"pith:D5TYRAHD","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"},"canonical_sha256":"1f678880e37d1bff5561a02616f815f3ff8b23c9df223f1b352a42b629ed7af4","source":{"kind":"arxiv","id":"1808.08496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08496","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08496v1","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08496","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"pith_short_12","alias_value":"D5TYRAHDPUN7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D5TYRAHDPUN76VLB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D5TYRAHD","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D5TYRAHDPUN76VLBUATBN6AV6P","target":"record","payload":{"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"},"canonical_sha256":"1f678880e37d1bff5561a02616f815f3ff8b23c9df223f1b352a42b629ed7af4","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"},"source_kind":"arxiv","source_id":"1808.08496","source_version":1,"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-18T00:07:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5KNzFgZretlLOgAywOM+xAPZca1L3cKyf0qlssujUzLP1hw/XCpGQAWsdCBlFvVKJeR2LvfDRPj3Y1sQbj6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:16:27.867164Z"},"content_sha256":"ec4d116895c317183f77349acb843db96a5bd4d89cbcc37c81483476c4f711f5","schema_version":"1.0","event_id":"sha256:ec4d116895c317183f77349acb843db96a5bd4d89cbcc37c81483476c4f711f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D5TYRAHDPUN76VLBUATBN6AV6P","target":"graph","payload":{"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"},"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-18T00:07:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v96VFR3OI/sg/pN5Pze/zBB4zHQQCCBEyc2BAKWltnxCc1s3rb1AJtIWQzVLZx9bOCsl98Yv8wGh5P0PtV1ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:16:27.867523Z"},"content_sha256":"931f2b7c9b6447c51ecd0771bb37449eca733fad9fa0faabe54d7a4fce9e783a","schema_version":"1.0","event_id":"sha256:931f2b7c9b6447c51ecd0771bb37449eca733fad9fa0faabe54d7a4fce9e783a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/bundle.json","state_url":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5TYRAHDPUN76VLBUATBN6AV6P/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-06-03T11:16:27Z","links":{"resolver":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P","bundle":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/bundle.json","state":"https://pith.science/pith/D5TYRAHDPUN76VLBUATBN6AV6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5TYRAHDPUN76VLBUATBN6AV6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D5TYRAHDPUN76VLBUATBN6AV6P","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":"4e7bffed5a17b56d8732725748e89f8d23c6b5c5fcd3e720e5724231a1bde36b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-26T02:29:28Z","title_canon_sha256":"887eef4a769e570ac438a19809629e88f4d006581ed8214479653b88d6dc0968"},"schema_version":"1.0","source":{"id":"1808.08496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08496","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08496v1","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08496","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"pith_short_12","alias_value":"D5TYRAHDPUN7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D5TYRAHDPUN76VLB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D5TYRAHD","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:931f2b7c9b6447c51ecd0771bb37449eca733fad9fa0faabe54d7a4fce9e783a","target":"graph","created_at":"2026-05-18T00:07:16Z","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":"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","authors_text":"Andr\\'e Schulz, Fabrizio Montecchiani, Lena Schlipf, Philipp Kindermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-26T02:29:28Z","title":"Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08496","kind":"arxiv","version":1},"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:ec4d116895c317183f77349acb843db96a5bd4d89cbcc37c81483476c4f711f5","target":"record","created_at":"2026-05-18T00:07:16Z","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":"4e7bffed5a17b56d8732725748e89f8d23c6b5c5fcd3e720e5724231a1bde36b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-26T02:29:28Z","title_canon_sha256":"887eef4a769e570ac438a19809629e88f4d006581ed8214479653b88d6dc0968"},"schema_version":"1.0","source":{"id":"1808.08496","kind":"arxiv","version":1}},"canonical_sha256":"1f678880e37d1bff5561a02616f815f3ff8b23c9df223f1b352a42b629ed7af4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f678880e37d1bff5561a02616f815f3ff8b23c9df223f1b352a42b629ed7af4","first_computed_at":"2026-05-18T00:07:16.322042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:16.322042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BBUZzZcoT1fI5aGujHuOfDf9co+PoRtb6QVFciNmmPQ0lMn+deh8ZgIjYeCkbZo8/U1u2bNjdCO0ewSH2eeRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:16.322729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec4d116895c317183f77349acb843db96a5bd4d89cbcc37c81483476c4f711f5","sha256:931f2b7c9b6447c51ecd0771bb37449eca733fad9fa0faabe54d7a4fce9e783a"],"state_sha256":"c7201546e6d256f1c8733758da9066b02eef84b153dcd7e4e7d3218892ea1044"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DkDOjjwLzAtRnGPmTO4+hMu7GCG/TiPhO1+6sWcUB1C2uvFKuE721lTHXLAzmJi7KKgp/6IkXNGrZ7A1iQtQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:16:27.869375Z","bundle_sha256":"b18080bb591c85dce46e37af4005101a73ca6ab9ac493c1fd4af731794240ee0"}}