{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VXGSL2BWQ76M4R4YVFTEWEIIC3","short_pith_number":"pith:VXGSL2BW","schema_version":"1.0","canonical_sha256":"adcd25e83687fcce4798a9664b110816fda8d96455d765cb34ebc540f81adc34","source":{"kind":"arxiv","id":"1108.0986","version":1},"attestation_state":"computed","paper":{"title":"A proximal point algorithm for sequential feature extraction applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Stephen Vavasis, Xuan Vinh Doan","submitted_at":"2011-08-04T02:56:09Z","abstract_excerpt":"We propose a proximal point algorithm to solve LAROS problem, that is the problem of finding a \"large approximately rank-one submatrix\". This LAROS problem is used to sequentially extract features in data. We also develop a new stopping criterion for the proximal point algorithm, which is based on the duality conditions of \\eps-optimal solutions of the LAROS problem, with a theoretical guarantee. We test our algorithm with two image databases and show that we can use the LAROS problem to extract appropriate common features from these images."},"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":"1108.0986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-04T02:56:09Z","cross_cats_sorted":[],"title_canon_sha256":"920cdb77753be7947aa1736b879452dcdfa8a1c88c53761f0e170b009ee0bcca","abstract_canon_sha256":"6678d47d361d9e4191bbfc87be3bded83805ee7f9d42ab21bfd945893da2689a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:13.262001Z","signature_b64":"ynEYC/4wzciK6HahPKy5Ch3wgM1CperSbt8VsW9mbUN9u6evZypdinYMZOsOMgZf0i1Tz0SHJc4AK1d2z784DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adcd25e83687fcce4798a9664b110816fda8d96455d765cb34ebc540f81adc34","last_reissued_at":"2026-05-18T04:16:13.261434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:13.261434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proximal point algorithm for sequential feature extraction applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Stephen Vavasis, Xuan Vinh Doan","submitted_at":"2011-08-04T02:56:09Z","abstract_excerpt":"We propose a proximal point algorithm to solve LAROS problem, that is the problem of finding a \"large approximately rank-one submatrix\". This LAROS problem is used to sequentially extract features in data. We also develop a new stopping criterion for the proximal point algorithm, which is based on the duality conditions of \\eps-optimal solutions of the LAROS problem, with a theoretical guarantee. We test our algorithm with two image databases and show that we can use the LAROS problem to extract appropriate common features from these images."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0986","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":"1108.0986","created_at":"2026-05-18T04:16:13.261516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0986v1","created_at":"2026-05-18T04:16:13.261516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0986","created_at":"2026-05-18T04:16:13.261516+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXGSL2BWQ76M","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXGSL2BWQ76M4R4Y","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXGSL2BW","created_at":"2026-05-18T12:26:44.992195+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/VXGSL2BWQ76M4R4YVFTEWEIIC3","json":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3.json","graph_json":"https://pith.science/api/pith-number/VXGSL2BWQ76M4R4YVFTEWEIIC3/graph.json","events_json":"https://pith.science/api/pith-number/VXGSL2BWQ76M4R4YVFTEWEIIC3/events.json","paper":"https://pith.science/paper/VXGSL2BW"},"agent_actions":{"view_html":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3","download_json":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3.json","view_paper":"https://pith.science/paper/VXGSL2BW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0986&json=true","fetch_graph":"https://pith.science/api/pith-number/VXGSL2BWQ76M4R4YVFTEWEIIC3/graph.json","fetch_events":"https://pith.science/api/pith-number/VXGSL2BWQ76M4R4YVFTEWEIIC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3/action/storage_attestation","attest_author":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3/action/author_attestation","sign_citation":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3/action/citation_signature","submit_replication":"https://pith.science/pith/VXGSL2BWQ76M4R4YVFTEWEIIC3/action/replication_record"}},"created_at":"2026-05-18T04:16:13.261516+00:00","updated_at":"2026-05-18T04:16:13.261516+00:00"}