{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:ONYG2LI4O4TMPOQH4NU7RWFJDH","short_pith_number":"pith:ONYG2LI4","schema_version":"1.0","canonical_sha256":"73706d2d1c7726c7ba07e369f8d8a919faf780993de4af47476eac330ee2ceff","source":{"kind":"arxiv","id":"0804.3647","version":1},"attestation_state":"computed","paper":{"title":"On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Dan Butnariu, Ethan Hadar, Pini Gurfil, Yair Censor","submitted_at":"2008-04-23T06:48:05Z","abstract_excerpt":"We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user-flexibility but gives a mathematical guarantee for the algorithm's behavior in the inconsistent case. We present numerical results of computational experiments that illustrate the computational advantage of the new method."},"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":"0804.3647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-04-23T06:48:05Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"28f5a6d24f24c629c10d365178aec41df169b2d92daab2fa84b18ec62606bf69","abstract_canon_sha256":"ca068122cc943b61fff26ea3da25ff029f05ec5493e785294d4de85977551dc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:45.485290Z","signature_b64":"1hEOW0WuISbol3Lk154c8FWRWix1RbAU8gcaDUS2grcvcR8CS3ihnwp5gvOvjDHXE7E8w+0hwGXZKlwdjHYMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73706d2d1c7726c7ba07e369f8d8a919faf780993de4af47476eac330ee2ceff","last_reissued_at":"2026-05-18T04:40:45.484779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:45.484779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Dan Butnariu, Ethan Hadar, Pini Gurfil, Yair Censor","submitted_at":"2008-04-23T06:48:05Z","abstract_excerpt":"We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user-flexibility but gives a mathematical guarantee for the algorithm's behavior in the inconsistent case. We present numerical results of computational experiments that illustrate the computational advantage of the new method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.3647","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":"0804.3647","created_at":"2026-05-18T04:40:45.484878+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.3647v1","created_at":"2026-05-18T04:40:45.484878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.3647","created_at":"2026-05-18T04:40:45.484878+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONYG2LI4O4TM","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONYG2LI4O4TMPOQH","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONYG2LI4","created_at":"2026-05-18T12:25:57.157939+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/ONYG2LI4O4TMPOQH4NU7RWFJDH","json":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH.json","graph_json":"https://pith.science/api/pith-number/ONYG2LI4O4TMPOQH4NU7RWFJDH/graph.json","events_json":"https://pith.science/api/pith-number/ONYG2LI4O4TMPOQH4NU7RWFJDH/events.json","paper":"https://pith.science/paper/ONYG2LI4"},"agent_actions":{"view_html":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH","download_json":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH.json","view_paper":"https://pith.science/paper/ONYG2LI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.3647&json=true","fetch_graph":"https://pith.science/api/pith-number/ONYG2LI4O4TMPOQH4NU7RWFJDH/graph.json","fetch_events":"https://pith.science/api/pith-number/ONYG2LI4O4TMPOQH4NU7RWFJDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/action/storage_attestation","attest_author":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/action/author_attestation","sign_citation":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/action/citation_signature","submit_replication":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/action/replication_record"}},"created_at":"2026-05-18T04:40:45.484878+00:00","updated_at":"2026-05-18T04:40:45.484878+00:00"}