{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QJJWYBOWYRNVAIOF5GGCX7LTFI","short_pith_number":"pith:QJJWYBOW","schema_version":"1.0","canonical_sha256":"82536c05d6c45b5021c5e98c2bfd732a024224243500057e04fb01aff8043ed8","source":{"kind":"arxiv","id":"1706.02540","version":1},"attestation_state":"computed","paper":{"title":"Clique Gossiping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.DC","authors_text":"Bo Li, Brian Anderson, Guodong Shi, Yang Liu","submitted_at":"2017-06-08T12:20:25Z","abstract_excerpt":"This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engineering networks. By clique gossiping, nodes interact with each other along a sequence of cliques. Clique-gossip protocols are defined as arbitrary linear node interactions where node states are vectors evolving as linear dynamical systems. Such protocols become clique-gossip averaging algorithms when node states are scalars under averaging rules. We generalize the classical notion of line graph to capture the essenti"},"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":"1706.02540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-08T12:20:25Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"462ae72ab5c8298b53e7add311b1399c51c6affc1c114bc7a2c3bf7fe3fb3210","abstract_canon_sha256":"474f1c0d57d15ab7365ddbf3b022f1432cbff80a75a9501795ec6a3495ba2f39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:45.205579Z","signature_b64":"x+aXIQ1fZLM23fSmsrVt67LMDoXO/P3Vz1ekd6nLEd2Zq44MVWCaXdxYbS2UwFpC394cs0S/bQK508iWe/+xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82536c05d6c45b5021c5e98c2bfd732a024224243500057e04fb01aff8043ed8","last_reissued_at":"2026-05-18T00:42:45.205082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:45.205082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique Gossiping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.DC","authors_text":"Bo Li, Brian Anderson, Guodong Shi, Yang Liu","submitted_at":"2017-06-08T12:20:25Z","abstract_excerpt":"This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engineering networks. By clique gossiping, nodes interact with each other along a sequence of cliques. Clique-gossip protocols are defined as arbitrary linear node interactions where node states are vectors evolving as linear dynamical systems. Such protocols become clique-gossip averaging algorithms when node states are scalars under averaging rules. We generalize the classical notion of line graph to capture the essenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02540","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.02540","created_at":"2026-05-18T00:42:45.205167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02540v1","created_at":"2026-05-18T00:42:45.205167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02540","created_at":"2026-05-18T00:42:45.205167+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJJWYBOWYRNV","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJJWYBOWYRNVAIOF","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJJWYBOW","created_at":"2026-05-18T12:31:39.905425+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/QJJWYBOWYRNVAIOF5GGCX7LTFI","json":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI.json","graph_json":"https://pith.science/api/pith-number/QJJWYBOWYRNVAIOF5GGCX7LTFI/graph.json","events_json":"https://pith.science/api/pith-number/QJJWYBOWYRNVAIOF5GGCX7LTFI/events.json","paper":"https://pith.science/paper/QJJWYBOW"},"agent_actions":{"view_html":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI","download_json":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI.json","view_paper":"https://pith.science/paper/QJJWYBOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02540&json=true","fetch_graph":"https://pith.science/api/pith-number/QJJWYBOWYRNVAIOF5GGCX7LTFI/graph.json","fetch_events":"https://pith.science/api/pith-number/QJJWYBOWYRNVAIOF5GGCX7LTFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI/action/storage_attestation","attest_author":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI/action/author_attestation","sign_citation":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI/action/citation_signature","submit_replication":"https://pith.science/pith/QJJWYBOWYRNVAIOF5GGCX7LTFI/action/replication_record"}},"created_at":"2026-05-18T00:42:45.205167+00:00","updated_at":"2026-05-18T00:42:45.205167+00:00"}