{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:A6ITDM4IMBOTNHQOHQUBCTPLEG","short_pith_number":"pith:A6ITDM4I","canonical_record":{"source":{"id":"1008.0075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-31T09:03:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2ad3345b4f463bbbcc708b70a6823ca05980c05ad54cb4ad2ce018f13b3423de","abstract_canon_sha256":"031daf7f13ebd1508a8d75d47193724bc91319ffd5c58b3500f60ffafda25aca"},"schema_version":"1.0"},"canonical_sha256":"079131b388605d369e0e3c28114deb21996a423d90154c812d75e5254298d99e","source":{"kind":"arxiv","id":"1008.0075","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0075","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0075v2","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0075","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"A6ITDM4IMBOT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6ITDM4IMBOTNHQO","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6ITDM4I","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:A6ITDM4IMBOTNHQOHQUBCTPLEG","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-31T09:03:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2ad3345b4f463bbbcc708b70a6823ca05980c05ad54cb4ad2ce018f13b3423de","abstract_canon_sha256":"031daf7f13ebd1508a8d75d47193724bc91319ffd5c58b3500f60ffafda25aca"},"schema_version":"1.0"},"canonical_sha256":"079131b388605d369e0e3c28114deb21996a423d90154c812d75e5254298d99e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:54.490993Z","signature_b64":"t9FFZIV1LJnWAq59YBZJMjS5aVFAUkQI+OUb9jLxPzn0DpYnzBUNh2LKAm2Mua0r99L2XP0DKSLPzjpTbxc9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079131b388605d369e0e3c28114deb21996a423d90154c812d75e5254298d99e","last_reissued_at":"2026-05-18T04:32:54.490575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:54.490575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0075","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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKT1gvOziw/u7vr+MGLa1IZLrxFRXOYRkvCLuoYp/A507ZzMtk9v2dpBHvX168SaAh1pc0NCyLqhYqLY8RBrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:08:26.181553Z"},"content_sha256":"77740429d96f3abc0229fd176cc41c4d3447b12dba6d457d1a69f793e10a81bd","schema_version":"1.0","event_id":"sha256:77740429d96f3abc0229fd176cc41c4d3447b12dba6d457d1a69f793e10a81bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:A6ITDM4IMBOTNHQOHQUBCTPLEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mobile Geometric Graphs: Detection, Coverage and Percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Alexandre Stauffer, Alistair Sinclair, Perla Sousi, Yuval Peres","submitted_at":"2010-07-31T09:03:55Z","abstract_excerpt":"We consider the following dynamic Boolean model introduced by van den Berg, Meester and White (1997). At time 0, let the nodes of the graph be a Poisson point process in R^d with constant intensity and let each node move independently according to Brownian motion. At any time t, we put an edge between every pair of nodes if their distance is at most r. We study three features in this model: detection (the time until a target point---fixed or moving---is within distance r from some node of the graph), coverage (the time until all points inside a finite box are detected by the graph), and percol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0075","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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0wCQ4JpeiXVTP/tacik97Rs7fFqM/2rp/uL9Sf0ElvcsMDrPLyH+l5VNf35WHmjKLr+klX5RVUMpINly2iUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:08:26.181897Z"},"content_sha256":"4f59c0a4bfbc89dbb7cb8b4b2b348f46a71f4a2b83e5c9304f9f41af64c6878b","schema_version":"1.0","event_id":"sha256:4f59c0a4bfbc89dbb7cb8b4b2b348f46a71f4a2b83e5c9304f9f41af64c6878b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6ITDM4IMBOTNHQOHQUBCTPLEG/bundle.json","state_url":"https://pith.science/pith/A6ITDM4IMBOTNHQOHQUBCTPLEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6ITDM4IMBOTNHQOHQUBCTPLEG/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-20T20:08:26Z","links":{"resolver":"https://pith.science/pith/A6ITDM4IMBOTNHQOHQUBCTPLEG","bundle":"https://pith.science/pith/A6ITDM4IMBOTNHQOHQUBCTPLEG/bundle.json","state":"https://pith.science/pith/A6ITDM4IMBOTNHQOHQUBCTPLEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6ITDM4IMBOTNHQOHQUBCTPLEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:A6ITDM4IMBOTNHQOHQUBCTPLEG","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":"031daf7f13ebd1508a8d75d47193724bc91319ffd5c58b3500f60ffafda25aca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-31T09:03:55Z","title_canon_sha256":"2ad3345b4f463bbbcc708b70a6823ca05980c05ad54cb4ad2ce018f13b3423de"},"schema_version":"1.0","source":{"id":"1008.0075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0075","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0075v2","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0075","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"A6ITDM4IMBOT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6ITDM4IMBOTNHQO","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6ITDM4I","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:4f59c0a4bfbc89dbb7cb8b4b2b348f46a71f4a2b83e5c9304f9f41af64c6878b","target":"graph","created_at":"2026-05-18T04:32:54Z","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 consider the following dynamic Boolean model introduced by van den Berg, Meester and White (1997). At time 0, let the nodes of the graph be a Poisson point process in R^d with constant intensity and let each node move independently according to Brownian motion. At any time t, we put an edge between every pair of nodes if their distance is at most r. We study three features in this model: detection (the time until a target point---fixed or moving---is within distance r from some node of the graph), coverage (the time until all points inside a finite box are detected by the graph), and percol","authors_text":"Alexandre Stauffer, Alistair Sinclair, Perla Sousi, Yuval Peres","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-31T09:03:55Z","title":"Mobile Geometric Graphs: Detection, Coverage and Percolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0075","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:77740429d96f3abc0229fd176cc41c4d3447b12dba6d457d1a69f793e10a81bd","target":"record","created_at":"2026-05-18T04:32:54Z","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":"031daf7f13ebd1508a8d75d47193724bc91319ffd5c58b3500f60ffafda25aca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-31T09:03:55Z","title_canon_sha256":"2ad3345b4f463bbbcc708b70a6823ca05980c05ad54cb4ad2ce018f13b3423de"},"schema_version":"1.0","source":{"id":"1008.0075","kind":"arxiv","version":2}},"canonical_sha256":"079131b388605d369e0e3c28114deb21996a423d90154c812d75e5254298d99e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"079131b388605d369e0e3c28114deb21996a423d90154c812d75e5254298d99e","first_computed_at":"2026-05-18T04:32:54.490575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:54.490575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9FFZIV1LJnWAq59YBZJMjS5aVFAUkQI+OUb9jLxPzn0DpYnzBUNh2LKAm2Mua0r99L2XP0DKSLPzjpTbxc9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:54.490993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77740429d96f3abc0229fd176cc41c4d3447b12dba6d457d1a69f793e10a81bd","sha256:4f59c0a4bfbc89dbb7cb8b4b2b348f46a71f4a2b83e5c9304f9f41af64c6878b"],"state_sha256":"90d071be4e74691268d7ebd274690f4f9b0dd77bd607877d062a4163e3664c68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RStnI3yXluvIvNu3PCIka6H2aoP51qMeMmcqH4Lf+TWqnldlpUIlWSgOrx8tPQurJeX8U9bRft4H80F2hQF/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:08:26.183779Z","bundle_sha256":"53bbb1a6a420512c02c9af6abe5a63497b70dc9b45cb5aa3b09bf47014e97779"}}