{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NS4MDKR5D22EFVJB3XWHP6NXU3","short_pith_number":"pith:NS4MDKR5","schema_version":"1.0","canonical_sha256":"6cb8c1aa3d1eb442d521ddec77f9b7a6dcfc60379b9d566d5714818fe929610b","source":{"kind":"arxiv","id":"1902.02481","version":1},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Computing a Common Fixed Point of a Group of Nonexpansive Operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gang Feng, Xiuxian Li","submitted_at":"2019-02-07T05:46:37Z","abstract_excerpt":"This paper addresses the problem of seeking a common fixed point for a collection of nonexpansive operators over time-varying multi-agent networks in real Hilbert spaces, where each operator is only privately and approximately known to each individual agent, and all agents need to cooperate to solve this problem by propagating their own information to their neighbors through local communications over time-varying networks. To handle this problem, inspired by the centralized inexact Krasnosel'ski\\u{\\i}-Mann (IKM) iteration, we propose a distributed algorithm, called distributed inexact Krasnose"},"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":"1902.02481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-07T05:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"15762e7b6efb843c86ab22ad54927f919380de492a4fadf4cc31f774e5ec7e81","abstract_canon_sha256":"974cb4e16f1e741a386370a74cc99cd1edf8483f503355946057856c0ef45801"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:33.178914Z","signature_b64":"bffq5+Nf7m1VH0gSUs13dFzSmde2aVcUJQBdJfg8I5q/EyqwdO+iDdWL7Pb0zzn9HFiLIDoRax7s6z1gZaEEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cb8c1aa3d1eb442d521ddec77f9b7a6dcfc60379b9d566d5714818fe929610b","last_reissued_at":"2026-05-17T23:54:33.178236Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:33.178236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Computing a Common Fixed Point of a Group of Nonexpansive Operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gang Feng, Xiuxian Li","submitted_at":"2019-02-07T05:46:37Z","abstract_excerpt":"This paper addresses the problem of seeking a common fixed point for a collection of nonexpansive operators over time-varying multi-agent networks in real Hilbert spaces, where each operator is only privately and approximately known to each individual agent, and all agents need to cooperate to solve this problem by propagating their own information to their neighbors through local communications over time-varying networks. To handle this problem, inspired by the centralized inexact Krasnosel'ski\\u{\\i}-Mann (IKM) iteration, we propose a distributed algorithm, called distributed inexact Krasnose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02481","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":"1902.02481","created_at":"2026-05-17T23:54:33.178363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02481v1","created_at":"2026-05-17T23:54:33.178363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02481","created_at":"2026-05-17T23:54:33.178363+00:00"},{"alias_kind":"pith_short_12","alias_value":"NS4MDKR5D22E","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NS4MDKR5D22EFVJB","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NS4MDKR5","created_at":"2026-05-18T12:33:24.271573+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/NS4MDKR5D22EFVJB3XWHP6NXU3","json":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3.json","graph_json":"https://pith.science/api/pith-number/NS4MDKR5D22EFVJB3XWHP6NXU3/graph.json","events_json":"https://pith.science/api/pith-number/NS4MDKR5D22EFVJB3XWHP6NXU3/events.json","paper":"https://pith.science/paper/NS4MDKR5"},"agent_actions":{"view_html":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3","download_json":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3.json","view_paper":"https://pith.science/paper/NS4MDKR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02481&json=true","fetch_graph":"https://pith.science/api/pith-number/NS4MDKR5D22EFVJB3XWHP6NXU3/graph.json","fetch_events":"https://pith.science/api/pith-number/NS4MDKR5D22EFVJB3XWHP6NXU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3/action/storage_attestation","attest_author":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3/action/author_attestation","sign_citation":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3/action/citation_signature","submit_replication":"https://pith.science/pith/NS4MDKR5D22EFVJB3XWHP6NXU3/action/replication_record"}},"created_at":"2026-05-17T23:54:33.178363+00:00","updated_at":"2026-05-17T23:54:33.178363+00:00"}