{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z2SJJPKEVCWHCBCA7X7DYZUBS7","short_pith_number":"pith:Z2SJJPKE","schema_version":"1.0","canonical_sha256":"cea494bd44a8ac710440fdfe3c668197c08346db7e8c9974fe098ac2055b7645","source":{"kind":"arxiv","id":"1207.1687","version":1},"attestation_state":"computed","paper":{"title":"Sequential detection of multiple change points in networks: a graphical model approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Arash Ali Amini, XuanLong Nguyen","submitted_at":"2012-07-06T17:07:38Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.1687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-07-06T17:07:38Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"4814dac9ec1096092f8d09984eab80f5c8b4f179bb17553253f1d38b022f0ca2","abstract_canon_sha256":"44dfc876cf5a6c2baf0a60d052df51c8d058b9377f07439f0010ec07245f6752"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:36.459802Z","signature_b64":"iQcl/hRo10Lwjzy7LhyLtuSYCzQGCU59c+aHubHwjUGUjv5Qw0Um5WHhPNP9CV+z++7CwRyOYzjlCqcRGJxTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea494bd44a8ac710440fdfe3c668197c08346db7e8c9974fe098ac2055b7645","last_reissued_at":"2026-05-18T03:51:36.459179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:36.459179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential detection of multiple change points in networks: a graphical model approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Arash Ali Amini, XuanLong Nguyen","submitted_at":"2012-07-06T17:07:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1687","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.1687","created_at":"2026-05-18T03:51:36.459259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1687v1","created_at":"2026-05-18T03:51:36.459259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1687","created_at":"2026-05-18T03:51:36.459259+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2SJJPKEVCWH","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2SJJPKEVCWHCBCA","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2SJJPKE","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7","json":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7.json","graph_json":"https://pith.science/api/pith-number/Z2SJJPKEVCWHCBCA7X7DYZUBS7/graph.json","events_json":"https://pith.science/api/pith-number/Z2SJJPKEVCWHCBCA7X7DYZUBS7/events.json","paper":"https://pith.science/paper/Z2SJJPKE"},"agent_actions":{"view_html":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7","download_json":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7.json","view_paper":"https://pith.science/paper/Z2SJJPKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1687&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2SJJPKEVCWHCBCA7X7DYZUBS7/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2SJJPKEVCWHCBCA7X7DYZUBS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/action/storage_attestation","attest_author":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/action/author_attestation","sign_citation":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/action/citation_signature","submit_replication":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/action/replication_record"}},"created_at":"2026-05-18T03:51:36.459259+00:00","updated_at":"2026-05-18T03:51:36.459259+00:00"}