{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SZ4CU3ROPBCLYLFXYTOBGLV7UH","short_pith_number":"pith:SZ4CU3RO","canonical_record":{"source":{"id":"1906.09073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T11:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"53bbc4ce64902b9de54797cdeae39519fdc94960c705197f61bbcab5f73a7d16","abstract_canon_sha256":"17c18bf71c79d9ca5277c584d2baddf8681bc09a40eb2d449fbba6acdc203910"},"schema_version":"1.0"},"canonical_sha256":"96782a6e2e7844bc2cb7c4dc132ebfa1ccb4bf1d266f27eb0207ce1767dfb31f","source":{"kind":"arxiv","id":"1906.09073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09073","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09073v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09073","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"SZ4CU3ROPBCL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SZ4CU3ROPBCLYLFX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SZ4CU3RO","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SZ4CU3ROPBCLYLFXYTOBGLV7UH","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T11:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"53bbc4ce64902b9de54797cdeae39519fdc94960c705197f61bbcab5f73a7d16","abstract_canon_sha256":"17c18bf71c79d9ca5277c584d2baddf8681bc09a40eb2d449fbba6acdc203910"},"schema_version":"1.0"},"canonical_sha256":"96782a6e2e7844bc2cb7c4dc132ebfa1ccb4bf1d266f27eb0207ce1767dfb31f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.661755Z","signature_b64":"xmEUfhi0470FwuDevvWDuu78f4BzzhGcKxSFLO7V/LxMYMlX1M65+iPNPBOBVfB5IvyU6PHiIJ3cHmE2AyEJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96782a6e2e7844bc2cb7c4dc132ebfa1ccb4bf1d266f27eb0207ce1767dfb31f","last_reissued_at":"2026-05-17T23:42:44.661203Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:44.661203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09073","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-17T23:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mS1zyzI6qdYWREYVlDAUBqh5c7+CRR5hcysvfq5QeCWkwFwPR8x6dfCLlg49XaUKGQhBQtTyWKUCNgIA6p5lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:58:18.058760Z"},"content_sha256":"32aefdcdc9ea0b0a4a894b889d82695e6ffb870f7c200c7eea9a909bdb645e43","schema_version":"1.0","event_id":"sha256:32aefdcdc9ea0b0a4a894b889d82695e6ffb870f7c200c7eea9a909bdb645e43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SZ4CU3ROPBCLYLFXYTOBGLV7UH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MinMax Algorithms for Stabilizing Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bernadette Charron-Bost, Shlomo Moran","submitted_at":"2019-06-21T11:24:43Z","abstract_excerpt":"In the stabilizing consensus problem, each agent of a networked system has an input value and is repeatedly writing an output value; it is required that eventually all the output values stabilize to the same value which, moreover, must be one of the input values. We study this problem for a synchronous model with identical and anonymous agents that are connected by a time-varying topology. Our main result is a generic MinMax algorithm that solves the stabilizing consensus problem in this model when, in each sufficiently long but bounded period of time, there is an agent, called a root, that ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09073","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-17T23:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/0j59LO9014VQLgSuc9D8LD5OaWBmcRw9L2y+DnMYl4srhh5z81lsqekxE58WNA1nlHGtC0k3rlTPPGxMEsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:58:18.059144Z"},"content_sha256":"7b99ab54b9c72c1920b47bb5f81ab218b0d6a9442d751ada60219ab86a985825","schema_version":"1.0","event_id":"sha256:7b99ab54b9c72c1920b47bb5f81ab218b0d6a9442d751ada60219ab86a985825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZ4CU3ROPBCLYLFXYTOBGLV7UH/bundle.json","state_url":"https://pith.science/pith/SZ4CU3ROPBCLYLFXYTOBGLV7UH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZ4CU3ROPBCLYLFXYTOBGLV7UH/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-05-30T08:58:18Z","links":{"resolver":"https://pith.science/pith/SZ4CU3ROPBCLYLFXYTOBGLV7UH","bundle":"https://pith.science/pith/SZ4CU3ROPBCLYLFXYTOBGLV7UH/bundle.json","state":"https://pith.science/pith/SZ4CU3ROPBCLYLFXYTOBGLV7UH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZ4CU3ROPBCLYLFXYTOBGLV7UH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SZ4CU3ROPBCLYLFXYTOBGLV7UH","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":"17c18bf71c79d9ca5277c584d2baddf8681bc09a40eb2d449fbba6acdc203910","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T11:24:43Z","title_canon_sha256":"53bbc4ce64902b9de54797cdeae39519fdc94960c705197f61bbcab5f73a7d16"},"schema_version":"1.0","source":{"id":"1906.09073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09073","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09073v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09073","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"SZ4CU3ROPBCL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SZ4CU3ROPBCLYLFX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SZ4CU3RO","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:7b99ab54b9c72c1920b47bb5f81ab218b0d6a9442d751ada60219ab86a985825","target":"graph","created_at":"2026-05-17T23:42:44Z","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":"In the stabilizing consensus problem, each agent of a networked system has an input value and is repeatedly writing an output value; it is required that eventually all the output values stabilize to the same value which, moreover, must be one of the input values. We study this problem for a synchronous model with identical and anonymous agents that are connected by a time-varying topology. Our main result is a generic MinMax algorithm that solves the stabilizing consensus problem in this model when, in each sufficiently long but bounded period of time, there is an agent, called a root, that ca","authors_text":"Bernadette Charron-Bost, Shlomo Moran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T11:24:43Z","title":"MinMax Algorithms for Stabilizing Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09073","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:32aefdcdc9ea0b0a4a894b889d82695e6ffb870f7c200c7eea9a909bdb645e43","target":"record","created_at":"2026-05-17T23:42:44Z","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":"17c18bf71c79d9ca5277c584d2baddf8681bc09a40eb2d449fbba6acdc203910","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T11:24:43Z","title_canon_sha256":"53bbc4ce64902b9de54797cdeae39519fdc94960c705197f61bbcab5f73a7d16"},"schema_version":"1.0","source":{"id":"1906.09073","kind":"arxiv","version":1}},"canonical_sha256":"96782a6e2e7844bc2cb7c4dc132ebfa1ccb4bf1d266f27eb0207ce1767dfb31f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96782a6e2e7844bc2cb7c4dc132ebfa1ccb4bf1d266f27eb0207ce1767dfb31f","first_computed_at":"2026-05-17T23:42:44.661203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:44.661203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xmEUfhi0470FwuDevvWDuu78f4BzzhGcKxSFLO7V/LxMYMlX1M65+iPNPBOBVfB5IvyU6PHiIJ3cHmE2AyEJCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:44.661755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32aefdcdc9ea0b0a4a894b889d82695e6ffb870f7c200c7eea9a909bdb645e43","sha256:7b99ab54b9c72c1920b47bb5f81ab218b0d6a9442d751ada60219ab86a985825"],"state_sha256":"975dbfe0bb8dc986eaf65090d0138dc6135f2328e5b3105ff4bdb69c6e500233"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MDpOk/lstVHxqZuMjx00X0UvUF1Ejg6gbhuwsPdKMM4L0vFNklaFdcSNJKGNA9O/j2wUHX1jTUyGh6UW2RPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:58:18.062171Z","bundle_sha256":"4199a85da10cbae144902a818a3728b8b9b781915c859f44a9b2f12642953b16"}}