{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UVARV5Q2DQIYPB35TR3GSU4TO6","short_pith_number":"pith:UVARV5Q2","schema_version":"1.0","canonical_sha256":"a5411af61a1c1187877d9c76695393779401349b8603f8e7de2d8a2e005dfcf5","source":{"kind":"arxiv","id":"2411.17565","version":1},"attestation_state":"computed","paper":{"title":"Outer-(ap)RAC Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"F\\\"orster, Giacomo Ortali, Julia Katheder","submitted_at":"2024-11-26T16:27:37Z","abstract_excerpt":"An \\emph{outer-RAC drawing} of a graph is a straight-line drawing where all vertices are incident to the outer cell and all edge crossings occur at a right angle. If additionally, all crossing edges are either horizontal or vertical, we call the drawing \\emph{outer-apRAC} (\\emph{ap} for \\emph{axis-parallel)}. A graph is outer-(ap)RAC if it admits an outer-(ap)RAC drawing. We investigate the class of outer-(ap)RAC graphs. We show that the outer-RAC graphs are a proper subset of~the planar graphs with at most $2.5n-4$ edges where $n$ is the number of vertices. This density bound is tight, even f"},"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":"2411.17565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-26T16:27:37Z","cross_cats_sorted":[],"title_canon_sha256":"db9e37fbfe1bbba59f3629a8e3aaec62c8be7230b0a9fced810d7c6d1c09b331","abstract_canon_sha256":"be1c0bbd06920d00dae37939a1bb00b238f26ec564e7b295abb86f49b8db5f2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:49.053327Z","signature_b64":"5eqcx6Q6hvUATNjBoCoQr2s8CSbqBpq4lkfeDlADBJ2mUK2HHlZgv0C1A3t31lQhE2s6nyRGX4vsZo60OmbjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5411af61a1c1187877d9c76695393779401349b8603f8e7de2d8a2e005dfcf5","last_reissued_at":"2026-07-05T09:40:49.052658Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:49.052658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Outer-(ap)RAC Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"F\\\"orster, Giacomo Ortali, Julia Katheder","submitted_at":"2024-11-26T16:27:37Z","abstract_excerpt":"An \\emph{outer-RAC drawing} of a graph is a straight-line drawing where all vertices are incident to the outer cell and all edge crossings occur at a right angle. If additionally, all crossing edges are either horizontal or vertical, we call the drawing \\emph{outer-apRAC} (\\emph{ap} for \\emph{axis-parallel)}. A graph is outer-(ap)RAC if it admits an outer-(ap)RAC drawing. We investigate the class of outer-(ap)RAC graphs. We show that the outer-RAC graphs are a proper subset of~the planar graphs with at most $2.5n-4$ edges where $n$ is the number of vertices. This density bound is tight, even f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17565","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17565/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.17565","created_at":"2026-07-05T09:40:49.052846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17565v1","created_at":"2026-07-05T09:40:49.052846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17565","created_at":"2026-07-05T09:40:49.052846+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVARV5Q2DQIY","created_at":"2026-07-05T09:40:49.052846+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVARV5Q2DQIYPB35","created_at":"2026-07-05T09:40:49.052846+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVARV5Q2","created_at":"2026-07-05T09:40:49.052846+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/UVARV5Q2DQIYPB35TR3GSU4TO6","json":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6.json","graph_json":"https://pith.science/api/pith-number/UVARV5Q2DQIYPB35TR3GSU4TO6/graph.json","events_json":"https://pith.science/api/pith-number/UVARV5Q2DQIYPB35TR3GSU4TO6/events.json","paper":"https://pith.science/paper/UVARV5Q2"},"agent_actions":{"view_html":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6","download_json":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6.json","view_paper":"https://pith.science/paper/UVARV5Q2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17565&json=true","fetch_graph":"https://pith.science/api/pith-number/UVARV5Q2DQIYPB35TR3GSU4TO6/graph.json","fetch_events":"https://pith.science/api/pith-number/UVARV5Q2DQIYPB35TR3GSU4TO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6/action/storage_attestation","attest_author":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6/action/author_attestation","sign_citation":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6/action/citation_signature","submit_replication":"https://pith.science/pith/UVARV5Q2DQIYPB35TR3GSU4TO6/action/replication_record"}},"created_at":"2026-07-05T09:40:49.052846+00:00","updated_at":"2026-07-05T09:40:49.052846+00:00"}