{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JUQ5LFHGIX2NVUL2DI6VQ5IQEO","short_pith_number":"pith:JUQ5LFHG","canonical_record":{"source":{"id":"1810.00117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-29T00:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"478e0a8e14621d49327ccf71f2e9c4701aa008c31f80fa3ebfdbec6bcc1b6af6","abstract_canon_sha256":"f7a3b936c4bac74338f2599c075e9bc73c8ef6091b0f114c83992dd01121f993"},"schema_version":"1.0"},"canonical_sha256":"4d21d594e645f4dad17a1a3d58751023a0410a8f941991acfad08fd284c46b49","source":{"kind":"arxiv","id":"1810.00117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00117","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00117v1","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00117","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"JUQ5LFHGIX2N","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JUQ5LFHGIX2NVUL2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JUQ5LFHG","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JUQ5LFHGIX2NVUL2DI6VQ5IQEO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-29T00:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"478e0a8e14621d49327ccf71f2e9c4701aa008c31f80fa3ebfdbec6bcc1b6af6","abstract_canon_sha256":"f7a3b936c4bac74338f2599c075e9bc73c8ef6091b0f114c83992dd01121f993"},"schema_version":"1.0"},"canonical_sha256":"4d21d594e645f4dad17a1a3d58751023a0410a8f941991acfad08fd284c46b49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:28.722517Z","signature_b64":"8l/kMFEZ61ezcufZ+NpI4eavqJNFNa4ujaE9WYB2VnUk4YPf/Qs1VOmOxaVT3DCFVxSHJe/nwjT9SUmUW232BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d21d594e645f4dad17a1a3d58751023a0410a8f941991acfad08fd284c46b49","last_reissued_at":"2026-05-18T00:04:28.721883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:28.721883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00117","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-18T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZv+elFge/wTx6QsMZ5pgXOeQxlLgQmBKYvLjfmxM2xerhiVN9Rf1awvsml2GZCznE+SBape7ffSFuI3N1N1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:26:31.979093Z"},"content_sha256":"8f529f6f939256a953c52a6862a2eb3d0879565b5db6a67324ae42f1e083763a","schema_version":"1.0","event_id":"sha256:8f529f6f939256a953c52a6862a2eb3d0879565b5db6a67324ae42f1e083763a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JUQ5LFHGIX2NVUL2DI6VQ5IQEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Functional Pruning Optimal Partitioning (GFPOP) for Constrained Changepoint Detection in Genomic Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Guillaume Bourque, Guillem Rigaill, Paul Fearnhead, Toby Dylan Hocking","submitted_at":"2018-09-29T00:10:30Z","abstract_excerpt":"We describe a new algorithm and R package for peak detection in genomic data sets using constrained changepoint algorithms. These detect changes from background to peak regions by imposing the constraint that the mean should alternately increase then decrease. An existing algorithm for this problem exists, and gives state-of-the-art accuracy results, but it is computationally expensive when the number of changes is large. We propose the GFPOP algorithm that jointly estimates the number of peaks and their locations by minimizing a cost function which consists of a data fitting term and a penalt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00117","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-18T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64D+XQgxWVvVRpMrcWuHMQdc4vl/A713YH40FZe/eXf4WCm98TFqeIW3KNvkXfSDNKf2Uem2hBZfROXNc+OODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:26:31.979451Z"},"content_sha256":"915b924a8c5ee3399d78c6563e967dcac967360c77f1949d6e9eb93267759f8f","schema_version":"1.0","event_id":"sha256:915b924a8c5ee3399d78c6563e967dcac967360c77f1949d6e9eb93267759f8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUQ5LFHGIX2NVUL2DI6VQ5IQEO/bundle.json","state_url":"https://pith.science/pith/JUQ5LFHGIX2NVUL2DI6VQ5IQEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUQ5LFHGIX2NVUL2DI6VQ5IQEO/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-04T10:26:31Z","links":{"resolver":"https://pith.science/pith/JUQ5LFHGIX2NVUL2DI6VQ5IQEO","bundle":"https://pith.science/pith/JUQ5LFHGIX2NVUL2DI6VQ5IQEO/bundle.json","state":"https://pith.science/pith/JUQ5LFHGIX2NVUL2DI6VQ5IQEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUQ5LFHGIX2NVUL2DI6VQ5IQEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JUQ5LFHGIX2NVUL2DI6VQ5IQEO","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":"f7a3b936c4bac74338f2599c075e9bc73c8ef6091b0f114c83992dd01121f993","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-29T00:10:30Z","title_canon_sha256":"478e0a8e14621d49327ccf71f2e9c4701aa008c31f80fa3ebfdbec6bcc1b6af6"},"schema_version":"1.0","source":{"id":"1810.00117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00117","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00117v1","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00117","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"JUQ5LFHGIX2N","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JUQ5LFHGIX2NVUL2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JUQ5LFHG","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:915b924a8c5ee3399d78c6563e967dcac967360c77f1949d6e9eb93267759f8f","target":"graph","created_at":"2026-05-18T00:04:28Z","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 describe a new algorithm and R package for peak detection in genomic data sets using constrained changepoint algorithms. These detect changes from background to peak regions by imposing the constraint that the mean should alternately increase then decrease. An existing algorithm for this problem exists, and gives state-of-the-art accuracy results, but it is computationally expensive when the number of changes is large. We propose the GFPOP algorithm that jointly estimates the number of peaks and their locations by minimizing a cost function which consists of a data fitting term and a penalt","authors_text":"Guillaume Bourque, Guillem Rigaill, Paul Fearnhead, Toby Dylan Hocking","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-29T00:10:30Z","title":"Generalized Functional Pruning Optimal Partitioning (GFPOP) for Constrained Changepoint Detection in Genomic Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00117","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:8f529f6f939256a953c52a6862a2eb3d0879565b5db6a67324ae42f1e083763a","target":"record","created_at":"2026-05-18T00:04:28Z","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":"f7a3b936c4bac74338f2599c075e9bc73c8ef6091b0f114c83992dd01121f993","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-09-29T00:10:30Z","title_canon_sha256":"478e0a8e14621d49327ccf71f2e9c4701aa008c31f80fa3ebfdbec6bcc1b6af6"},"schema_version":"1.0","source":{"id":"1810.00117","kind":"arxiv","version":1}},"canonical_sha256":"4d21d594e645f4dad17a1a3d58751023a0410a8f941991acfad08fd284c46b49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d21d594e645f4dad17a1a3d58751023a0410a8f941991acfad08fd284c46b49","first_computed_at":"2026-05-18T00:04:28.721883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:28.721883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8l/kMFEZ61ezcufZ+NpI4eavqJNFNa4ujaE9WYB2VnUk4YPf/Qs1VOmOxaVT3DCFVxSHJe/nwjT9SUmUW232BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:28.722517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f529f6f939256a953c52a6862a2eb3d0879565b5db6a67324ae42f1e083763a","sha256:915b924a8c5ee3399d78c6563e967dcac967360c77f1949d6e9eb93267759f8f"],"state_sha256":"89f000fd3768406ab367e319a0f3ad212089414d8be7af94aa0c76ce017c9519"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjoOO3MLTW1OJ63Clx3d8nVLVugJY2c+xJwJFsC3UmAzFhFaPdQdbl84ZXeUEQGTlndB8srMAqUqkyGytXHTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:26:31.981388Z","bundle_sha256":"1358172969e538978ad1068df2e1b2d553adbf2a001acbe62cd63d6c161a24e6"}}