{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ERTWDQTPEVXKSIC4JLFWVQNREN","short_pith_number":"pith:ERTWDQTP","canonical_record":{"source":{"id":"1708.01797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-05T18:04:26Z","cross_cats_sorted":[],"title_canon_sha256":"7a782baed51fc6ab4f1440ae76ace1d5d2aa848a1832b7cac56b2bedddd3ef86","abstract_canon_sha256":"83613c1fa900f8b0a5c377b116947d211d45cc177c2624411ef8f9ffc9c3d9e3"},"schema_version":"1.0"},"canonical_sha256":"246761c26f256ea9205c4acb6ac1b12340d91c7b695929dbac4894cc789795e2","source":{"kind":"arxiv","id":"1708.01797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01797","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01797v1","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01797","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"pith_short_12","alias_value":"ERTWDQTPEVXK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ERTWDQTPEVXKSIC4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ERTWDQTP","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ERTWDQTPEVXKSIC4JLFWVQNREN","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-05T18:04:26Z","cross_cats_sorted":[],"title_canon_sha256":"7a782baed51fc6ab4f1440ae76ace1d5d2aa848a1832b7cac56b2bedddd3ef86","abstract_canon_sha256":"83613c1fa900f8b0a5c377b116947d211d45cc177c2624411ef8f9ffc9c3d9e3"},"schema_version":"1.0"},"canonical_sha256":"246761c26f256ea9205c4acb6ac1b12340d91c7b695929dbac4894cc789795e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:33.117912Z","signature_b64":"KrWqj2CuozfzWB0c2Mu6BqF8rclsT3IXoVufM61VAC4M2Q+PWRnUp+TSzA2ex8jdEG5VEWKaUGjeMZ6IhmRPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"246761c26f256ea9205c4acb6ac1b12340d91c7b695929dbac4894cc789795e2","last_reissued_at":"2026-05-18T00:38:33.117215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:33.117215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01797","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/OnQ0UweTtepyvJW2YZKfb/5vWgkDNbiniQD5Uufh1czWZEi7YV8EWaJJhelAzImhxZf26H5JF7iyjCEIohCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:05:57.993829Z"},"content_sha256":"cb13e51e5c6be66338fd59a2ecac50feee329b63d4239c52cee3b7fb10166f08","schema_version":"1.0","event_id":"sha256:cb13e51e5c6be66338fd59a2ecac50feee329b63d4239c52cee3b7fb10166f08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ERTWDQTPEVXKSIC4JLFWVQNREN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Maya Arbel-Raviv, Trevor Brown","submitted_at":"2017-08-05T18:04:26Z","abstract_excerpt":"In many lock-free algorithms, threads help one another, and each operation creates a descriptor that describes how other threads should help it. Allocating and reclaiming descriptors introduces significant space and time overhead. We introduce the first descriptor abstract data type (ADT), which captures the usage of descriptors by lock-free algorithms. We then develop a weak descriptor ADT which has weaker semantics, but can be implemented significantly more efficiently. We show how a large class of lock-free algorithms can be transformed to use weak descriptors, and demonstrate our technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01797","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjD2H4kcw+WJ3leSG4O+76/jdEzswXcX2CZil/4VW9mkBY/X592OutjSG+Nf1ftjvNikNcSXChfGz2kvR/s8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:05:57.994451Z"},"content_sha256":"3704c7c2d75a1527833f7f8143cfc493e36e0cbe19f1ffcff94c70a8d3b3b4c6","schema_version":"1.0","event_id":"sha256:3704c7c2d75a1527833f7f8143cfc493e36e0cbe19f1ffcff94c70a8d3b3b4c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERTWDQTPEVXKSIC4JLFWVQNREN/bundle.json","state_url":"https://pith.science/pith/ERTWDQTPEVXKSIC4JLFWVQNREN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERTWDQTPEVXKSIC4JLFWVQNREN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T23:05:57Z","links":{"resolver":"https://pith.science/pith/ERTWDQTPEVXKSIC4JLFWVQNREN","bundle":"https://pith.science/pith/ERTWDQTPEVXKSIC4JLFWVQNREN/bundle.json","state":"https://pith.science/pith/ERTWDQTPEVXKSIC4JLFWVQNREN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERTWDQTPEVXKSIC4JLFWVQNREN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ERTWDQTPEVXKSIC4JLFWVQNREN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"83613c1fa900f8b0a5c377b116947d211d45cc177c2624411ef8f9ffc9c3d9e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-05T18:04:26Z","title_canon_sha256":"7a782baed51fc6ab4f1440ae76ace1d5d2aa848a1832b7cac56b2bedddd3ef86"},"schema_version":"1.0","source":{"id":"1708.01797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01797","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01797v1","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01797","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"pith_short_12","alias_value":"ERTWDQTPEVXK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ERTWDQTPEVXKSIC4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ERTWDQTP","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:3704c7c2d75a1527833f7f8143cfc493e36e0cbe19f1ffcff94c70a8d3b3b4c6","target":"graph","created_at":"2026-05-18T00:38:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In many lock-free algorithms, threads help one another, and each operation creates a descriptor that describes how other threads should help it. Allocating and reclaiming descriptors introduces significant space and time overhead. We introduce the first descriptor abstract data type (ADT), which captures the usage of descriptors by lock-free algorithms. We then develop a weak descriptor ADT which has weaker semantics, but can be implemented significantly more efficiently. We show how a large class of lock-free algorithms can be transformed to use weak descriptors, and demonstrate our technique","authors_text":"Maya Arbel-Raviv, Trevor Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-05T18:04:26Z","title":"Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01797","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cb13e51e5c6be66338fd59a2ecac50feee329b63d4239c52cee3b7fb10166f08","target":"record","created_at":"2026-05-18T00:38:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"83613c1fa900f8b0a5c377b116947d211d45cc177c2624411ef8f9ffc9c3d9e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-05T18:04:26Z","title_canon_sha256":"7a782baed51fc6ab4f1440ae76ace1d5d2aa848a1832b7cac56b2bedddd3ef86"},"schema_version":"1.0","source":{"id":"1708.01797","kind":"arxiv","version":1}},"canonical_sha256":"246761c26f256ea9205c4acb6ac1b12340d91c7b695929dbac4894cc789795e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"246761c26f256ea9205c4acb6ac1b12340d91c7b695929dbac4894cc789795e2","first_computed_at":"2026-05-18T00:38:33.117215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:33.117215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KrWqj2CuozfzWB0c2Mu6BqF8rclsT3IXoVufM61VAC4M2Q+PWRnUp+TSzA2ex8jdEG5VEWKaUGjeMZ6IhmRPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:33.117912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb13e51e5c6be66338fd59a2ecac50feee329b63d4239c52cee3b7fb10166f08","sha256:3704c7c2d75a1527833f7f8143cfc493e36e0cbe19f1ffcff94c70a8d3b3b4c6"],"state_sha256":"d4323781bad574c23f38ff46363c41c4ead3d4dc67866e15fd740d6accdfa048"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOVg9Xuvl5pnFyg+9VCBKqcKi+X78+kK+0aEaDONXU7DAWfsk21XUaqdFyQ0c7gepkUKT6v1NAaf3ZUgko4fDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:05:57.997630Z","bundle_sha256":"1806efc200024a765efd72d9d5e2e2785e4b3ba98f324e3ab735c2f2ed8ce0dc"}}