{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YCWK7JWNLHSMBH7Q2W6UBGK4I2","short_pith_number":"pith:YCWK7JWN","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"},"canonical_sha256":"c0acafa6cd59e4c09ff0d5bd40995c4696a194fca4fadd39ecdb5a9500b98103","source":{"kind":"arxiv","id":"1705.09704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09704","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09704v1","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09704","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"YCWK7JWNLHSM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YCWK7JWNLHSMBH7Q","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YCWK7JWN","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YCWK7JWNLHSMBH7Q2W6UBGK4I2","target":"record","payload":{"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"},"canonical_sha256":"c0acafa6cd59e4c09ff0d5bd40995c4696a194fca4fadd39ecdb5a9500b98103","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"},"source_kind":"arxiv","source_id":"1705.09704","source_version":1,"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:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24Cb5mk6DFWNFZo1+YYcDmMGWsskybx0ikEfVdKCveUmHn/YcNHLeShS37mmdlOnlMFmXPdJSSki6faMgkErAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:01:45.199278Z"},"content_sha256":"98d76c6dab58b50449f34141c80a56df46deb63bff82b2cee11c10df8560a347","schema_version":"1.0","event_id":"sha256:98d76c6dab58b50449f34141c80a56df46deb63bff82b2cee11c10df8560a347"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YCWK7JWNLHSMBH7Q2W6UBGK4I2","target":"graph","payload":{"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"},"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:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xaDtpg9DkkajnPW0zOgIehfHmW5qvqtPWzKtPtKwQrzN+XdH0Sy36VyDNLVtJEQjF7e414IUW71qlzX+vAhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:01:45.199641Z"},"content_sha256":"e13b3283f33cba260c81dadfc80f07bb634e74b850b3159f30b0e72d9657835e","schema_version":"1.0","event_id":"sha256:e13b3283f33cba260c81dadfc80f07bb634e74b850b3159f30b0e72d9657835e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/bundle.json","state_url":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/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-07T11:01:45Z","links":{"resolver":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2","bundle":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/bundle.json","state":"https://pith.science/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YCWK7JWNLHSMBH7Q2W6UBGK4I2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YCWK7JWNLHSMBH7Q2W6UBGK4I2","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":"7742c1b0525202fa0ef26659f6798e2135e038e81d583e170b6eb1e6755b4174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-26T20:11:00Z","title_canon_sha256":"6bf45309b0b8467437823203368ef67000a88ece9d7be6bd23338535569cbc77"},"schema_version":"1.0","source":{"id":"1705.09704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09704","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09704v1","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09704","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"YCWK7JWNLHSM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YCWK7JWNLHSMBH7Q","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YCWK7JWN","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e13b3283f33cba260c81dadfc80f07bb634e74b850b3159f30b0e72d9657835e","target":"graph","created_at":"2026-05-18T00:41:17Z","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":"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","authors_text":"Chris Smith, Joachim Breitner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-26T20:11:00Z","title":"Lock-step simulation is child's play"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09704","kind":"arxiv","version":1},"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:98d76c6dab58b50449f34141c80a56df46deb63bff82b2cee11c10df8560a347","target":"record","created_at":"2026-05-18T00:41:17Z","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":"7742c1b0525202fa0ef26659f6798e2135e038e81d583e170b6eb1e6755b4174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-26T20:11:00Z","title_canon_sha256":"6bf45309b0b8467437823203368ef67000a88ece9d7be6bd23338535569cbc77"},"schema_version":"1.0","source":{"id":"1705.09704","kind":"arxiv","version":1}},"canonical_sha256":"c0acafa6cd59e4c09ff0d5bd40995c4696a194fca4fadd39ecdb5a9500b98103","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0acafa6cd59e4c09ff0d5bd40995c4696a194fca4fadd39ecdb5a9500b98103","first_computed_at":"2026-05-18T00:41:17.593672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:17.593672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quBeuMM6IbwjCFlH2tXE0r4FS+nR1EdRd2hegjYi0iraZcxNEdPYso5xa0y41SbiAA4MYgYPQHcu8LtDlnlGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:17.594437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98d76c6dab58b50449f34141c80a56df46deb63bff82b2cee11c10df8560a347","sha256:e13b3283f33cba260c81dadfc80f07bb634e74b850b3159f30b0e72d9657835e"],"state_sha256":"b4d67631e96ff596abf751224280807203646241ea8451ca01812a910e82a776"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PD2WXC9UbHmPg6yi39FWGvfbT3J07Ayc6Un6/GUxtxhZaxq/HDMVXeS+YFU4JxOwaUfPYNXBKiQPAbTAPRsGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:01:45.201743Z","bundle_sha256":"9dcd0f7ee446eb1e011afbcfdfc2eb9c451bca45dca504235e33ad9563838bad"}}