{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HWQ5NHOLZ3SZSAC5IKESWOYBP2","short_pith_number":"pith:HWQ5NHOL","canonical_record":{"source":{"id":"1506.01286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2015-06-03T15:42:09Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"8baf7529aeae05859a74525bdff61281d98de2a52b2596e64ee1290ffa050759","abstract_canon_sha256":"e6470dbac8723f65f19e9245dddbcbd2b1d362c03f7f5512440545588ef086c3"},"schema_version":"1.0"},"canonical_sha256":"3da1d69dcbcee599005d42892b3b017e9c82380b7e8d15c38d8612141c664e34","source":{"kind":"arxiv","id":"1506.01286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01286","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01286v1","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01286","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"HWQ5NHOLZ3SZ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWQ5NHOLZ3SZSAC5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWQ5NHOL","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HWQ5NHOLZ3SZSAC5IKESWOYBP2","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2015-06-03T15:42:09Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"8baf7529aeae05859a74525bdff61281d98de2a52b2596e64ee1290ffa050759","abstract_canon_sha256":"e6470dbac8723f65f19e9245dddbcbd2b1d362c03f7f5512440545588ef086c3"},"schema_version":"1.0"},"canonical_sha256":"3da1d69dcbcee599005d42892b3b017e9c82380b7e8d15c38d8612141c664e34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:24.651236Z","signature_b64":"y4qMDV8ZD8ois3rb3WWBJdhb1ZblNwrAnu/KialyYl9Yl3AfLgtqBElR+09qBOBeXbiXciP+RrkgfIvOxo8UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3da1d69dcbcee599005d42892b3b017e9c82380b7e8d15c38d8612141c664e34","last_reissued_at":"2026-05-18T01:58:24.650613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:24.650613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01286","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:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6nqD58wwdWKBm3HBLERO6245PwbvyTFR/YUm2/9IFaLw926M1y79wBNaRA3GhnyeUVs4Dw44figXz4qZdi/rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:24:34.283959Z"},"content_sha256":"5d724bc1a1d1dfdd98b0eb955201ba244bf750de1073bbc843e9030633221586","schema_version":"1.0","event_id":"sha256:5d724bc1a1d1dfdd98b0eb955201ba244bf750de1073bbc843e9030633221586"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HWQ5NHOLZ3SZSAC5IKESWOYBP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PeakSegJoint: fast supervised peak detection via joint segmentation of multiple count data samples","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"stat.ML","authors_text":"Guillaume Bourque, Toby Dylan Hocking","submitted_at":"2015-06-03T15:42:09Z","abstract_excerpt":"Joint peak detection is a central problem when comparing samples in genomic data analysis, but current algorithms for this task are unsupervised and limited to at most 2 sample types. We propose PeakSegJoint, a new constrained maximum likelihood segmentation model for any number of sample types. To select the number of peaks in the segmentation, we propose a supervised penalty learning model. To infer the parameters of these two models, we propose to use a discrete optimization heuristic for the segmentation, and convex optimization for the penalty learning. In comparisons with state-of-the-ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01286","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:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NZvWCBkm0J9m2ajttR6EZXddE4vmxlOpa20fdC3t7MQgrj4iBPL2OKBLr8teTcTaRCiQMCaEUBNO5OWPWOgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:24:34.284688Z"},"content_sha256":"ae720a2a5788224cdcb2eb338c06338f87950cdbf06f5019f1cb38d7bcd2204f","schema_version":"1.0","event_id":"sha256:ae720a2a5788224cdcb2eb338c06338f87950cdbf06f5019f1cb38d7bcd2204f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/bundle.json","state_url":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/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-11T21:24:34Z","links":{"resolver":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2","bundle":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/bundle.json","state":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HWQ5NHOLZ3SZSAC5IKESWOYBP2","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":"e6470dbac8723f65f19e9245dddbcbd2b1d362c03f7f5512440545588ef086c3","cross_cats_sorted":["q-bio.GN"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2015-06-03T15:42:09Z","title_canon_sha256":"8baf7529aeae05859a74525bdff61281d98de2a52b2596e64ee1290ffa050759"},"schema_version":"1.0","source":{"id":"1506.01286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01286","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01286v1","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01286","created_at":"2026-05-18T01:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"HWQ5NHOLZ3SZ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWQ5NHOLZ3SZSAC5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWQ5NHOL","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:ae720a2a5788224cdcb2eb338c06338f87950cdbf06f5019f1cb38d7bcd2204f","target":"graph","created_at":"2026-05-18T01:58:24Z","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":"Joint peak detection is a central problem when comparing samples in genomic data analysis, but current algorithms for this task are unsupervised and limited to at most 2 sample types. We propose PeakSegJoint, a new constrained maximum likelihood segmentation model for any number of sample types. To select the number of peaks in the segmentation, we propose a supervised penalty learning model. To infer the parameters of these two models, we propose to use a discrete optimization heuristic for the segmentation, and convex optimization for the penalty learning. In comparisons with state-of-the-ar","authors_text":"Guillaume Bourque, Toby Dylan Hocking","cross_cats":["q-bio.GN"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2015-06-03T15:42:09Z","title":"PeakSegJoint: fast supervised peak detection via joint segmentation of multiple count data samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01286","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:5d724bc1a1d1dfdd98b0eb955201ba244bf750de1073bbc843e9030633221586","target":"record","created_at":"2026-05-18T01:58:24Z","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":"e6470dbac8723f65f19e9245dddbcbd2b1d362c03f7f5512440545588ef086c3","cross_cats_sorted":["q-bio.GN"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2015-06-03T15:42:09Z","title_canon_sha256":"8baf7529aeae05859a74525bdff61281d98de2a52b2596e64ee1290ffa050759"},"schema_version":"1.0","source":{"id":"1506.01286","kind":"arxiv","version":1}},"canonical_sha256":"3da1d69dcbcee599005d42892b3b017e9c82380b7e8d15c38d8612141c664e34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3da1d69dcbcee599005d42892b3b017e9c82380b7e8d15c38d8612141c664e34","first_computed_at":"2026-05-18T01:58:24.650613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:24.650613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y4qMDV8ZD8ois3rb3WWBJdhb1ZblNwrAnu/KialyYl9Yl3AfLgtqBElR+09qBOBeXbiXciP+RrkgfIvOxo8UAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:24.651236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d724bc1a1d1dfdd98b0eb955201ba244bf750de1073bbc843e9030633221586","sha256:ae720a2a5788224cdcb2eb338c06338f87950cdbf06f5019f1cb38d7bcd2204f"],"state_sha256":"f706e21d6a6cf778ffd6ba7c37b183d2a628b3eb1b3a5f65579420948a4676b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQL8VuN5yqzO2kMXoJSUrzAv62K1KipgYXciGtXCOH2FlLZar/gRS6Qfpdk4yoHXKggBInFWaj5iy2ayic70AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:24:34.288688Z","bundle_sha256":"b3c79982b80a1ded76e4285fd5cb890649841eaf77e56a00f7372921a9b4db6f"}}