{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ROYP2SSZJYAPPIEZMDGFZFCJRS","short_pith_number":"pith:ROYP2SSZ","schema_version":"1.0","canonical_sha256":"8bb0fd4a594e00f7a09960cc5c94498ca0c898dacc6725de07aad9faab525983","source":{"kind":"arxiv","id":"2606.28974","version":1},"attestation_state":"computed","paper":{"title":"Faster than Fast-LTS: Robust Regression and Outlier Detection with DC Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Alain B. Zemkoho, Marah-Lisanne Thormann, Phan Tu Vuong, Tri-Dung Nguyen","submitted_at":"2026-06-27T15:26:58Z","abstract_excerpt":"When datasets contain outliers, robust regression is a well-established alternative to Ordinary Least Squares. A commonly employed robust estimator is Least Trimmed Squares (LTS), which computes the regression coefficients from a subset of observations. Determining the exact solution corresponds to a combinatorial problem with prohibitive computational costs, even for instances of moderate dimension. Thus, the most prevalent approach in practice remains a heuristic known as Fast-LTS. Although the heuristic often performs effectively, certain elements of the approach remain open to improvement."},"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":"2606.28974","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-27T15:26:58Z","cross_cats_sorted":["cs.NA","math.NA","math.ST","stat.TH"],"title_canon_sha256":"029fe651f9a61c4d1792cd23d85ff1d5ab15584712375c50df751b493a750bf7","abstract_canon_sha256":"7350491efa50d13794933a20bffd97f27b0b3eb4c0c9343a282cb6557dff2668"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:47.816036Z","signature_b64":"krsUMEWUJccKyDzGF278Gr8kZUSdU2F1Xll1LeUKH3uexBJbIIwXs6JhRemMhc77eLrTX7GSpYVd3ahtb0dfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb0fd4a594e00f7a09960cc5c94498ca0c898dacc6725de07aad9faab525983","last_reissued_at":"2026-06-30T01:17:47.815536Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:47.815536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster than Fast-LTS: Robust Regression and Outlier Detection with DC Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Alain B. Zemkoho, Marah-Lisanne Thormann, Phan Tu Vuong, Tri-Dung Nguyen","submitted_at":"2026-06-27T15:26:58Z","abstract_excerpt":"When datasets contain outliers, robust regression is a well-established alternative to Ordinary Least Squares. A commonly employed robust estimator is Least Trimmed Squares (LTS), which computes the regression coefficients from a subset of observations. Determining the exact solution corresponds to a combinatorial problem with prohibitive computational costs, even for instances of moderate dimension. Thus, the most prevalent approach in practice remains a heuristic known as Fast-LTS. Although the heuristic often performs effectively, certain elements of the approach remain open to improvement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28974","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.28974/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.28974","created_at":"2026-06-30T01:17:47.815623+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28974v1","created_at":"2026-06-30T01:17:47.815623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28974","created_at":"2026-06-30T01:17:47.815623+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROYP2SSZJYAP","created_at":"2026-06-30T01:17:47.815623+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROYP2SSZJYAPPIEZ","created_at":"2026-06-30T01:17:47.815623+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROYP2SSZ","created_at":"2026-06-30T01:17:47.815623+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/ROYP2SSZJYAPPIEZMDGFZFCJRS","json":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS.json","graph_json":"https://pith.science/api/pith-number/ROYP2SSZJYAPPIEZMDGFZFCJRS/graph.json","events_json":"https://pith.science/api/pith-number/ROYP2SSZJYAPPIEZMDGFZFCJRS/events.json","paper":"https://pith.science/paper/ROYP2SSZ"},"agent_actions":{"view_html":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS","download_json":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS.json","view_paper":"https://pith.science/paper/ROYP2SSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28974&json=true","fetch_graph":"https://pith.science/api/pith-number/ROYP2SSZJYAPPIEZMDGFZFCJRS/graph.json","fetch_events":"https://pith.science/api/pith-number/ROYP2SSZJYAPPIEZMDGFZFCJRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS/action/storage_attestation","attest_author":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS/action/author_attestation","sign_citation":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS/action/citation_signature","submit_replication":"https://pith.science/pith/ROYP2SSZJYAPPIEZMDGFZFCJRS/action/replication_record"}},"created_at":"2026-06-30T01:17:47.815623+00:00","updated_at":"2026-06-30T01:17:47.815623+00:00"}