{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VBBT4NMIL3EVFFCSXZ4425WYAR","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":"581ea18d7a5f65f862fe7c8a9df5412d98c083deabca0427de5e946e90a55a1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-24T19:56:31Z","title_canon_sha256":"5c5d0083e0b57c048af65ccc90e5fa7260f27b3c63f833cdcbf3b49f0fd315cb"},"schema_version":"1.0","source":{"id":"1011.5470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5470","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5470v2","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5470","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"VBBT4NMIL3EV","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VBBT4NMIL3EVFFCS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VBBT4NMI","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:994b37e7ce8f015c2d7407cd5a76363eafedf87083d550fe522a4ccd544938b6","target":"graph","created_at":"2026-05-18T01:18:00Z","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":"The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a \\emph{distributed} fashion. More precisely, if nodes of a network must base their decision on information in their local neighborhood only, how well can they compute or approximate a global (optimization) problem? In this paper we give the first poly-logarithmic lower bound on such local computation for (optimization) problems including minimum vertex cover, minimum (connect","authors_text":"Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-24T19:56:31Z","title":"Local Computation: Lower and Upper Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5470","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:0443927b377912e38977ccaa8c43941b660919cc7fd3f12409a619c0c42792a9","target":"record","created_at":"2026-05-18T01:18:00Z","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":"581ea18d7a5f65f862fe7c8a9df5412d98c083deabca0427de5e946e90a55a1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-24T19:56:31Z","title_canon_sha256":"5c5d0083e0b57c048af65ccc90e5fa7260f27b3c63f833cdcbf3b49f0fd315cb"},"schema_version":"1.0","source":{"id":"1011.5470","kind":"arxiv","version":2}},"canonical_sha256":"a8433e35885ec9529452be79cd76d8046de194ceef03938fbead1401491372da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8433e35885ec9529452be79cd76d8046de194ceef03938fbead1401491372da","first_computed_at":"2026-05-18T01:18:00.693699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:00.693699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BUhQBJdbE2jJTscmNSgL2i1uX2iu45I8HQErKIDAA2aKFKxLOfpq1ve5cDFM+hNMdknF9Y/Vclq88qYN9Mo2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:00.694537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0443927b377912e38977ccaa8c43941b660919cc7fd3f12409a619c0c42792a9","sha256:994b37e7ce8f015c2d7407cd5a76363eafedf87083d550fe522a4ccd544938b6"],"state_sha256":"e33be4fd3e3ee3d0c40705da7d3499dec271d117af6d316bf3336e73d4066258"}