{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TAAG2FGJNAXG3BM4BS3I3JC3U7","short_pith_number":"pith:TAAG2FGJ","canonical_record":{"source":{"id":"1605.01748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-05T20:23:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5af421348560cb1d8323379b9432e8cbe9b4a5ffef6d4afd33706206e14a8991","abstract_canon_sha256":"4a293ae490b4ab6b77abd9874417527fbcef350b69be4e43a8fff8b90eae96af"},"schema_version":"1.0"},"canonical_sha256":"98006d14c9682e6d859c0cb68da45ba7d4db108640e1c2cca55f757ce0eca53c","source":{"kind":"arxiv","id":"1605.01748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01748","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01748v1","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01748","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"TAAG2FGJNAXG","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TAAG2FGJNAXG3BM4","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TAAG2FGJ","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TAAG2FGJNAXG3BM4BS3I3JC3U7","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-05T20:23:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5af421348560cb1d8323379b9432e8cbe9b4a5ffef6d4afd33706206e14a8991","abstract_canon_sha256":"4a293ae490b4ab6b77abd9874417527fbcef350b69be4e43a8fff8b90eae96af"},"schema_version":"1.0"},"canonical_sha256":"98006d14c9682e6d859c0cb68da45ba7d4db108640e1c2cca55f757ce0eca53c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.873267Z","signature_b64":"aHbcW4L2nNbyuOOzxTWCAilS8YaVUzxAu7Y4XpeJHati0JfkgRWLECn/yp/V+E8YDivwGwuTc5CDk1AMs5FLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98006d14c9682e6d859c0cb68da45ba7d4db108640e1c2cca55f757ce0eca53c","last_reissued_at":"2026-05-18T00:58:56.872652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.872652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01748","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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaBlwhKsQVGlYLMn5Wpb7Fma4Z6Nw9SudrcI4qF7WB3i9ZHEn1+R0kJSeDdNKaAcZVp5PApv/qSnHNzWGk95Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:28:24.102373Z"},"content_sha256":"1de0cd63f5df79d86613be2e7de1096f90d500faf9d365621a3913c09134552b","schema_version":"1.0","event_id":"sha256:1de0cd63f5df79d86613be2e7de1096f90d500faf9d365621a3913c09134552b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TAAG2FGJNAXG3BM4BS3I3JC3U7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Alexander A. Schwarzmann, Erez Kantor, Kishori M. Konwar, Muriel Medard, Nancy Lynch, N. Prakash","submitted_at":"2016-05-05T20:23:53Z","abstract_excerpt":"Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the traditional replication based schemes, erasure codes have the potential of significantly lowering storage and communication costs while simultaneously guaranteeing the desired resiliency levels. In this work, we propose the Storage-Optimized Data-Atomic (SODA) algorithm for implementing atomic memory objects in the multi-writer multi-reader setting. SODA uses Maximum Distance Separable (MDS) codes, and is specifically "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01748","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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BsBLkrRcOoyBG9lyLiRDyne5Vrdi2UYv8HReHl5g/j2hwfIM0HfNtNgITXyvlCsgMzoz1vi58l1DSx3WpojQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:28:24.103028Z"},"content_sha256":"2a260be7d7b4f7389fcb467777e3bca2c6ef69a76276bf64364eeee6c0f9ffe0","schema_version":"1.0","event_id":"sha256:2a260be7d7b4f7389fcb467777e3bca2c6ef69a76276bf64364eeee6c0f9ffe0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAAG2FGJNAXG3BM4BS3I3JC3U7/bundle.json","state_url":"https://pith.science/pith/TAAG2FGJNAXG3BM4BS3I3JC3U7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAAG2FGJNAXG3BM4BS3I3JC3U7/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-05-25T22:28:24Z","links":{"resolver":"https://pith.science/pith/TAAG2FGJNAXG3BM4BS3I3JC3U7","bundle":"https://pith.science/pith/TAAG2FGJNAXG3BM4BS3I3JC3U7/bundle.json","state":"https://pith.science/pith/TAAG2FGJNAXG3BM4BS3I3JC3U7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAAG2FGJNAXG3BM4BS3I3JC3U7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TAAG2FGJNAXG3BM4BS3I3JC3U7","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":"4a293ae490b4ab6b77abd9874417527fbcef350b69be4e43a8fff8b90eae96af","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-05T20:23:53Z","title_canon_sha256":"5af421348560cb1d8323379b9432e8cbe9b4a5ffef6d4afd33706206e14a8991"},"schema_version":"1.0","source":{"id":"1605.01748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01748","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01748v1","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01748","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"TAAG2FGJNAXG","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TAAG2FGJNAXG3BM4","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TAAG2FGJ","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:2a260be7d7b4f7389fcb467777e3bca2c6ef69a76276bf64364eeee6c0f9ffe0","target":"graph","created_at":"2026-05-18T00:58:56Z","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":"Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the traditional replication based schemes, erasure codes have the potential of significantly lowering storage and communication costs while simultaneously guaranteeing the desired resiliency levels. In this work, we propose the Storage-Optimized Data-Atomic (SODA) algorithm for implementing atomic memory objects in the multi-writer multi-reader setting. SODA uses Maximum Distance Separable (MDS) codes, and is specifically ","authors_text":"Alexander A. Schwarzmann, Erez Kantor, Kishori M. Konwar, Muriel Medard, Nancy Lynch, N. Prakash","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-05T20:23:53Z","title":"Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01748","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:1de0cd63f5df79d86613be2e7de1096f90d500faf9d365621a3913c09134552b","target":"record","created_at":"2026-05-18T00:58:56Z","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":"4a293ae490b4ab6b77abd9874417527fbcef350b69be4e43a8fff8b90eae96af","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-05T20:23:53Z","title_canon_sha256":"5af421348560cb1d8323379b9432e8cbe9b4a5ffef6d4afd33706206e14a8991"},"schema_version":"1.0","source":{"id":"1605.01748","kind":"arxiv","version":1}},"canonical_sha256":"98006d14c9682e6d859c0cb68da45ba7d4db108640e1c2cca55f757ce0eca53c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98006d14c9682e6d859c0cb68da45ba7d4db108640e1c2cca55f757ce0eca53c","first_computed_at":"2026-05-18T00:58:56.872652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:56.872652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHbcW4L2nNbyuOOzxTWCAilS8YaVUzxAu7Y4XpeJHati0JfkgRWLECn/yp/V+E8YDivwGwuTc5CDk1AMs5FLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:56.873267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de0cd63f5df79d86613be2e7de1096f90d500faf9d365621a3913c09134552b","sha256:2a260be7d7b4f7389fcb467777e3bca2c6ef69a76276bf64364eeee6c0f9ffe0"],"state_sha256":"0c7590491500f2d63990bed0bcddf0abfaa6b83a6e7674dd40274ee94b6a9ea0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YY7BRuwGJ3vPEhltQF1kOoDR38il4StHs2xEc3UQnyZ4QJI9/pYhMBtaSBy9GFyYjMLjh3hx1kRLf7y4BvnXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:28:24.106246Z","bundle_sha256":"a38202a3138552b85d2ad812c8fb588fef504af66d292abf5d55a0edf61dc43e"}}