{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HWQ5NHOLZ3SZSAC5IKESWOYBP2","short_pith_number":"pith:HWQ5NHOL","schema_version":"1.0","canonical_sha256":"3da1d69dcbcee599005d42892b3b017e9c82380b7e8d15c38d8612141c664e34","source":{"kind":"arxiv","id":"1506.01286","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.01286","created_at":"2026-05-18T01:58:24.650716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01286v1","created_at":"2026-05-18T01:58:24.650716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01286","created_at":"2026-05-18T01:58:24.650716+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWQ5NHOLZ3SZ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWQ5NHOLZ3SZSAC5","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWQ5NHOL","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2","json":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2.json","graph_json":"https://pith.science/api/pith-number/HWQ5NHOLZ3SZSAC5IKESWOYBP2/graph.json","events_json":"https://pith.science/api/pith-number/HWQ5NHOLZ3SZSAC5IKESWOYBP2/events.json","paper":"https://pith.science/paper/HWQ5NHOL"},"agent_actions":{"view_html":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2","download_json":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2.json","view_paper":"https://pith.science/paper/HWQ5NHOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01286&json=true","fetch_graph":"https://pith.science/api/pith-number/HWQ5NHOLZ3SZSAC5IKESWOYBP2/graph.json","fetch_events":"https://pith.science/api/pith-number/HWQ5NHOLZ3SZSAC5IKESWOYBP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/action/storage_attestation","attest_author":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/action/author_attestation","sign_citation":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/action/citation_signature","submit_replication":"https://pith.science/pith/HWQ5NHOLZ3SZSAC5IKESWOYBP2/action/replication_record"}},"created_at":"2026-05-18T01:58:24.650716+00:00","updated_at":"2026-05-18T01:58:24.650716+00:00"}