{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JFYSMBZTYPDGVNPKAYDTXGQPBY","short_pith_number":"pith:JFYSMBZT","canonical_record":{"source":{"id":"1804.06197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T12:26:31Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5a65eab2fabe8c9962ede0df4c9bbf005253a9545f590ceea889b3308dcf925e","abstract_canon_sha256":"af31b7946c353397e48c29f4da768a5f65449bde0c15d746a1bea60eeb79d332"},"schema_version":"1.0"},"canonical_sha256":"4971260733c3c66ab5ea06073b9a0f0e1ad7eba8515b9bba20fee43b674b8212","source":{"kind":"arxiv","id":"1804.06197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06197","created_at":"2026-05-18T00:18:08Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06197v2","created_at":"2026-05-18T00:18:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06197","created_at":"2026-05-18T00:18:08Z"},{"alias_kind":"pith_short_12","alias_value":"JFYSMBZTYPDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JFYSMBZTYPDGVNPK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JFYSMBZT","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JFYSMBZTYPDGVNPKAYDTXGQPBY","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T12:26:31Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5a65eab2fabe8c9962ede0df4c9bbf005253a9545f590ceea889b3308dcf925e","abstract_canon_sha256":"af31b7946c353397e48c29f4da768a5f65449bde0c15d746a1bea60eeb79d332"},"schema_version":"1.0"},"canonical_sha256":"4971260733c3c66ab5ea06073b9a0f0e1ad7eba8515b9bba20fee43b674b8212","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:08.767877Z","signature_b64":"XnJ/oUPwyYtPacgAV+MOPwt6ixa3/DOa+1Re7z4tg2ID76bWkC55FP6DHQQTejH5YqlJYbkqG0qg7Ah9PhpbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4971260733c3c66ab5ea06073b9a0f0e1ad7eba8515b9bba20fee43b674b8212","last_reissued_at":"2026-05-18T00:18:08.767306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:08.767306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06197","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-05-18T00:18:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81SUpRRCXxgWZZAAjaNL4zkqzHzlTv1iSKc1OEa5/kszevaLxgZ/sKBEx+D/vV57Xx3H/yi5ojmjF/BDeS6VAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:43:36.503731Z"},"content_sha256":"db4103974ee659abfefd9268a0fbd43c5545cb0381fb052c4b123e17b0442adc","schema_version":"1.0","event_id":"sha256:db4103974ee659abfefd9268a0fbd43c5545cb0381fb052c4b123e17b0442adc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JFYSMBZTYPDGVNPKAYDTXGQPBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reaching Distributed Equilibrium with Limited ID Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Dor Bank, Eyal Waserman, Moshe Sulamy","submitted_at":"2018-04-17T12:26:31Z","abstract_excerpt":"We examine the relation between the size of the id space and the number of rational agents in a network under which equilibrium in distributed algorithms is possible. When the number of agents in the network is not a-priori known, a single agent may duplicate to gain an advantage, pretending to be more than one agent. However, when the id space is limited, each duplication involves a risk of being caught. By comparing the risk against the advantage, given an id space of size $L$, we provide a method of calculating the minimal threshold $t$, the required number of agents in the network, such th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06197","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":""},"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:18:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6hQp0QCWz6lTbTjswLRAYRi7iwAbNExJritlEBVQS+gqicB6acewbt+Gd4OBbvjxt/xw0v829k7tEvNyE7BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:43:36.504442Z"},"content_sha256":"21e7c8428a844cea90e5ad3fd0738c8ecdcbf3c556be4b594582d9cdc30834df","schema_version":"1.0","event_id":"sha256:21e7c8428a844cea90e5ad3fd0738c8ecdcbf3c556be4b594582d9cdc30834df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/bundle.json","state_url":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/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-09T22:43:36Z","links":{"resolver":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY","bundle":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/bundle.json","state":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JFYSMBZTYPDGVNPKAYDTXGQPBY","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":"af31b7946c353397e48c29f4da768a5f65449bde0c15d746a1bea60eeb79d332","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T12:26:31Z","title_canon_sha256":"5a65eab2fabe8c9962ede0df4c9bbf005253a9545f590ceea889b3308dcf925e"},"schema_version":"1.0","source":{"id":"1804.06197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06197","created_at":"2026-05-18T00:18:08Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06197v2","created_at":"2026-05-18T00:18:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06197","created_at":"2026-05-18T00:18:08Z"},{"alias_kind":"pith_short_12","alias_value":"JFYSMBZTYPDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JFYSMBZTYPDGVNPK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JFYSMBZT","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:21e7c8428a844cea90e5ad3fd0738c8ecdcbf3c556be4b594582d9cdc30834df","target":"graph","created_at":"2026-05-18T00:18:08Z","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":"We examine the relation between the size of the id space and the number of rational agents in a network under which equilibrium in distributed algorithms is possible. When the number of agents in the network is not a-priori known, a single agent may duplicate to gain an advantage, pretending to be more than one agent. However, when the id space is limited, each duplication involves a risk of being caught. By comparing the risk against the advantage, given an id space of size $L$, we provide a method of calculating the minimal threshold $t$, the required number of agents in the network, such th","authors_text":"Dor Bank, Eyal Waserman, Moshe Sulamy","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T12:26:31Z","title":"Reaching Distributed Equilibrium with Limited ID Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06197","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:db4103974ee659abfefd9268a0fbd43c5545cb0381fb052c4b123e17b0442adc","target":"record","created_at":"2026-05-18T00:18:08Z","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":"af31b7946c353397e48c29f4da768a5f65449bde0c15d746a1bea60eeb79d332","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T12:26:31Z","title_canon_sha256":"5a65eab2fabe8c9962ede0df4c9bbf005253a9545f590ceea889b3308dcf925e"},"schema_version":"1.0","source":{"id":"1804.06197","kind":"arxiv","version":2}},"canonical_sha256":"4971260733c3c66ab5ea06073b9a0f0e1ad7eba8515b9bba20fee43b674b8212","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4971260733c3c66ab5ea06073b9a0f0e1ad7eba8515b9bba20fee43b674b8212","first_computed_at":"2026-05-18T00:18:08.767306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:08.767306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XnJ/oUPwyYtPacgAV+MOPwt6ixa3/DOa+1Re7z4tg2ID76bWkC55FP6DHQQTejH5YqlJYbkqG0qg7Ah9PhpbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:08.767877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db4103974ee659abfefd9268a0fbd43c5545cb0381fb052c4b123e17b0442adc","sha256:21e7c8428a844cea90e5ad3fd0738c8ecdcbf3c556be4b594582d9cdc30834df"],"state_sha256":"104b9f28939f215d3bc1d26501b944623a8daebd2df88a96f1edd11fb208327c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0POfoqtT9X4bpHEqHYawM6yJGz+GWTxLiaJeyneSA9H5fc0cgsADWORlMBFd3uamqKsL56RJzDJ4IkGk+5SyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:43:36.738368Z","bundle_sha256":"f51e15dc8822df8fb9165fde54817a2ce7f590f436f097fa5021555290c3333f"}}