{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JLK7BKK2WAGP6P4XGOXH3SJE57","short_pith_number":"pith:JLK7BKK2","canonical_record":{"source":{"id":"1908.02743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T17:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"fa8beadfdcd39950c927f77696495a73f1d8455cd2d2050190f6bfe223597607","abstract_canon_sha256":"d7936d2be99a3563a558e5f5c08a413c2be01ec7d3dc2b035aab7e1faf3fa30e"},"schema_version":"1.0"},"canonical_sha256":"4ad5f0a95ab00cff3f9733ae7dc924eff754b6458deb06c91fb6a954e5fafab3","source":{"kind":"arxiv","id":"1908.02743","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02743","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02743v2","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02743","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"JLK7BKK2WAGP","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"pith_short_16","alias_value":"JLK7BKK2WAGP6P4X","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"pith_short_8","alias_value":"JLK7BKK2","created_at":"2026-07-05T00:20:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JLK7BKK2WAGP6P4XGOXH3SJE57","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T17:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"fa8beadfdcd39950c927f77696495a73f1d8455cd2d2050190f6bfe223597607","abstract_canon_sha256":"d7936d2be99a3563a558e5f5c08a413c2be01ec7d3dc2b035aab7e1faf3fa30e"},"schema_version":"1.0"},"canonical_sha256":"4ad5f0a95ab00cff3f9733ae7dc924eff754b6458deb06c91fb6a954e5fafab3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:18.088271Z","signature_b64":"hjEgnHU+pnBcFnaVTsuoBW68vmdeL+9KvmokmXnsrhyI+7AY9SvBNL4h7/u6FAZgoSklN7gzJ+I21mFQGeeOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad5f0a95ab00cff3f9733ae7dc924eff754b6458deb06c91fb6a954e5fafab3","last_reissued_at":"2026-07-05T00:20:18.087861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:18.087861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02743","source_version":2,"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-07-05T00:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPO6HDFW4pXES8tYnlK1JuNq0GMs7g0kRxswPU+KK4qjeERfnbmtaHecM2kO92WPoAmBCPKXLuO11a6C72n5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:27:28.044277Z"},"content_sha256":"8fdcb3538ee40f2c744559943d15fb0f7959f59c9df79d40798fba3761bf3253","schema_version":"1.0","event_id":"sha256:8fdcb3538ee40f2c744559943d15fb0f7959f59c9df79d40798fba3761bf3253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JLK7BKK2WAGP6P4XGOXH3SJE57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Byzantine Approximate Agreement on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Joel Rybicki, Thomas Nowak","submitted_at":"2019-08-07T17:47:34Z","abstract_excerpt":"Consider a distributed system with $n$ processors out of which $f$ can be Byzantine faulty. In the approximate agreement task, each processor $i$ receives an input value $x_i$ and has to decide on an output value $y_i$ such that\n  - the output values are in the convex hull of the non-faulty processors' input values,\n  - the output values are within distance $d$ of each other.\n  Classically, the values are assumed to be from an $m$-dimensional Euclidean space, where $m \\ge 1$.\n  In this work, we study the task in a discrete setting, where input values with some structure expressible as a graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02743","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02743/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pACnzK3ouGsoZ6xrg7SURS6lGjFdXBceryBjMVQSe3R/3i0K3iywTtEVCQN6piS43jjfcKSK2O4Dhz3k4xXFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:27:28.044787Z"},"content_sha256":"7d39cd823723325e5df9792ef7fec844ee17f418c6eefff197d56affa34ab5ca","schema_version":"1.0","event_id":"sha256:7d39cd823723325e5df9792ef7fec844ee17f418c6eefff197d56affa34ab5ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLK7BKK2WAGP6P4XGOXH3SJE57/bundle.json","state_url":"https://pith.science/pith/JLK7BKK2WAGP6P4XGOXH3SJE57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLK7BKK2WAGP6P4XGOXH3SJE57/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-08-17T08:27:28Z","links":{"resolver":"https://pith.science/pith/JLK7BKK2WAGP6P4XGOXH3SJE57","bundle":"https://pith.science/pith/JLK7BKK2WAGP6P4XGOXH3SJE57/bundle.json","state":"https://pith.science/pith/JLK7BKK2WAGP6P4XGOXH3SJE57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLK7BKK2WAGP6P4XGOXH3SJE57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JLK7BKK2WAGP6P4XGOXH3SJE57","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":"d7936d2be99a3563a558e5f5c08a413c2be01ec7d3dc2b035aab7e1faf3fa30e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T17:47:34Z","title_canon_sha256":"fa8beadfdcd39950c927f77696495a73f1d8455cd2d2050190f6bfe223597607"},"schema_version":"1.0","source":{"id":"1908.02743","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02743","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02743v2","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02743","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"JLK7BKK2WAGP","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"pith_short_16","alias_value":"JLK7BKK2WAGP6P4X","created_at":"2026-07-05T00:20:18Z"},{"alias_kind":"pith_short_8","alias_value":"JLK7BKK2","created_at":"2026-07-05T00:20:18Z"}],"graph_snapshots":[{"event_id":"sha256:7d39cd823723325e5df9792ef7fec844ee17f418c6eefff197d56affa34ab5ca","target":"graph","created_at":"2026-07-05T00:20:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02743/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a distributed system with $n$ processors out of which $f$ can be Byzantine faulty. In the approximate agreement task, each processor $i$ receives an input value $x_i$ and has to decide on an output value $y_i$ such that\n  - the output values are in the convex hull of the non-faulty processors' input values,\n  - the output values are within distance $d$ of each other.\n  Classically, the values are assumed to be from an $m$-dimensional Euclidean space, where $m \\ge 1$.\n  In this work, we study the task in a discrete setting, where input values with some structure expressible as a graph.","authors_text":"Joel Rybicki, Thomas Nowak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T17:47:34Z","title":"Byzantine Approximate Agreement on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02743","kind":"arxiv","version":2},"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:8fdcb3538ee40f2c744559943d15fb0f7959f59c9df79d40798fba3761bf3253","target":"record","created_at":"2026-07-05T00:20:18Z","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":"d7936d2be99a3563a558e5f5c08a413c2be01ec7d3dc2b035aab7e1faf3fa30e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-08-07T17:47:34Z","title_canon_sha256":"fa8beadfdcd39950c927f77696495a73f1d8455cd2d2050190f6bfe223597607"},"schema_version":"1.0","source":{"id":"1908.02743","kind":"arxiv","version":2}},"canonical_sha256":"4ad5f0a95ab00cff3f9733ae7dc924eff754b6458deb06c91fb6a954e5fafab3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ad5f0a95ab00cff3f9733ae7dc924eff754b6458deb06c91fb6a954e5fafab3","first_computed_at":"2026-07-05T00:20:18.087861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:18.087861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hjEgnHU+pnBcFnaVTsuoBW68vmdeL+9KvmokmXnsrhyI+7AY9SvBNL4h7/u6FAZgoSklN7gzJ+I21mFQGeeOCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:18.088271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02743","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fdcb3538ee40f2c744559943d15fb0f7959f59c9df79d40798fba3761bf3253","sha256:7d39cd823723325e5df9792ef7fec844ee17f418c6eefff197d56affa34ab5ca"],"state_sha256":"4fd817b54db3e3aa4b43713f013c19a5cc322a3cdf868f677fc6768aacdb7e1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnSUBRhOMXVNhNzl1FZlkwbuVCaOBmOokjYZ+ETM6ZD7Q0NSVglPP6jq9AzPlegfoC8zuxsBjXHeh56VQtR7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T08:27:28.049766Z","bundle_sha256":"20e116810a4b905cb1f29372fa16e0c5952fa20cfd97da1f7551be98fa765f4f"}}