{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SJUWPOFNA4FV5ONOC7AQHRT2TZ","short_pith_number":"pith:SJUWPOFN","canonical_record":{"source":{"id":"1410.7256","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-27T14:32:21Z","cross_cats_sorted":[],"title_canon_sha256":"eb26a1044f5877ccbbea501d1833b77ab3dd1c66de0d1fab80c2f7cb768cf025","abstract_canon_sha256":"0af4332998605f6341f3551f1bda4b0c9a6e4a839d2659c26f83b6daeb0b7454"},"schema_version":"1.0"},"canonical_sha256":"926967b8ad070b5eb9ae17c103c67a9e69c9c547fc0c027e397b7eee4e834b03","source":{"kind":"arxiv","id":"1410.7256","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7256","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7256v5","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7256","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"SJUWPOFNA4FV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SJUWPOFNA4FV5ONO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SJUWPOFN","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SJUWPOFNA4FV5ONOC7AQHRT2TZ","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7256","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-27T14:32:21Z","cross_cats_sorted":[],"title_canon_sha256":"eb26a1044f5877ccbbea501d1833b77ab3dd1c66de0d1fab80c2f7cb768cf025","abstract_canon_sha256":"0af4332998605f6341f3551f1bda4b0c9a6e4a839d2659c26f83b6daeb0b7454"},"schema_version":"1.0"},"canonical_sha256":"926967b8ad070b5eb9ae17c103c67a9e69c9c547fc0c027e397b7eee4e834b03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:20.419338Z","signature_b64":"jIixD4aKf7zzqCfYaydZsIj3RPDtys1+Mk0pNYDsmTKNZ+KwHMK97gEHGkbfJezSO3OGKIU+R6/LWFrhSEsZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926967b8ad070b5eb9ae17c103c67a9e69c9c547fc0c027e397b7eee4e834b03","last_reissued_at":"2026-05-18T01:36:20.418711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:20.418711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7256","source_version":5,"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-18T01:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQVw7Uz6crJWu4/PFrVcW+dMAUjdgtodZtieXizc96LtXCkBaFbNXuKZqmwsWHNE+W2rJ+vvtL7iHMv4l2XqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:09:48.198600Z"},"content_sha256":"fc42bba6f2fd136405b97078c463becb35010847bac02d5d0a290613f78cf4e2","schema_version":"1.0","event_id":"sha256:fc42bba6f2fd136405b97078c463becb35010847bac02d5d0a290613f78cf4e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SJUWPOFNA4FV5ONOC7AQHRT2TZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interactive Consistency in practical, mostly-asynchronous systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christos Patsonakis, Mema Roussopoulos, Nikos Chondros, Panos Diamantopoulos, Stathis Maneas","submitted_at":"2014-10-27T14:32:21Z","abstract_excerpt":"Interactive consistency is the problem in which n nodes, where up to t may be byzantine, each with its own private value, run an algorithm that allows all non-faulty nodes to infer the values of each other node. This problem is relevant to critical applications that rely on the combination of the opinions of multiple peers to provide a service. Examples include monitoring a content source to prevent equivocation or to track variability in the content provided, and resolving divergent state amongst the nodes of a distributed system. Previous works assume a fully synchronous system, where one ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7256","kind":"arxiv","version":5},"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-18T01:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgBGbcVyk/AVCayXWZf5+s3tXjFdYfSD1fDEjmUVioVL2x8MQsKlvGWJrHi76tRQCUpONxbGMBtMClVhhw92BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:09:48.199226Z"},"content_sha256":"4d1142943aedbb8d715b2b843e52aaa19818daa1430ea4bb29690733ba49bf43","schema_version":"1.0","event_id":"sha256:4d1142943aedbb8d715b2b843e52aaa19818daa1430ea4bb29690733ba49bf43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJUWPOFNA4FV5ONOC7AQHRT2TZ/bundle.json","state_url":"https://pith.science/pith/SJUWPOFNA4FV5ONOC7AQHRT2TZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJUWPOFNA4FV5ONOC7AQHRT2TZ/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-30T14:09:48Z","links":{"resolver":"https://pith.science/pith/SJUWPOFNA4FV5ONOC7AQHRT2TZ","bundle":"https://pith.science/pith/SJUWPOFNA4FV5ONOC7AQHRT2TZ/bundle.json","state":"https://pith.science/pith/SJUWPOFNA4FV5ONOC7AQHRT2TZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJUWPOFNA4FV5ONOC7AQHRT2TZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SJUWPOFNA4FV5ONOC7AQHRT2TZ","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":"0af4332998605f6341f3551f1bda4b0c9a6e4a839d2659c26f83b6daeb0b7454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-27T14:32:21Z","title_canon_sha256":"eb26a1044f5877ccbbea501d1833b77ab3dd1c66de0d1fab80c2f7cb768cf025"},"schema_version":"1.0","source":{"id":"1410.7256","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7256","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7256v5","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7256","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"SJUWPOFNA4FV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SJUWPOFNA4FV5ONO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SJUWPOFN","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:4d1142943aedbb8d715b2b843e52aaa19818daa1430ea4bb29690733ba49bf43","target":"graph","created_at":"2026-05-18T01:36:20Z","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":"Interactive consistency is the problem in which n nodes, where up to t may be byzantine, each with its own private value, run an algorithm that allows all non-faulty nodes to infer the values of each other node. This problem is relevant to critical applications that rely on the combination of the opinions of multiple peers to provide a service. Examples include monitoring a content source to prevent equivocation or to track variability in the content provided, and resolving divergent state amongst the nodes of a distributed system. Previous works assume a fully synchronous system, where one ca","authors_text":"Christos Patsonakis, Mema Roussopoulos, Nikos Chondros, Panos Diamantopoulos, Stathis Maneas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-27T14:32:21Z","title":"Interactive Consistency in practical, mostly-asynchronous systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7256","kind":"arxiv","version":5},"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:fc42bba6f2fd136405b97078c463becb35010847bac02d5d0a290613f78cf4e2","target":"record","created_at":"2026-05-18T01:36:20Z","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":"0af4332998605f6341f3551f1bda4b0c9a6e4a839d2659c26f83b6daeb0b7454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-27T14:32:21Z","title_canon_sha256":"eb26a1044f5877ccbbea501d1833b77ab3dd1c66de0d1fab80c2f7cb768cf025"},"schema_version":"1.0","source":{"id":"1410.7256","kind":"arxiv","version":5}},"canonical_sha256":"926967b8ad070b5eb9ae17c103c67a9e69c9c547fc0c027e397b7eee4e834b03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"926967b8ad070b5eb9ae17c103c67a9e69c9c547fc0c027e397b7eee4e834b03","first_computed_at":"2026-05-18T01:36:20.418711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:20.418711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jIixD4aKf7zzqCfYaydZsIj3RPDtys1+Mk0pNYDsmTKNZ+KwHMK97gEHGkbfJezSO3OGKIU+R6/LWFrhSEsZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:20.419338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7256","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc42bba6f2fd136405b97078c463becb35010847bac02d5d0a290613f78cf4e2","sha256:4d1142943aedbb8d715b2b843e52aaa19818daa1430ea4bb29690733ba49bf43"],"state_sha256":"c970e493fb6f6687eadb06e185cc171c39fb568296784095be12eff68efaf8c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rC2QJTQg42jihr9/JK4KbMbC4YscaykqKPDvArxBWmjHS1Ha/Yp2oArUcqwaQkJewtAIlY3vdyHnyNMGXANDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:09:48.202371Z","bundle_sha256":"ec049f4c57f22880104d0e0e5fcc9cc957ad471787ad262713ecba7486e9db6f"}}