{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YCWK7JWNLHSMBH7Q2W6UBGK4I2","short_pith_number":"pith:YCWK7JWN","schema_version":"1.0","canonical_sha256":"c0acafa6cd59e4c09ff0d5bd40995c4696a194fca4fadd39ecdb5a9500b98103","source":{"kind":"arxiv","id":"1705.09704","version":1},"attestation_state":"computed","paper":{"title":"Lock-step simulation is child's play","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Chris Smith, Joachim Breitner","submitted_at":"2017-05-26T20:11:00Z","abstract_excerpt":"Implementing multi-player networked games by broadcasting the player's input and letting each client calculate the game state - a scheme known as lock-step simulation - is an established technique. However, ensuring that every client in this scheme obtains a consistent state is infamously hard and in general requires great discipline from the game programmer. The thesis of this report is that in the realm of functional programming - in particular with Haskell's purity and static pointers - this hard problem becomes almost trivially easy.\n  We support this thesis by implementing lock-step simul"},"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":"1705.09704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-26T20:11:00Z","cross_cats_sorted":[],"title_canon_sha256":"6bf45309b0b8467437823203368ef67000a88ece9d7be6bd23338535569cbc77","abstract_canon_sha256":"7742c1b0525202fa0ef26659f6798e2135e038e81d583e170b6eb1e6755b4174"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:17.594437Z","signature_b64":"quBeuMM6IbwjCFlH2tXE0r4FS+nR1EdRd2hegjYi0iraZcxNEdPYso5xa0y41SbiAA4MYgYPQHcu8LtDlnlGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0acafa6cd59e4c09ff0d5bd40995c4696a194fca4fadd39ecdb5a9500b98103","last_reissued_at":"2026-05-18T00:41:17.593672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:17.593672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lock-step simulation is child's play","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Chris Smith, Joachim Breitner","submitted_at":"2017-05-26T20:11:00Z","abstract_excerpt":"Implementing multi-player networked games by broadcasting the player's input and letting each client calculate the game state - a scheme known as lock-step simulation - is an established technique. However, ensuring that every client in this scheme obtains a consistent state is infamously hard and in general requires great discipline from the game programmer. The thesis of this report is that in the realm of functional programming - in particular with Haskell's purity and static pointers - this hard problem becomes almost trivially easy.\n  We support this thesis by implementing lock-step simul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09704","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":"1705.09704","created_at":"2026-05-18T00:41:17.593783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09704v1","created_at":"2026-05-18T00:41:17.593783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09704","created_at":"2026-05-18T00:41:17.593783+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCWK7JWNLHSM","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCWK7JWNLHSMBH7Q","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCWK7JWN","created_at":"2026-05-18T12:31:56.362134+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/YCWK7JWNLHSMBH7Q2W6UBGK4I2","json":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2.json","graph_json":"https://pith.science/api/pith-number/YCWK7JWNLHSMBH7Q2W6UBGK4I2/graph.json","events_json":"https://pith.science/api/pith-number/YCWK7JWNLHSMBH7Q2W6UBGK4I2/events.json","paper":"https://pith.science/paper/YCWK7JWN"},"agent_actions":{"view_html":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2","download_json":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2.json","view_paper":"https://pith.science/paper/YCWK7JWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09704&json=true","fetch_graph":"https://pith.science/api/pith-number/YCWK7JWNLHSMBH7Q2W6UBGK4I2/graph.json","fetch_events":"https://pith.science/api/pith-number/YCWK7JWNLHSMBH7Q2W6UBGK4I2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/action/storage_attestation","attest_author":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/action/author_attestation","sign_citation":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/action/citation_signature","submit_replication":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/action/replication_record"}},"created_at":"2026-05-18T00:41:17.593783+00:00","updated_at":"2026-05-18T00:41:17.593783+00:00"}