{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G5K5XRST7FB6BR3LZCRINMLEIQ","short_pith_number":"pith:G5K5XRST","schema_version":"1.0","canonical_sha256":"3755dbc653f943e0c76bc8a286b16444179d724076b550a0e9f4d22f8ec790ac","source":{"kind":"arxiv","id":"1711.04728","version":2},"attestation_state":"computed","paper":{"title":"Cheating by Duplication: Equilibrium Requires Global Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Moshe Sulamy, Shaked Rafaeli, Yehuda Afek","submitted_at":"2017-11-13T17:55:45Z","abstract_excerpt":"The question of what global information must distributed rational agents a-priori know about the network in order for equilibrium to be possible is researched here. Until now, distributed algorithms with rational agents have assumed that $n$, the size of the network, is a-priori known to the participants. We investigate the above question, considering different distributed computing problems and showing how much each agent must a-priori know about $n$ in order for distributed algorithms to be equilibria. The main tool considered throughout the paper is the advantage an agent may gain by duplic"},"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":"1711.04728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-13T17:55:45Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"81209645574bc81ba893891e80aa73b1304e9db4adcb194f89361d411bc96eee","abstract_canon_sha256":"384134be3fdc7f17615e8c5072bb10f71f08aab1a2b6511aec0d1889d3c25cfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:03.141867Z","signature_b64":"zt0zpJ+eIowMw87cKh+Wxt6rTeZ0nhesjy8Q1IaTXvUT4w9P65Bm51xxiV+nQXZudWeMKbgat1FZw5nd++CxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3755dbc653f943e0c76bc8a286b16444179d724076b550a0e9f4d22f8ec790ac","last_reissued_at":"2026-05-18T00:19:03.141256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:03.141256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cheating by Duplication: Equilibrium Requires Global Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DC","authors_text":"Moshe Sulamy, Shaked Rafaeli, Yehuda Afek","submitted_at":"2017-11-13T17:55:45Z","abstract_excerpt":"The question of what global information must distributed rational agents a-priori know about the network in order for equilibrium to be possible is researched here. Until now, distributed algorithms with rational agents have assumed that $n$, the size of the network, is a-priori known to the participants. We investigate the above question, considering different distributed computing problems and showing how much each agent must a-priori know about $n$ in order for distributed algorithms to be equilibria. The main tool considered throughout the paper is the advantage an agent may gain by duplic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04728","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":"1711.04728","created_at":"2026-05-18T00:19:03.141358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04728v2","created_at":"2026-05-18T00:19:03.141358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04728","created_at":"2026-05-18T00:19:03.141358+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5K5XRST7FB6","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5K5XRST7FB6BR3L","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5K5XRST","created_at":"2026-05-18T12:31:15.632608+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/G5K5XRST7FB6BR3LZCRINMLEIQ","json":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ.json","graph_json":"https://pith.science/api/pith-number/G5K5XRST7FB6BR3LZCRINMLEIQ/graph.json","events_json":"https://pith.science/api/pith-number/G5K5XRST7FB6BR3LZCRINMLEIQ/events.json","paper":"https://pith.science/paper/G5K5XRST"},"agent_actions":{"view_html":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ","download_json":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ.json","view_paper":"https://pith.science/paper/G5K5XRST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04728&json=true","fetch_graph":"https://pith.science/api/pith-number/G5K5XRST7FB6BR3LZCRINMLEIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/G5K5XRST7FB6BR3LZCRINMLEIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ/action/storage_attestation","attest_author":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ/action/author_attestation","sign_citation":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ/action/citation_signature","submit_replication":"https://pith.science/pith/G5K5XRST7FB6BR3LZCRINMLEIQ/action/replication_record"}},"created_at":"2026-05-18T00:19:03.141358+00:00","updated_at":"2026-05-18T00:19:03.141358+00:00"}