{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CZ5VJDWUQT7ENAFCKWPMNESQPF","short_pith_number":"pith:CZ5VJDWU","schema_version":"1.0","canonical_sha256":"167b548ed484fe4680a2559ec69250795247672d2c7a523c6bfce14fde2e901a","source":{"kind":"arxiv","id":"1110.3843","version":2},"attestation_state":"computed","paper":{"title":"Robustness of Information Diffusion Algorithms to Locally Bounded Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY","math.OC","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Haotian Zhang, Shreyas Sundaram","submitted_at":"2011-10-17T22:51:50Z","abstract_excerpt":"We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in its neighborhood. We introduce a topological property known as r-robustness of a graph, and show that this property provides improved bounds on tolerating malicious behavior, in comparison to traditional concepts such as connectivity and minimum degree. We use this topological property to analyze the canonical problems of distributed consensus and broadcast"},"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":"1110.3843","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-17T22:51:50Z","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","math.OC","physics.soc-ph"],"title_canon_sha256":"2c502eabc0cb108264c9c67ec5fe68cd097ce6ba5e8802455e99146d91c2ceae","abstract_canon_sha256":"3c1437b31abbe4b07472c101a732efc0cd07ed25d2ce0b0ea0fff16a25e0a3c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:12.215076Z","signature_b64":"cBT6aW0MwD78dvl5SpDvlwvcmBaCXsGRnAPb7QZ0KKbkuiZJPo9Hm7ofpzVOVnsDyLs+t7F6meR+rXWBar8CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"167b548ed484fe4680a2559ec69250795247672d2c7a523c6bfce14fde2e901a","last_reissued_at":"2026-05-18T03:59:12.214551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:12.214551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness of Information Diffusion Algorithms to Locally Bounded Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY","math.OC","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Haotian Zhang, Shreyas Sundaram","submitted_at":"2011-10-17T22:51:50Z","abstract_excerpt":"We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in its neighborhood. We introduce a topological property known as r-robustness of a graph, and show that this property provides improved bounds on tolerating malicious behavior, in comparison to traditional concepts such as connectivity and minimum degree. We use this topological property to analyze the canonical problems of distributed consensus and broadcast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3843","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.3843","created_at":"2026-05-18T03:59:12.214635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3843v2","created_at":"2026-05-18T03:59:12.214635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3843","created_at":"2026-05-18T03:59:12.214635+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZ5VJDWUQT7E","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZ5VJDWUQT7ENAFC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZ5VJDWU","created_at":"2026-05-18T12:26:26.731475+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/CZ5VJDWUQT7ENAFCKWPMNESQPF","json":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF.json","graph_json":"https://pith.science/api/pith-number/CZ5VJDWUQT7ENAFCKWPMNESQPF/graph.json","events_json":"https://pith.science/api/pith-number/CZ5VJDWUQT7ENAFCKWPMNESQPF/events.json","paper":"https://pith.science/paper/CZ5VJDWU"},"agent_actions":{"view_html":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF","download_json":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF.json","view_paper":"https://pith.science/paper/CZ5VJDWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3843&json=true","fetch_graph":"https://pith.science/api/pith-number/CZ5VJDWUQT7ENAFCKWPMNESQPF/graph.json","fetch_events":"https://pith.science/api/pith-number/CZ5VJDWUQT7ENAFCKWPMNESQPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF/action/storage_attestation","attest_author":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF/action/author_attestation","sign_citation":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF/action/citation_signature","submit_replication":"https://pith.science/pith/CZ5VJDWUQT7ENAFCKWPMNESQPF/action/replication_record"}},"created_at":"2026-05-18T03:59:12.214635+00:00","updated_at":"2026-05-18T03:59:12.214635+00:00"}