{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4HXNFEXVJAPN5BGXHL2BE277Y2","short_pith_number":"pith:4HXNFEXV","schema_version":"1.0","canonical_sha256":"e1eed292f5481ede84d73af4126bffc6851ff359b74665e73940b872ccc0c9f9","source":{"kind":"arxiv","id":"1608.08425","version":1},"attestation_state":"computed","paper":{"title":"1-bend Upward Planar Drawings of SP-digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta","submitted_at":"2016-08-30T12:40:40Z","abstract_excerpt":"It is proved that every series-parallel digraph whose maximum vertex-degree is $\\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\\Delta$ distinct slopes. This is shown to be worst-case optimal in terms of the number of slopes. Furthermore, our construction gives rise to drawings with optimal angular resolution $\\frac{\\pi}{\\Delta}$. A variant of the proof technique is used to show that (non-directed) reduced series-parallel graphs and flat series-parallel graphs have a (non-upward) one-bend planar drawing with $\\lceil\\frac{\\Delta}{2}"},"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":"1608.08425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-30T12:40:40Z","cross_cats_sorted":[],"title_canon_sha256":"534985e7c98c6083d3bb9a7dc4beca6ef54debe5a3c7a689f37e923554f93fdb","abstract_canon_sha256":"e856b83158f2f5dd74259af1ee0d48fda4f71fa11faecbef62678d26ed2ec3b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:18.154784Z","signature_b64":"DZhjgOSjDbQLxi1em7h/iQCQZbpQQ6+wnKGK13aK9o89mrI9DuClP3GFo4WuEn1fHwfe3IJrzKP3S1TaFuwsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1eed292f5481ede84d73af4126bffc6851ff359b74665e73940b872ccc0c9f9","last_reissued_at":"2026-05-18T01:07:18.154328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:18.154328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-bend Upward Planar Drawings of SP-digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta","submitted_at":"2016-08-30T12:40:40Z","abstract_excerpt":"It is proved that every series-parallel digraph whose maximum vertex-degree is $\\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\\Delta$ distinct slopes. This is shown to be worst-case optimal in terms of the number of slopes. Furthermore, our construction gives rise to drawings with optimal angular resolution $\\frac{\\pi}{\\Delta}$. A variant of the proof technique is used to show that (non-directed) reduced series-parallel graphs and flat series-parallel graphs have a (non-upward) one-bend planar drawing with $\\lceil\\frac{\\Delta}{2}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08425","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":"1608.08425","created_at":"2026-05-18T01:07:18.154409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08425v1","created_at":"2026-05-18T01:07:18.154409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08425","created_at":"2026-05-18T01:07:18.154409+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HXNFEXVJAPN","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HXNFEXVJAPN5BGX","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HXNFEXV","created_at":"2026-05-18T12:29:58.707656+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/4HXNFEXVJAPN5BGXHL2BE277Y2","json":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2.json","graph_json":"https://pith.science/api/pith-number/4HXNFEXVJAPN5BGXHL2BE277Y2/graph.json","events_json":"https://pith.science/api/pith-number/4HXNFEXVJAPN5BGXHL2BE277Y2/events.json","paper":"https://pith.science/paper/4HXNFEXV"},"agent_actions":{"view_html":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2","download_json":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2.json","view_paper":"https://pith.science/paper/4HXNFEXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08425&json=true","fetch_graph":"https://pith.science/api/pith-number/4HXNFEXVJAPN5BGXHL2BE277Y2/graph.json","fetch_events":"https://pith.science/api/pith-number/4HXNFEXVJAPN5BGXHL2BE277Y2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2/action/storage_attestation","attest_author":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2/action/author_attestation","sign_citation":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2/action/citation_signature","submit_replication":"https://pith.science/pith/4HXNFEXVJAPN5BGXHL2BE277Y2/action/replication_record"}},"created_at":"2026-05-18T01:07:18.154409+00:00","updated_at":"2026-05-18T01:07:18.154409+00:00"}