{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HZ3LCORB4H7ARVP3J3V7EKM2N4","short_pith_number":"pith:HZ3LCORB","canonical_record":{"source":{"id":"1708.03274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-10T15:50:37Z","cross_cats_sorted":[],"title_canon_sha256":"c78494b6353d827c90679e925bfc2b21333b3d9d351533f29ddb0940ebf78699","abstract_canon_sha256":"ad6e75790d886289e6b0b61a21682193584169b1993e1727c3b117bc3dc702e0"},"schema_version":"1.0"},"canonical_sha256":"3e76b13a21e1fe08d5fb4eebf2299a6f03967ad393582ebd11c3ae36eb03e02f","source":{"kind":"arxiv","id":"1708.03274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03274","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03274v1","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03274","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"HZ3LCORB4H7A","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HZ3LCORB4H7ARVP3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HZ3LCORB","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HZ3LCORB4H7ARVP3J3V7EKM2N4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-10T15:50:37Z","cross_cats_sorted":[],"title_canon_sha256":"c78494b6353d827c90679e925bfc2b21333b3d9d351533f29ddb0940ebf78699","abstract_canon_sha256":"ad6e75790d886289e6b0b61a21682193584169b1993e1727c3b117bc3dc702e0"},"schema_version":"1.0"},"canonical_sha256":"3e76b13a21e1fe08d5fb4eebf2299a6f03967ad393582ebd11c3ae36eb03e02f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:14.252962Z","signature_b64":"GFl5ZmPB0CyXbtF+tGDhJa4DRlPIwnMGYGZsJt22RzqBVZRGs5Z6Tzi4v8ctiyvC7p39JZWJ1/4wn1cOl7zwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e76b13a21e1fe08d5fb4eebf2299a6f03967ad393582ebd11c3ae36eb03e02f","last_reissued_at":"2026-05-18T00:38:14.252321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:14.252321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03274","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:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dli/GghfoF05j5Gv48pIKEXUxj1hN7MwI8MBpm+jdGxkuBRq0EAksG3/svBrv2gIrwp/GxuBCzxfbbBPuYUhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:01:49.722428Z"},"content_sha256":"a4148e60940c1be1014b1803711a775eeefbebda2b968bf42a63c55f5cf700f0","schema_version":"1.0","event_id":"sha256:a4148e60940c1be1014b1803711a775eeefbebda2b968bf42a63c55f5cf700f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HZ3LCORB4H7ARVP3J3V7EKM2N4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulating a Shared Register in a System that Never Stops Changing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Faith Ellen, Hagit Attiya, Hyun Chul Chung, Jennifer L. Welch, Saptaparni Kumar","submitted_at":"2017-08-10T15:50:37Z","abstract_excerpt":"Simulating a shared register can mask the intricacies of designing algorithms for asynchronous message-passing systems subject to crash failures, since it allows them to run algorithms designed for the simpler shared-memory model. Typically such simulations replicate the value of the register in multiple servers and require readers and writers to communicate with a majority of servers. The success of this approach for static systems, where the set of nodes (readers, writers, and servers) is fixed, has motivated several similar simulations for dynamic systems, where nodes may enter and leave. H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03274","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:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yCyfDZRoZmiOXnk12vnoUxNkO7DnNBxh5qFROZ4Ls/N7fn4M0KAk1RgihdRGBXzKOIyCcSLmStHWVeTFwYwfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:01:49.723088Z"},"content_sha256":"334b3d4dfe6d7a196b25da92b8ba2229a6d17787cac367f21d67e8450588a1db","schema_version":"1.0","event_id":"sha256:334b3d4dfe6d7a196b25da92b8ba2229a6d17787cac367f21d67e8450588a1db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZ3LCORB4H7ARVP3J3V7EKM2N4/bundle.json","state_url":"https://pith.science/pith/HZ3LCORB4H7ARVP3J3V7EKM2N4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZ3LCORB4H7ARVP3J3V7EKM2N4/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-08T18:01:49Z","links":{"resolver":"https://pith.science/pith/HZ3LCORB4H7ARVP3J3V7EKM2N4","bundle":"https://pith.science/pith/HZ3LCORB4H7ARVP3J3V7EKM2N4/bundle.json","state":"https://pith.science/pith/HZ3LCORB4H7ARVP3J3V7EKM2N4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZ3LCORB4H7ARVP3J3V7EKM2N4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HZ3LCORB4H7ARVP3J3V7EKM2N4","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":"ad6e75790d886289e6b0b61a21682193584169b1993e1727c3b117bc3dc702e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-10T15:50:37Z","title_canon_sha256":"c78494b6353d827c90679e925bfc2b21333b3d9d351533f29ddb0940ebf78699"},"schema_version":"1.0","source":{"id":"1708.03274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03274","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03274v1","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03274","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"HZ3LCORB4H7A","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HZ3LCORB4H7ARVP3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HZ3LCORB","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:334b3d4dfe6d7a196b25da92b8ba2229a6d17787cac367f21d67e8450588a1db","target":"graph","created_at":"2026-05-18T00:38:14Z","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":"Simulating a shared register can mask the intricacies of designing algorithms for asynchronous message-passing systems subject to crash failures, since it allows them to run algorithms designed for the simpler shared-memory model. Typically such simulations replicate the value of the register in multiple servers and require readers and writers to communicate with a majority of servers. The success of this approach for static systems, where the set of nodes (readers, writers, and servers) is fixed, has motivated several similar simulations for dynamic systems, where nodes may enter and leave. H","authors_text":"Faith Ellen, Hagit Attiya, Hyun Chul Chung, Jennifer L. Welch, Saptaparni Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-10T15:50:37Z","title":"Simulating a Shared Register in a System that Never Stops Changing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03274","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:a4148e60940c1be1014b1803711a775eeefbebda2b968bf42a63c55f5cf700f0","target":"record","created_at":"2026-05-18T00:38:14Z","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":"ad6e75790d886289e6b0b61a21682193584169b1993e1727c3b117bc3dc702e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-10T15:50:37Z","title_canon_sha256":"c78494b6353d827c90679e925bfc2b21333b3d9d351533f29ddb0940ebf78699"},"schema_version":"1.0","source":{"id":"1708.03274","kind":"arxiv","version":1}},"canonical_sha256":"3e76b13a21e1fe08d5fb4eebf2299a6f03967ad393582ebd11c3ae36eb03e02f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e76b13a21e1fe08d5fb4eebf2299a6f03967ad393582ebd11c3ae36eb03e02f","first_computed_at":"2026-05-18T00:38:14.252321Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:14.252321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GFl5ZmPB0CyXbtF+tGDhJa4DRlPIwnMGYGZsJt22RzqBVZRGs5Z6Tzi4v8ctiyvC7p39JZWJ1/4wn1cOl7zwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:14.252962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4148e60940c1be1014b1803711a775eeefbebda2b968bf42a63c55f5cf700f0","sha256:334b3d4dfe6d7a196b25da92b8ba2229a6d17787cac367f21d67e8450588a1db"],"state_sha256":"44fec7abf4a1286a8aa6c7167b308bbb187a00394a25fcfc6a7ea72989ff061e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kN9Fk/k+YlqcyIML73D3/asKGJKjlAsTEcd27O4w/sgX+tcHzscOaagNkdu70NzbcfHwZyLP8UulBDcqoeTcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:01:49.728597Z","bundle_sha256":"1473e96de54cdf75088f93ca6ad969e557be762cb2b2ea6a0a016ecc851dbd3f"}}