{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:W5D6GR65G3YEXGFOEIXBXZDH4U","short_pith_number":"pith:W5D6GR65","canonical_record":{"source":{"id":"1102.4816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-02-23T18:46:56Z","cross_cats_sorted":["cs.CV","stat.AP","stat.ME","stat.ML"],"title_canon_sha256":"f4b9e106b5686d02fd112f0d3054fba7dca657d9df2361141a8c52409541cf19","abstract_canon_sha256":"99c616a3b2bf924b2e1aace8ec24ae80adf82c38ab0496a9738ff97998ab58aa"},"schema_version":"1.0"},"canonical_sha256":"b747e347dd36f04b98ae222e1be467e50b76f3a3d52e4a6b69e725c5af8ba79d","source":{"kind":"arxiv","id":"1102.4816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4816","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4816v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4816","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"W5D6GR65G3YE","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W5D6GR65G3YEXGFO","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W5D6GR65","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:W5D6GR65G3YEXGFOEIXBXZDH4U","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-02-23T18:46:56Z","cross_cats_sorted":["cs.CV","stat.AP","stat.ME","stat.ML"],"title_canon_sha256":"f4b9e106b5686d02fd112f0d3054fba7dca657d9df2361141a8c52409541cf19","abstract_canon_sha256":"99c616a3b2bf924b2e1aace8ec24ae80adf82c38ab0496a9738ff97998ab58aa"},"schema_version":"1.0"},"canonical_sha256":"b747e347dd36f04b98ae222e1be467e50b76f3a3d52e4a6b69e725c5af8ba79d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:07.297829Z","signature_b64":"bEjrH4M2Mghutz6uOj1fbXelFQ1w9c8QgoNh20SpSThFzy0zMU1C/r0YGOV2zZmRGZSzbZHuhf2fhCWgj52gAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b747e347dd36f04b98ae222e1be467e50b76f3a3d52e4a6b69e725c5af8ba79d","last_reissued_at":"2026-05-18T04:28:07.297054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:07.297054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4816","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-18T04:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXsKl3KDLYpscX17Iutmi4ruQ0QVV1Tj0a548tnMP7zQJrUBHzpkCGmCwn86STSTTwmwJVm8Vl5jHe0sdAWIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:27:15.749304Z"},"content_sha256":"a02a7eac240eb334c4723f353075ce98f200a4673e24fa2ae0bc8014072e34d9","schema_version":"1.0","event_id":"sha256:a02a7eac240eb334c4723f353075ce98f200a4673e24fa2ae0bc8014072e34d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:W5D6GR65G3YEXGFOEIXBXZDH4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally efficient algorithms for statistical image processing. Implementation in R","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.AP","stat.ME","stat.ML"],"primary_cat":"stat.CO","authors_text":"Mikhail A. Langovoy, Olaf Wittich","submitted_at":"2011-02-23T18:46:56Z","abstract_excerpt":"In the series of our earlier papers on the subject, we proposed a novel statistical hypothesis testing method for detection of objects in noisy images. The method uses results from percolation theory and random graph theory. We developed algorithms that allowed to detect objects of unknown shapes in the presence of nonparametric noise of unknown level and of unknown distribution. No boundary shape constraints were imposed on the objects, only a weak bulk condition for the object's interior was required. Our algorithms have linear complexity and exponential accuracy. In the present paper, we de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4816","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-18T04:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJsgJ21i/1BSLxIzl1oxTZs2PM48jArARMRP0Bm8XGR1NPBKPs4M9VvqHSqKjyFcuwegZg9yB7gNi4GHPHiUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:27:15.749975Z"},"content_sha256":"981bee92a76a8f51ad30fdc5e4f1fd7e05b127530b86b00bb7e82789e0af96ea","schema_version":"1.0","event_id":"sha256:981bee92a76a8f51ad30fdc5e4f1fd7e05b127530b86b00bb7e82789e0af96ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5D6GR65G3YEXGFOEIXBXZDH4U/bundle.json","state_url":"https://pith.science/pith/W5D6GR65G3YEXGFOEIXBXZDH4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5D6GR65G3YEXGFOEIXBXZDH4U/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-06T20:27:15Z","links":{"resolver":"https://pith.science/pith/W5D6GR65G3YEXGFOEIXBXZDH4U","bundle":"https://pith.science/pith/W5D6GR65G3YEXGFOEIXBXZDH4U/bundle.json","state":"https://pith.science/pith/W5D6GR65G3YEXGFOEIXBXZDH4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5D6GR65G3YEXGFOEIXBXZDH4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:W5D6GR65G3YEXGFOEIXBXZDH4U","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":"99c616a3b2bf924b2e1aace8ec24ae80adf82c38ab0496a9738ff97998ab58aa","cross_cats_sorted":["cs.CV","stat.AP","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-02-23T18:46:56Z","title_canon_sha256":"f4b9e106b5686d02fd112f0d3054fba7dca657d9df2361141a8c52409541cf19"},"schema_version":"1.0","source":{"id":"1102.4816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4816","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4816v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4816","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"W5D6GR65G3YE","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W5D6GR65G3YEXGFO","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W5D6GR65","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:981bee92a76a8f51ad30fdc5e4f1fd7e05b127530b86b00bb7e82789e0af96ea","target":"graph","created_at":"2026-05-18T04:28:07Z","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":"In the series of our earlier papers on the subject, we proposed a novel statistical hypothesis testing method for detection of objects in noisy images. The method uses results from percolation theory and random graph theory. We developed algorithms that allowed to detect objects of unknown shapes in the presence of nonparametric noise of unknown level and of unknown distribution. No boundary shape constraints were imposed on the objects, only a weak bulk condition for the object's interior was required. Our algorithms have linear complexity and exponential accuracy. In the present paper, we de","authors_text":"Mikhail A. Langovoy, Olaf Wittich","cross_cats":["cs.CV","stat.AP","stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-02-23T18:46:56Z","title":"Computationally efficient algorithms for statistical image processing. Implementation in R"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4816","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:a02a7eac240eb334c4723f353075ce98f200a4673e24fa2ae0bc8014072e34d9","target":"record","created_at":"2026-05-18T04:28:07Z","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":"99c616a3b2bf924b2e1aace8ec24ae80adf82c38ab0496a9738ff97998ab58aa","cross_cats_sorted":["cs.CV","stat.AP","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-02-23T18:46:56Z","title_canon_sha256":"f4b9e106b5686d02fd112f0d3054fba7dca657d9df2361141a8c52409541cf19"},"schema_version":"1.0","source":{"id":"1102.4816","kind":"arxiv","version":1}},"canonical_sha256":"b747e347dd36f04b98ae222e1be467e50b76f3a3d52e4a6b69e725c5af8ba79d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b747e347dd36f04b98ae222e1be467e50b76f3a3d52e4a6b69e725c5af8ba79d","first_computed_at":"2026-05-18T04:28:07.297054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:07.297054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bEjrH4M2Mghutz6uOj1fbXelFQ1w9c8QgoNh20SpSThFzy0zMU1C/r0YGOV2zZmRGZSzbZHuhf2fhCWgj52gAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:07.297829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a02a7eac240eb334c4723f353075ce98f200a4673e24fa2ae0bc8014072e34d9","sha256:981bee92a76a8f51ad30fdc5e4f1fd7e05b127530b86b00bb7e82789e0af96ea"],"state_sha256":"4294efc720ebffd435a0c278159413c2669988df93379a5a1d5d4e45eb49cff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4phZAr2fUxtMGGteh3dc7b5JF2KZIkg/Br3bYzivrnOfVNAAJWhVomXffCa0yY7uMm2IqqvLj+NIkzh2RwU8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:27:15.753056Z","bundle_sha256":"84b5bbed6fcf2c09f28a271f7b7930e3e35d4ef4f84a59f86fda4d1041005405"}}