{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:33TKWAOMYZ2WXU75T54DYKIZKN","short_pith_number":"pith:33TKWAOM","schema_version":"1.0","canonical_sha256":"dee6ab01ccc6756bd3fd9f783c29195371646aef700b47c15f0753e7caa942d7","source":{"kind":"arxiv","id":"1106.6304","version":1},"attestation_state":"computed","paper":{"title":"A Dynamic Elimination-Combining Stack Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adi Suissa, Danny Hendler, Gal Bar-Nissan","submitted_at":"2011-06-30T17:12:14Z","abstract_excerpt":"Two key synchronization paradigms for the construction of scalable concurrent data-structures are software combining and elimination. Elimination-based concurrent data-structures allow operations with reverse semantics (such as push and pop stack operations) to \"collide\" and exchange values without having to access a central location. Software combining, on the other hand, is effective when colliding operations have identical semantics: when a pair of threads performing operations with identical semantics collide, the task of performing the combined set of operations is delegated to one of the"},"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":"1106.6304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-06-30T17:12:14Z","cross_cats_sorted":[],"title_canon_sha256":"24440ba4658d0ebd9dad8c5a4ed122b4dabbc048a0e7edd38ec3d0d9d60900e4","abstract_canon_sha256":"1f3b743cc1b5e26ed44f8b99c21db0e0ff332a90c650a7846cf70e611ea2d34b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:03.584901Z","signature_b64":"jYqsIsalAtDlKwTXh3NGmf0avhHYL+2GKxw68jlfO/niLdqBI3Pu7OI2kpToVSfDFLeJNBCaeT/JybrSPG2xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee6ab01ccc6756bd3fd9f783c29195371646aef700b47c15f0753e7caa942d7","last_reissued_at":"2026-05-18T04:19:03.584253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:03.584253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamic Elimination-Combining Stack Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adi Suissa, Danny Hendler, Gal Bar-Nissan","submitted_at":"2011-06-30T17:12:14Z","abstract_excerpt":"Two key synchronization paradigms for the construction of scalable concurrent data-structures are software combining and elimination. Elimination-based concurrent data-structures allow operations with reverse semantics (such as push and pop stack operations) to \"collide\" and exchange values without having to access a central location. Software combining, on the other hand, is effective when colliding operations have identical semantics: when a pair of threads performing operations with identical semantics collide, the task of performing the combined set of operations is delegated to one of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6304","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":"1106.6304","created_at":"2026-05-18T04:19:03.584353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.6304v1","created_at":"2026-05-18T04:19:03.584353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6304","created_at":"2026-05-18T04:19:03.584353+00:00"},{"alias_kind":"pith_short_12","alias_value":"33TKWAOMYZ2W","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"33TKWAOMYZ2WXU75","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"33TKWAOM","created_at":"2026-05-18T12:26:18.847500+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/33TKWAOMYZ2WXU75T54DYKIZKN","json":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN.json","graph_json":"https://pith.science/api/pith-number/33TKWAOMYZ2WXU75T54DYKIZKN/graph.json","events_json":"https://pith.science/api/pith-number/33TKWAOMYZ2WXU75T54DYKIZKN/events.json","paper":"https://pith.science/paper/33TKWAOM"},"agent_actions":{"view_html":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN","download_json":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN.json","view_paper":"https://pith.science/paper/33TKWAOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.6304&json=true","fetch_graph":"https://pith.science/api/pith-number/33TKWAOMYZ2WXU75T54DYKIZKN/graph.json","fetch_events":"https://pith.science/api/pith-number/33TKWAOMYZ2WXU75T54DYKIZKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN/action/storage_attestation","attest_author":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN/action/author_attestation","sign_citation":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN/action/citation_signature","submit_replication":"https://pith.science/pith/33TKWAOMYZ2WXU75T54DYKIZKN/action/replication_record"}},"created_at":"2026-05-18T04:19:03.584353+00:00","updated_at":"2026-05-18T04:19:03.584353+00:00"}