{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:74EW6YUCEBTSA74LXJE2VGMGTD","short_pith_number":"pith:74EW6YUC","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"},"canonical_sha256":"ff096f62822067207f8bba49aa998698d860b74eb083fd135aa7e925b664f9b1","source":{"kind":"arxiv","id":"1703.05233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05233","created_at":"2026-05-17T23:57:21Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05233v1","created_at":"2026-05-17T23:57:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05233","created_at":"2026-05-17T23:57:21Z"},{"alias_kind":"pith_short_12","alias_value":"74EW6YUCEBTS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"74EW6YUCEBTSA74L","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"74EW6YUC","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:74EW6YUCEBTSA74LXJE2VGMGTD","target":"record","payload":{"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"},"canonical_sha256":"ff096f62822067207f8bba49aa998698d860b74eb083fd135aa7e925b664f9b1","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"},"source_kind":"arxiv","source_id":"1703.05233","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-17T23:57:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Msw8kQq5AYb1K63H9cPtJJ3mY+YbH3Myoet7N2hZbFknxNix9apjk8EW3HJpH8CJE3MpdzfVJUGKb/HdQwsgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:16:53.075304Z"},"content_sha256":"a58f8a367d5f0d546302dbb79f8aee9b35b60622f86d79fa7a1461b2b5a36c0b","schema_version":"1.0","event_id":"sha256:a58f8a367d5f0d546302dbb79f8aee9b35b60622f86d79fa7a1461b2b5a36c0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:74EW6YUCEBTSA74LXJE2VGMGTD","target":"graph","payload":{"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"},"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:57:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGkrnOz1sbyyTG0bM/p327+wao0MCD7JU3wcEpswR588/9YKwli+cWbjt6PMrqC26bZWBH/UGgjdR1Y7NR+YAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:16:53.075999Z"},"content_sha256":"62092d086dc3942d7002f2137dfb1a2701a15e4ee7007473f437810732c8750b","schema_version":"1.0","event_id":"sha256:62092d086dc3942d7002f2137dfb1a2701a15e4ee7007473f437810732c8750b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/bundle.json","state_url":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74EW6YUCEBTSA74LXJE2VGMGTD/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-05-27T02:16:53Z","links":{"resolver":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD","bundle":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/bundle.json","state":"https://pith.science/pith/74EW6YUCEBTSA74LXJE2VGMGTD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74EW6YUCEBTSA74LXJE2VGMGTD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:74EW6YUCEBTSA74LXJE2VGMGTD","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":"16ded39cb57b410a46953d39ba307f8741d1491da6466f0d7f58e3abee0bf637","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T16:21:10Z","title_canon_sha256":"4ceb050831641f18b485089f2e9a45eb68805008542720c26175501eefe8cd12"},"schema_version":"1.0","source":{"id":"1703.05233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05233","created_at":"2026-05-17T23:57:21Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05233v1","created_at":"2026-05-17T23:57:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05233","created_at":"2026-05-17T23:57:21Z"},{"alias_kind":"pith_short_12","alias_value":"74EW6YUCEBTS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"74EW6YUCEBTSA74L","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"74EW6YUC","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:62092d086dc3942d7002f2137dfb1a2701a15e4ee7007473f437810732c8750b","target":"graph","created_at":"2026-05-17T23:57:21Z","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":"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","authors_text":"A. Stephen Morse, Daniel Fullmer","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T16:21:10Z","title":"A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05233","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:a58f8a367d5f0d546302dbb79f8aee9b35b60622f86d79fa7a1461b2b5a36c0b","target":"record","created_at":"2026-05-17T23:57:21Z","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":"16ded39cb57b410a46953d39ba307f8741d1491da6466f0d7f58e3abee0bf637","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-15T16:21:10Z","title_canon_sha256":"4ceb050831641f18b485089f2e9a45eb68805008542720c26175501eefe8cd12"},"schema_version":"1.0","source":{"id":"1703.05233","kind":"arxiv","version":1}},"canonical_sha256":"ff096f62822067207f8bba49aa998698d860b74eb083fd135aa7e925b664f9b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff096f62822067207f8bba49aa998698d860b74eb083fd135aa7e925b664f9b1","first_computed_at":"2026-05-17T23:57:21.831069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:21.831069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kVPBLUr0ZG+yGz3zA24geM5u0Jz7svmOOzi9/tpQlmCq8yORtrb2ieRUi2wzJE0Aj9PIDQiLao71nYqzkBXQCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:21.831527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a58f8a367d5f0d546302dbb79f8aee9b35b60622f86d79fa7a1461b2b5a36c0b","sha256:62092d086dc3942d7002f2137dfb1a2701a15e4ee7007473f437810732c8750b"],"state_sha256":"5563e25bad1ffe5cec3abaf407fbb421e68a381d347a350a78fb33d2028373a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSGoK0zAwBY8NlLJZqwe+cqf7FfJSonuj05nyw/rNsms4C1q45NOEtIN+SLYnVSDPt9dNiPB4F5l6UgAn0kuBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:16:53.079383Z","bundle_sha256":"1cb915d2a999d54fcaa99e631786a1064c7e40e89f023fa868721857b24776a6"}}