{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ICAQLFXCDT3RCRVGIRZR6YHJ3M","short_pith_number":"pith:ICAQLFXC","schema_version":"1.0","canonical_sha256":"40810596e21cf71146a644731f60e9db0ae824c1459962f733b07ba85b82d21d","source":{"kind":"arxiv","id":"1805.03727","version":2},"attestation_state":"computed","paper":{"title":"ARES: Adaptive, Reconfigurable, Erasure coded, atomic Storage","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andria Trigeorgi, Kishori M. Konwar, Muriel Medard, Nancy Lynch, Nicolas Nicolaou, N. Prakash, Viveck Cadambe","submitted_at":"2018-05-09T20:44:02Z","abstract_excerpt":"Atomicity or strong consistency is one of the fundamental, most intuitive, and hardest to provide primitives in distributed shared memory emulations. To ensure survivability, scalability, and availability of a storage service in the presence of failures, traditional approaches for atomic memory emulation, in message passing environments, replicate the objects across multiple servers. Compared to replication based algorithms, erasure code-based atomic memory algorithms has much lower storage and communication costs, but usually, they are harder to design. The difficulty of designing atomic memo"},"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":"1805.03727","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-09T20:44:02Z","cross_cats_sorted":[],"title_canon_sha256":"43d1974cada6a11f47ffd9f4081dd823ff847cb93a01d5fab57264cec219681c","abstract_canon_sha256":"252d8107639f0d893b82c160ae805bec56012675c569f372b0af1a6be8c0785c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:01.030822Z","signature_b64":"tfccI6Kt3r3wUC7XJ5wheP0dT+tH5wTvWPF6fr4fO5OYTuFhkZBvzvua2NAJiwXB52b1D7tNfXz1FqjcaVZ0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40810596e21cf71146a644731f60e9db0ae824c1459962f733b07ba85b82d21d","last_reissued_at":"2026-07-05T02:44:01.030270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:01.030270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ARES: Adaptive, Reconfigurable, Erasure coded, atomic Storage","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andria Trigeorgi, Kishori M. Konwar, Muriel Medard, Nancy Lynch, Nicolas Nicolaou, N. Prakash, Viveck Cadambe","submitted_at":"2018-05-09T20:44:02Z","abstract_excerpt":"Atomicity or strong consistency is one of the fundamental, most intuitive, and hardest to provide primitives in distributed shared memory emulations. To ensure survivability, scalability, and availability of a storage service in the presence of failures, traditional approaches for atomic memory emulation, in message passing environments, replicate the objects across multiple servers. Compared to replication based algorithms, erasure code-based atomic memory algorithms has much lower storage and communication costs, but usually, they are harder to design. The difficulty of designing atomic memo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03727","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.03727/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1805.03727","created_at":"2026-07-05T02:44:01.030350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03727v2","created_at":"2026-07-05T02:44:01.030350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03727","created_at":"2026-07-05T02:44:01.030350+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICAQLFXCDT3R","created_at":"2026-07-05T02:44:01.030350+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICAQLFXCDT3RCRVG","created_at":"2026-07-05T02:44:01.030350+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICAQLFXC","created_at":"2026-07-05T02:44:01.030350+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/ICAQLFXCDT3RCRVGIRZR6YHJ3M","json":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M.json","graph_json":"https://pith.science/api/pith-number/ICAQLFXCDT3RCRVGIRZR6YHJ3M/graph.json","events_json":"https://pith.science/api/pith-number/ICAQLFXCDT3RCRVGIRZR6YHJ3M/events.json","paper":"https://pith.science/paper/ICAQLFXC"},"agent_actions":{"view_html":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M","download_json":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M.json","view_paper":"https://pith.science/paper/ICAQLFXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03727&json=true","fetch_graph":"https://pith.science/api/pith-number/ICAQLFXCDT3RCRVGIRZR6YHJ3M/graph.json","fetch_events":"https://pith.science/api/pith-number/ICAQLFXCDT3RCRVGIRZR6YHJ3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M/action/storage_attestation","attest_author":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M/action/author_attestation","sign_citation":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M/action/citation_signature","submit_replication":"https://pith.science/pith/ICAQLFXCDT3RCRVGIRZR6YHJ3M/action/replication_record"}},"created_at":"2026-07-05T02:44:01.030350+00:00","updated_at":"2026-07-05T02:44:01.030350+00:00"}