{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QQN44DCKR43Z6LLCAPSBMVMTJV","short_pith_number":"pith:QQN44DCK","schema_version":"1.0","canonical_sha256":"841bce0c4a8f379f2d6203e41655934d6066645a086ef09d1af2ca6e7048fc32","source":{"kind":"arxiv","id":"1704.05521","version":1},"attestation_state":"computed","paper":{"title":"Building Regular Registers with Rational Malicious Servers and Anonymous Clients -- Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Antonella Del Pozzo, Riccardo Lazzeretti, Roberto Baldoni, Silvia Bonomi","submitted_at":"2017-04-18T20:37:46Z","abstract_excerpt":"The paper addresses the problem of emulating a regular register in a synchronous distributed system where clients invoking ${\\sf read}()$ and ${\\sf write}()$ operations are anonymous while server processes maintaining the state of the register may be compromised by rational adversaries (i.e., a server might behave as \\emph{rational malicious Byzantine} process). We first model our problem as a Bayesian game between a client and a rational malicious server where the equilibrium depends on the decisions of the malicious server (behave correctly and not be detected by clients vs returning a wrong"},"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":"1704.05521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-18T20:37:46Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f0e03c030ca2cee82484fa7a317d24d743c37679fe46dff347bd00795b1e109f","abstract_canon_sha256":"abf650eecd6a717e7ed6a9ab782a6b65efc8bdbec5967b32c49701b396bcf9d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:07.248185Z","signature_b64":"bFtYzvD5UAD5aj3bUcHSy3gKgdlkPaAboMnvj/wnC3XTGI1QuZyALsvmeDqo63ZPGLiLA5QAE7D0TYhtzhLQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"841bce0c4a8f379f2d6203e41655934d6066645a086ef09d1af2ca6e7048fc32","last_reissued_at":"2026-05-18T00:46:07.247725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:07.247725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Building Regular Registers with Rational Malicious Servers and Anonymous Clients -- Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Antonella Del Pozzo, Riccardo Lazzeretti, Roberto Baldoni, Silvia Bonomi","submitted_at":"2017-04-18T20:37:46Z","abstract_excerpt":"The paper addresses the problem of emulating a regular register in a synchronous distributed system where clients invoking ${\\sf read}()$ and ${\\sf write}()$ operations are anonymous while server processes maintaining the state of the register may be compromised by rational adversaries (i.e., a server might behave as \\emph{rational malicious Byzantine} process). We first model our problem as a Bayesian game between a client and a rational malicious server where the equilibrium depends on the decisions of the malicious server (behave correctly and not be detected by clients vs returning a wrong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05521","kind":"arxiv","version":1},"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":"1704.05521","created_at":"2026-05-18T00:46:07.247803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05521v1","created_at":"2026-05-18T00:46:07.247803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05521","created_at":"2026-05-18T00:46:07.247803+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQN44DCKR43Z","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQN44DCKR43Z6LLC","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQN44DCK","created_at":"2026-05-18T12:31:39.905425+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/QQN44DCKR43Z6LLCAPSBMVMTJV","json":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV.json","graph_json":"https://pith.science/api/pith-number/QQN44DCKR43Z6LLCAPSBMVMTJV/graph.json","events_json":"https://pith.science/api/pith-number/QQN44DCKR43Z6LLCAPSBMVMTJV/events.json","paper":"https://pith.science/paper/QQN44DCK"},"agent_actions":{"view_html":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV","download_json":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV.json","view_paper":"https://pith.science/paper/QQN44DCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05521&json=true","fetch_graph":"https://pith.science/api/pith-number/QQN44DCKR43Z6LLCAPSBMVMTJV/graph.json","fetch_events":"https://pith.science/api/pith-number/QQN44DCKR43Z6LLCAPSBMVMTJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV/action/storage_attestation","attest_author":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV/action/author_attestation","sign_citation":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV/action/citation_signature","submit_replication":"https://pith.science/pith/QQN44DCKR43Z6LLCAPSBMVMTJV/action/replication_record"}},"created_at":"2026-05-18T00:46:07.247803+00:00","updated_at":"2026-05-18T00:46:07.247803+00:00"}