{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BD7F7XW42I64UKQ7MP6BRB3LSM","short_pith_number":"pith:BD7F7XW4","schema_version":"1.0","canonical_sha256":"08fe5fdedcd23dca2a1f63fc18876b930ef882a419de6f8df270ad52b36d56c7","source":{"kind":"arxiv","id":"1306.2516","version":3},"attestation_state":"computed","paper":{"title":"Projections Onto Convex Sets (POCS) Based Optimization by Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"A. Enis Cetin, Alican Bozkurt, Ibrahim Onaran, Kivanc Kose, Osman Gunay, R. A. Sevimli, Y. Hakan Habiboglu","submitted_at":"2013-06-11T13:25:31Z","abstract_excerpt":"Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by one and sets corresponding to the cost function are defined. If the cost function is a convex function in R^N the corresponding set is a convex set in R^(N+1). The iterative optimization approach starts with an arbitrary initial estimate in R^(N+1) and an orthogonal projection is performed onto one of the sets in a sequential manner at each step of the optimization problem. The "},"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":"1306.2516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-11T13:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"799fb6285fc5065d4b7f769c563f668b3fedb5ed678df605c887da3f377e593f","abstract_canon_sha256":"2dd0ffab614cc5afde34ee021a8fa80e2b836971e1f486c527848a73d3dcb302"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:00.018267Z","signature_b64":"iYRg06rr2cUyvkxmeBHyMjADnJxFfca8rK7leaM943lH6DkH4vr6qxG3IXMOhYSrPi4GE60vNFSBKjWuwP2BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08fe5fdedcd23dca2a1f63fc18876b930ef882a419de6f8df270ad52b36d56c7","last_reissued_at":"2026-05-18T03:21:00.017721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:00.017721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projections Onto Convex Sets (POCS) Based Optimization by Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"A. Enis Cetin, Alican Bozkurt, Ibrahim Onaran, Kivanc Kose, Osman Gunay, R. A. Sevimli, Y. Hakan Habiboglu","submitted_at":"2013-06-11T13:25:31Z","abstract_excerpt":"Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by one and sets corresponding to the cost function are defined. If the cost function is a convex function in R^N the corresponding set is a convex set in R^(N+1). The iterative optimization approach starts with an arbitrary initial estimate in R^(N+1) and an orthogonal projection is performed onto one of the sets in a sequential manner at each step of the optimization problem. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2516","kind":"arxiv","version":3},"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":"1306.2516","created_at":"2026-05-18T03:21:00.017819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2516v3","created_at":"2026-05-18T03:21:00.017819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2516","created_at":"2026-05-18T03:21:00.017819+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD7F7XW42I64","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD7F7XW42I64UKQ7","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD7F7XW4","created_at":"2026-05-18T12:27:38.830355+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/BD7F7XW42I64UKQ7MP6BRB3LSM","json":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM.json","graph_json":"https://pith.science/api/pith-number/BD7F7XW42I64UKQ7MP6BRB3LSM/graph.json","events_json":"https://pith.science/api/pith-number/BD7F7XW42I64UKQ7MP6BRB3LSM/events.json","paper":"https://pith.science/paper/BD7F7XW4"},"agent_actions":{"view_html":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM","download_json":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM.json","view_paper":"https://pith.science/paper/BD7F7XW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2516&json=true","fetch_graph":"https://pith.science/api/pith-number/BD7F7XW42I64UKQ7MP6BRB3LSM/graph.json","fetch_events":"https://pith.science/api/pith-number/BD7F7XW42I64UKQ7MP6BRB3LSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/action/storage_attestation","attest_author":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/action/author_attestation","sign_citation":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/action/citation_signature","submit_replication":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/action/replication_record"}},"created_at":"2026-05-18T03:21:00.017819+00:00","updated_at":"2026-05-18T03:21:00.017819+00:00"}