{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RMX4UWNGSXMZPNYUSG4GLOLF2Q","short_pith_number":"pith:RMX4UWNG","canonical_record":{"source":{"id":"1003.3700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-19T02:04:05Z","cross_cats_sorted":["cond-mat.dis-nn","stat.ME"],"title_canon_sha256":"f40e440b9aff994037f974c60653f52c50c82e707676a38293caae3148010097","abstract_canon_sha256":"482c71a8aa7ed76620e40fdc6e3cb9a271b3cfbd9942a5e39e0c566a64003e76"},"schema_version":"1.0"},"canonical_sha256":"8b2fca59a695d997b71491b865b965d4017a769ba385fbac367bc58978f859a4","source":{"kind":"arxiv","id":"1003.3700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3700","created_at":"2026-05-18T04:32:01Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3700v2","created_at":"2026-05-18T04:32:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3700","created_at":"2026-05-18T04:32:01Z"},{"alias_kind":"pith_short_12","alias_value":"RMX4UWNGSXMZ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RMX4UWNGSXMZPNYU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RMX4UWNG","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RMX4UWNGSXMZPNYUSG4GLOLF2Q","target":"record","payload":{"canonical_record":{"source":{"id":"1003.3700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-19T02:04:05Z","cross_cats_sorted":["cond-mat.dis-nn","stat.ME"],"title_canon_sha256":"f40e440b9aff994037f974c60653f52c50c82e707676a38293caae3148010097","abstract_canon_sha256":"482c71a8aa7ed76620e40fdc6e3cb9a271b3cfbd9942a5e39e0c566a64003e76"},"schema_version":"1.0"},"canonical_sha256":"8b2fca59a695d997b71491b865b965d4017a769ba385fbac367bc58978f859a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:01.775926Z","signature_b64":"taPJnLRRGIfEXDiVhsIkV2GzSr3eQjG+6UKgFpMPhSfpYPRhCPxdYzXN1Yvnsyehsie6Y7TgwXkbBqyH1DKABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b2fca59a695d997b71491b865b965d4017a769ba385fbac367bc58978f859a4","last_reissued_at":"2026-05-18T04:32:01.775476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:01.775476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.3700","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-18T04:32:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YtBX74NDtlkH4ADG5eqS/+xOcPE6HaeXa+qWmG+wmoKfcfiqh0vAwPFbVI6RyUnxgT/chcz0ErFJHA+BXR8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:57.985987Z"},"content_sha256":"14fc77bb21552380dfc1ef6bacd781bfb1bed5877d2f0c61e4bb070057bd8d0b","schema_version":"1.0","event_id":"sha256:14fc77bb21552380dfc1ef6bacd781bfb1bed5877d2f0c61e4bb070057bd8d0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RMX4UWNGSXMZPNYUSG4GLOLF2Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected Spatial Networks over Random Points and a Route-Length Statistic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","stat.ME"],"primary_cat":"math.PR","authors_text":"David J. Aldous, Julian Shun","submitted_at":"2010-03-19T02:04:05Z","abstract_excerpt":"We review mathematically tractable models for connected networks on random points in the plane, emphasizing the class of proximity graphs which deserves to be better known to applied probabilists and statisticians. We introduce and motivate a particular statistic $R$ measuring shortness of routes in a network. We illustrate, via Monte Carlo in part, the trade-off between normalized network length and $R$ in a one-parameter family of proximity graphs. How close this family comes to the optimal trade-off over all possible networks remains an intriguing open question. The paper is a write-up of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3700","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-18T04:32:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIkhOxEFmGk9ajG4bJSykpu5VRA5Z2XW4t3OEgkXZaPxEP4SRuXD9UBqWaIaz4rlm7QE/sbN93Bo/Mz4FUr5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:57.986599Z"},"content_sha256":"9f22ee11e1414141c4453013549eafc869eb64a53cc85c60c7ad8fb912df4428","schema_version":"1.0","event_id":"sha256:9f22ee11e1414141c4453013549eafc869eb64a53cc85c60c7ad8fb912df4428"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMX4UWNGSXMZPNYUSG4GLOLF2Q/bundle.json","state_url":"https://pith.science/pith/RMX4UWNGSXMZPNYUSG4GLOLF2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMX4UWNGSXMZPNYUSG4GLOLF2Q/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-27T22:16:57Z","links":{"resolver":"https://pith.science/pith/RMX4UWNGSXMZPNYUSG4GLOLF2Q","bundle":"https://pith.science/pith/RMX4UWNGSXMZPNYUSG4GLOLF2Q/bundle.json","state":"https://pith.science/pith/RMX4UWNGSXMZPNYUSG4GLOLF2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMX4UWNGSXMZPNYUSG4GLOLF2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RMX4UWNGSXMZPNYUSG4GLOLF2Q","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":"482c71a8aa7ed76620e40fdc6e3cb9a271b3cfbd9942a5e39e0c566a64003e76","cross_cats_sorted":["cond-mat.dis-nn","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-19T02:04:05Z","title_canon_sha256":"f40e440b9aff994037f974c60653f52c50c82e707676a38293caae3148010097"},"schema_version":"1.0","source":{"id":"1003.3700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3700","created_at":"2026-05-18T04:32:01Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3700v2","created_at":"2026-05-18T04:32:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3700","created_at":"2026-05-18T04:32:01Z"},{"alias_kind":"pith_short_12","alias_value":"RMX4UWNGSXMZ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RMX4UWNGSXMZPNYU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RMX4UWNG","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:9f22ee11e1414141c4453013549eafc869eb64a53cc85c60c7ad8fb912df4428","target":"graph","created_at":"2026-05-18T04:32:01Z","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":"We review mathematically tractable models for connected networks on random points in the plane, emphasizing the class of proximity graphs which deserves to be better known to applied probabilists and statisticians. We introduce and motivate a particular statistic $R$ measuring shortness of routes in a network. We illustrate, via Monte Carlo in part, the trade-off between normalized network length and $R$ in a one-parameter family of proximity graphs. How close this family comes to the optimal trade-off over all possible networks remains an intriguing open question. The paper is a write-up of a","authors_text":"David J. Aldous, Julian Shun","cross_cats":["cond-mat.dis-nn","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-19T02:04:05Z","title":"Connected Spatial Networks over Random Points and a Route-Length Statistic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3700","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:14fc77bb21552380dfc1ef6bacd781bfb1bed5877d2f0c61e4bb070057bd8d0b","target":"record","created_at":"2026-05-18T04:32:01Z","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":"482c71a8aa7ed76620e40fdc6e3cb9a271b3cfbd9942a5e39e0c566a64003e76","cross_cats_sorted":["cond-mat.dis-nn","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-19T02:04:05Z","title_canon_sha256":"f40e440b9aff994037f974c60653f52c50c82e707676a38293caae3148010097"},"schema_version":"1.0","source":{"id":"1003.3700","kind":"arxiv","version":2}},"canonical_sha256":"8b2fca59a695d997b71491b865b965d4017a769ba385fbac367bc58978f859a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b2fca59a695d997b71491b865b965d4017a769ba385fbac367bc58978f859a4","first_computed_at":"2026-05-18T04:32:01.775476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:01.775476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"taPJnLRRGIfEXDiVhsIkV2GzSr3eQjG+6UKgFpMPhSfpYPRhCPxdYzXN1Yvnsyehsie6Y7TgwXkbBqyH1DKABg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:01.775926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.3700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14fc77bb21552380dfc1ef6bacd781bfb1bed5877d2f0c61e4bb070057bd8d0b","sha256:9f22ee11e1414141c4453013549eafc869eb64a53cc85c60c7ad8fb912df4428"],"state_sha256":"b95382a12f831eb092dcb893c798c37aeba49c65295ba7a46f43b05342f7a877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbw6muNtPxDhxG0Ct6xh2RIjOzHfI7WkZCgUTD9FL0Urkolx3bJQEYDeRKS1iQ5/mQng1mPX6cFI6Hr9VruBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:16:57.988938Z","bundle_sha256":"afc2bb3b9c536674ace3ce10c8e8d62fd867c51dc6fb39eb28a8821cfed26bd4"}}