{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TAENIMSZD6DKG7LKDRBG5ZIHZM","short_pith_number":"pith:TAENIMSZ","schema_version":"1.0","canonical_sha256":"9808d432591f86a37d6a1c426ee507cb14dd472fa4ff53ea51bbd4d916629023","source":{"kind":"arxiv","id":"1903.01101","version":4},"attestation_state":"computed","paper":{"title":"A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chen Chen, Liaoyuan Zeng, Lulin Tan, Ting Kei Pong","submitted_at":"2019-03-04T07:32:48Z","abstract_excerpt":"The split feasibility problem is to find an element in the intersection of a closed set $C$ and the linear preimage of another closed set $D$, assuming the projections onto $C$ and $D$ are easy to compute. This class of problems arises naturally in many contemporary applications such as compressed sensing. While the sets $C$ and $D$ are typically assumed to be convex in the literature, in this paper, we allow both sets to be possibly nonconvex. We observe that, in this setting, the split feasibility problem can be formulated as an optimization problem with a difference-of-convex objective so t"},"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":"1903.01101","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T07:32:48Z","cross_cats_sorted":[],"title_canon_sha256":"ea2959510eb448018128b3f7b189fa88d966da2b29a0206c68c030d0d4782527","abstract_canon_sha256":"e2d06df8ab0441bf4ccbd1878eb485953ddbc1af8b6dbad6326f1924cd94a13f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:00.224716Z","signature_b64":"v8lokZ9loyxGQw3puRfNDvI8tNCZ2IBQtdH65F3AAr8BrOmbmL1hjWsKDkrcviVr2oYsdH5rTyHzIQgFeA+8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9808d432591f86a37d6a1c426ee507cb14dd472fa4ff53ea51bbd4d916629023","last_reissued_at":"2026-07-05T01:49:00.224297Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:00.224297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chen Chen, Liaoyuan Zeng, Lulin Tan, Ting Kei Pong","submitted_at":"2019-03-04T07:32:48Z","abstract_excerpt":"The split feasibility problem is to find an element in the intersection of a closed set $C$ and the linear preimage of another closed set $D$, assuming the projections onto $C$ and $D$ are easy to compute. This class of problems arises naturally in many contemporary applications such as compressed sensing. While the sets $C$ and $D$ are typically assumed to be convex in the literature, in this paper, we allow both sets to be possibly nonconvex. We observe that, in this setting, the split feasibility problem can be formulated as an optimization problem with a difference-of-convex objective so t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01101","kind":"arxiv","version":4},"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/1903.01101/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":"1903.01101","created_at":"2026-07-05T01:49:00.224366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01101v4","created_at":"2026-07-05T01:49:00.224366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01101","created_at":"2026-07-05T01:49:00.224366+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAENIMSZD6DK","created_at":"2026-07-05T01:49:00.224366+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAENIMSZD6DKG7LK","created_at":"2026-07-05T01:49:00.224366+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAENIMSZ","created_at":"2026-07-05T01:49:00.224366+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/TAENIMSZD6DKG7LKDRBG5ZIHZM","json":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM.json","graph_json":"https://pith.science/api/pith-number/TAENIMSZD6DKG7LKDRBG5ZIHZM/graph.json","events_json":"https://pith.science/api/pith-number/TAENIMSZD6DKG7LKDRBG5ZIHZM/events.json","paper":"https://pith.science/paper/TAENIMSZ"},"agent_actions":{"view_html":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM","download_json":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM.json","view_paper":"https://pith.science/paper/TAENIMSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01101&json=true","fetch_graph":"https://pith.science/api/pith-number/TAENIMSZD6DKG7LKDRBG5ZIHZM/graph.json","fetch_events":"https://pith.science/api/pith-number/TAENIMSZD6DKG7LKDRBG5ZIHZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM/action/storage_attestation","attest_author":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM/action/author_attestation","sign_citation":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM/action/citation_signature","submit_replication":"https://pith.science/pith/TAENIMSZD6DKG7LKDRBG5ZIHZM/action/replication_record"}},"created_at":"2026-07-05T01:49:00.224366+00:00","updated_at":"2026-07-05T01:49:00.224366+00:00"}