{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TTF57T5O2KYBYROSCC73RDONBD","short_pith_number":"pith:TTF57T5O","canonical_record":{"source":{"id":"1201.4480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-21T15:05:01Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"e09310ab22383b6fb196c51392bb19986506f419f3e32799f864cbfc7fd0abf9","abstract_canon_sha256":"4c7b4aa244ff807c6ee5e3c88301dbd1149be4f1557cb1118c23d83f0eca0a9d"},"schema_version":"1.0"},"canonical_sha256":"9ccbdfcfaed2b01c45d210bfb88dcd08e678834d65be6ab8e59a0a553799cf67","source":{"kind":"arxiv","id":"1201.4480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4480","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4480v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4480","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"TTF57T5O2KYB","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TTF57T5O2KYBYROS","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TTF57T5O","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TTF57T5O2KYBYROSCC73RDONBD","target":"record","payload":{"canonical_record":{"source":{"id":"1201.4480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-21T15:05:01Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"e09310ab22383b6fb196c51392bb19986506f419f3e32799f864cbfc7fd0abf9","abstract_canon_sha256":"4c7b4aa244ff807c6ee5e3c88301dbd1149be4f1557cb1118c23d83f0eca0a9d"},"schema_version":"1.0"},"canonical_sha256":"9ccbdfcfaed2b01c45d210bfb88dcd08e678834d65be6ab8e59a0a553799cf67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:05.932852Z","signature_b64":"K8A2+smjkUF7YdQpxyTgO/Lvp/H8AUD8t8/1FA4qtH67LXacK8hNnsDdtLzVb5SIgAYAzJTO80iWu7+9C9kiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ccbdfcfaed2b01c45d210bfb88dcd08e678834d65be6ab8e59a0a553799cf67","last_reissued_at":"2026-05-18T04:04:05.932281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:05.932281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.4480","source_version":1,"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-18T04:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yUBwYdQwojrk7TnepsUD3r49iMaL1LLpA6ngydnYgSzIjyqMN2XJNPcexMzEl6GNuJEHE9y7M+NvTputxHtbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:16:37.530753Z"},"content_sha256":"f7dbde2bc2c7446349cb6cdc892f671fa863130dfc9585586d034c3c8659189c","schema_version":"1.0","event_id":"sha256:f7dbde2bc2c7446349cb6cdc892f671fa863130dfc9585586d034c3c8659189c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TTF57T5O2KYBYROSCC73RDONBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Solution to Fastest Distributed Consensus Problem for Generic Star & K-cored Star Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas Jamalipour, Saber Jafarizadeh","submitted_at":"2012-01-21T15:05:01Z","abstract_excerpt":"Distributed average consensus is the main mechanism in algorithms for decentralized computation. In distributed average consensus algorithm each node has an initial state, and the goal is to compute the average of these initial states in every node. To accomplish this task, each node updates its state by a weighted average of its own and neighbors' states, by using local communication between neighboring nodes. In the networks with fixed topology, convergence rate of distributed average consensus algorithm depends on the choice of weights. This paper studies the weight optimization problem in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4480","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"},"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-18T04:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wPpj59R+HcCCB+za4blrYpl47bTblSUhNM87kX74w05aVkK9Wg5e5Rcvyae+DwnCg5VVJqVnIxxHboBgnFo8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:16:37.531359Z"},"content_sha256":"c9d96e88ec9b4f34e0b44819dafbba3627827a05a493118d924f3e2050eceacc","schema_version":"1.0","event_id":"sha256:c9d96e88ec9b4f34e0b44819dafbba3627827a05a493118d924f3e2050eceacc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTF57T5O2KYBYROSCC73RDONBD/bundle.json","state_url":"https://pith.science/pith/TTF57T5O2KYBYROSCC73RDONBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTF57T5O2KYBYROSCC73RDONBD/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-06-07T11:16:37Z","links":{"resolver":"https://pith.science/pith/TTF57T5O2KYBYROSCC73RDONBD","bundle":"https://pith.science/pith/TTF57T5O2KYBYROSCC73RDONBD/bundle.json","state":"https://pith.science/pith/TTF57T5O2KYBYROSCC73RDONBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTF57T5O2KYBYROSCC73RDONBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TTF57T5O2KYBYROSCC73RDONBD","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":"4c7b4aa244ff807c6ee5e3c88301dbd1149be4f1557cb1118c23d83f0eca0a9d","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-21T15:05:01Z","title_canon_sha256":"e09310ab22383b6fb196c51392bb19986506f419f3e32799f864cbfc7fd0abf9"},"schema_version":"1.0","source":{"id":"1201.4480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4480","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4480v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4480","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"TTF57T5O2KYB","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TTF57T5O2KYBYROS","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TTF57T5O","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:c9d96e88ec9b4f34e0b44819dafbba3627827a05a493118d924f3e2050eceacc","target":"graph","created_at":"2026-05-18T04:04:05Z","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":"Distributed average consensus is the main mechanism in algorithms for decentralized computation. In distributed average consensus algorithm each node has an initial state, and the goal is to compute the average of these initial states in every node. To accomplish this task, each node updates its state by a weighted average of its own and neighbors' states, by using local communication between neighboring nodes. In the networks with fixed topology, convergence rate of distributed average consensus algorithm depends on the choice of weights. This paper studies the weight optimization problem in ","authors_text":"Abbas Jamalipour, Saber Jafarizadeh","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-21T15:05:01Z","title":"A Solution to Fastest Distributed Consensus Problem for Generic Star & K-cored Star Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4480","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:f7dbde2bc2c7446349cb6cdc892f671fa863130dfc9585586d034c3c8659189c","target":"record","created_at":"2026-05-18T04:04:05Z","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":"4c7b4aa244ff807c6ee5e3c88301dbd1149be4f1557cb1118c23d83f0eca0a9d","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-21T15:05:01Z","title_canon_sha256":"e09310ab22383b6fb196c51392bb19986506f419f3e32799f864cbfc7fd0abf9"},"schema_version":"1.0","source":{"id":"1201.4480","kind":"arxiv","version":1}},"canonical_sha256":"9ccbdfcfaed2b01c45d210bfb88dcd08e678834d65be6ab8e59a0a553799cf67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ccbdfcfaed2b01c45d210bfb88dcd08e678834d65be6ab8e59a0a553799cf67","first_computed_at":"2026-05-18T04:04:05.932281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:05.932281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K8A2+smjkUF7YdQpxyTgO/Lvp/H8AUD8t8/1FA4qtH67LXacK8hNnsDdtLzVb5SIgAYAzJTO80iWu7+9C9kiDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:05.932852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7dbde2bc2c7446349cb6cdc892f671fa863130dfc9585586d034c3c8659189c","sha256:c9d96e88ec9b4f34e0b44819dafbba3627827a05a493118d924f3e2050eceacc"],"state_sha256":"ab3c9c18a9ffb22301ae149a61bc8cb23284bb050bcbd9607348a3cf4ade6598"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3TxYuM0Yufn37rV7gNpb6H17EnMn+vhnQrywLARG+B0/3i0wT0xfyWe4Abp3VuKfM4WZ4B2Mubwc1cZg3QLdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:16:37.535014Z","bundle_sha256":"ffb7b8929bb6b3bc83fc18d4dd471b2ed79245a53e9035038c9d2da423bb435e"}}