{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ONYG2LI4O4TMPOQH4NU7RWFJDH","short_pith_number":"pith:ONYG2LI4","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"},"canonical_sha256":"73706d2d1c7726c7ba07e369f8d8a919faf780993de4af47476eac330ee2ceff","source":{"kind":"arxiv","id":"0804.3647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.3647","created_at":"2026-05-18T04:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"0804.3647v1","created_at":"2026-05-18T04:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.3647","created_at":"2026-05-18T04:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"ONYG2LI4O4TM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"ONYG2LI4O4TMPOQH","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"ONYG2LI4","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ONYG2LI4O4TMPOQH4NU7RWFJDH","target":"record","payload":{"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"},"canonical_sha256":"73706d2d1c7726c7ba07e369f8d8a919faf780993de4af47476eac330ee2ceff","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"},"source_kind":"arxiv","source_id":"0804.3647","source_version":1,"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-18T04:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/tJRjt8KRnf2rQrTBM887pCXky28Wdt4elwyokPCiitROGfn7yf3++WjbBJsw09Wvy9OtJocsTbrKIlquHJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:17:45.410995Z"},"content_sha256":"1eef53b39aca237f781ca763ebe9b8e1ec3dd51d273f647300c6dd41b7520e1b","schema_version":"1.0","event_id":"sha256:1eef53b39aca237f781ca763ebe9b8e1ec3dd51d273f647300c6dd41b7520e1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ONYG2LI4O4TMPOQH4NU7RWFJDH","target":"graph","payload":{"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"},"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-18T04:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"js9gDlieHIWEwZLefcjzZR2idHqXjwza+6cx/VoZroTOJf1x3HxE7Yt8NsS+fycyHIeV6c8gr3ti/hJFSWYgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:17:45.411811Z"},"content_sha256":"24fc068c41c7f97fcf841f1285c0412fa30522e318659d00e552cce4e56f9f6f","schema_version":"1.0","event_id":"sha256:24fc068c41c7f97fcf841f1285c0412fa30522e318659d00e552cce4e56f9f6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/bundle.json","state_url":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/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-05-31T08:17:45Z","links":{"resolver":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH","bundle":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/bundle.json","state":"https://pith.science/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONYG2LI4O4TMPOQH4NU7RWFJDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ONYG2LI4O4TMPOQH4NU7RWFJDH","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":"ca068122cc943b61fff26ea3da25ff029f05ec5493e785294d4de85977551dc9","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-04-23T06:48:05Z","title_canon_sha256":"28f5a6d24f24c629c10d365178aec41df169b2d92daab2fa84b18ec62606bf69"},"schema_version":"1.0","source":{"id":"0804.3647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.3647","created_at":"2026-05-18T04:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"0804.3647v1","created_at":"2026-05-18T04:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.3647","created_at":"2026-05-18T04:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"ONYG2LI4O4TM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"ONYG2LI4O4TMPOQH","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"ONYG2LI4","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:24fc068c41c7f97fcf841f1285c0412fa30522e318659d00e552cce4e56f9f6f","target":"graph","created_at":"2026-05-18T04:40:45Z","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":"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.","authors_text":"Dan Butnariu, Ethan Hadar, Pini Gurfil, Yair Censor","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-04-23T06:48:05Z","title":"On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.3647","kind":"arxiv","version":1},"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:1eef53b39aca237f781ca763ebe9b8e1ec3dd51d273f647300c6dd41b7520e1b","target":"record","created_at":"2026-05-18T04:40:45Z","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":"ca068122cc943b61fff26ea3da25ff029f05ec5493e785294d4de85977551dc9","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-04-23T06:48:05Z","title_canon_sha256":"28f5a6d24f24c629c10d365178aec41df169b2d92daab2fa84b18ec62606bf69"},"schema_version":"1.0","source":{"id":"0804.3647","kind":"arxiv","version":1}},"canonical_sha256":"73706d2d1c7726c7ba07e369f8d8a919faf780993de4af47476eac330ee2ceff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73706d2d1c7726c7ba07e369f8d8a919faf780993de4af47476eac330ee2ceff","first_computed_at":"2026-05-18T04:40:45.484779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:45.484779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1hEOW0WuISbol3Lk154c8FWRWix1RbAU8gcaDUS2grcvcR8CS3ihnwp5gvOvjDHXE7E8w+0hwGXZKlwdjHYMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:45.485290Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.3647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eef53b39aca237f781ca763ebe9b8e1ec3dd51d273f647300c6dd41b7520e1b","sha256:24fc068c41c7f97fcf841f1285c0412fa30522e318659d00e552cce4e56f9f6f"],"state_sha256":"b7a302c4740a0c2e5889e6877e4a6881f4d9d53fca6f284f39ace41493a75ecb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBWknbpCCM495SXyiRL3QN/Y4bJn90z+4KGbyWgAnG5RZcZ+R5R9mfaVUj1MIjWepypm2ZsKDytmkEEkNM0FCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:17:45.416250Z","bundle_sha256":"9a1437ec426272fac659e418dc918b2429b250b31f1e522e51e3bfb980426b6a"}}