{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QY7DUMVF3DC5FRND5T7NUA3ZML","short_pith_number":"pith:QY7DUMVF","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"},"canonical_sha256":"863e3a32a5d8c5d2c5a3ecfeda037962e636881f88f4d3b7e73fbc1c492f7dde","source":{"kind":"arxiv","id":"1805.03030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03030","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03030v1","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03030","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"QY7DUMVF3DC5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QY7DUMVF3DC5FRND","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QY7DUMVF","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QY7DUMVF3DC5FRND5T7NUA3ZML","target":"record","payload":{"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"},"canonical_sha256":"863e3a32a5d8c5d2c5a3ecfeda037962e636881f88f4d3b7e73fbc1c492f7dde","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"},"source_kind":"arxiv","source_id":"1805.03030","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-18T00:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7myZ337uV68Z8WbFkInz6LUZwVSTpJ77rgVblnzMC63yOnajkQEeUWAlSQAQm7xrd4Vm25OMmiBGAhVSuRLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:28:08.879172Z"},"content_sha256":"4b2bc70ce2736fc76d3c94db6e65f2f8e46c3d9a61e8a9b2c3177c3263aba022","schema_version":"1.0","event_id":"sha256:4b2bc70ce2736fc76d3c94db6e65f2f8e46c3d9a61e8a9b2c3177c3263aba022"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QY7DUMVF3DC5FRND5T7NUA3ZML","target":"graph","payload":{"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"},"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-18T00:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieMdAMOg7DgtDe5E5C2/BrKYNY9ZAInACefbE5cEfpvBZZH+CRCH6icthPh6XI0l+bFfEqLgxxcZjcpJMnZYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:28:08.879542Z"},"content_sha256":"6cbb57821c8c401f8b0a68c93e2d68cd0f84b13d6d11551687a61c671e01f053","schema_version":"1.0","event_id":"sha256:6cbb57821c8c401f8b0a68c93e2d68cd0f84b13d6d11551687a61c671e01f053"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/bundle.json","state_url":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/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-05-30T15:28:08Z","links":{"resolver":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML","bundle":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/bundle.json","state":"https://pith.science/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY7DUMVF3DC5FRND5T7NUA3ZML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QY7DUMVF3DC5FRND5T7NUA3ZML","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":"8099180b144f2e3d43a8186552f8d7cd95c3deb95e9595da8834a781131af59e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-08T14:01:26Z","title_canon_sha256":"d7e385b26c7f5153ccdc114564edd3afc578a9cb831ac4b8b76eb49e0526a8ba"},"schema_version":"1.0","source":{"id":"1805.03030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03030","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03030v1","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03030","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"QY7DUMVF3DC5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QY7DUMVF3DC5FRND","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QY7DUMVF","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:6cbb57821c8c401f8b0a68c93e2d68cd0f84b13d6d11551687a61c671e01f053","target":"graph","created_at":"2026-05-18T00:16:34Z","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":"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","authors_text":"Minglu Ye, Ting Kei Pong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-08T14:01:26Z","title":"A subgradient-based approach for finding the maximum feasible subsystem with respect to a set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03030","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:4b2bc70ce2736fc76d3c94db6e65f2f8e46c3d9a61e8a9b2c3177c3263aba022","target":"record","created_at":"2026-05-18T00:16:34Z","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":"8099180b144f2e3d43a8186552f8d7cd95c3deb95e9595da8834a781131af59e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-08T14:01:26Z","title_canon_sha256":"d7e385b26c7f5153ccdc114564edd3afc578a9cb831ac4b8b76eb49e0526a8ba"},"schema_version":"1.0","source":{"id":"1805.03030","kind":"arxiv","version":1}},"canonical_sha256":"863e3a32a5d8c5d2c5a3ecfeda037962e636881f88f4d3b7e73fbc1c492f7dde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863e3a32a5d8c5d2c5a3ecfeda037962e636881f88f4d3b7e73fbc1c492f7dde","first_computed_at":"2026-05-18T00:16:34.869069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:34.869069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xsuC0KYZx9WzlyQsVR27xi+CXiG93a7TSIX/I6lWkpDshQf+djpCDcGh5zEa8BdpwU95W/OMvqO+7SkDT5ySDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:34.869615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b2bc70ce2736fc76d3c94db6e65f2f8e46c3d9a61e8a9b2c3177c3263aba022","sha256:6cbb57821c8c401f8b0a68c93e2d68cd0f84b13d6d11551687a61c671e01f053"],"state_sha256":"6e8370210bee7de512995d804c592efe5a52600434ea088bc600754a66d9e6ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JFG+Kjy3MHYC91SPeUBHp9HL00UleKFE6NFq9pU4ZK60EOt1gVrRkiuG9bh2eeDcwDXikLRP6Uw6JqthhCAFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:28:08.881698Z","bundle_sha256":"15f0d15a5ce8af60224623d6c09e117ae71721745cba93f50d44b75c152d9614"}}