{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GCIO2O3P66OAG3F2HSQ5TIFKTU","short_pith_number":"pith:GCIO2O3P","canonical_record":{"source":{"id":"1104.0338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-02T21:35:02Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"57e4c55e09ffd8fad678fe21677965f709de96c2535e51ca73a512a033fcaa7a","abstract_canon_sha256":"d2bed55c8cfbf5422953ff38ed9a8de2cd795f4fbca08d41dc9ba251d1fd4402"},"schema_version":"1.0"},"canonical_sha256":"3090ed3b6ff79c036cba3ca1d9a0aa9d2187cf272d8c7b1826835126e9ace1f6","source":{"kind":"arxiv","id":"1104.0338","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0338","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0338v2","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0338","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"GCIO2O3P66OA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GCIO2O3P66OAG3F2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GCIO2O3P","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GCIO2O3P66OAG3F2HSQ5TIFKTU","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-02T21:35:02Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"57e4c55e09ffd8fad678fe21677965f709de96c2535e51ca73a512a033fcaa7a","abstract_canon_sha256":"d2bed55c8cfbf5422953ff38ed9a8de2cd795f4fbca08d41dc9ba251d1fd4402"},"schema_version":"1.0"},"canonical_sha256":"3090ed3b6ff79c036cba3ca1d9a0aa9d2187cf272d8c7b1826835126e9ace1f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:15.096306Z","signature_b64":"Xj80kilC3eBg7XIDMmBXOjmJna1cS9GI4M8YQ6QvRFJV6IYGr2e52IYrRD8/c6Tf6DXzgGqL5DQmptXucQajCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3090ed3b6ff79c036cba3ca1d9a0aa9d2187cf272d8c7b1826835126e9ace1f6","last_reissued_at":"2026-05-18T03:30:15.095393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:15.095393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0338","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-18T03:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjCE7IL+q1mn7RXOVLqLrDDoKzeqjsjKWm+BZzvQM6UZSeMKjv//UitSdd5nJp8jvy0dgXJ9HomLnySpLFaEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:54:07.530442Z"},"content_sha256":"8e0ecea85b295e3cdcab4c5e0983e560232e1512bc463a4bf1d1ead5d1c79b39","schema_version":"1.0","event_id":"sha256:8e0ecea85b295e3cdcab4c5e0983e560232e1512bc463a4bf1d1ead5d1c79b39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GCIO2O3P66OAG3F2HSQ5TIFKTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cluster detection in networks using percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Ery Arias-Castro, Geoffrey R. Grimmett","submitted_at":"2011-04-02T21:35:02Z","abstract_excerpt":"We consider the task of detecting a salient cluster in a sensor network, that is, an undirected graph with a random variable attached to each node. Motivated by recent research in environmental statistics and the drive to compete with the reigning scan statistic, we explore alternatives based on the percolative properties of the network. The first method is based on the size of the largest connected component after removing the nodes in the network with a value below a given threshold. The second method is the upper level set scan test introduced by Patil and Taillie [Statist. Sci. 18 (2003) 4"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0338","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-18T03:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Swe0oGjA5qEQxhAPUmIs3kYYrh0cFXRIUsmZx/eCeIUGcsw/CKztMM9VNiH2ypnoA43n6MdIPYyWdgPcnVjKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:54:07.530921Z"},"content_sha256":"c569216c236c50b5d0c85d3fe678bd1c4d62541e7aa6422b113c40c50a08e0cd","schema_version":"1.0","event_id":"sha256:c569216c236c50b5d0c85d3fe678bd1c4d62541e7aa6422b113c40c50a08e0cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCIO2O3P66OAG3F2HSQ5TIFKTU/bundle.json","state_url":"https://pith.science/pith/GCIO2O3P66OAG3F2HSQ5TIFKTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCIO2O3P66OAG3F2HSQ5TIFKTU/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-28T22:54:07Z","links":{"resolver":"https://pith.science/pith/GCIO2O3P66OAG3F2HSQ5TIFKTU","bundle":"https://pith.science/pith/GCIO2O3P66OAG3F2HSQ5TIFKTU/bundle.json","state":"https://pith.science/pith/GCIO2O3P66OAG3F2HSQ5TIFKTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCIO2O3P66OAG3F2HSQ5TIFKTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GCIO2O3P66OAG3F2HSQ5TIFKTU","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":"d2bed55c8cfbf5422953ff38ed9a8de2cd795f4fbca08d41dc9ba251d1fd4402","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-02T21:35:02Z","title_canon_sha256":"57e4c55e09ffd8fad678fe21677965f709de96c2535e51ca73a512a033fcaa7a"},"schema_version":"1.0","source":{"id":"1104.0338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0338","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0338v2","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0338","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"GCIO2O3P66OA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GCIO2O3P66OAG3F2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GCIO2O3P","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:c569216c236c50b5d0c85d3fe678bd1c4d62541e7aa6422b113c40c50a08e0cd","target":"graph","created_at":"2026-05-18T03:30:15Z","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 task of detecting a salient cluster in a sensor network, that is, an undirected graph with a random variable attached to each node. Motivated by recent research in environmental statistics and the drive to compete with the reigning scan statistic, we explore alternatives based on the percolative properties of the network. The first method is based on the size of the largest connected component after removing the nodes in the network with a value below a given threshold. The second method is the upper level set scan test introduced by Patil and Taillie [Statist. Sci. 18 (2003) 4","authors_text":"Ery Arias-Castro, Geoffrey R. Grimmett","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-02T21:35:02Z","title":"Cluster detection in networks using percolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0338","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:8e0ecea85b295e3cdcab4c5e0983e560232e1512bc463a4bf1d1ead5d1c79b39","target":"record","created_at":"2026-05-18T03:30:15Z","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":"d2bed55c8cfbf5422953ff38ed9a8de2cd795f4fbca08d41dc9ba251d1fd4402","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-02T21:35:02Z","title_canon_sha256":"57e4c55e09ffd8fad678fe21677965f709de96c2535e51ca73a512a033fcaa7a"},"schema_version":"1.0","source":{"id":"1104.0338","kind":"arxiv","version":2}},"canonical_sha256":"3090ed3b6ff79c036cba3ca1d9a0aa9d2187cf272d8c7b1826835126e9ace1f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3090ed3b6ff79c036cba3ca1d9a0aa9d2187cf272d8c7b1826835126e9ace1f6","first_computed_at":"2026-05-18T03:30:15.095393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:15.095393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xj80kilC3eBg7XIDMmBXOjmJna1cS9GI4M8YQ6QvRFJV6IYGr2e52IYrRD8/c6Tf6DXzgGqL5DQmptXucQajCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:15.096306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e0ecea85b295e3cdcab4c5e0983e560232e1512bc463a4bf1d1ead5d1c79b39","sha256:c569216c236c50b5d0c85d3fe678bd1c4d62541e7aa6422b113c40c50a08e0cd"],"state_sha256":"1d7a23c0184136191e25fedc1b58c07b7340a7235f03a64d63105e4727549d9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFaZGmfrjet7SqhgA2xgBZghTRRr1hUzLSVBcuxhKZStQrRh+2b2mq/5vRLg9Z7bak/2r7rnIc7vkpz/n8IBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:54:07.534566Z","bundle_sha256":"1e89be67e214f19301912b81e8e396b263d0af0f1dadf2f9aa37e0dcd8dd1ad8"}}