{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4MR6K5BOTVHM7HLPACF4YV3723","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":"4c587693315cb35ad1956f3febdefe1de900f176c3df16bbc3e481f5a66308ca","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2021-01-14T07:24:39Z","title_canon_sha256":"b408cd10674c9ffbe935667c0896995fffb853f5052d68e3c519677209d40b46"},"schema_version":"1.0","source":{"id":"2101.05477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.05477","created_at":"2026-07-05T02:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"2101.05477v1","created_at":"2026-07-05T02:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05477","created_at":"2026-07-05T02:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"4MR6K5BOTVHM","created_at":"2026-07-05T02:06:56Z"},{"alias_kind":"pith_short_16","alias_value":"4MR6K5BOTVHM7HLP","created_at":"2026-07-05T02:06:56Z"},{"alias_kind":"pith_short_8","alias_value":"4MR6K5BO","created_at":"2026-07-05T02:06:56Z"}],"graph_snapshots":[{"event_id":"sha256:e1b515733dfddee326b297caa0b575a80059970df6bf7da4e0a2d23c69c1c96a","target":"graph","created_at":"2026-07-05T02:06:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.05477/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of online network change point detection. In this setting, a collection of independent Bernoulli networks is collected sequentially, and the underlying distributions change when a change point occurs. The goal is to detect the change point as quickly as possible, if it exists, subject to a constraint on the number or probability of false alarms. In this paper, on the detection delay, we establish a minimax lower bound and two upper bounds based on NP-hard algorithms and polynomial-time algorithms, i.e., \\[ \\mbox{detection delay} \\begin{cases} \\gtrsim \\log(1/\\alpha) \\frac{\\","authors_text":"Alessandro Rinaldo, Daren Wang, Oscar Hernan Madrid Padilla, Yi Yu","cross_cats":["cs.LG","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2021-01-14T07:24:39Z","title":"Optimal network online change point localisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05477","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:a4d82a3efad0c03e247578733456aaaac815e1c8e6551cc8b45387a2e2bbd2a6","target":"record","created_at":"2026-07-05T02:06:56Z","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":"4c587693315cb35ad1956f3febdefe1de900f176c3df16bbc3e481f5a66308ca","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2021-01-14T07:24:39Z","title_canon_sha256":"b408cd10674c9ffbe935667c0896995fffb853f5052d68e3c519677209d40b46"},"schema_version":"1.0","source":{"id":"2101.05477","kind":"arxiv","version":1}},"canonical_sha256":"e323e5742e9d4ecf9d6f008bcc577fd6f0d4786beca1545173be6c95a21dfdf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e323e5742e9d4ecf9d6f008bcc577fd6f0d4786beca1545173be6c95a21dfdf1","first_computed_at":"2026-07-05T02:06:56.195291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:06:56.195291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rc0BoLxmWlSwmd4V0E46ISDrAlBJJDU41LzHx+KT+BJjfSZdP6dZ5mODfu1yJw5QuEWbyBIwCE56pOayfhsbBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:06:56.195700Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.05477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4d82a3efad0c03e247578733456aaaac815e1c8e6551cc8b45387a2e2bbd2a6","sha256:e1b515733dfddee326b297caa0b575a80059970df6bf7da4e0a2d23c69c1c96a"],"state_sha256":"b217642d273eac43ed53ce548a5b77ea78d6ea72c1befb392ddd943ce5c1a7f5"}