{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QY7DUMVF3DC5FRND5T7NUA3ZML","short_pith_number":"pith:QY7DUMVF","schema_version":"1.0","canonical_sha256":"863e3a32a5d8c5d2c5a3ecfeda037962e636881f88f4d3b7e73fbc1c492f7dde","source":{"kind":"arxiv","id":"1805.03030","version":1},"attestation_state":"computed","paper":{"title":"A subgradient-based approach for finding the maximum feasible subsystem with respect to a set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minglu Ye, Ting Kei Pong","submitted_at":"2018-05-08T14:01:26Z","abstract_excerpt":"We propose a subgradient-based method for finding the maximum feasible subsystem in a collection of closed sets with respect to a given closed set $C$ (MFS$_C$). In this method, we reformulate the MFS$_C$ problem as an $\\ell_0$ optimization problem and construct a sequence of continuous optimization problems to approximate it. The objective of each approximation problem is the sum of the composition of a nonnegative nondecreasing continuously differentiable concave function with the squared distance function to a closed set. Although this objective function is nonsmooth in general, a subgradie"},"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":"1805.03030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-08T14:01:26Z","cross_cats_sorted":[],"title_canon_sha256":"d7e385b26c7f5153ccdc114564edd3afc578a9cb831ac4b8b76eb49e0526a8ba","abstract_canon_sha256":"8099180b144f2e3d43a8186552f8d7cd95c3deb95e9595da8834a781131af59e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:34.869615Z","signature_b64":"xsuC0KYZx9WzlyQsVR27xi+CXiG93a7TSIX/I6lWkpDshQf+djpCDcGh5zEa8BdpwU95W/OMvqO+7SkDT5ySDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863e3a32a5d8c5d2c5a3ecfeda037962e636881f88f4d3b7e73fbc1c492f7dde","last_reissued_at":"2026-05-18T00:16:34.869069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:34.869069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A subgradient-based approach for finding the maximum feasible subsystem with respect to a set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minglu Ye, Ting Kei Pong","submitted_at":"2018-05-08T14:01:26Z","abstract_excerpt":"We propose a subgradient-based method for finding the maximum feasible subsystem in a collection of closed sets with respect to a given closed set $C$ (MFS$_C$). In this method, we reformulate the MFS$_C$ problem as an $\\ell_0$ optimization problem and construct a sequence of continuous optimization problems to approximate it. The objective of each approximation problem is the sum of the composition of a nonnegative nondecreasing continuously differentiable concave function with the squared distance function to a closed set. Although this objective function is nonsmooth in general, a subgradie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03030","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":"1805.03030","created_at":"2026-05-18T00:16:34.869156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03030v1","created_at":"2026-05-18T00:16:34.869156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03030","created_at":"2026-05-18T00:16:34.869156+00:00"},{"alias_kind":"pith_short_12","alias_value":"QY7DUMVF3DC5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QY7DUMVF3DC5FRND","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QY7DUMVF","created_at":"2026-05-18T12:32:50.500415+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/QY7DUMVF3DC5FRND5T7NUA3ZML","json":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML.json","graph_json":"https://pith.science/api/pith-number/QY7DUMVF3DC5FRND5T7NUA3ZML/graph.json","events_json":"https://pith.science/api/pith-number/QY7DUMVF3DC5FRND5T7NUA3ZML/events.json","paper":"https://pith.science/paper/QY7DUMVF"},"agent_actions":{"view_html":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML","download_json":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML.json","view_paper":"https://pith.science/paper/QY7DUMVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03030&json=true","fetch_graph":"https://pith.science/api/pith-number/QY7DUMVF3DC5FRND5T7NUA3ZML/graph.json","fetch_events":"https://pith.science/api/pith-number/QY7DUMVF3DC5FRND5T7NUA3ZML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/action/storage_attestation","attest_author":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/action/author_attestation","sign_citation":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/action/citation_signature","submit_replication":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/action/replication_record"}},"created_at":"2026-05-18T00:16:34.869156+00:00","updated_at":"2026-05-18T00:16:34.869156+00:00"}