{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2DLRM3UBGJZFAAEJBCDPG654QB","short_pith_number":"pith:2DLRM3UB","canonical_record":{"source":{"id":"1506.04423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-14T17:04:54Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"bdd67566733034b87184067b9a42b9249217abf2a4c9d057fb16d444ba01c274","abstract_canon_sha256":"4206d01bde1c97ae568548ec47dc830b61f0688b09a9fbbca32f7f8a32a679ef"},"schema_version":"1.0"},"canonical_sha256":"d0d7166e8132725000890886f37bbc8067d524823f4414540b0875ca2c291ab5","source":{"kind":"arxiv","id":"1506.04423","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04423","created_at":"2026-05-18T01:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04423v2","created_at":"2026-05-18T01:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04423","created_at":"2026-05-18T01:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"2DLRM3UBGJZF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2DLRM3UBGJZFAAEJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2DLRM3UB","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2DLRM3UBGJZFAAEJBCDPG654QB","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-14T17:04:54Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"bdd67566733034b87184067b9a42b9249217abf2a4c9d057fb16d444ba01c274","abstract_canon_sha256":"4206d01bde1c97ae568548ec47dc830b61f0688b09a9fbbca32f7f8a32a679ef"},"schema_version":"1.0"},"canonical_sha256":"d0d7166e8132725000890886f37bbc8067d524823f4414540b0875ca2c291ab5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:00.377389Z","signature_b64":"USidrm3Ezo0N0SL/TNqQIGEQm4wVccaGN0f58KkBUggPABygMl8QVgzeqgLsmO3ghAYeCNiGBybRqTnsGLMlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d7166e8132725000890886f37bbc8067d524823f4414540b0875ca2c291ab5","last_reissued_at":"2026-05-18T01:32:00.376832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:00.376832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04423","source_version":2,"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-18T01:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bR3I0r1TCiSgJE7zVsOPBlNVc0snFh11v8DyD08s/Wso02xK9Q7l5N8bY5wb61myv5ogpX0LbQySkBsADzZeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:21:41.270645Z"},"content_sha256":"0bdfde3a19bdd5f0e6e312da8bdb7e4f86bb2ec750b73b4a7039d57c2369253d","schema_version":"1.0","event_id":"sha256:0bdfde3a19bdd5f0e6e312da8bdb7e4f86bb2ec750b73b4a7039d57c2369253d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2DLRM3UBGJZFAAEJBCDPG654QB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph drawings with one bend and few slopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Bartosz Walczak, Kolja Knauer","submitted_at":"2015-06-14T17:04:54Z","abstract_excerpt":"We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that $\\lceil\\frac{\\Delta}{2}\\rceil$ edge slopes suffice for outerplanar drawings of outerplanar graphs with maximum degree $\\Delta\\geq 3$. This matches the obvious lower bound. We also show that $\\lceil\\frac{\\Delta}{2}\\rceil+1$ edge slopes suffice for drawings of general graphs, improving on the previous bound of $\\Delta+1$. Furthermore, we improve previous upper bounds on the number of slop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04423","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"},"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-18T01:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63hTUj5ossnb+YKqedD0Srvoa29Bqg9u0jKmlj3l9ylcISdCBLydIw8jp+TQRovRqRQ1yHkv9b3b+NkDPabNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:21:41.271273Z"},"content_sha256":"3ee20bd0aefe0d663e005d4da0e9aeb8ec27968344ae263113e9d02e68a32f52","schema_version":"1.0","event_id":"sha256:3ee20bd0aefe0d663e005d4da0e9aeb8ec27968344ae263113e9d02e68a32f52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DLRM3UBGJZFAAEJBCDPG654QB/bundle.json","state_url":"https://pith.science/pith/2DLRM3UBGJZFAAEJBCDPG654QB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DLRM3UBGJZFAAEJBCDPG654QB/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-05-25T19:21:41Z","links":{"resolver":"https://pith.science/pith/2DLRM3UBGJZFAAEJBCDPG654QB","bundle":"https://pith.science/pith/2DLRM3UBGJZFAAEJBCDPG654QB/bundle.json","state":"https://pith.science/pith/2DLRM3UBGJZFAAEJBCDPG654QB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DLRM3UBGJZFAAEJBCDPG654QB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2DLRM3UBGJZFAAEJBCDPG654QB","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":"4206d01bde1c97ae568548ec47dc830b61f0688b09a9fbbca32f7f8a32a679ef","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-14T17:04:54Z","title_canon_sha256":"bdd67566733034b87184067b9a42b9249217abf2a4c9d057fb16d444ba01c274"},"schema_version":"1.0","source":{"id":"1506.04423","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04423","created_at":"2026-05-18T01:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04423v2","created_at":"2026-05-18T01:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04423","created_at":"2026-05-18T01:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"2DLRM3UBGJZF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2DLRM3UBGJZFAAEJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2DLRM3UB","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:3ee20bd0aefe0d663e005d4da0e9aeb8ec27968344ae263113e9d02e68a32f52","target":"graph","created_at":"2026-05-18T01:32:00Z","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 consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that $\\lceil\\frac{\\Delta}{2}\\rceil$ edge slopes suffice for outerplanar drawings of outerplanar graphs with maximum degree $\\Delta\\geq 3$. This matches the obvious lower bound. We also show that $\\lceil\\frac{\\Delta}{2}\\rceil+1$ edge slopes suffice for drawings of general graphs, improving on the previous bound of $\\Delta+1$. Furthermore, we improve previous upper bounds on the number of slop","authors_text":"Bartosz Walczak, Kolja Knauer","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-14T17:04:54Z","title":"Graph drawings with one bend and few slopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04423","kind":"arxiv","version":2},"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:0bdfde3a19bdd5f0e6e312da8bdb7e4f86bb2ec750b73b4a7039d57c2369253d","target":"record","created_at":"2026-05-18T01:32:00Z","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":"4206d01bde1c97ae568548ec47dc830b61f0688b09a9fbbca32f7f8a32a679ef","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-14T17:04:54Z","title_canon_sha256":"bdd67566733034b87184067b9a42b9249217abf2a4c9d057fb16d444ba01c274"},"schema_version":"1.0","source":{"id":"1506.04423","kind":"arxiv","version":2}},"canonical_sha256":"d0d7166e8132725000890886f37bbc8067d524823f4414540b0875ca2c291ab5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0d7166e8132725000890886f37bbc8067d524823f4414540b0875ca2c291ab5","first_computed_at":"2026-05-18T01:32:00.376832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:00.376832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"USidrm3Ezo0N0SL/TNqQIGEQm4wVccaGN0f58KkBUggPABygMl8QVgzeqgLsmO3ghAYeCNiGBybRqTnsGLMlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:00.377389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04423","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bdfde3a19bdd5f0e6e312da8bdb7e4f86bb2ec750b73b4a7039d57c2369253d","sha256:3ee20bd0aefe0d663e005d4da0e9aeb8ec27968344ae263113e9d02e68a32f52"],"state_sha256":"ccc414c0982659a2799492f2f995cd811cb501124655df39f1683b96d3f753f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uABgichcsNBGjEa9S5QVOYHna5ReSEWXb/vmS+hbR/CURnYKyPEvSpdhQmGB9XbCiuWgd7AdSxJA7B8AC8VBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:21:41.274629Z","bundle_sha256":"f880936a13335e6dbd9c60cf9d7992c013d49cbe4507467fc4ec382162e852f6"}}