{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TJCFBQWPVLKMWFAXHESYT3KYDK","short_pith_number":"pith:TJCFBQWP","canonical_record":{"source":{"id":"2112.07549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-14T16:56:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a61a82744b0f856ce7bee8a5d56192194d36a72d241d21cad1f8b09ab5cce698","abstract_canon_sha256":"08be3ade8bd30c38e9ee571c1c3093e5d1868f76f2ff3530fdf21f6c1eca2a43"},"schema_version":"1.0"},"canonical_sha256":"9a4450c2cfaad4cb1417392589ed581aa09d9437d1ffc7431d4f48b57d45bb96","source":{"kind":"arxiv","id":"2112.07549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.07549","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"2112.07549v1","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07549","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"TJCFBQWPVLKM","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"pith_short_16","alias_value":"TJCFBQWPVLKMWFAX","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"pith_short_8","alias_value":"TJCFBQWP","created_at":"2026-07-05T03:40:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TJCFBQWPVLKMWFAXHESYT3KYDK","target":"record","payload":{"canonical_record":{"source":{"id":"2112.07549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-14T16:56:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a61a82744b0f856ce7bee8a5d56192194d36a72d241d21cad1f8b09ab5cce698","abstract_canon_sha256":"08be3ade8bd30c38e9ee571c1c3093e5d1868f76f2ff3530fdf21f6c1eca2a43"},"schema_version":"1.0"},"canonical_sha256":"9a4450c2cfaad4cb1417392589ed581aa09d9437d1ffc7431d4f48b57d45bb96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:59.477907Z","signature_b64":"CeL4B0EUxlvU5glsOVT8p5IoPKsukC5uXYVnqifp3gaXdRbdDhGG5pVDTO/4ZObQVEJtEVG9m3nPYL3fvv5SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a4450c2cfaad4cb1417392589ed581aa09d9437d1ffc7431d4f48b57d45bb96","last_reissued_at":"2026-07-05T03:40:59.477429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:59.477429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.07549","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-07-05T03:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6IIcfdehCutSODANjliLyW/mtqxh7W4ficlCdAGCXAVZRpg0pvB/pdf9nF9gEGEEkMY2/L3IueWYOerI3QeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:54:48.466095Z"},"content_sha256":"613cf2c4ebb5e9561ab125bd97bc87265031635ffe028abd51c5bdd26f18408f","schema_version":"1.0","event_id":"sha256:613cf2c4ebb5e9561ab125bd97bc87265031635ffe028abd51c5bdd26f18408f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TJCFBQWPVLKMWFAXHESYT3KYDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Change Detection through Empirical Distribution and Universal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. K. Bansal, Vikrant Malik","submitted_at":"2021-12-14T16:56:47Z","abstract_excerpt":"Universal compression algorithms have been studied in the past for sequential change detection, where they have been used to estimate the post-change distribution in the modified version of the Cumulative Sum (CUSUM) Test. In this paper, we introduce a modified CUSUM test where the pre-change distribution is also unknown and an empirical version of the pre-change distribution is used to implement the algorithm. We present a study of various characteristics of this modified CUSUM Test and then prove its asymptotic optimality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07549","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.07549/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCefauMJ4dGZMw6CVLzx0UPoKP4ftVcCPwwqzQooppR5xoBGhECnea3Oz9HGeYcxvdEI2nDuGULGVbE+xC6tAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:54:48.466629Z"},"content_sha256":"dcee1f8eaf7843c64a8959114c73149d13560d9af3e6027693edd1b826046c59","schema_version":"1.0","event_id":"sha256:dcee1f8eaf7843c64a8959114c73149d13560d9af3e6027693edd1b826046c59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJCFBQWPVLKMWFAXHESYT3KYDK/bundle.json","state_url":"https://pith.science/pith/TJCFBQWPVLKMWFAXHESYT3KYDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJCFBQWPVLKMWFAXHESYT3KYDK/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-08-05T14:54:48Z","links":{"resolver":"https://pith.science/pith/TJCFBQWPVLKMWFAXHESYT3KYDK","bundle":"https://pith.science/pith/TJCFBQWPVLKMWFAXHESYT3KYDK/bundle.json","state":"https://pith.science/pith/TJCFBQWPVLKMWFAXHESYT3KYDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJCFBQWPVLKMWFAXHESYT3KYDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TJCFBQWPVLKMWFAXHESYT3KYDK","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":"08be3ade8bd30c38e9ee571c1c3093e5d1868f76f2ff3530fdf21f6c1eca2a43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-14T16:56:47Z","title_canon_sha256":"a61a82744b0f856ce7bee8a5d56192194d36a72d241d21cad1f8b09ab5cce698"},"schema_version":"1.0","source":{"id":"2112.07549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.07549","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"2112.07549v1","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07549","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"TJCFBQWPVLKM","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"pith_short_16","alias_value":"TJCFBQWPVLKMWFAX","created_at":"2026-07-05T03:40:59Z"},{"alias_kind":"pith_short_8","alias_value":"TJCFBQWP","created_at":"2026-07-05T03:40:59Z"}],"graph_snapshots":[{"event_id":"sha256:dcee1f8eaf7843c64a8959114c73149d13560d9af3e6027693edd1b826046c59","target":"graph","created_at":"2026-07-05T03:40:59Z","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/2112.07549/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Universal compression algorithms have been studied in the past for sequential change detection, where they have been used to estimate the post-change distribution in the modified version of the Cumulative Sum (CUSUM) Test. In this paper, we introduce a modified CUSUM test where the pre-change distribution is also unknown and an empirical version of the pre-change distribution is used to implement the algorithm. We present a study of various characteristics of this modified CUSUM Test and then prove its asymptotic optimality.","authors_text":"R. K. Bansal, Vikrant Malik","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-14T16:56:47Z","title":"Sequential Change Detection through Empirical Distribution and Universal Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07549","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:613cf2c4ebb5e9561ab125bd97bc87265031635ffe028abd51c5bdd26f18408f","target":"record","created_at":"2026-07-05T03:40:59Z","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":"08be3ade8bd30c38e9ee571c1c3093e5d1868f76f2ff3530fdf21f6c1eca2a43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-12-14T16:56:47Z","title_canon_sha256":"a61a82744b0f856ce7bee8a5d56192194d36a72d241d21cad1f8b09ab5cce698"},"schema_version":"1.0","source":{"id":"2112.07549","kind":"arxiv","version":1}},"canonical_sha256":"9a4450c2cfaad4cb1417392589ed581aa09d9437d1ffc7431d4f48b57d45bb96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a4450c2cfaad4cb1417392589ed581aa09d9437d1ffc7431d4f48b57d45bb96","first_computed_at":"2026-07-05T03:40:59.477429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:40:59.477429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CeL4B0EUxlvU5glsOVT8p5IoPKsukC5uXYVnqifp3gaXdRbdDhGG5pVDTO/4ZObQVEJtEVG9m3nPYL3fvv5SAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:40:59.477907Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.07549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:613cf2c4ebb5e9561ab125bd97bc87265031635ffe028abd51c5bdd26f18408f","sha256:dcee1f8eaf7843c64a8959114c73149d13560d9af3e6027693edd1b826046c59"],"state_sha256":"05c018f3af209cc6169a015e35b585044248e13dde4bedd851a94f8aefef7d3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9qoq5cRrypiy3kYi0Z+Kkt1x0gm00SkbfS7KvC+ojTyLEW03rXVfNp6sQaCH9QMdJPT7MD8ztB3faeSt3yzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T14:54:48.485272Z","bundle_sha256":"0501731c38cd6c5af02cf11d676f8d61ae2eabc531d1bb03fc6ce6fb0eebc4b0"}}