{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T3KHHL267WXYRAKPBF7XS52BFA","short_pith_number":"pith:T3KHHL26","schema_version":"1.0","canonical_sha256":"9ed473af5efdaf88814f097f797741280a920fb0f23d3abe6393a0567c40f3c3","source":{"kind":"arxiv","id":"1807.00234","version":2},"attestation_state":"computed","paper":{"title":"String-Averaging Algorithms for Convex Feasibility with Infinitely Many Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabor T. Herman, Homeira Pajoohesh, T. Yung Kong","submitted_at":"2018-06-30T22:18:30Z","abstract_excerpt":"Algorithms for convex feasibility find or approximate a point in the intersection of given closed convex sets. Typically there are only finitely many convex sets, but the case of infinitely many convex sets also has some applications. In this context, a \\emph{string} is a finite sequence of points each of which is obtained from the previous point by considering one of the convex sets. In a \\emph{string-averaging} algorithm, an iterative step from a first point to a second point computes a number of strings, all starting with the first point, and then calculates a (weighted) average of those st"},"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":"1807.00234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-30T22:18:30Z","cross_cats_sorted":[],"title_canon_sha256":"28d4eba0cef99015659b79efd7e30e2f6553053850b81e6328fad85e2f6a1d90","abstract_canon_sha256":"0b8d584eda2d7ca09c90052ea1f92a0682d44f6f8ac29e743c97e6c6b3a5a5f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:37.800906Z","signature_b64":"4BgEC4yYQ993nsCFyNcQB7gl3tO6M3OWasZPGWK8XcChG1bS4MfoE+DZjUe/zypGaceii/NyqunxvFTGzRhhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed473af5efdaf88814f097f797741280a920fb0f23d3abe6393a0567c40f3c3","last_reissued_at":"2026-05-17T23:45:37.800292Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:37.800292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"String-Averaging Algorithms for Convex Feasibility with Infinitely Many Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabor T. Herman, Homeira Pajoohesh, T. Yung Kong","submitted_at":"2018-06-30T22:18:30Z","abstract_excerpt":"Algorithms for convex feasibility find or approximate a point in the intersection of given closed convex sets. Typically there are only finitely many convex sets, but the case of infinitely many convex sets also has some applications. In this context, a \\emph{string} is a finite sequence of points each of which is obtained from the previous point by considering one of the convex sets. In a \\emph{string-averaging} algorithm, an iterative step from a first point to a second point computes a number of strings, all starting with the first point, and then calculates a (weighted) average of those st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00234","kind":"arxiv","version":2},"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":"1807.00234","created_at":"2026-05-17T23:45:37.800381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00234v2","created_at":"2026-05-17T23:45:37.800381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00234","created_at":"2026-05-17T23:45:37.800381+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3KHHL267WXY","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3KHHL267WXYRAKP","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3KHHL26","created_at":"2026-05-18T12:32:53.628368+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/T3KHHL267WXYRAKPBF7XS52BFA","json":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA.json","graph_json":"https://pith.science/api/pith-number/T3KHHL267WXYRAKPBF7XS52BFA/graph.json","events_json":"https://pith.science/api/pith-number/T3KHHL267WXYRAKPBF7XS52BFA/events.json","paper":"https://pith.science/paper/T3KHHL26"},"agent_actions":{"view_html":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA","download_json":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA.json","view_paper":"https://pith.science/paper/T3KHHL26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00234&json=true","fetch_graph":"https://pith.science/api/pith-number/T3KHHL267WXYRAKPBF7XS52BFA/graph.json","fetch_events":"https://pith.science/api/pith-number/T3KHHL267WXYRAKPBF7XS52BFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/action/storage_attestation","attest_author":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/action/author_attestation","sign_citation":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/action/citation_signature","submit_replication":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/action/replication_record"}},"created_at":"2026-05-17T23:45:37.800381+00:00","updated_at":"2026-05-17T23:45:37.800381+00:00"}