{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TVTE4OOOMGGWKR5NCQPOQ3UX6X","short_pith_number":"pith:TVTE4OOO","canonical_record":{"source":{"id":"1308.4191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T23:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"9ea6ea702b1070387dfe9203e34fc4347301ee072a0e45538516b676ef42e2b5","abstract_canon_sha256":"ecf7a024d7a38ba05f29e66206aabc614dcee3f371d535b55c3c85bf60dddc3b"},"schema_version":"1.0"},"canonical_sha256":"9d664e39ce618d6547ad141ee86e97f5efc7e3fafccac9c9f58faec675d98386","source":{"kind":"arxiv","id":"1308.4191","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4191","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4191v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4191","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"TVTE4OOOMGGW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TVTE4OOOMGGWKR5N","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TVTE4OOO","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TVTE4OOOMGGWKR5NCQPOQ3UX6X","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T23:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"9ea6ea702b1070387dfe9203e34fc4347301ee072a0e45538516b676ef42e2b5","abstract_canon_sha256":"ecf7a024d7a38ba05f29e66206aabc614dcee3f371d535b55c3c85bf60dddc3b"},"schema_version":"1.0"},"canonical_sha256":"9d664e39ce618d6547ad141ee86e97f5efc7e3fafccac9c9f58faec675d98386","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.507682Z","signature_b64":"cj+c8iHvKLe1np+anOFGDCtfer9vsqxwWYbKnJS0frKewIAOKjKHjwpcCaCXjj1JLVHeaE8w43MzMF0oMYyRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d664e39ce618d6547ad141ee86e97f5efc7e3fafccac9c9f58faec675d98386","last_reissued_at":"2026-05-18T03:15:33.506764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.506764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4191","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-18T03:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzmK4vPrHqIT5D4MPvImxj1CurT5DI3cjgXebUP6A92JgqdL0HxjZ+riTVF5PLvfVKLgpCKRcPTSoE5kS6ESAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:39:44.448131Z"},"content_sha256":"3aa4bb0b06b87e1b62a28cc3aa3166684c8739d5fced30445d8821ef756e9a1a","schema_version":"1.0","event_id":"sha256:3aa4bb0b06b87e1b62a28cc3aa3166684c8739d5fced30445d8821ef756e9a1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TVTE4OOOMGGWKR5NCQPOQ3UX6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projected Subgradient Minimization versus Superiorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabor T. Herman, Luba Tetruashvili, Ran Davidi, Reinhard W. Schulte, Yair Censor","submitted_at":"2013-08-19T23:49:56Z","abstract_excerpt":"The projected subgradient method for constrained minimization repeatedly interlaces subgradient steps for the objective function with projections onto the feasible region, which is the intersection of closed and convex constraints sets, to regain feasibility. The latter poses a computational difficulty and, therefore, the projected subgradient method is applicable only when the feasible region is \"simple to project onto\". In contrast to this, in the superiorization methodology a feasibility-seeking algorithm leads the overall process and objective function steps are interlaced into it. This ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4191","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-18T03:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VG33Ub96zOyA2gs5oPthHD2u/LFsDw1amnxKTFl0wGRPmCJ79Zof11v6rP3Shh/BdrbSQuJHsi9i6peqYu0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:39:44.449187Z"},"content_sha256":"3ef6281d4e88ae06034b96c4b3566062760a417904029955cb06ad9d4e422fd6","schema_version":"1.0","event_id":"sha256:3ef6281d4e88ae06034b96c4b3566062760a417904029955cb06ad9d4e422fd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVTE4OOOMGGWKR5NCQPOQ3UX6X/bundle.json","state_url":"https://pith.science/pith/TVTE4OOOMGGWKR5NCQPOQ3UX6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVTE4OOOMGGWKR5NCQPOQ3UX6X/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-06-05T20:39:44Z","links":{"resolver":"https://pith.science/pith/TVTE4OOOMGGWKR5NCQPOQ3UX6X","bundle":"https://pith.science/pith/TVTE4OOOMGGWKR5NCQPOQ3UX6X/bundle.json","state":"https://pith.science/pith/TVTE4OOOMGGWKR5NCQPOQ3UX6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVTE4OOOMGGWKR5NCQPOQ3UX6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TVTE4OOOMGGWKR5NCQPOQ3UX6X","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":"ecf7a024d7a38ba05f29e66206aabc614dcee3f371d535b55c3c85bf60dddc3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T23:49:56Z","title_canon_sha256":"9ea6ea702b1070387dfe9203e34fc4347301ee072a0e45538516b676ef42e2b5"},"schema_version":"1.0","source":{"id":"1308.4191","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4191","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4191v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4191","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"TVTE4OOOMGGW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TVTE4OOOMGGWKR5N","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TVTE4OOO","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:3ef6281d4e88ae06034b96c4b3566062760a417904029955cb06ad9d4e422fd6","target":"graph","created_at":"2026-05-18T03:15:33Z","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":"The projected subgradient method for constrained minimization repeatedly interlaces subgradient steps for the objective function with projections onto the feasible region, which is the intersection of closed and convex constraints sets, to regain feasibility. The latter poses a computational difficulty and, therefore, the projected subgradient method is applicable only when the feasible region is \"simple to project onto\". In contrast to this, in the superiorization methodology a feasibility-seeking algorithm leads the overall process and objective function steps are interlaced into it. This ma","authors_text":"Gabor T. Herman, Luba Tetruashvili, Ran Davidi, Reinhard W. Schulte, Yair Censor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T23:49:56Z","title":"Projected Subgradient Minimization versus Superiorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4191","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:3aa4bb0b06b87e1b62a28cc3aa3166684c8739d5fced30445d8821ef756e9a1a","target":"record","created_at":"2026-05-18T03:15:33Z","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":"ecf7a024d7a38ba05f29e66206aabc614dcee3f371d535b55c3c85bf60dddc3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T23:49:56Z","title_canon_sha256":"9ea6ea702b1070387dfe9203e34fc4347301ee072a0e45538516b676ef42e2b5"},"schema_version":"1.0","source":{"id":"1308.4191","kind":"arxiv","version":1}},"canonical_sha256":"9d664e39ce618d6547ad141ee86e97f5efc7e3fafccac9c9f58faec675d98386","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d664e39ce618d6547ad141ee86e97f5efc7e3fafccac9c9f58faec675d98386","first_computed_at":"2026-05-18T03:15:33.506764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:33.506764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cj+c8iHvKLe1np+anOFGDCtfer9vsqxwWYbKnJS0frKewIAOKjKHjwpcCaCXjj1JLVHeaE8w43MzMF0oMYyRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:33.507682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4191","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aa4bb0b06b87e1b62a28cc3aa3166684c8739d5fced30445d8821ef756e9a1a","sha256:3ef6281d4e88ae06034b96c4b3566062760a417904029955cb06ad9d4e422fd6"],"state_sha256":"95feb0aff7c96e693de1ac5b798ee2e988895ddeabad7d1984b7fe44263b13c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqYCXf+v4+DcGBTS8e/kdqRbsHwDGwzifWuLyMxFbm+INqFHcgCu1QZKc5z+z3FlesQejNd7zGx7NmUq5ZJiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:39:44.452906Z","bundle_sha256":"0f7f602a99a8077e2f30477ad20257a2eaa6a20238ff3a490a05fe9838fbaf94"}}