{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MORJKLHDJRPYQCWCGKX6KNVHCF","short_pith_number":"pith:MORJKLHD","schema_version":"1.0","canonical_sha256":"63a2952ce34c5f880ac232afe536a71177f7d0512b450c59490f63da406ae2ce","source":{"kind":"arxiv","id":"1502.02991","version":1},"attestation_state":"computed","paper":{"title":"Simple Executions of Snapshot Implementations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Amram, Gera Weiss, Lior Mizrahi","submitted_at":"2015-02-10T17:03:54Z","abstract_excerpt":"The well known snapshot primitive in concurrent programming allows for n-asynchronous processes to write values to an array of single-writer registers and, for each process, to take a snapshot of these registers. In this paper we provide a formulation of the well known linearizability condition for snapshot algorithms in terms of the existence of certain mathematical functions. In addition, we identify a simplifying property of snapshot implementations we call \"schedule-based algorithms\". This property is natural to assume in the sense that as far as we know, every published snapshot algorithm"},"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":"1502.02991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-10T17:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"31b88846f78cbc66bb6ba7f95f8131fdf9d1960e7ed16a253de247737d506217","abstract_canon_sha256":"4d2d0ed7d5417cf9bf51d6385e907993e7a465cf8de7b34edd0b838829895b29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:30.103552Z","signature_b64":"qny2/BEJofjdMe7RIvCgeQxHT9e/kZMC0lYo/g9oJJvGHdxfyhaq0csq29nmgoQVe3FzTYfu39yZOde2ZsJ2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63a2952ce34c5f880ac232afe536a71177f7d0512b450c59490f63da406ae2ce","last_reissued_at":"2026-05-18T02:27:30.102814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:30.102814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Executions of Snapshot Implementations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Amram, Gera Weiss, Lior Mizrahi","submitted_at":"2015-02-10T17:03:54Z","abstract_excerpt":"The well known snapshot primitive in concurrent programming allows for n-asynchronous processes to write values to an array of single-writer registers and, for each process, to take a snapshot of these registers. In this paper we provide a formulation of the well known linearizability condition for snapshot algorithms in terms of the existence of certain mathematical functions. In addition, we identify a simplifying property of snapshot implementations we call \"schedule-based algorithms\". This property is natural to assume in the sense that as far as we know, every published snapshot algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02991","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":"1502.02991","created_at":"2026-05-18T02:27:30.102919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02991v1","created_at":"2026-05-18T02:27:30.102919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02991","created_at":"2026-05-18T02:27:30.102919+00:00"},{"alias_kind":"pith_short_12","alias_value":"MORJKLHDJRPY","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MORJKLHDJRPYQCWC","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MORJKLHD","created_at":"2026-05-18T12:29:32.376354+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/MORJKLHDJRPYQCWCGKX6KNVHCF","json":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF.json","graph_json":"https://pith.science/api/pith-number/MORJKLHDJRPYQCWCGKX6KNVHCF/graph.json","events_json":"https://pith.science/api/pith-number/MORJKLHDJRPYQCWCGKX6KNVHCF/events.json","paper":"https://pith.science/paper/MORJKLHD"},"agent_actions":{"view_html":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF","download_json":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF.json","view_paper":"https://pith.science/paper/MORJKLHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02991&json=true","fetch_graph":"https://pith.science/api/pith-number/MORJKLHDJRPYQCWCGKX6KNVHCF/graph.json","fetch_events":"https://pith.science/api/pith-number/MORJKLHDJRPYQCWCGKX6KNVHCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF/action/storage_attestation","attest_author":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF/action/author_attestation","sign_citation":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF/action/citation_signature","submit_replication":"https://pith.science/pith/MORJKLHDJRPYQCWCGKX6KNVHCF/action/replication_record"}},"created_at":"2026-05-18T02:27:30.102919+00:00","updated_at":"2026-05-18T02:27:30.102919+00:00"}