{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:T3KHHL267WXYRAKPBF7XS52BFA","short_pith_number":"pith:T3KHHL26","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"},"canonical_sha256":"9ed473af5efdaf88814f097f797741280a920fb0f23d3abe6393a0567c40f3c3","source":{"kind":"arxiv","id":"1807.00234","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00234","created_at":"2026-05-17T23:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00234v2","created_at":"2026-05-17T23:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00234","created_at":"2026-05-17T23:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"T3KHHL267WXY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T3KHHL267WXYRAKP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T3KHHL26","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:T3KHHL267WXYRAKPBF7XS52BFA","target":"record","payload":{"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"},"canonical_sha256":"9ed473af5efdaf88814f097f797741280a920fb0f23d3abe6393a0567c40f3c3","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"},"source_kind":"arxiv","source_id":"1807.00234","source_version":2,"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-17T23:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SSEnjcyUvYkQ/leQBFkyx+U0mEyVC/GaOcDk7H2LxJHntaDrKYShRFgWRCyvZ5mUWF1PR8B8Ypbx1YfKYvAGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T03:35:09.121844Z"},"content_sha256":"459e71d8190e038f309462ce065ca4e2d1d773b6bf34852d157af287a2212963","schema_version":"1.0","event_id":"sha256:459e71d8190e038f309462ce065ca4e2d1d773b6bf34852d157af287a2212963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:T3KHHL267WXYRAKPBF7XS52BFA","target":"graph","payload":{"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"},"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-17T23:45:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RP6dDptViX38oFaVD4hdoqCOr1dFt+km64c4j9R/F4k8oWpcIVXd5sVjZ1j+APFdtPmzQgkdzC6bp9PmN5DjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T03:35:09.122185Z"},"content_sha256":"afcab6d59f9456c0fcdc6a24258a1bfd13e11e679adef267fffa5be4b7eeec07","schema_version":"1.0","event_id":"sha256:afcab6d59f9456c0fcdc6a24258a1bfd13e11e679adef267fffa5be4b7eeec07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/bundle.json","state_url":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3KHHL267WXYRAKPBF7XS52BFA/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-05T03:35:09Z","links":{"resolver":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA","bundle":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/bundle.json","state":"https://pith.science/pith/T3KHHL267WXYRAKPBF7XS52BFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3KHHL267WXYRAKPBF7XS52BFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T3KHHL267WXYRAKPBF7XS52BFA","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":"0b8d584eda2d7ca09c90052ea1f92a0682d44f6f8ac29e743c97e6c6b3a5a5f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-30T22:18:30Z","title_canon_sha256":"28d4eba0cef99015659b79efd7e30e2f6553053850b81e6328fad85e2f6a1d90"},"schema_version":"1.0","source":{"id":"1807.00234","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00234","created_at":"2026-05-17T23:45:37Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00234v2","created_at":"2026-05-17T23:45:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00234","created_at":"2026-05-17T23:45:37Z"},{"alias_kind":"pith_short_12","alias_value":"T3KHHL267WXY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T3KHHL267WXYRAKP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T3KHHL26","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:afcab6d59f9456c0fcdc6a24258a1bfd13e11e679adef267fffa5be4b7eeec07","target":"graph","created_at":"2026-05-17T23:45:37Z","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":"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","authors_text":"Gabor T. Herman, Homeira Pajoohesh, T. Yung Kong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-30T22:18:30Z","title":"String-Averaging Algorithms for Convex Feasibility with Infinitely Many Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00234","kind":"arxiv","version":2},"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:459e71d8190e038f309462ce065ca4e2d1d773b6bf34852d157af287a2212963","target":"record","created_at":"2026-05-17T23:45:37Z","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":"0b8d584eda2d7ca09c90052ea1f92a0682d44f6f8ac29e743c97e6c6b3a5a5f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-30T22:18:30Z","title_canon_sha256":"28d4eba0cef99015659b79efd7e30e2f6553053850b81e6328fad85e2f6a1d90"},"schema_version":"1.0","source":{"id":"1807.00234","kind":"arxiv","version":2}},"canonical_sha256":"9ed473af5efdaf88814f097f797741280a920fb0f23d3abe6393a0567c40f3c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ed473af5efdaf88814f097f797741280a920fb0f23d3abe6393a0567c40f3c3","first_computed_at":"2026-05-17T23:45:37.800292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:37.800292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4BgEC4yYQ993nsCFyNcQB7gl3tO6M3OWasZPGWK8XcChG1bS4MfoE+DZjUe/zypGaceii/NyqunxvFTGzRhhDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:37.800906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00234","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:459e71d8190e038f309462ce065ca4e2d1d773b6bf34852d157af287a2212963","sha256:afcab6d59f9456c0fcdc6a24258a1bfd13e11e679adef267fffa5be4b7eeec07"],"state_sha256":"2b74523ad6dec0f13e0c78fe0056aa26d77e305f9b35a3e2a7d0927fe5c6ed5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AS8YllPh7I+QPkA/vA/aF7XMBebeixY1E5YGuFnLF00JoUytbq0ay57+X7gdZn5UOwFCMON+P6fOe/UOi0P5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T03:35:09.124250Z","bundle_sha256":"26eb22ed4ffa2e17a00bc0f2b518a53600edef61d3aa884477162c5e1385f95b"}}