{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LJ6H3XPM32U4HRZAMPA7ZTNEAU","short_pith_number":"pith:LJ6H3XPM","schema_version":"1.0","canonical_sha256":"5a7c7dddecdea9c3c72063c1fccda40538adc6a988a7d9a8eeabf6a09cd2e74a","source":{"kind":"arxiv","id":"1808.10470","version":1},"attestation_state":"computed","paper":{"title":"On RAC Drawings of Graphs with one Bend per Edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henry F\\\"orster, Michael A. Bekos, Michael Kaufmann, Patrizio Angelini","submitted_at":"2018-08-30T18:05:26Z","abstract_excerpt":"A k-bend right-angle-crossing drawing or (k-bend RAC drawing}, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing points of the edges are 90 degrees. Accordingly, a graph that admits a k-bend RAC drawing is referred to as k-bend right-angle-crossing graph (or k-bend RAC, for short).\n  In this paper, we continue the study of the maximum edge-density of 1-bend RAC graphs. We show that an n-vertex 1-bend RAC graph cannot have more than $5.5n-O(1)$ edges. We also demonstrate that there exist infinitely many n-vertex 1-bend RAC grap"},"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.10470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T18:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"738dce6e12c96ae2a9d4ba9e753feec5b954b2e38383e4ec95e0aa2f06409189","abstract_canon_sha256":"4b862f0a7a192b7be4189b637309c35813870dc7a97cb0c4dda5c5e3e5596c6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:45.593686Z","signature_b64":"eqIBU+Ks8wLmE+ZI5bYQogAPIz5euv9ZNdINvIxNBTxP3PKg8HTgkW3dArGUgxOCNY6RVP5Qnbf7DB/nLkWVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7c7dddecdea9c3c72063c1fccda40538adc6a988a7d9a8eeabf6a09cd2e74a","last_reissued_at":"2026-05-18T00:06:45.593147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:45.593147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On RAC Drawings of Graphs with one Bend per Edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henry F\\\"orster, Michael A. Bekos, Michael Kaufmann, Patrizio Angelini","submitted_at":"2018-08-30T18:05:26Z","abstract_excerpt":"A k-bend right-angle-crossing drawing or (k-bend RAC drawing}, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing points of the edges are 90 degrees. Accordingly, a graph that admits a k-bend RAC drawing is referred to as k-bend right-angle-crossing graph (or k-bend RAC, for short).\n  In this paper, we continue the study of the maximum edge-density of 1-bend RAC graphs. We show that an n-vertex 1-bend RAC graph cannot have more than $5.5n-O(1)$ edges. We also demonstrate that there exist infinitely many n-vertex 1-bend RAC grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10470","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.10470","created_at":"2026-05-18T00:06:45.593239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10470v1","created_at":"2026-05-18T00:06:45.593239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10470","created_at":"2026-05-18T00:06:45.593239+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ6H3XPM32U4","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ6H3XPM32U4HRZA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ6H3XPM","created_at":"2026-05-18T12:32:37.024351+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/LJ6H3XPM32U4HRZAMPA7ZTNEAU","json":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU.json","graph_json":"https://pith.science/api/pith-number/LJ6H3XPM32U4HRZAMPA7ZTNEAU/graph.json","events_json":"https://pith.science/api/pith-number/LJ6H3XPM32U4HRZAMPA7ZTNEAU/events.json","paper":"https://pith.science/paper/LJ6H3XPM"},"agent_actions":{"view_html":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU","download_json":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU.json","view_paper":"https://pith.science/paper/LJ6H3XPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10470&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ6H3XPM32U4HRZAMPA7ZTNEAU/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ6H3XPM32U4HRZAMPA7ZTNEAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU/action/storage_attestation","attest_author":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU/action/author_attestation","sign_citation":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU/action/citation_signature","submit_replication":"https://pith.science/pith/LJ6H3XPM32U4HRZAMPA7ZTNEAU/action/replication_record"}},"created_at":"2026-05-18T00:06:45.593239+00:00","updated_at":"2026-05-18T00:06:45.593239+00:00"}