{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SUWBLABVFWNPSC75Q3OKR35OE3","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":"8b40dfb1f2d31948afa3738874c9f2f6fd30e1ef3cf4c9ea0f73b7e51a55c2ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-27T04:28:53Z","title_canon_sha256":"eab1ec53a44fc4aabf9a6e1ba2a2fde96276bd295fcbc1f75f66ebc2a7bed9c7"},"schema_version":"1.0","source":{"id":"1504.06924","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06924","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06924v2","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06924","created_at":"2026-05-18T02:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"SUWBLABVFWNP","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SUWBLABVFWNPSC75","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SUWBLABV","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:cdd366e9d3a57e6299577a80deef410599848284c91e78169491a3109baad449","target":"graph","created_at":"2026-05-18T02:17:35Z","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 study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly one node has an elevated mean, with its location following a random walk on the graph over time. We want to exploit knowledge of the graph structure and random walk parameters (specified by a Markov chain transition matrix) to detect a possibly very weak signal. The optimal detector is easily derived, and we focus on the harder problem of characterizing its pe","authors_text":"Ameya Agaskar, Yue M. Lu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-27T04:28:53Z","title":"Optimal Detection of Random Walks on Graphs: Performance Analysis via Statistical Physics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06924","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:fd8814ea82bd8c887a5ae3ffa41d15ce0743d6a246209f095e6e0fd80239c24a","target":"record","created_at":"2026-05-18T02:17:35Z","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":"8b40dfb1f2d31948afa3738874c9f2f6fd30e1ef3cf4c9ea0f73b7e51a55c2ee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-27T04:28:53Z","title_canon_sha256":"eab1ec53a44fc4aabf9a6e1ba2a2fde96276bd295fcbc1f75f66ebc2a7bed9c7"},"schema_version":"1.0","source":{"id":"1504.06924","kind":"arxiv","version":2}},"canonical_sha256":"952c1580352d9af90bfd86dca8efae26ff6376dfa99eb3a64a0c05514b25b962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"952c1580352d9af90bfd86dca8efae26ff6376dfa99eb3a64a0c05514b25b962","first_computed_at":"2026-05-18T02:17:35.439827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:35.439827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nD0Qm/OlJtEUEJoc+IEV5j5yGUfrq6b4FlfgFZF0iCcHam0YdGJ6uDqz7r0xnFt6tV0ebVE40KKqOQfID9UFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:35.440550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06924","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd8814ea82bd8c887a5ae3ffa41d15ce0743d6a246209f095e6e0fd80239c24a","sha256:cdd366e9d3a57e6299577a80deef410599848284c91e78169491a3109baad449"],"state_sha256":"f2dacbe0409dd49942bad031087a2a47c4802ead9e0c236fcf45c4dd4ab1ab1b"}