{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ETRRZSJ5XMEO5HX6SKBSV7IYKV","short_pith_number":"pith:ETRRZSJ5","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"},"canonical_sha256":"24e31cc93dbb08ee9efe92832afd18555d39d9d417a43fb9da9c85a7ca28f967","source":{"kind":"arxiv","id":"1610.09482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09482","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09482v1","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09482","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"ETRRZSJ5XMEO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETRRZSJ5XMEO5HX6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETRRZSJ5","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ETRRZSJ5XMEO5HX6SKBSV7IYKV","target":"record","payload":{"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"},"canonical_sha256":"24e31cc93dbb08ee9efe92832afd18555d39d9d417a43fb9da9c85a7ca28f967","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"},"source_kind":"arxiv","source_id":"1610.09482","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-18T00:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLF5I9tolMtNRatolgMp5EhJmQsCLmxjSpTsTn9Iw0iWq5H8foK3ojFaaQTV9wzY+fVCLQYxlDjL0jdsERjGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:24:37.839084Z"},"content_sha256":"faf6c7209f5e07460129b97c560deedf3ee3919ec9172cbec973aa92a799ebb4","schema_version":"1.0","event_id":"sha256:faf6c7209f5e07460129b97c560deedf3ee3919ec9172cbec973aa92a799ebb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ETRRZSJ5XMEO5HX6SKBSV7IYKV","target":"graph","payload":{"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"},"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-18T00:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"313pt2I8/RQCV+GHzQQ2zAC0IDwAj6Qsih713L3qdcRXkZ29BAblO1wsSV3w3s815ahhkMngf1WAdpGjCPP1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:24:37.839448Z"},"content_sha256":"5d7b2df5fa93cd4c9689e7d538271c3e5581035d835805691ab44b5f8dcdf036","schema_version":"1.0","event_id":"sha256:5d7b2df5fa93cd4c9689e7d538271c3e5581035d835805691ab44b5f8dcdf036"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/bundle.json","state_url":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/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-06-01T04:24:37Z","links":{"resolver":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV","bundle":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/bundle.json","state":"https://pith.science/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETRRZSJ5XMEO5HX6SKBSV7IYKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ETRRZSJ5XMEO5HX6SKBSV7IYKV","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":"3b630f31e85d69bfcf167025eaa0940c5f100d32a791bed00c4715762816ea02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-29T10:10:58Z","title_canon_sha256":"d39ebf49d3b2a7dde326717e9156959cf5d6f4080046430a85da7e310e286e7d"},"schema_version":"1.0","source":{"id":"1610.09482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09482","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09482v1","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09482","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"ETRRZSJ5XMEO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETRRZSJ5XMEO5HX6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETRRZSJ5","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:5d7b2df5fa93cd4c9689e7d538271c3e5581035d835805691ab44b5f8dcdf036","target":"graph","created_at":"2026-05-18T00:44:57Z","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":"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","authors_text":"Shuai Li, Yinyan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-29T10:10:58Z","title":"From Simplicity to Complexity Based on Consensus: A Case Study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09482","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:faf6c7209f5e07460129b97c560deedf3ee3919ec9172cbec973aa92a799ebb4","target":"record","created_at":"2026-05-18T00:44:57Z","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":"3b630f31e85d69bfcf167025eaa0940c5f100d32a791bed00c4715762816ea02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-29T10:10:58Z","title_canon_sha256":"d39ebf49d3b2a7dde326717e9156959cf5d6f4080046430a85da7e310e286e7d"},"schema_version":"1.0","source":{"id":"1610.09482","kind":"arxiv","version":1}},"canonical_sha256":"24e31cc93dbb08ee9efe92832afd18555d39d9d417a43fb9da9c85a7ca28f967","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24e31cc93dbb08ee9efe92832afd18555d39d9d417a43fb9da9c85a7ca28f967","first_computed_at":"2026-05-18T00:44:57.665116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:57.665116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kteBy4fEbKL0kHtKr/wtr/H38OfCOc+kw25ma9t75FAntBBxPNQRqEJzMW/IJM/SiJnmlGQLrsn1pnQQmNFhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:57.665628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faf6c7209f5e07460129b97c560deedf3ee3919ec9172cbec973aa92a799ebb4","sha256:5d7b2df5fa93cd4c9689e7d538271c3e5581035d835805691ab44b5f8dcdf036"],"state_sha256":"3a79806e427270a2fcc4e9ff4490506a195cd253eed285cefc4e5a386664fd8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQkznBHDe382tMXaeddIl3VaEd1POQaKeUFQjCqafsMeeC9YjtmuG8umj0WjGMttraxhS1lbQTaHT0B4jA3PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:24:37.842134Z","bundle_sha256":"df6a1c952c4511291a249d8f03973ad40cc85fae868721029d76d47bdbd713dd"}}