{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:74EW6YUCEBTSA74LXJE2VGMGTD","short_pith_number":"pith:74EW6YUC","schema_version":"1.0","canonical_sha256":"ff096f62822067207f8bba49aa998698d860b74eb083fd135aa7e925b664f9b1","source":{"kind":"arxiv","id":"1703.05233","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"A. Stephen Morse, Daniel Fullmer","submitted_at":"2017-03-15T16:21:10Z","abstract_excerpt":"A distributed algorithm is described for finding a common fixed point of a family of m>1 nonlinear maps M_i : R^n -> R^n assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed point is simultaneously computed by m agents assuming each agent i knows only M_i, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of a fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-varying directe"},"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":"1703.05233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T16:21:10Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"4ceb050831641f18b485089f2e9a45eb68805008542720c26175501eefe8cd12","abstract_canon_sha256":"16ded39cb57b410a46953d39ba307f8741d1491da6466f0d7f58e3abee0bf637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:21.831527Z","signature_b64":"kVPBLUr0ZG+yGz3zA24geM5u0Jz7svmOOzi9/tpQlmCq8yORtrb2ieRUi2wzJE0Aj9PIDQiLao71nYqzkBXQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff096f62822067207f8bba49aa998698d860b74eb083fd135aa7e925b664f9b1","last_reissued_at":"2026-05-17T23:57:21.831069Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:21.831069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"A. Stephen Morse, Daniel Fullmer","submitted_at":"2017-03-15T16:21:10Z","abstract_excerpt":"A distributed algorithm is described for finding a common fixed point of a family of m>1 nonlinear maps M_i : R^n -> R^n assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed point is simultaneously computed by m agents assuming each agent i knows only M_i, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of a fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-varying directe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05233","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":"1703.05233","created_at":"2026-05-17T23:57:21.831141+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05233v1","created_at":"2026-05-17T23:57:21.831141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05233","created_at":"2026-05-17T23:57:21.831141+00:00"},{"alias_kind":"pith_short_12","alias_value":"74EW6YUCEBTS","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"74EW6YUCEBTSA74L","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"74EW6YUC","created_at":"2026-05-18T12:31:03.183658+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/74EW6YUCEBTSA74LXJE2VGMGTD","json":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD.json","graph_json":"https://pith.science/api/pith-number/74EW6YUCEBTSA74LXJE2VGMGTD/graph.json","events_json":"https://pith.science/api/pith-number/74EW6YUCEBTSA74LXJE2VGMGTD/events.json","paper":"https://pith.science/paper/74EW6YUC"},"agent_actions":{"view_html":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD","download_json":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD.json","view_paper":"https://pith.science/paper/74EW6YUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05233&json=true","fetch_graph":"https://pith.science/api/pith-number/74EW6YUCEBTSA74LXJE2VGMGTD/graph.json","fetch_events":"https://pith.science/api/pith-number/74EW6YUCEBTSA74LXJE2VGMGTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/action/storage_attestation","attest_author":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/action/author_attestation","sign_citation":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/action/citation_signature","submit_replication":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/action/replication_record"}},"created_at":"2026-05-17T23:57:21.831141+00:00","updated_at":"2026-05-17T23:57:21.831141+00:00"}