{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:MJR2PZCOSPQYMKJD7RVF4I4TTC","short_pith_number":"pith:MJR2PZCO","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"},"canonical_sha256":"6263a7e44e93e1862923fc6a5e2393988d9ae8f6a8658a52168db64f431778d0","source":{"kind":"arxiv","id":"0908.3545","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.3545","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"0908.3545v2","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3545","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"MJR2PZCOSPQY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MJR2PZCOSPQYMKJD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MJR2PZCO","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:MJR2PZCOSPQYMKJD7RVF4I4TTC","target":"record","payload":{"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"},"canonical_sha256":"6263a7e44e93e1862923fc6a5e2393988d9ae8f6a8658a52168db64f431778d0","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"},"source_kind":"arxiv","source_id":"0908.3545","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-18T03:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PbKAY8xDoJuwKuFpNl8EzU5TGoJrUjqpjb9M8IY5kjNeRH6TKHR6HRi56XlPfoa1718hKSI4EfftI62Cc2PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:54:04.876445Z"},"content_sha256":"da01a0e7a92bdf1aacca7bc0a1a85af14d07f76bd32c1dbe386ad697bbef8bb8","schema_version":"1.0","event_id":"sha256:da01a0e7a92bdf1aacca7bc0a1a85af14d07f76bd32c1dbe386ad697bbef8bb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:MJR2PZCOSPQYMKJD7RVF4I4TTC","target":"graph","payload":{"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"},"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-18T03:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0j526KBhV8+Mh3BQkn7qwoaFe7pR/dKV1NdxMup3I4B9FLuOigtbrAqWorSobBF5ZKk53j5ksExJIgtNg+2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:54:04.876806Z"},"content_sha256":"0f0e5daa494573b94d65bace177110740bdd06b9f80d1e8f7cb2c8dae8e81145","schema_version":"1.0","event_id":"sha256:0f0e5daa494573b94d65bace177110740bdd06b9f80d1e8f7cb2c8dae8e81145"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/bundle.json","state_url":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/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-26T18:54:04Z","links":{"resolver":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC","bundle":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/bundle.json","state":"https://pith.science/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJR2PZCOSPQYMKJD7RVF4I4TTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:MJR2PZCOSPQYMKJD7RVF4I4TTC","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":"2b9492254bd2014a072fcaff4d5337a14dce48c9891fe81845847345d5fbc8bf","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-25T06:21:41Z","title_canon_sha256":"96ca2525f63cc093efb070e546ec922b86873d8bc8a98e2f41edf3931c360a5c"},"schema_version":"1.0","source":{"id":"0908.3545","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.3545","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"0908.3545v2","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3545","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"MJR2PZCOSPQY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MJR2PZCOSPQYMKJD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MJR2PZCO","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:0f0e5daa494573b94d65bace177110740bdd06b9f80d1e8f7cb2c8dae8e81145","target":"graph","created_at":"2026-05-18T03:31:31Z","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":"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.","authors_text":"Joachim Gudmundsson, Pat Morin, Thomas Wolle, Vida Dujmovic","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-25T06:21:41Z","title":"Notes on large angle crossing graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3545","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:da01a0e7a92bdf1aacca7bc0a1a85af14d07f76bd32c1dbe386ad697bbef8bb8","target":"record","created_at":"2026-05-18T03:31:31Z","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":"2b9492254bd2014a072fcaff4d5337a14dce48c9891fe81845847345d5fbc8bf","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-25T06:21:41Z","title_canon_sha256":"96ca2525f63cc093efb070e546ec922b86873d8bc8a98e2f41edf3931c360a5c"},"schema_version":"1.0","source":{"id":"0908.3545","kind":"arxiv","version":2}},"canonical_sha256":"6263a7e44e93e1862923fc6a5e2393988d9ae8f6a8658a52168db64f431778d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6263a7e44e93e1862923fc6a5e2393988d9ae8f6a8658a52168db64f431778d0","first_computed_at":"2026-05-18T03:31:31.219310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:31.219310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"siJraKbPN7ecWmx9/kyNTmNkCnf+DxNhf1VVvWtgFP7jBpNvX6XCvGbfINcpt44Z2YulE4CPpg5qjREUHevRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:31.219963Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.3545","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da01a0e7a92bdf1aacca7bc0a1a85af14d07f76bd32c1dbe386ad697bbef8bb8","sha256:0f0e5daa494573b94d65bace177110740bdd06b9f80d1e8f7cb2c8dae8e81145"],"state_sha256":"f771b0396386f3229df82aca91fd4c55e0df70def1264ac9c0a8937c10e47b76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJC1OivNdgxmgXfacSsLwA7gJOzuJL/vLxS34Kn2QsMEn0Z0MmCjhpSqdAjAZHWMbafAsgE7nHXy0OSQ1NiYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:54:04.879487Z","bundle_sha256":"42df620d659d00606672f158901f9a21ee64d6da83d516aaa172aa9663ce3ff9"}}