{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BD7F7XW42I64UKQ7MP6BRB3LSM","short_pith_number":"pith:BD7F7XW4","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"},"canonical_sha256":"08fe5fdedcd23dca2a1f63fc18876b930ef882a419de6f8df270ad52b36d56c7","source":{"kind":"arxiv","id":"1306.2516","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2516","created_at":"2026-05-18T03:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2516v3","created_at":"2026-05-18T03:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2516","created_at":"2026-05-18T03:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"BD7F7XW42I64","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BD7F7XW42I64UKQ7","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BD7F7XW4","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BD7F7XW42I64UKQ7MP6BRB3LSM","target":"record","payload":{"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"},"canonical_sha256":"08fe5fdedcd23dca2a1f63fc18876b930ef882a419de6f8df270ad52b36d56c7","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"},"source_kind":"arxiv","source_id":"1306.2516","source_version":3,"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-18T03:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1IFFSSSJICkJtN2W2ixriP9ZUf3ydntPlUfjIw+Bcs8f/lRftizeCfY5SGGH770v8Fpa8LZAYhmr/Kfafk0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:28:55.881739Z"},"content_sha256":"15f3f7e3fb422d174237aff6fa1b9d2fa5cf402318e66e6293470e550fe2419c","schema_version":"1.0","event_id":"sha256:15f3f7e3fb422d174237aff6fa1b9d2fa5cf402318e66e6293470e550fe2419c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BD7F7XW42I64UKQ7MP6BRB3LSM","target":"graph","payload":{"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"},"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-18T03:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNc5+LC2OScUKy9eJWpYZ2+TbWakUsCC8qJmBUfyVyLDh3PvGKvWAIHIy83TgBHUWTCUQ2rI7EsNhZwiUMzPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:28:55.882096Z"},"content_sha256":"63f3c1d1255aba28bfbe581dfae6cadadc313a7b6db341e3f4c4ae684bf2594e","schema_version":"1.0","event_id":"sha256:63f3c1d1255aba28bfbe581dfae6cadadc313a7b6db341e3f4c4ae684bf2594e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/bundle.json","state_url":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/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-07-03T06:28:55Z","links":{"resolver":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM","bundle":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/bundle.json","state":"https://pith.science/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BD7F7XW42I64UKQ7MP6BRB3LSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BD7F7XW42I64UKQ7MP6BRB3LSM","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":"2dd0ffab614cc5afde34ee021a8fa80e2b836971e1f486c527848a73d3dcb302","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-11T13:25:31Z","title_canon_sha256":"799fb6285fc5065d4b7f769c563f668b3fedb5ed678df605c887da3f377e593f"},"schema_version":"1.0","source":{"id":"1306.2516","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2516","created_at":"2026-05-18T03:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2516v3","created_at":"2026-05-18T03:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2516","created_at":"2026-05-18T03:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"BD7F7XW42I64","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BD7F7XW42I64UKQ7","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BD7F7XW4","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:63f3c1d1255aba28bfbe581dfae6cadadc313a7b6db341e3f4c4ae684bf2594e","target":"graph","created_at":"2026-05-18T03:21:00Z","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":"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 ","authors_text":"A. Enis Cetin, Alican Bozkurt, Ibrahim Onaran, Kivanc Kose, Osman Gunay, R. A. Sevimli, Y. Hakan Habiboglu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-11T13:25:31Z","title":"Projections Onto Convex Sets (POCS) Based Optimization by Lifting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2516","kind":"arxiv","version":3},"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:15f3f7e3fb422d174237aff6fa1b9d2fa5cf402318e66e6293470e550fe2419c","target":"record","created_at":"2026-05-18T03:21:00Z","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":"2dd0ffab614cc5afde34ee021a8fa80e2b836971e1f486c527848a73d3dcb302","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-11T13:25:31Z","title_canon_sha256":"799fb6285fc5065d4b7f769c563f668b3fedb5ed678df605c887da3f377e593f"},"schema_version":"1.0","source":{"id":"1306.2516","kind":"arxiv","version":3}},"canonical_sha256":"08fe5fdedcd23dca2a1f63fc18876b930ef882a419de6f8df270ad52b36d56c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08fe5fdedcd23dca2a1f63fc18876b930ef882a419de6f8df270ad52b36d56c7","first_computed_at":"2026-05-18T03:21:00.017721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:00.017721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iYRg06rr2cUyvkxmeBHyMjADnJxFfca8rK7leaM943lH6DkH4vr6qxG3IXMOhYSrPi4GE60vNFSBKjWuwP2BDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:00.018267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2516","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f3f7e3fb422d174237aff6fa1b9d2fa5cf402318e66e6293470e550fe2419c","sha256:63f3c1d1255aba28bfbe581dfae6cadadc313a7b6db341e3f4c4ae684bf2594e"],"state_sha256":"11ecf0b5308649d0429315af9bbb43acd58d06b2d2a41b7b7cf8189270aa62a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yn2y5sRO8NE6Ls2HhKoCnpgRULIou9E+WQ5UeqOtjD/hrhzfh6+xm8LGLn0ASC43Kms0OJo7VHR6oQZjhm6xBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T06:28:55.884021Z","bundle_sha256":"b74cbb6d7ee97b142e142a25384124772af331f27703dc04f099ecb6148e5280"}}