{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HX7SBA6VGD26CSFKDUBHVUAKCX","short_pith_number":"pith:HX7SBA6V","schema_version":"1.0","canonical_sha256":"3dff2083d530f5e148aa1d027ad00a15d383065467e3e9b7f51ab6b133194468","source":{"kind":"arxiv","id":"1605.08066","version":2},"attestation_state":"computed","paper":{"title":"Edge complexity of geometric graphs on convex independent point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Abhijeet Khopkar","submitted_at":"2016-05-24T19:01:54Z","abstract_excerpt":"In this paper, we focus on a generalised version of Gabriel graphs known as Locally Gabriel graphs ($LGGs$) and Unit distance graphs ($UDGs$) on convexly independent point sets. $UDGs$ are sub graphs of $LGGs$. We give a simpler proof for the claim that $LGGs$ on convex independent point sets have $2n \\log n + O(n)$ edges. Then we prove that unit distance graphs on convex independent point sets have $O(n)$ edges improving the previous known bound of $O(n \\log n)$."},"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":"1605.08066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-24T19:01:54Z","cross_cats_sorted":[],"title_canon_sha256":"79e5eb1ef546443287a831dbaf6e63481a3aa37f1d7506bf24f5470f7d7a03e2","abstract_canon_sha256":"0096480c6b996c56d2fa59c1710bb07af9e8a8236083dcc06a2cee7ae8ec6108"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:02.643766Z","signature_b64":"gc9BNENaXM+O6rORcm/d6s2qXPpRHbd47X/j3pcghVRXKxUIfYp2ApaMV733TQOTXEqKMvjT3sWCRJ6oSqByDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dff2083d530f5e148aa1d027ad00a15d383065467e3e9b7f51ab6b133194468","last_reissued_at":"2026-05-18T00:46:02.643139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:02.643139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge complexity of geometric graphs on convex independent point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Abhijeet Khopkar","submitted_at":"2016-05-24T19:01:54Z","abstract_excerpt":"In this paper, we focus on a generalised version of Gabriel graphs known as Locally Gabriel graphs ($LGGs$) and Unit distance graphs ($UDGs$) on convexly independent point sets. $UDGs$ are sub graphs of $LGGs$. We give a simpler proof for the claim that $LGGs$ on convex independent point sets have $2n \\log n + O(n)$ edges. Then we prove that unit distance graphs on convex independent point sets have $O(n)$ edges improving the previous known bound of $O(n \\log n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08066","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":"1605.08066","created_at":"2026-05-18T00:46:02.643220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08066v2","created_at":"2026-05-18T00:46:02.643220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08066","created_at":"2026-05-18T00:46:02.643220+00:00"},{"alias_kind":"pith_short_12","alias_value":"HX7SBA6VGD26","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HX7SBA6VGD26CSFK","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HX7SBA6V","created_at":"2026-05-18T12:30:22.444734+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/HX7SBA6VGD26CSFKDUBHVUAKCX","json":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX.json","graph_json":"https://pith.science/api/pith-number/HX7SBA6VGD26CSFKDUBHVUAKCX/graph.json","events_json":"https://pith.science/api/pith-number/HX7SBA6VGD26CSFKDUBHVUAKCX/events.json","paper":"https://pith.science/paper/HX7SBA6V"},"agent_actions":{"view_html":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX","download_json":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX.json","view_paper":"https://pith.science/paper/HX7SBA6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08066&json=true","fetch_graph":"https://pith.science/api/pith-number/HX7SBA6VGD26CSFKDUBHVUAKCX/graph.json","fetch_events":"https://pith.science/api/pith-number/HX7SBA6VGD26CSFKDUBHVUAKCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX/action/storage_attestation","attest_author":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX/action/author_attestation","sign_citation":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX/action/citation_signature","submit_replication":"https://pith.science/pith/HX7SBA6VGD26CSFKDUBHVUAKCX/action/replication_record"}},"created_at":"2026-05-18T00:46:02.643220+00:00","updated_at":"2026-05-18T00:46:02.643220+00:00"}