{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C24CMKFNTUEI72EDTK4CUEGTRZ","short_pith_number":"pith:C24CMKFN","canonical_record":{"source":{"id":"1509.00368","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-09-01T15:55:42Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"31a421a999d065d93ada77ed8e5b36433cfeeabdc116f9d1a10d86ae5e348143","abstract_canon_sha256":"455643aeb8d72925fd22314080bb6e91f3af18e4e4b4df9c4bfbbd02b8ac2781"},"schema_version":"1.0"},"canonical_sha256":"16b82628ad9d088fe8839ab82a10d38e765c07c76b73377bad54fe66898aa0b0","source":{"kind":"arxiv","id":"1509.00368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00368","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00368v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00368","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"C24CMKFNTUEI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C24CMKFNTUEI72ED","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C24CMKFN","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C24CMKFNTUEI72EDTK4CUEGTRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00368","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-09-01T15:55:42Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"31a421a999d065d93ada77ed8e5b36433cfeeabdc116f9d1a10d86ae5e348143","abstract_canon_sha256":"455643aeb8d72925fd22314080bb6e91f3af18e4e4b4df9c4bfbbd02b8ac2781"},"schema_version":"1.0"},"canonical_sha256":"16b82628ad9d088fe8839ab82a10d38e765c07c76b73377bad54fe66898aa0b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:14.281361Z","signature_b64":"nVo7OHbBTPFYaRdp++KUhxhVWE9rmNjJs/VumpYqcZ2s+70lZC1MBS046sQT5kzvOmdfG2zr67civUXQDEgGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16b82628ad9d088fe8839ab82a10d38e765c07c76b73377bad54fe66898aa0b0","last_reissued_at":"2026-05-18T01:34:14.280535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:14.280535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00368","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-18T01:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHxSeENwtdy2er6QSApYunT7C2xtU4e34LVGf5jq8jrQwSKr2Pvy+n+AjZOiBOCfLMuQS54eB4NhRoCXkwKCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:45:34.011589Z"},"content_sha256":"0f63f0315cf76b0916be3aa0f1be42a970674392bb87cce6355432a11a5d0946","schema_version":"1.0","event_id":"sha256:0f63f0315cf76b0916be3aa0f1be42a970674392bb87cce6355432a11a5d0946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C24CMKFNTUEI72EDTK4CUEGTRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A breakpoint detection error function for segmentation model selection and evaluation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Toby Dylan Hocking","submitted_at":"2015-09-01T15:55:42Z","abstract_excerpt":"We consider the multiple breakpoint detection problem, which is concerned with detecting the locations of several distinct changes in a one-dimensional noisy data series. We propose the breakpointError, a function that can be used to evaluate estimated breakpoint locations, given the known locations of true breakpoints. We discuss an application of the breakpointError for finding optimal penalties for breakpoint detection in simulated data. Finally, we show how to relax the breakpointError to obtain an annotation error function which can be used more readily in practice on real data. A fast C "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00368","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-18T01:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5lI4xMpAObtm7L1dhDVe8rpga9AD7tdE4AFcf8hiBOwNNO1EcQEmyvME8AUFclfgI29RN53H9wR60XXitWFgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:45:34.011931Z"},"content_sha256":"fb40003fff6cf583608d975d7902840772d91d16af3da194b711f378c8f1c753","schema_version":"1.0","event_id":"sha256:fb40003fff6cf583608d975d7902840772d91d16af3da194b711f378c8f1c753"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C24CMKFNTUEI72EDTK4CUEGTRZ/bundle.json","state_url":"https://pith.science/pith/C24CMKFNTUEI72EDTK4CUEGTRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C24CMKFNTUEI72EDTK4CUEGTRZ/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-26T20:45:34Z","links":{"resolver":"https://pith.science/pith/C24CMKFNTUEI72EDTK4CUEGTRZ","bundle":"https://pith.science/pith/C24CMKFNTUEI72EDTK4CUEGTRZ/bundle.json","state":"https://pith.science/pith/C24CMKFNTUEI72EDTK4CUEGTRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C24CMKFNTUEI72EDTK4CUEGTRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C24CMKFNTUEI72EDTK4CUEGTRZ","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":"455643aeb8d72925fd22314080bb6e91f3af18e4e4b4df9c4bfbbd02b8ac2781","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-09-01T15:55:42Z","title_canon_sha256":"31a421a999d065d93ada77ed8e5b36433cfeeabdc116f9d1a10d86ae5e348143"},"schema_version":"1.0","source":{"id":"1509.00368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00368","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00368v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00368","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"C24CMKFNTUEI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C24CMKFNTUEI72ED","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C24CMKFN","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:fb40003fff6cf583608d975d7902840772d91d16af3da194b711f378c8f1c753","target":"graph","created_at":"2026-05-18T01:34:14Z","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 consider the multiple breakpoint detection problem, which is concerned with detecting the locations of several distinct changes in a one-dimensional noisy data series. We propose the breakpointError, a function that can be used to evaluate estimated breakpoint locations, given the known locations of true breakpoints. We discuss an application of the breakpointError for finding optimal penalties for breakpoint detection in simulated data. Finally, we show how to relax the breakpointError to obtain an annotation error function which can be used more readily in practice on real data. A fast C ","authors_text":"Toby Dylan Hocking","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-09-01T15:55:42Z","title":"A breakpoint detection error function for segmentation model selection and evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00368","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:0f63f0315cf76b0916be3aa0f1be42a970674392bb87cce6355432a11a5d0946","target":"record","created_at":"2026-05-18T01:34:14Z","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":"455643aeb8d72925fd22314080bb6e91f3af18e4e4b4df9c4bfbbd02b8ac2781","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.ST","submitted_at":"2015-09-01T15:55:42Z","title_canon_sha256":"31a421a999d065d93ada77ed8e5b36433cfeeabdc116f9d1a10d86ae5e348143"},"schema_version":"1.0","source":{"id":"1509.00368","kind":"arxiv","version":1}},"canonical_sha256":"16b82628ad9d088fe8839ab82a10d38e765c07c76b73377bad54fe66898aa0b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16b82628ad9d088fe8839ab82a10d38e765c07c76b73377bad54fe66898aa0b0","first_computed_at":"2026-05-18T01:34:14.280535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:14.280535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nVo7OHbBTPFYaRdp++KUhxhVWE9rmNjJs/VumpYqcZ2s+70lZC1MBS046sQT5kzvOmdfG2zr67civUXQDEgGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:14.281361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f63f0315cf76b0916be3aa0f1be42a970674392bb87cce6355432a11a5d0946","sha256:fb40003fff6cf583608d975d7902840772d91d16af3da194b711f378c8f1c753"],"state_sha256":"e8db6372b3138ce97c025977e4ff55a37fd54e78dbba1c04f16e2e717339b1d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K359PSp19FMo33nOcopBv3K8VRyzKnS/SYjJpnW/Br4UeLcsSGdHkwYoCtRMOISxhanVU/wcyIIU8i4g/lsmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:45:34.013773Z","bundle_sha256":"4811a33ff2ab8f54747cb88aab69df90d05007ffd0cff440a330608cb9f702b9"}}