{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WZZFZKV654SVAJMQQSMFRGMWCH","short_pith_number":"pith:WZZFZKV6","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"},"canonical_sha256":"b6725caabeef25502590849858999611e62ab962574a8343edeec42210e9f334","source":{"kind":"arxiv","id":"1304.3402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3402","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3402v1","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3402","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"WZZFZKV654SV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZZFZKV654SVAJMQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZZFZKV6","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WZZFZKV654SVAJMQQSMFRGMWCH","target":"record","payload":{"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"},"canonical_sha256":"b6725caabeef25502590849858999611e62ab962574a8343edeec42210e9f334","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"},"source_kind":"arxiv","source_id":"1304.3402","source_version":1,"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:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+11l3M/jU6ekCIpF/SlHXsKze/6udexZ3QWq10c7Adyalhdund7DmruYCbEvGqlPmAA/9YrQaTHwoY5grWWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:08:35.159284Z"},"content_sha256":"3497fb25afd858dceea7a8779a83866971df7a37dca6729efd660b6a6a9b5946","schema_version":"1.0","event_id":"sha256:3497fb25afd858dceea7a8779a83866971df7a37dca6729efd660b6a6a9b5946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WZZFZKV654SVAJMQQSMFRGMWCH","target":"graph","payload":{"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"},"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:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WvgyUMeNyhPNeH4qck7eKFm/r9cJyxa3fJKYRaX0321a7Ck2GFBb94okMMOyYoOTCKC2vhy4thHwmlDEUuaJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:08:35.159934Z"},"content_sha256":"f389ada98568e6727e963b2892ad07e1abea6c43bf5905339587b0f3f3f0c1d9","schema_version":"1.0","event_id":"sha256:f389ada98568e6727e963b2892ad07e1abea6c43bf5905339587b0f3f3f0c1d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/bundle.json","state_url":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZZFZKV654SVAJMQQSMFRGMWCH/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-06-09T19:08:35Z","links":{"resolver":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH","bundle":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/bundle.json","state":"https://pith.science/pith/WZZFZKV654SVAJMQQSMFRGMWCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZZFZKV654SVAJMQQSMFRGMWCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WZZFZKV654SVAJMQQSMFRGMWCH","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":"bd21fe420333a219a5237f329d763ac8710f6f5379cfe837004065c2b7de9c3b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-11T19:21:51Z","title_canon_sha256":"e45d0fcadba31adabc755e3013736e037b99fecd9a1a6bdf78a4600db9d9ac41"},"schema_version":"1.0","source":{"id":"1304.3402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3402","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3402v1","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3402","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"WZZFZKV654SV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZZFZKV654SVAJMQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZZFZKV6","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:f389ada98568e6727e963b2892ad07e1abea6c43bf5905339587b0f3f3f0c1d9","target":"graph","created_at":"2026-05-18T03:28:17Z","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":"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","authors_text":"Pat Morin, Sander Verdonschot","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-11T19:21:51Z","title":"On the Average Number of Edges in Theta Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3402","kind":"arxiv","version":1},"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:3497fb25afd858dceea7a8779a83866971df7a37dca6729efd660b6a6a9b5946","target":"record","created_at":"2026-05-18T03:28:17Z","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":"bd21fe420333a219a5237f329d763ac8710f6f5379cfe837004065c2b7de9c3b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-11T19:21:51Z","title_canon_sha256":"e45d0fcadba31adabc755e3013736e037b99fecd9a1a6bdf78a4600db9d9ac41"},"schema_version":"1.0","source":{"id":"1304.3402","kind":"arxiv","version":1}},"canonical_sha256":"b6725caabeef25502590849858999611e62ab962574a8343edeec42210e9f334","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6725caabeef25502590849858999611e62ab962574a8343edeec42210e9f334","first_computed_at":"2026-05-18T03:28:17.863249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:17.863249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"guckkCP0O+reQUNYJCU7KNKYkGTxkci+JbfKQZiy6RhY60aGhUTaxopRwL+KEYG2Rn7znDSi0A3yulCpv8wPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:17.863893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3497fb25afd858dceea7a8779a83866971df7a37dca6729efd660b6a6a9b5946","sha256:f389ada98568e6727e963b2892ad07e1abea6c43bf5905339587b0f3f3f0c1d9"],"state_sha256":"c00f6586c34ddbb282a57b188f010b52a89367f9db5edcf37f53327c4989aa36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOs4POzxhfI9dA8fY93IxFt3qLccKjYt0dYl/J/Dz6kPsWMPbqRtEEeRMW74IvxeNA2XGNH/KXG1tEiDkFTJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:08:35.162936Z","bundle_sha256":"69b451a06df9cfe6bdc5551320f9e172ca89d00a2eb4fd1a2798ddb9de4233c5"}}