{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XNOTGLO7AWRZ3PGXTTVQQFQSQE","short_pith_number":"pith:XNOTGLO7","schema_version":"1.0","canonical_sha256":"bb5d332ddf05a39dbcd79ceb0816128113dcec31699cc5ccf96d897f15a213eb","source":{"kind":"arxiv","id":"1411.4503","version":2},"attestation_state":"computed","paper":{"title":"Outlier-Robust Convex Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Itamar Katz, Koby Crammer","submitted_at":"2014-11-17T14:59:25Z","abstract_excerpt":"We derive a convex optimization problem for the task of segmenting sequential data, which explicitly treats presence of outliers. We describe two algorithms for solving this problem, one exact and one a top-down novel approach, and we derive a consistency results for the case of two segments and no outliers. Robustness to outliers is evaluated on two real-world tasks related to speech segmentation. Our algorithms outperform baseline segmentation algorithms."},"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":"1411.4503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-17T14:59:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fcc3b588058559ca60b086a737a5ab08e64d0b2bd7b233f4ea42edf897262d2a","abstract_canon_sha256":"a77be3d4758f7d6ae6ad3d8dbe2161785a7e9f0901ed687a9d4cb444c391a710"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:51.469848Z","signature_b64":"1b2q+iXRZbR+QMmmkr3qBed9bUTYzOyaYjd/vM+auSjbiohEETJoVqhrHDr+Fo4TiqLflGrIVuDtra6g5manCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb5d332ddf05a39dbcd79ceb0816128113dcec31699cc5ccf96d897f15a213eb","last_reissued_at":"2026-05-18T02:34:51.469482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:51.469482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Outlier-Robust Convex Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Itamar Katz, Koby Crammer","submitted_at":"2014-11-17T14:59:25Z","abstract_excerpt":"We derive a convex optimization problem for the task of segmenting sequential data, which explicitly treats presence of outliers. We describe two algorithms for solving this problem, one exact and one a top-down novel approach, and we derive a consistency results for the case of two segments and no outliers. Robustness to outliers is evaluated on two real-world tasks related to speech segmentation. Our algorithms outperform baseline segmentation algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4503","kind":"arxiv","version":2},"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":"1411.4503","created_at":"2026-05-18T02:34:51.469539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4503v2","created_at":"2026-05-18T02:34:51.469539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4503","created_at":"2026-05-18T02:34:51.469539+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNOTGLO7AWRZ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNOTGLO7AWRZ3PGX","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNOTGLO7","created_at":"2026-05-18T12:28:57.508820+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/XNOTGLO7AWRZ3PGXTTVQQFQSQE","json":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE.json","graph_json":"https://pith.science/api/pith-number/XNOTGLO7AWRZ3PGXTTVQQFQSQE/graph.json","events_json":"https://pith.science/api/pith-number/XNOTGLO7AWRZ3PGXTTVQQFQSQE/events.json","paper":"https://pith.science/paper/XNOTGLO7"},"agent_actions":{"view_html":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE","download_json":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE.json","view_paper":"https://pith.science/paper/XNOTGLO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4503&json=true","fetch_graph":"https://pith.science/api/pith-number/XNOTGLO7AWRZ3PGXTTVQQFQSQE/graph.json","fetch_events":"https://pith.science/api/pith-number/XNOTGLO7AWRZ3PGXTTVQQFQSQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE/action/storage_attestation","attest_author":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE/action/author_attestation","sign_citation":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE/action/citation_signature","submit_replication":"https://pith.science/pith/XNOTGLO7AWRZ3PGXTTVQQFQSQE/action/replication_record"}},"created_at":"2026-05-18T02:34:51.469539+00:00","updated_at":"2026-05-18T02:34:51.469539+00:00"}