{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:YGDZXGRDDZ5RS54X5TXVIG2U26","short_pith_number":"pith:YGDZXGRD","canonical_record":{"source":{"id":"2002.06633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-02-16T18:08:10Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"8c741497efdaf0fd41a328eb3c9e7cd0fcf3cfa28138f3e8615efc4677288912","abstract_canon_sha256":"178261f94fd38d49b1041bc55ec2e4c7473bfa544bf2c2d50fa25417138eb776"},"schema_version":"1.0"},"canonical_sha256":"c1879b9a231e7b197797ecef541b54d798e60987578dd5e3e70a0d12e5ff06ae","source":{"kind":"arxiv","id":"2002.06633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.06633","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"arxiv_version","alias_value":"2002.06633v1","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06633","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"pith_short_12","alias_value":"YGDZXGRDDZ5R","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"pith_short_16","alias_value":"YGDZXGRDDZ5RS54X","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"pith_short_8","alias_value":"YGDZXGRD","created_at":"2026-07-05T05:49:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:YGDZXGRDDZ5RS54X5TXVIG2U26","target":"record","payload":{"canonical_record":{"source":{"id":"2002.06633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-02-16T18:08:10Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"8c741497efdaf0fd41a328eb3c9e7cd0fcf3cfa28138f3e8615efc4677288912","abstract_canon_sha256":"178261f94fd38d49b1041bc55ec2e4c7473bfa544bf2c2d50fa25417138eb776"},"schema_version":"1.0"},"canonical_sha256":"c1879b9a231e7b197797ecef541b54d798e60987578dd5e3e70a0d12e5ff06ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:51.942585Z","signature_b64":"y+c/IllSP0fXFAhkxamr+n8AdE+MpaIz9xSpzWQ2qilIrAIbKDdAsWi5yF9G+ght3Fn61+UgyLLqy/tQdTQzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1879b9a231e7b197797ecef541b54d798e60987578dd5e3e70a0d12e5ff06ae","last_reissued_at":"2026-07-05T05:49:51.942139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:51.942139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.06633","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-05T05:49:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mp5JN11tjcOpF4OI9WdA3Jg3enQH71HHW0Hx5Na5fiBk1rsaB7dYOh8MshquwuoWId4aJUhL406TAXH1fmTwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T21:26:01.903313Z"},"content_sha256":"c94d6423fee8abe835d0af27e95e82687d1392e1c95d190d5094012559357cbf","schema_version":"1.0","event_id":"sha256:c94d6423fee8abe835d0af27e95e82687d1392e1c95d190d5094012559357cbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:YGDZXGRDDZ5RS54X5TXVIG2U26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Seeded Binary Segmentation: A general methodology for fast and optimal change point detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Axel Munk, Housen Li, Peter B\\\"uhlmann, Solt Kov\\'acs","submitted_at":"2020-02-16T18:08:10Z","abstract_excerpt":"In recent years, there has been an increasing demand on efficient algorithms for large scale change point detection problems. To this end, we propose seeded binary segmentation, an approach relying on a deterministic construction of background intervals, called seeded intervals, in which single change points are searched. The final selection of change points based on the candidates from seeded intervals can be done in various ways, adapted to the problem at hand. Thus, seeded binary segmentation is easy to adapt to a wide range of change point detection problems, let that be univariate, multiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06633","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/2002.06633/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-05T05:49:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Wq0QwPko29xMJMHGudNivBL/7wUFS92/zizVRBvvagTPJYC5vIFWjvlUO56o60NWDtvEszlRXiPBg8r9kWaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T21:26:01.903884Z"},"content_sha256":"1232ca98972b77d860477717d5a3e265e32a33eea8872da320a8b37c884a5173","schema_version":"1.0","event_id":"sha256:1232ca98972b77d860477717d5a3e265e32a33eea8872da320a8b37c884a5173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGDZXGRDDZ5RS54X5TXVIG2U26/bundle.json","state_url":"https://pith.science/pith/YGDZXGRDDZ5RS54X5TXVIG2U26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGDZXGRDDZ5RS54X5TXVIG2U26/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-22T21:26:01Z","links":{"resolver":"https://pith.science/pith/YGDZXGRDDZ5RS54X5TXVIG2U26","bundle":"https://pith.science/pith/YGDZXGRDDZ5RS54X5TXVIG2U26/bundle.json","state":"https://pith.science/pith/YGDZXGRDDZ5RS54X5TXVIG2U26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGDZXGRDDZ5RS54X5TXVIG2U26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:YGDZXGRDDZ5RS54X5TXVIG2U26","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":"178261f94fd38d49b1041bc55ec2e4c7473bfa544bf2c2d50fa25417138eb776","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-02-16T18:08:10Z","title_canon_sha256":"8c741497efdaf0fd41a328eb3c9e7cd0fcf3cfa28138f3e8615efc4677288912"},"schema_version":"1.0","source":{"id":"2002.06633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.06633","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"arxiv_version","alias_value":"2002.06633v1","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06633","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"pith_short_12","alias_value":"YGDZXGRDDZ5R","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"pith_short_16","alias_value":"YGDZXGRDDZ5RS54X","created_at":"2026-07-05T05:49:51Z"},{"alias_kind":"pith_short_8","alias_value":"YGDZXGRD","created_at":"2026-07-05T05:49:51Z"}],"graph_snapshots":[{"event_id":"sha256:1232ca98972b77d860477717d5a3e265e32a33eea8872da320a8b37c884a5173","target":"graph","created_at":"2026-07-05T05:49:51Z","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/2002.06633/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, there has been an increasing demand on efficient algorithms for large scale change point detection problems. To this end, we propose seeded binary segmentation, an approach relying on a deterministic construction of background intervals, called seeded intervals, in which single change points are searched. The final selection of change points based on the candidates from seeded intervals can be done in various ways, adapted to the problem at hand. Thus, seeded binary segmentation is easy to adapt to a wide range of change point detection problems, let that be univariate, multiv","authors_text":"Axel Munk, Housen Li, Peter B\\\"uhlmann, Solt Kov\\'acs","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-02-16T18:08:10Z","title":"Seeded Binary Segmentation: A general methodology for fast and optimal change point detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06633","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:c94d6423fee8abe835d0af27e95e82687d1392e1c95d190d5094012559357cbf","target":"record","created_at":"2026-07-05T05:49:51Z","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":"178261f94fd38d49b1041bc55ec2e4c7473bfa544bf2c2d50fa25417138eb776","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-02-16T18:08:10Z","title_canon_sha256":"8c741497efdaf0fd41a328eb3c9e7cd0fcf3cfa28138f3e8615efc4677288912"},"schema_version":"1.0","source":{"id":"2002.06633","kind":"arxiv","version":1}},"canonical_sha256":"c1879b9a231e7b197797ecef541b54d798e60987578dd5e3e70a0d12e5ff06ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1879b9a231e7b197797ecef541b54d798e60987578dd5e3e70a0d12e5ff06ae","first_computed_at":"2026-07-05T05:49:51.942139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:49:51.942139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+c/IllSP0fXFAhkxamr+n8AdE+MpaIz9xSpzWQ2qilIrAIbKDdAsWi5yF9G+ght3Fn61+UgyLLqy/tQdTQzBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:49:51.942585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.06633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c94d6423fee8abe835d0af27e95e82687d1392e1c95d190d5094012559357cbf","sha256:1232ca98972b77d860477717d5a3e265e32a33eea8872da320a8b37c884a5173"],"state_sha256":"5373838b83d8e3e2b0be4c553f445fb4d7ae8688bb87bba9604f42c5f59c6632"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+UJTjr+xEV0q1ROcxb5yX7LSag3RdJ8q3O91lumn5kbMyZCsfyGuKL4G1H/qWm7wc1MM+WHqe4fMUhCyKA9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T21:26:01.909979Z","bundle_sha256":"5b69949ac85f67262a1fbc9452cc46c7598b3b32db6264a7eddaa118502eccab"}}