{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JFYSMBZTYPDGVNPKAYDTXGQPBY","short_pith_number":"pith:JFYSMBZT","schema_version":"1.0","canonical_sha256":"4971260733c3c66ab5ea06073b9a0f0e1ad7eba8515b9bba20fee43b674b8212","source":{"kind":"arxiv","id":"1804.06197","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.06197","created_at":"2026-05-18T00:18:08.767393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06197v2","created_at":"2026-05-18T00:18:08.767393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06197","created_at":"2026-05-18T00:18:08.767393+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFYSMBZTYPDG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFYSMBZTYPDGVNPK","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFYSMBZT","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY","json":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY.json","graph_json":"https://pith.science/api/pith-number/JFYSMBZTYPDGVNPKAYDTXGQPBY/graph.json","events_json":"https://pith.science/api/pith-number/JFYSMBZTYPDGVNPKAYDTXGQPBY/events.json","paper":"https://pith.science/paper/JFYSMBZT"},"agent_actions":{"view_html":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY","download_json":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY.json","view_paper":"https://pith.science/paper/JFYSMBZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06197&json=true","fetch_graph":"https://pith.science/api/pith-number/JFYSMBZTYPDGVNPKAYDTXGQPBY/graph.json","fetch_events":"https://pith.science/api/pith-number/JFYSMBZTYPDGVNPKAYDTXGQPBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/action/storage_attestation","attest_author":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/action/author_attestation","sign_citation":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/action/citation_signature","submit_replication":"https://pith.science/pith/JFYSMBZTYPDGVNPKAYDTXGQPBY/action/replication_record"}},"created_at":"2026-05-18T00:18:08.767393+00:00","updated_at":"2026-05-18T00:18:08.767393+00:00"}