{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RQE7QQHIX7SDKWNO3BCWSSYQKI","short_pith_number":"pith:RQE7QQHI","schema_version":"1.0","canonical_sha256":"8c09f840e8bfe43559aed845694b105207fa1d05d6d9f209279d2c10a12f2abc","source":{"kind":"arxiv","id":"1510.00116","version":1},"attestation_state":"computed","paper":{"title":"A Wait-Free Stack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Pooja Aggarwal, Seep Goel, Smruti R. Sarangi","submitted_at":"2015-10-01T06:14:42Z","abstract_excerpt":"In this paper, we describe a novel algorithm to create a con- current wait-free stack. To the best of our knowledge, this is the first wait-free algorithm for a general purpose stack. In the past, researchers have proposed restricted wait-free implementations of stacks, lock-free implementations, and efficient universal constructions that can support wait-free stacks. The crux of our wait-free implementation is a fast pop operation that does not modify the stack top; instead, it walks down the stack till it finds a node that is unmarked. It marks it but does not delete it. Subsequently, it is "},"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":"1510.00116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-01T06:14:42Z","cross_cats_sorted":[],"title_canon_sha256":"062b1bcb9dc8269b287439c102058343555a1da311545053799a369ee6febe8a","abstract_canon_sha256":"be7d760d279abaa3d88d2943f98a7ae2b3e1677ed91d738cf90c1de57cdfecdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:20.709084Z","signature_b64":"a3xnyAhGuPZUfWCnHDpdErwq5VT0SZ/jk3wzVFH+JKAZdQaJ3G88KQM0qRFuEhsjvjc/3DeMAcgxgSzeiPfEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c09f840e8bfe43559aed845694b105207fa1d05d6d9f209279d2c10a12f2abc","last_reissued_at":"2026-05-18T01:31:20.708463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:20.708463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Wait-Free Stack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Pooja Aggarwal, Seep Goel, Smruti R. Sarangi","submitted_at":"2015-10-01T06:14:42Z","abstract_excerpt":"In this paper, we describe a novel algorithm to create a con- current wait-free stack. To the best of our knowledge, this is the first wait-free algorithm for a general purpose stack. In the past, researchers have proposed restricted wait-free implementations of stacks, lock-free implementations, and efficient universal constructions that can support wait-free stacks. The crux of our wait-free implementation is a fast pop operation that does not modify the stack top; instead, it walks down the stack till it finds a node that is unmarked. It marks it but does not delete it. Subsequently, it is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00116","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":"1510.00116","created_at":"2026-05-18T01:31:20.708576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00116v1","created_at":"2026-05-18T01:31:20.708576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00116","created_at":"2026-05-18T01:31:20.708576+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQE7QQHIX7SD","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQE7QQHIX7SDKWNO","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQE7QQHI","created_at":"2026-05-18T12:29:39.896362+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/RQE7QQHIX7SDKWNO3BCWSSYQKI","json":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI.json","graph_json":"https://pith.science/api/pith-number/RQE7QQHIX7SDKWNO3BCWSSYQKI/graph.json","events_json":"https://pith.science/api/pith-number/RQE7QQHIX7SDKWNO3BCWSSYQKI/events.json","paper":"https://pith.science/paper/RQE7QQHI"},"agent_actions":{"view_html":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI","download_json":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI.json","view_paper":"https://pith.science/paper/RQE7QQHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00116&json=true","fetch_graph":"https://pith.science/api/pith-number/RQE7QQHIX7SDKWNO3BCWSSYQKI/graph.json","fetch_events":"https://pith.science/api/pith-number/RQE7QQHIX7SDKWNO3BCWSSYQKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI/action/storage_attestation","attest_author":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI/action/author_attestation","sign_citation":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI/action/citation_signature","submit_replication":"https://pith.science/pith/RQE7QQHIX7SDKWNO3BCWSSYQKI/action/replication_record"}},"created_at":"2026-05-18T01:31:20.708576+00:00","updated_at":"2026-05-18T01:31:20.708576+00:00"}