{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EG2EWOQC7TURTANN4SF3NEPCF7","short_pith_number":"pith:EG2EWOQC","schema_version":"1.0","canonical_sha256":"21b44b3a02fce91981ade48bb691e22feff80586a28fa34bb664d7acdb47f784","source":{"kind":"arxiv","id":"1806.00834","version":2},"attestation_state":"computed","paper":{"title":"Garbage Collection in Concurrent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jonathan Marbaniang, Sathya Peri, Shekhar Bhandakkar","submitted_at":"2018-06-03T17:00:12Z","abstract_excerpt":"Garbage Collection in concurrent data structures, especially lock-free ones, pose multiple design and consistency challenges. In this instance, we consider the case of concurrent sets. A set is a collection of elements, where the elements are ordered and distinct. These two invariants are always maintained at every point in time. Currently, multiple implementations of concurrent sets already exist. LazyList, Hand-over-hand List and Harris List are some of the well-known implementations. However none of these implementations employ, or are concerned with garbage collection of deleted nodes. Ins"},"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":"1806.00834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T17:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"5d513fd600d3f92ff5d12b5a30cf3913885bbdaf430f42080aff2f7a1dadee55","abstract_canon_sha256":"0735ad8af676a8b2f0e5249fd0bcd4b667325576367520b5c68de5e9a4aeb0e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:10.102997Z","signature_b64":"HdfM7MMOQQQq4odKIK4Sespt03bxRaVRkpY/zYBEi9AbigSOieNn/6PKvwSnGU2lUKTZZLIfvLOgwFvyp9jDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b44b3a02fce91981ade48bb691e22feff80586a28fa34bb664d7acdb47f784","last_reissued_at":"2026-05-18T00:10:10.102473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:10.102473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Garbage Collection in Concurrent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jonathan Marbaniang, Sathya Peri, Shekhar Bhandakkar","submitted_at":"2018-06-03T17:00:12Z","abstract_excerpt":"Garbage Collection in concurrent data structures, especially lock-free ones, pose multiple design and consistency challenges. In this instance, we consider the case of concurrent sets. A set is a collection of elements, where the elements are ordered and distinct. These two invariants are always maintained at every point in time. Currently, multiple implementations of concurrent sets already exist. LazyList, Hand-over-hand List and Harris List are some of the well-known implementations. However none of these implementations employ, or are concerned with garbage collection of deleted nodes. Ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00834","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":""},"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":"1806.00834","created_at":"2026-05-18T00:10:10.102552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00834v2","created_at":"2026-05-18T00:10:10.102552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00834","created_at":"2026-05-18T00:10:10.102552+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG2EWOQC7TUR","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG2EWOQC7TURTANN","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG2EWOQC","created_at":"2026-05-18T12:32:22.470017+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/EG2EWOQC7TURTANN4SF3NEPCF7","json":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7.json","graph_json":"https://pith.science/api/pith-number/EG2EWOQC7TURTANN4SF3NEPCF7/graph.json","events_json":"https://pith.science/api/pith-number/EG2EWOQC7TURTANN4SF3NEPCF7/events.json","paper":"https://pith.science/paper/EG2EWOQC"},"agent_actions":{"view_html":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7","download_json":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7.json","view_paper":"https://pith.science/paper/EG2EWOQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00834&json=true","fetch_graph":"https://pith.science/api/pith-number/EG2EWOQC7TURTANN4SF3NEPCF7/graph.json","fetch_events":"https://pith.science/api/pith-number/EG2EWOQC7TURTANN4SF3NEPCF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7/action/storage_attestation","attest_author":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7/action/author_attestation","sign_citation":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7/action/citation_signature","submit_replication":"https://pith.science/pith/EG2EWOQC7TURTANN4SF3NEPCF7/action/replication_record"}},"created_at":"2026-05-18T00:10:10.102552+00:00","updated_at":"2026-05-18T00:10:10.102552+00:00"}