{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VBBT4NMIL3EVFFCSXZ4425WYAR","short_pith_number":"pith:VBBT4NMI","canonical_record":{"source":{"id":"1011.5470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-24T19:56:31Z","cross_cats_sorted":[],"title_canon_sha256":"5c5d0083e0b57c048af65ccc90e5fa7260f27b3c63f833cdcbf3b49f0fd315cb","abstract_canon_sha256":"581ea18d7a5f65f862fe7c8a9df5412d98c083deabca0427de5e946e90a55a1e"},"schema_version":"1.0"},"canonical_sha256":"a8433e35885ec9529452be79cd76d8046de194ceef03938fbead1401491372da","source":{"kind":"arxiv","id":"1011.5470","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VBBT4NMIL3EVFFCSXZ4425WYAR","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-24T19:56:31Z","cross_cats_sorted":[],"title_canon_sha256":"5c5d0083e0b57c048af65ccc90e5fa7260f27b3c63f833cdcbf3b49f0fd315cb","abstract_canon_sha256":"581ea18d7a5f65f862fe7c8a9df5412d98c083deabca0427de5e946e90a55a1e"},"schema_version":"1.0"},"canonical_sha256":"a8433e35885ec9529452be79cd76d8046de194ceef03938fbead1401491372da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:00.694537Z","signature_b64":"BUhQBJdbE2jJTscmNSgL2i1uX2iu45I8HQErKIDAA2aKFKxLOfpq1ve5cDFM+hNMdknF9Y/Vclq88qYN9Mo2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8433e35885ec9529452be79cd76d8046de194ceef03938fbead1401491372da","last_reissued_at":"2026-05-18T01:18:00.693699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:00.693699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5470","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:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVrx4yb7NgOzSRNY1Nsd0uu3HvbUcNfrZiIdNgB+kD8ypZGh1fB3PjuYsqFwean7jT36lDLkqMLath0smQkrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:23:36.859632Z"},"content_sha256":"0443927b377912e38977ccaa8c43941b660919cc7fd3f12409a619c0c42792a9","schema_version":"1.0","event_id":"sha256:0443927b377912e38977ccaa8c43941b660919cc7fd3f12409a619c0c42792a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VBBT4NMIL3EVFFCSXZ4425WYAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Computation: Lower and Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda","submitted_at":"2010-11-24T19:56:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5470","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:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sV0RviBkzZdTu0JP+GJzDjGM0yaW81M95Z7e50nrSwwieV9qTcdm3L6j49WymFyVB3NRz1rXUO4bc6zbnaOvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:23:36.860262Z"},"content_sha256":"994b37e7ce8f015c2d7407cd5a76363eafedf87083d550fe522a4ccd544938b6","schema_version":"1.0","event_id":"sha256:994b37e7ce8f015c2d7407cd5a76363eafedf87083d550fe522a4ccd544938b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBBT4NMIL3EVFFCSXZ4425WYAR/bundle.json","state_url":"https://pith.science/pith/VBBT4NMIL3EVFFCSXZ4425WYAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBBT4NMIL3EVFFCSXZ4425WYAR/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-26T07:23:36Z","links":{"resolver":"https://pith.science/pith/VBBT4NMIL3EVFFCSXZ4425WYAR","bundle":"https://pith.science/pith/VBBT4NMIL3EVFFCSXZ4425WYAR/bundle.json","state":"https://pith.science/pith/VBBT4NMIL3EVFFCSXZ4425WYAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBBT4NMIL3EVFFCSXZ4425WYAR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sjZruu7gNH1CQPzBbepYe3tGD4BLREAl+lg0Nwp2wFIDaj3+pxpDeOucQ1zTuulXDEk3fDEYIHKVkOFjzFMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:23:36.863355Z","bundle_sha256":"e3a63fcc57c7e62de98dcc992ee931d92467523292c3701467a87acb3965dfe7"}}