{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:75JLQYKVQPQU2ZQGN7QXJ4E3TW","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":"efc3aa0cab8a381087a06df2078f94191bc0d346b9d2b41730474ebba16c66f6","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-20T14:30:01Z","title_canon_sha256":"abe4c989e116394e0879fefff5d54fabdbeccd3eb3864335e9677c8787e70b30"},"schema_version":"1.0","source":{"id":"1304.5633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5633","created_at":"2026-05-18T00:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5633v1","created_at":"2026-05-18T00:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5633","created_at":"2026-05-18T00:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"75JLQYKVQPQU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"75JLQYKVQPQU2ZQG","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"75JLQYKV","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:ece50671d795c81cbee340a53545d657980f28ccbb2211445e246de0e118b35f","target":"graph","created_at":"2026-05-18T00:55:26Z","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 gossip problem (telephone problem) is an information dissemination problem in which each of $n$ nodes of a communication network has a unique piece of information that must be transmitted to all the other nodes using two-way communications (telephone calls) between the pairs of nodes. During a call between the given two nodes, they exchange the whole information known to them at that moment. In this paper we investigate the $k$-fault-tolerant gossip problem, which is a generalization of the gossip problem, where at most $k$ arbitrary faults of calls are allowed. The problem is to find the ","authors_text":"H.E. Nahapetyan, Su.S. Poghosyan, V.H. Hovnanyan, V.S. Poghosyan","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-20T14:30:01Z","title":"Tighter Upper Bounds for the Minimum Number of Calls and Rigorous Minimal Time in Fault-Tolerant Gossip Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5633","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:99143be0e9bab48130313718f98d75b0b70d01eaef78dcf921041e1bbf8d2697","target":"record","created_at":"2026-05-18T00:55:26Z","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":"efc3aa0cab8a381087a06df2078f94191bc0d346b9d2b41730474ebba16c66f6","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-20T14:30:01Z","title_canon_sha256":"abe4c989e116394e0879fefff5d54fabdbeccd3eb3864335e9677c8787e70b30"},"schema_version":"1.0","source":{"id":"1304.5633","kind":"arxiv","version":1}},"canonical_sha256":"ff52b8615583e14d66066fe174f09b9d9d6c3caf941d9a00721a0972ec44779a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff52b8615583e14d66066fe174f09b9d9d6c3caf941d9a00721a0972ec44779a","first_computed_at":"2026-05-18T00:55:26.342930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:26.342930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+HCp9qxMPaqbLC/VJZspN2vcmcHj7G2woxBgisimkdNqbVl66A/zDaK62JMHXA3RIn9tvmLN/FIT+paPDtkaCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:26.343571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99143be0e9bab48130313718f98d75b0b70d01eaef78dcf921041e1bbf8d2697","sha256:ece50671d795c81cbee340a53545d657980f28ccbb2211445e246de0e118b35f"],"state_sha256":"6ad678122bc72e2b0228b84bcc71811fa38c59639e5d05a6fcb8ff102d98852b"}