{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LQJH4MWTIEFVOMPB6PBRI7YIPC","short_pith_number":"pith:LQJH4MWT","canonical_record":{"source":{"id":"1602.01483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T21:18:37Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"2c6994cadae80c5a5270f505c2a93ee12f436c00030a04e7c9c101afc2285671","abstract_canon_sha256":"587be4bb54c946ec2089de11705d992ac88422a1927df61b2190cca18c6e64c0"},"schema_version":"1.0"},"canonical_sha256":"5c127e32d3410b5731e1f3c3147f0878a29ab3f62bd064b3862feeae42f29fa1","source":{"kind":"arxiv","id":"1602.01483","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01483","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01483v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01483","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"LQJH4MWTIEFV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQJH4MWTIEFVOMPB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQJH4MWT","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LQJH4MWTIEFVOMPB6PBRI7YIPC","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T21:18:37Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"2c6994cadae80c5a5270f505c2a93ee12f436c00030a04e7c9c101afc2285671","abstract_canon_sha256":"587be4bb54c946ec2089de11705d992ac88422a1927df61b2190cca18c6e64c0"},"schema_version":"1.0"},"canonical_sha256":"5c127e32d3410b5731e1f3c3147f0878a29ab3f62bd064b3862feeae42f29fa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:39.810737Z","signature_b64":"9aYxFAT11ciTSKwUehJcQACeR6sDI8COK9GQJdHpmEkWuQGe664XShBjGQ9v4fT1gQWww/hVRCeAHHZ8NvS8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c127e32d3410b5731e1f3c3147f0878a29ab3f62bd064b3862feeae42f29fa1","last_reissued_at":"2026-05-18T01:13:39.810022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:39.810022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01483","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xo4ERmV17ETYRsASCJjnvZjJ9YzAjZpylStG0mkq6xTCTRvow6qygveKYlGbwg/KHjgliwqwSgqDuqwQLlHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:41:18.301211Z"},"content_sha256":"d1a0bb8d68567395d229dc0748685ba8eaec0cc62ac07bb1186e886dfa6cf25f","schema_version":"1.0","event_id":"sha256:d1a0bb8d68567395d229dc0748685ba8eaec0cc62ac07bb1186e886dfa6cf25f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LQJH4MWTIEFVOMPB6PBRI7YIPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"math.OC","authors_text":"A. Stephen Morse, Daniel Fullmer, Lili Wang","submitted_at":"2016-02-03T21:18:37Z","abstract_excerpt":"A distributed algorithm is described for finding a common fixed point of a family of $m>1$ nonlinear maps $M_i : \\mathbb{R}^n \\rightarrow \\mathbb{R}^n$ assuming that each map is a paracontraction and that such a 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 the fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characteriz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01483","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0KyYdacmBWkivHMkrTg4MabjnQVldu7m4bXZU5CcCCEonZQoL+dcZWmXdFmi0x4q/pTBHxp3Ux8AWlcyTHtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:41:18.301849Z"},"content_sha256":"b9261a69582875eff628b13be7b4d5e5e61ae53806e287a49dffe67e2b6ba173","schema_version":"1.0","event_id":"sha256:b9261a69582875eff628b13be7b4d5e5e61ae53806e287a49dffe67e2b6ba173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQJH4MWTIEFVOMPB6PBRI7YIPC/bundle.json","state_url":"https://pith.science/pith/LQJH4MWTIEFVOMPB6PBRI7YIPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQJH4MWTIEFVOMPB6PBRI7YIPC/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-26T17:41:18Z","links":{"resolver":"https://pith.science/pith/LQJH4MWTIEFVOMPB6PBRI7YIPC","bundle":"https://pith.science/pith/LQJH4MWTIEFVOMPB6PBRI7YIPC/bundle.json","state":"https://pith.science/pith/LQJH4MWTIEFVOMPB6PBRI7YIPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQJH4MWTIEFVOMPB6PBRI7YIPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LQJH4MWTIEFVOMPB6PBRI7YIPC","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":"587be4bb54c946ec2089de11705d992ac88422a1927df61b2190cca18c6e64c0","cross_cats_sorted":["cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T21:18:37Z","title_canon_sha256":"2c6994cadae80c5a5270f505c2a93ee12f436c00030a04e7c9c101afc2285671"},"schema_version":"1.0","source":{"id":"1602.01483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01483","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01483v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01483","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"LQJH4MWTIEFV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQJH4MWTIEFVOMPB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQJH4MWT","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:b9261a69582875eff628b13be7b4d5e5e61ae53806e287a49dffe67e2b6ba173","target":"graph","created_at":"2026-05-18T01:13:39Z","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 : \\mathbb{R}^n \\rightarrow \\mathbb{R}^n$ assuming that each map is a paracontraction and that such a 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 the fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characteriz","authors_text":"A. Stephen Morse, Daniel Fullmer, Lili Wang","cross_cats":["cs.MA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T21:18:37Z","title":"A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01483","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:d1a0bb8d68567395d229dc0748685ba8eaec0cc62ac07bb1186e886dfa6cf25f","target":"record","created_at":"2026-05-18T01:13:39Z","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":"587be4bb54c946ec2089de11705d992ac88422a1927df61b2190cca18c6e64c0","cross_cats_sorted":["cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-03T21:18:37Z","title_canon_sha256":"2c6994cadae80c5a5270f505c2a93ee12f436c00030a04e7c9c101afc2285671"},"schema_version":"1.0","source":{"id":"1602.01483","kind":"arxiv","version":2}},"canonical_sha256":"5c127e32d3410b5731e1f3c3147f0878a29ab3f62bd064b3862feeae42f29fa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c127e32d3410b5731e1f3c3147f0878a29ab3f62bd064b3862feeae42f29fa1","first_computed_at":"2026-05-18T01:13:39.810022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:39.810022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9aYxFAT11ciTSKwUehJcQACeR6sDI8COK9GQJdHpmEkWuQGe664XShBjGQ9v4fT1gQWww/hVRCeAHHZ8NvS8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:39.810737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a0bb8d68567395d229dc0748685ba8eaec0cc62ac07bb1186e886dfa6cf25f","sha256:b9261a69582875eff628b13be7b4d5e5e61ae53806e287a49dffe67e2b6ba173"],"state_sha256":"507e70cc3352931ecf9599f9b7bffc1d93058a28f5f4452b3c0adcab4c605bcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6bG/9K6DXKLTqBCaD40KeGUjIis2BHxQ210W/c3j8iSbifKuBl4X8D/FJRxAYvMAE7izvgoA4ohch+Vt62MDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:41:18.304918Z","bundle_sha256":"842ae6ff9e324f883e9a5e0cd582f27e3a85af3920587b0453f5487ce439f4f3"}}