{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z2SJJPKEVCWHCBCA7X7DYZUBS7","short_pith_number":"pith:Z2SJJPKE","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"},"canonical_sha256":"cea494bd44a8ac710440fdfe3c668197c08346db7e8c9974fe098ac2055b7645","source":{"kind":"arxiv","id":"1207.1687","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z2SJJPKEVCWHCBCA7X7DYZUBS7","target":"record","payload":{"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"},"canonical_sha256":"cea494bd44a8ac710440fdfe3c668197c08346db7e8c9974fe098ac2055b7645","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"},"source_kind":"arxiv","source_id":"1207.1687","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-18T03:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZraaRHzW1W1L90nVPi4HpGtX/taW7Lg2hBGKRjECTRnR2IMFFNQ2rnpBnhcYJl41jfNJwOVvAgEJ/HyX9l8vDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:36:42.870556Z"},"content_sha256":"3df74929b00761ef95c5f245f4c937add76f2465e25d545759195491e2f3dbc9","schema_version":"1.0","event_id":"sha256:3df74929b00761ef95c5f245f4c937add76f2465e25d545759195491e2f3dbc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z2SJJPKEVCWHCBCA7X7DYZUBS7","target":"graph","payload":{"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"},"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:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0aYDwCd4e0wNy6RWThFKtxl3zgcD5/u9EDQashqI8oZFAuzlPpGXxsXb1cUebPGRKXwr1XHWoy075ezRP9Q8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:36:42.870899Z"},"content_sha256":"acf15d5d4d9a3bfda87bc5c2ff0e52ada6947a025c0f1c11dfc0b1a00c1b1951","schema_version":"1.0","event_id":"sha256:acf15d5d4d9a3bfda87bc5c2ff0e52ada6947a025c0f1c11dfc0b1a00c1b1951"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/bundle.json","state_url":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/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-30T22:36:42Z","links":{"resolver":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7","bundle":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/bundle.json","state":"https://pith.science/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2SJJPKEVCWHCBCA7X7DYZUBS7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWxaki+hZhvm9P0avBJ4zxfXP/KRM8NfQtx5vq20el1gmVEKQNbbuavwZKu1miJGlVeJPo2qWh5oab2/zLh8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:36:42.872953Z","bundle_sha256":"f4b775ee94bb718cec62de17768cd78fcb4320d3a020dbf1e818fac77d3ccb21"}}