{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WZZFZKV654SVAJMQQSMFRGMWCH","short_pith_number":"pith:WZZFZKV6","schema_version":"1.0","canonical_sha256":"b6725caabeef25502590849858999611e62ab962574a8343edeec42210e9f334","source":{"kind":"arxiv","id":"1304.3402","version":1},"attestation_state":"computed","paper":{"title":"On the Average Number of Edges in Theta Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Pat Morin, Sander Verdonschot","submitted_at":"2013-04-11T19:21:51Z","abstract_excerpt":"Theta graphs are important geometric graphs that have many applications, including wireless networking, motion planning, real-time animation, and minimum-spanning tree construction. We give closed form expressions for the average degree of theta graphs of a homogeneous Poisson point process over the plane. We then show that essentially the same bounds---with vanishing error terms---hold for theta graphs of finite sets of points that are uniformly distributed in a square. Finally, we show that the number of edges in a theta graph of points uniformly distributed in a square is concentrated aroun"},"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":"1304.3402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-11T19:21:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e45d0fcadba31adabc755e3013736e037b99fecd9a1a6bdf78a4600db9d9ac41","abstract_canon_sha256":"bd21fe420333a219a5237f329d763ac8710f6f5379cfe837004065c2b7de9c3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.863893Z","signature_b64":"guckkCP0O+reQUNYJCU7KNKYkGTxkci+JbfKQZiy6RhY60aGhUTaxopRwL+KEYG2Rn7znDSi0A3yulCpv8wPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6725caabeef25502590849858999611e62ab962574a8343edeec42210e9f334","last_reissued_at":"2026-05-18T03:28:17.863249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.863249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Average Number of Edges in Theta Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Pat Morin, Sander Verdonschot","submitted_at":"2013-04-11T19:21:51Z","abstract_excerpt":"Theta graphs are important geometric graphs that have many applications, including wireless networking, motion planning, real-time animation, and minimum-spanning tree construction. We give closed form expressions for the average degree of theta graphs of a homogeneous Poisson point process over the plane. We then show that essentially the same bounds---with vanishing error terms---hold for theta graphs of finite sets of points that are uniformly distributed in a square. Finally, we show that the number of edges in a theta graph of points uniformly distributed in a square is concentrated aroun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3402","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":"1304.3402","created_at":"2026-05-18T03:28:17.863363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3402v1","created_at":"2026-05-18T03:28:17.863363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3402","created_at":"2026-05-18T03:28:17.863363+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZZFZKV654SV","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZZFZKV654SVAJMQ","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZZFZKV6","created_at":"2026-05-18T12:28:06.772260+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/WZZFZKV654SVAJMQQSMFRGMWCH","json":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH.json","graph_json":"https://pith.science/api/pith-number/WZZFZKV654SVAJMQQSMFRGMWCH/graph.json","events_json":"https://pith.science/api/pith-number/WZZFZKV654SVAJMQQSMFRGMWCH/events.json","paper":"https://pith.science/paper/WZZFZKV6"},"agent_actions":{"view_html":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH","download_json":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH.json","view_paper":"https://pith.science/paper/WZZFZKV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3402&json=true","fetch_graph":"https://pith.science/api/pith-number/WZZFZKV654SVAJMQQSMFRGMWCH/graph.json","fetch_events":"https://pith.science/api/pith-number/WZZFZKV654SVAJMQQSMFRGMWCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/action/storage_attestation","attest_author":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/action/author_attestation","sign_citation":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/action/citation_signature","submit_replication":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/action/replication_record"}},"created_at":"2026-05-18T03:28:17.863363+00:00","updated_at":"2026-05-18T03:28:17.863363+00:00"}