{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ETRRZSJ5XMEO5HX6SKBSV7IYKV","short_pith_number":"pith:ETRRZSJ5","schema_version":"1.0","canonical_sha256":"24e31cc93dbb08ee9efe92832afd18555d39d9d417a43fb9da9c85a7ca28f967","source":{"kind":"arxiv","id":"1610.09482","version":1},"attestation_state":"computed","paper":{"title":"From Simplicity to Complexity Based on Consensus: A Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Shuai Li, Yinyan Zhang","submitted_at":"2016-10-29T10:10:58Z","abstract_excerpt":"Distributed consensus has been intensively studied in recent years as a means to mitigate state differences among dynamic nodes on a graph. It has been successfully employed in various applications, e.g., formation control of multi-robots, load balancing, clock synchronization. However, almost all existing applications cast an impression of consensus as a simple process to iteratively reach agreement, without any clue on possibility to generate advanced complexity, say shortest path planning, which has been proved to be NP-hard. Counter-intuitively, we show for the first time that the complexi"},"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":"1610.09482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-29T10:10:58Z","cross_cats_sorted":[],"title_canon_sha256":"d39ebf49d3b2a7dde326717e9156959cf5d6f4080046430a85da7e310e286e7d","abstract_canon_sha256":"3b630f31e85d69bfcf167025eaa0940c5f100d32a791bed00c4715762816ea02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:57.665628Z","signature_b64":"kteBy4fEbKL0kHtKr/wtr/H38OfCOc+kw25ma9t75FAntBBxPNQRqEJzMW/IJM/SiJnmlGQLrsn1pnQQmNFhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24e31cc93dbb08ee9efe92832afd18555d39d9d417a43fb9da9c85a7ca28f967","last_reissued_at":"2026-05-18T00:44:57.665116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:57.665116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Simplicity to Complexity Based on Consensus: A Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Shuai Li, Yinyan Zhang","submitted_at":"2016-10-29T10:10:58Z","abstract_excerpt":"Distributed consensus has been intensively studied in recent years as a means to mitigate state differences among dynamic nodes on a graph. It has been successfully employed in various applications, e.g., formation control of multi-robots, load balancing, clock synchronization. However, almost all existing applications cast an impression of consensus as a simple process to iteratively reach agreement, without any clue on possibility to generate advanced complexity, say shortest path planning, which has been proved to be NP-hard. Counter-intuitively, we show for the first time that the complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09482","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":"1610.09482","created_at":"2026-05-18T00:44:57.665180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09482v1","created_at":"2026-05-18T00:44:57.665180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09482","created_at":"2026-05-18T00:44:57.665180+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETRRZSJ5XMEO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETRRZSJ5XMEO5HX6","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETRRZSJ5","created_at":"2026-05-18T12:30:15.759754+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/ETRRZSJ5XMEO5HX6SKBSV7IYKV","json":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV.json","graph_json":"https://pith.science/api/pith-number/ETRRZSJ5XMEO5HX6SKBSV7IYKV/graph.json","events_json":"https://pith.science/api/pith-number/ETRRZSJ5XMEO5HX6SKBSV7IYKV/events.json","paper":"https://pith.science/paper/ETRRZSJ5"},"agent_actions":{"view_html":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV","download_json":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV.json","view_paper":"https://pith.science/paper/ETRRZSJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09482&json=true","fetch_graph":"https://pith.science/api/pith-number/ETRRZSJ5XMEO5HX6SKBSV7IYKV/graph.json","fetch_events":"https://pith.science/api/pith-number/ETRRZSJ5XMEO5HX6SKBSV7IYKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/action/storage_attestation","attest_author":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/action/author_attestation","sign_citation":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/action/citation_signature","submit_replication":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/action/replication_record"}},"created_at":"2026-05-18T00:44:57.665180+00:00","updated_at":"2026-05-18T00:44:57.665180+00:00"}