{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z2SJJPKEVCWHCBCA7X7DYZUBS7","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":"44dfc876cf5a6c2baf0a60d052df51c8d058b9377f07439f0010ec07245f6752","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-07-06T17:07:38Z","title_canon_sha256":"4814dac9ec1096092f8d09984eab80f5c8b4f179bb17553253f1d38b022f0ca2"},"schema_version":"1.0","source":{"id":"1207.1687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1687","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1687v1","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1687","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"Z2SJJPKEVCWH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z2SJJPKEVCWHCBCA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z2SJJPKE","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:acf15d5d4d9a3bfda87bc5c2ff0e52ada6947a025c0f1c11dfc0b1a00c1b1951","target":"graph","created_at":"2026-05-18T03:51:36Z","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 propose a probabilistic formulation that enables sequential detection of multiple change points in a network setting. We present a class of sequential detection rules for certain functionals of change points (minimum among a subset), and prove their asymptotic optimality properties in terms of expected detection delay time. Drawing from graphical model formalism, the sequential detection rules can be implemented by a computationally efficient message-passing protocol which may scale up linearly in network size and in waiting time. The effectiveness of our inference algorithm is demonstrated","authors_text":"Arash Ali Amini, XuanLong Nguyen","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-07-06T17:07:38Z","title":"Sequential detection of multiple change points in networks: a graphical model approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1687","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:3df74929b00761ef95c5f245f4c937add76f2465e25d545759195491e2f3dbc9","target":"record","created_at":"2026-05-18T03:51:36Z","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":"44dfc876cf5a6c2baf0a60d052df51c8d058b9377f07439f0010ec07245f6752","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-07-06T17:07:38Z","title_canon_sha256":"4814dac9ec1096092f8d09984eab80f5c8b4f179bb17553253f1d38b022f0ca2"},"schema_version":"1.0","source":{"id":"1207.1687","kind":"arxiv","version":1}},"canonical_sha256":"cea494bd44a8ac710440fdfe3c668197c08346db7e8c9974fe098ac2055b7645","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea494bd44a8ac710440fdfe3c668197c08346db7e8c9974fe098ac2055b7645","first_computed_at":"2026-05-18T03:51:36.459179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:36.459179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iQcl/hRo10Lwjzy7LhyLtuSYCzQGCU59c+aHubHwjUGUjv5Qw0Um5WHhPNP9CV+z++7CwRyOYzjlCqcRGJxTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:36.459802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3df74929b00761ef95c5f245f4c937add76f2465e25d545759195491e2f3dbc9","sha256:acf15d5d4d9a3bfda87bc5c2ff0e52ada6947a025c0f1c11dfc0b1a00c1b1951"],"state_sha256":"c58b5086f74f1b720d8e1cbaaa1b87caa79573823a167cd505c48b0807e78b35"}