{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MJR2PZCOSPQYMKJD7RVF4I4TTC","short_pith_number":"pith:MJR2PZCO","schema_version":"1.0","canonical_sha256":"6263a7e44e93e1862923fc6a5e2393988d9ae8f6a8658a52168db64f431778d0","source":{"kind":"arxiv","id":"0908.3545","version":2},"attestation_state":"computed","paper":{"title":"Notes on large angle crossing graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Joachim Gudmundsson, Pat Morin, Thomas Wolle, Vida Dujmovic","submitted_at":"2009-08-25T06:21:41Z","abstract_excerpt":"A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al. It was shown that any RAC graph with n vertices has at most 4n-10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n-10 edges. In this paper, we give upper and lower bounds for the number of edges in aAC graphs for all 0 < a < Pi/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":"0908.3545","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-25T06:21:41Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"96ca2525f63cc093efb070e546ec922b86873d8bc8a98e2f41edf3931c360a5c","abstract_canon_sha256":"2b9492254bd2014a072fcaff4d5337a14dce48c9891fe81845847345d5fbc8bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:31.219963Z","signature_b64":"siJraKbPN7ecWmx9/kyNTmNkCnf+DxNhf1VVvWtgFP7jBpNvX6XCvGbfINcpt44Z2YulE4CPpg5qjREUHevRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6263a7e44e93e1862923fc6a5e2393988d9ae8f6a8658a52168db64f431778d0","last_reissued_at":"2026-05-18T03:31:31.219310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:31.219310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Notes on large angle crossing graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Joachim Gudmundsson, Pat Morin, Thomas Wolle, Vida Dujmovic","submitted_at":"2009-08-25T06:21:41Z","abstract_excerpt":"A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al. It was shown that any RAC graph with n vertices has at most 4n-10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n-10 edges. In this paper, we give upper and lower bounds for the number of edges in aAC graphs for all 0 < a < Pi/2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3545","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0908.3545","created_at":"2026-05-18T03:31:31.219412+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3545v2","created_at":"2026-05-18T03:31:31.219412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3545","created_at":"2026-05-18T03:31:31.219412+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJR2PZCOSPQY","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJR2PZCOSPQYMKJD","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJR2PZCO","created_at":"2026-05-18T12:26:00.592388+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/MJR2PZCOSPQYMKJD7RVF4I4TTC","json":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC.json","graph_json":"https://pith.science/api/pith-number/MJR2PZCOSPQYMKJD7RVF4I4TTC/graph.json","events_json":"https://pith.science/api/pith-number/MJR2PZCOSPQYMKJD7RVF4I4TTC/events.json","paper":"https://pith.science/paper/MJR2PZCO"},"agent_actions":{"view_html":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC","download_json":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC.json","view_paper":"https://pith.science/paper/MJR2PZCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3545&json=true","fetch_graph":"https://pith.science/api/pith-number/MJR2PZCOSPQYMKJD7RVF4I4TTC/graph.json","fetch_events":"https://pith.science/api/pith-number/MJR2PZCOSPQYMKJD7RVF4I4TTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/action/storage_attestation","attest_author":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/action/author_attestation","sign_citation":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/action/citation_signature","submit_replication":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/action/replication_record"}},"created_at":"2026-05-18T03:31:31.219412+00:00","updated_at":"2026-05-18T03:31:31.219412+00:00"}