{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N2CGYVFCUBXRVGXAHULGKRFAQ6","short_pith_number":"pith:N2CGYVFC","canonical_record":{"source":{"id":"1505.08134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T18:24:12Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"6a2c3e314798f4661d9a801c17aaf33a7b7f86a06ef3c5242833c4ecb64cd1b1","abstract_canon_sha256":"a084e4868ab6eefda8f83e1cdf1d8cc954052a56aff7714eeb1d14a150491a60"},"schema_version":"1.0"},"canonical_sha256":"6e846c54a2a06f1a9ae03d166544a087b8be814d115d940d68db674a24cc8b86","source":{"kind":"arxiv","id":"1505.08134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08134","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08134v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08134","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"N2CGYVFCUBXR","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N2CGYVFCUBXRVGXA","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N2CGYVFC","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N2CGYVFCUBXRVGXAHULGKRFAQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1505.08134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T18:24:12Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"6a2c3e314798f4661d9a801c17aaf33a7b7f86a06ef3c5242833c4ecb64cd1b1","abstract_canon_sha256":"a084e4868ab6eefda8f83e1cdf1d8cc954052a56aff7714eeb1d14a150491a60"},"schema_version":"1.0"},"canonical_sha256":"6e846c54a2a06f1a9ae03d166544a087b8be814d115d940d68db674a24cc8b86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.590470Z","signature_b64":"IAj23/1gqHljPD1l/qDLkWFFJBr0T/0ZuWZF+86FiMwN7lpWsGSLq1u/plbBDsiKJXKR9BlgFjStq1Owt9qaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e846c54a2a06f1a9ae03d166544a087b8be814d115d940d68db674a24cc8b86","last_reissued_at":"2026-05-18T01:59:59.589972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.589972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.08134","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2smQCGACkbZWEtNaQFPH19MrCSPbLl6JTK+Z+e1mBIeC+GP9kY4gL2GiQ2ZXMun+8Ur6a37AJRiaqrObYQ+hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:59:33.226843Z"},"content_sha256":"ee983d3a9455ff1b47536b17e297feaf93d6d95ed9ea51fc710c0ff3587c7952","schema_version":"1.0","event_id":"sha256:ee983d3a9455ff1b47536b17e297feaf93d6d95ed9ea51fc710c0ff3587c7952"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N2CGYVFCUBXRVGXAHULGKRFAQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Salvador Flores","submitted_at":"2015-05-29T18:24:12Z","abstract_excerpt":"This paper deals with the problem of finding the globally optimal subset of h elements from a larger set of n elements in d space dimensions so as to minimize a quadratic criterion, with an special emphasis on applications to computing the Least Trimmed Squares Estimator (LTSE) for robust regression. The computation of the LTSE is a challenging subset selection problem involving a nonlinear program with continuous and binary variables, linked in a highly nonlinear fashion. The selection of a globally optimal subset using the branch and bound (BB) algorithm is limited to problems in very low di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08134","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDs5bbdQR3PktIGqBQmLYskozkPrJKf9jox3m74aT31qVV9/pJ9J4fHbit0pESRqkJad/P8Xyq+SFyt/yhmvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:59:33.227201Z"},"content_sha256":"82245acf5bcf3a1ac4612cfac7cb06ece20c75cd622e410da44c811b61ae2384","schema_version":"1.0","event_id":"sha256:82245acf5bcf3a1ac4612cfac7cb06ece20c75cd622e410da44c811b61ae2384"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2CGYVFCUBXRVGXAHULGKRFAQ6/bundle.json","state_url":"https://pith.science/pith/N2CGYVFCUBXRVGXAHULGKRFAQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2CGYVFCUBXRVGXAHULGKRFAQ6/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-30T03:59:33Z","links":{"resolver":"https://pith.science/pith/N2CGYVFCUBXRVGXAHULGKRFAQ6","bundle":"https://pith.science/pith/N2CGYVFCUBXRVGXAHULGKRFAQ6/bundle.json","state":"https://pith.science/pith/N2CGYVFCUBXRVGXAHULGKRFAQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2CGYVFCUBXRVGXAHULGKRFAQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N2CGYVFCUBXRVGXAHULGKRFAQ6","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":"a084e4868ab6eefda8f83e1cdf1d8cc954052a56aff7714eeb1d14a150491a60","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T18:24:12Z","title_canon_sha256":"6a2c3e314798f4661d9a801c17aaf33a7b7f86a06ef3c5242833c4ecb64cd1b1"},"schema_version":"1.0","source":{"id":"1505.08134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08134","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08134v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08134","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"N2CGYVFCUBXR","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N2CGYVFCUBXRVGXA","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N2CGYVFC","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:82245acf5bcf3a1ac4612cfac7cb06ece20c75cd622e410da44c811b61ae2384","target":"graph","created_at":"2026-05-18T01:59:59Z","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":"This paper deals with the problem of finding the globally optimal subset of h elements from a larger set of n elements in d space dimensions so as to minimize a quadratic criterion, with an special emphasis on applications to computing the Least Trimmed Squares Estimator (LTSE) for robust regression. The computation of the LTSE is a challenging subset selection problem involving a nonlinear program with continuous and binary variables, linked in a highly nonlinear fashion. The selection of a globally optimal subset using the branch and bound (BB) algorithm is limited to problems in very low di","authors_text":"Salvador Flores","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T18:24:12Z","title":"SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08134","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:ee983d3a9455ff1b47536b17e297feaf93d6d95ed9ea51fc710c0ff3587c7952","target":"record","created_at":"2026-05-18T01:59:59Z","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":"a084e4868ab6eefda8f83e1cdf1d8cc954052a56aff7714eeb1d14a150491a60","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-29T18:24:12Z","title_canon_sha256":"6a2c3e314798f4661d9a801c17aaf33a7b7f86a06ef3c5242833c4ecb64cd1b1"},"schema_version":"1.0","source":{"id":"1505.08134","kind":"arxiv","version":1}},"canonical_sha256":"6e846c54a2a06f1a9ae03d166544a087b8be814d115d940d68db674a24cc8b86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e846c54a2a06f1a9ae03d166544a087b8be814d115d940d68db674a24cc8b86","first_computed_at":"2026-05-18T01:59:59.589972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:59.589972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IAj23/1gqHljPD1l/qDLkWFFJBr0T/0ZuWZF+86FiMwN7lpWsGSLq1u/plbBDsiKJXKR9BlgFjStq1Owt9qaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:59.590470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.08134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee983d3a9455ff1b47536b17e297feaf93d6d95ed9ea51fc710c0ff3587c7952","sha256:82245acf5bcf3a1ac4612cfac7cb06ece20c75cd622e410da44c811b61ae2384"],"state_sha256":"a7f484c18cea33049cbd7687d247c0e985752eb6bc0789dad7149ec2f1560a36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9KWLyU1q+NIgqUBfbxAIpbzWvwB99OhsE1eNnDlxlZe2Rtm9wayTOvsDOICEtudbXsLo2Vtb1oYv5z/64n6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T03:59:33.229447Z","bundle_sha256":"00e13f8dce21ece15f9e359e11c0c662cb0d8ac29d7505a76c8963c6aeb0d70f"}}