{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ES64IGONSBKRIBHJSEJOQCRAOU","short_pith_number":"pith:ES64IGON","schema_version":"1.0","canonical_sha256":"24bdc419cd90551404e99112e80a207535c871c9ee1a7d7252ba8598e620fb27","source":{"kind":"arxiv","id":"1211.6324","version":3},"attestation_state":"computed","paper":{"title":"Graph diameter, eigenvalues, and minimum-time consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Alexander Olshevsky, Guillaume Vankeerberghen, Julien M. Hendrickx, Rapha\\\"el M. Jungers","submitted_at":"2012-11-27T15:27:44Z","abstract_excerpt":"We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called \"definitive consensus conjecture\" which states that for an undirected connected graph G with diameter D there exist D matrices whose nonzero-pattern complies with the edges in G and whose product equals the all-ones matrix. Our first result is a counterexample to the definitive consensus conjecture, which is the first improvement of the diameter lower bound for linear co"},"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":"1211.6324","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-27T15:27:44Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"7c9abe1989910517b9531ce4b2a2657b760fb38ebdd159cb20d73e358e3a35e1","abstract_canon_sha256":"887b96bdf23da96bd96f81cf917944f50cbec8897f279374eabcfbcb634d1b15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:40.987907Z","signature_b64":"Siej+6Y4mk32qcIgKpiZ3Qpmbrnx5A2afcEq0uS6XmY5pVf3Xs1y3JSaimcYN41FfZsTu0lhkdb2xHY3IDBNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24bdc419cd90551404e99112e80a207535c871c9ee1a7d7252ba8598e620fb27","last_reissued_at":"2026-05-18T03:14:40.987196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:40.987196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph diameter, eigenvalues, and minimum-time consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Alexander Olshevsky, Guillaume Vankeerberghen, Julien M. Hendrickx, Rapha\\\"el M. Jungers","submitted_at":"2012-11-27T15:27:44Z","abstract_excerpt":"We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called \"definitive consensus conjecture\" which states that for an undirected connected graph G with diameter D there exist D matrices whose nonzero-pattern complies with the edges in G and whose product equals the all-ones matrix. Our first result is a counterexample to the definitive consensus conjecture, which is the first improvement of the diameter lower bound for linear co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6324","kind":"arxiv","version":3},"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":"1211.6324","created_at":"2026-05-18T03:14:40.987298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6324v3","created_at":"2026-05-18T03:14:40.987298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6324","created_at":"2026-05-18T03:14:40.987298+00:00"},{"alias_kind":"pith_short_12","alias_value":"ES64IGONSBKR","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"ES64IGONSBKRIBHJ","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"ES64IGON","created_at":"2026-05-18T12:27:04.183437+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/ES64IGONSBKRIBHJSEJOQCRAOU","json":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU.json","graph_json":"https://pith.science/api/pith-number/ES64IGONSBKRIBHJSEJOQCRAOU/graph.json","events_json":"https://pith.science/api/pith-number/ES64IGONSBKRIBHJSEJOQCRAOU/events.json","paper":"https://pith.science/paper/ES64IGON"},"agent_actions":{"view_html":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU","download_json":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU.json","view_paper":"https://pith.science/paper/ES64IGON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6324&json=true","fetch_graph":"https://pith.science/api/pith-number/ES64IGONSBKRIBHJSEJOQCRAOU/graph.json","fetch_events":"https://pith.science/api/pith-number/ES64IGONSBKRIBHJSEJOQCRAOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU/action/storage_attestation","attest_author":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU/action/author_attestation","sign_citation":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU/action/citation_signature","submit_replication":"https://pith.science/pith/ES64IGONSBKRIBHJSEJOQCRAOU/action/replication_record"}},"created_at":"2026-05-18T03:14:40.987298+00:00","updated_at":"2026-05-18T03:14:40.987298+00:00"}