{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5SOTFAC4LOYYOLCA6WVAOTBCS4","short_pith_number":"pith:5SOTFAC4","canonical_record":{"source":{"id":"1701.00021","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-12-30T21:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"c5051e7c0a1ae4ad3b4d30159c49f52750530220abc8ab8fcf4abc12c0a09c5d","abstract_canon_sha256":"1caa65e6e3607ed13ef02edba0af733b39f75a735d8ba2b8275c735143f9a60b"},"schema_version":"1.0"},"canonical_sha256":"ec9d32805c5bb1872c40f5aa074c22970834f72eb35fe2791920fa1ed8437823","source":{"kind":"arxiv","id":"1701.00021","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00021","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00021v3","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00021","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"5SOTFAC4LOYY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SOTFAC4LOYYOLCA","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SOTFAC4","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5SOTFAC4LOYYOLCA6WVAOTBCS4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00021","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-12-30T21:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"c5051e7c0a1ae4ad3b4d30159c49f52750530220abc8ab8fcf4abc12c0a09c5d","abstract_canon_sha256":"1caa65e6e3607ed13ef02edba0af733b39f75a735d8ba2b8275c735143f9a60b"},"schema_version":"1.0"},"canonical_sha256":"ec9d32805c5bb1872c40f5aa074c22970834f72eb35fe2791920fa1ed8437823","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:57.968375Z","signature_b64":"/sjOktnmldEjhSOoQJUjyxd//PricuTXsNYbjdgKoXvU+QubhhniRjR0AUmkcD2TzZzHsmkcpZKPZVm86KG0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec9d32805c5bb1872c40f5aa074c22970834f72eb35fe2791920fa1ed8437823","last_reissued_at":"2026-05-18T00:41:57.967745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:57.967745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00021","source_version":3,"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-18T00:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzYCTd37tNerNXxvZlQxmfysIzwkmL0/Jgam2WUh6VBLbEnGgDxvgPie9iiuRaH0C63H3LWXBUfvQG9eVKA8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:03.510691Z"},"content_sha256":"a7bd0744951c2331fd92c7cb45f7da16e947b4eafd734c36d88b37784263403e","schema_version":"1.0","event_id":"sha256:a7bd0744951c2331fd92c7cb45f7da16e947b4eafd734c36d88b37784263403e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5SOTFAC4LOYYOLCA6WVAOTBCS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Finite Time Termination of Consensus in the Presence of Delays","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mangal Prakash, Murti Salapaka, Sandeep Attree, Saurav Talukdar, Vikas Yadav","submitted_at":"2016-12-30T21:49:23Z","abstract_excerpt":"Linear consensus iterations guarantee asymptotic convergence, thereby, limiting their applicability in applications where consensus value needs to be used in real time to perform a system level task. It also leads to wastage of power and communication resources. In this article, an algorithm is proposed which enables each node to detect in a distributed manner and in finite number of iterations, when every agent in the network is within a user specified threshold of the consensus value (approximate consensus) and hence terminate further communications and computations associated with consensus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00021","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"},"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-18T00:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSCR6u0PgaBIFLaVK74L/wzjlcA7d5EIwKmWNbSUHZi9BbeC5H6ds0MfdIbQVE4yk+CRZB3TK9MTwsrSl67ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:03.511039Z"},"content_sha256":"72bf310537fca92ecca59d7b595c138eaa0b93c7439b927b12fc832855ae73d3","schema_version":"1.0","event_id":"sha256:72bf310537fca92ecca59d7b595c138eaa0b93c7439b927b12fc832855ae73d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SOTFAC4LOYYOLCA6WVAOTBCS4/bundle.json","state_url":"https://pith.science/pith/5SOTFAC4LOYYOLCA6WVAOTBCS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SOTFAC4LOYYOLCA6WVAOTBCS4/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-03T22:07:03Z","links":{"resolver":"https://pith.science/pith/5SOTFAC4LOYYOLCA6WVAOTBCS4","bundle":"https://pith.science/pith/5SOTFAC4LOYYOLCA6WVAOTBCS4/bundle.json","state":"https://pith.science/pith/5SOTFAC4LOYYOLCA6WVAOTBCS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SOTFAC4LOYYOLCA6WVAOTBCS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5SOTFAC4LOYYOLCA6WVAOTBCS4","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":"1caa65e6e3607ed13ef02edba0af733b39f75a735d8ba2b8275c735143f9a60b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-12-30T21:49:23Z","title_canon_sha256":"c5051e7c0a1ae4ad3b4d30159c49f52750530220abc8ab8fcf4abc12c0a09c5d"},"schema_version":"1.0","source":{"id":"1701.00021","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00021","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00021v3","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00021","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"5SOTFAC4LOYY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SOTFAC4LOYYOLCA","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SOTFAC4","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:72bf310537fca92ecca59d7b595c138eaa0b93c7439b927b12fc832855ae73d3","target":"graph","created_at":"2026-05-18T00:41:57Z","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":"Linear consensus iterations guarantee asymptotic convergence, thereby, limiting their applicability in applications where consensus value needs to be used in real time to perform a system level task. It also leads to wastage of power and communication resources. In this article, an algorithm is proposed which enables each node to detect in a distributed manner and in finite number of iterations, when every agent in the network is within a user specified threshold of the consensus value (approximate consensus) and hence terminate further communications and computations associated with consensus","authors_text":"Mangal Prakash, Murti Salapaka, Sandeep Attree, Saurav Talukdar, Vikas Yadav","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-12-30T21:49:23Z","title":"Distributed Finite Time Termination of Consensus in the Presence of Delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00021","kind":"arxiv","version":3},"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:a7bd0744951c2331fd92c7cb45f7da16e947b4eafd734c36d88b37784263403e","target":"record","created_at":"2026-05-18T00:41:57Z","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":"1caa65e6e3607ed13ef02edba0af733b39f75a735d8ba2b8275c735143f9a60b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-12-30T21:49:23Z","title_canon_sha256":"c5051e7c0a1ae4ad3b4d30159c49f52750530220abc8ab8fcf4abc12c0a09c5d"},"schema_version":"1.0","source":{"id":"1701.00021","kind":"arxiv","version":3}},"canonical_sha256":"ec9d32805c5bb1872c40f5aa074c22970834f72eb35fe2791920fa1ed8437823","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec9d32805c5bb1872c40f5aa074c22970834f72eb35fe2791920fa1ed8437823","first_computed_at":"2026-05-18T00:41:57.967745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:57.967745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/sjOktnmldEjhSOoQJUjyxd//PricuTXsNYbjdgKoXvU+QubhhniRjR0AUmkcD2TzZzHsmkcpZKPZVm86KG0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:57.968375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00021","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7bd0744951c2331fd92c7cb45f7da16e947b4eafd734c36d88b37784263403e","sha256:72bf310537fca92ecca59d7b595c138eaa0b93c7439b927b12fc832855ae73d3"],"state_sha256":"715ae5e93594dcb4611aeb520f4e125a0cb181bc296cb888b8229a7dd8c228f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nve2CGIv7sdBrgirwd/SCxT/Hmvnwhk0ptYIb3ovLnby/3Mhc+gauvbXTnBA4tQGFP+S0sYdA/pBHfU0MDmPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:07:03.512998Z","bundle_sha256":"167ce0a913e415deab5eb77f9418e1b91b3539e290684a7e0513a7dd0e76e58b"}}