{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NOJXS2HN53YEIKBXN7ZVPCEXBE","short_pith_number":"pith:NOJXS2HN","canonical_record":{"source":{"id":"1611.05793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T17:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"8a3a4ee8ad8df01f55de2a1a180e47bf2fcf30406d4bbfcf13ac5ac40cdfc02c","abstract_canon_sha256":"0d18803c8b1815ed4c5ed2a083990a22d94ed1dba63477e85a663610c729358e"},"schema_version":"1.0"},"canonical_sha256":"6b937968edeef04428376ff35788970913c40641c461c4f6714cba0132dd44da","source":{"kind":"arxiv","id":"1611.05793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05793","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05793v1","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05793","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"NOJXS2HN53YE","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NOJXS2HN53YEIKBX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NOJXS2HN","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NOJXS2HN53YEIKBXN7ZVPCEXBE","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T17:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"8a3a4ee8ad8df01f55de2a1a180e47bf2fcf30406d4bbfcf13ac5ac40cdfc02c","abstract_canon_sha256":"0d18803c8b1815ed4c5ed2a083990a22d94ed1dba63477e85a663610c729358e"},"schema_version":"1.0"},"canonical_sha256":"6b937968edeef04428376ff35788970913c40641c461c4f6714cba0132dd44da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:02.555393Z","signature_b64":"ZhmcbZoBc86fCVT2XRckOA7u3ozTvplUQvZ+dRsqU2/moIQiMFDT3knoz9hb63qpiqWNWQv2chvtXpbD+185BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b937968edeef04428376ff35788970913c40641c461c4f6714cba0132dd44da","last_reissued_at":"2026-05-18T00:58:02.554888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:02.554888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05793","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:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tZiFn1VZgtOWaE21VtZUZ0Ux32DlZ12fIsXkGrDzz8GWeh6Dc9GG59DmnTIve0tajszVDcKrQ9sBpocyIM3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:31:06.483551Z"},"content_sha256":"12ed4dce74bf5f96284f3def5e473b1e44bb147012c3837841955d1d2b348d13","schema_version":"1.0","event_id":"sha256:12ed4dce74bf5f96284f3def5e473b1e44bb147012c3837841955d1d2b348d13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NOJXS2HN53YEIKBXN7ZVPCEXBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aras Atalar, Paul Renaud-Goud, Philippas Tsigas","submitted_at":"2016-11-17T17:25:42Z","abstract_excerpt":"In this paper we present two analytical frameworks for calculating the performance of lock-free data structures. Lock-free data structures are based on retry loops and are called by application-specific routines. In contrast to previous work, we consider in this paper lock-free data structures in dynamic environments. The size of each of the retry loops, and the size of the application routines invoked in between, are not constant but may change dynamically. The new frameworks follow two different approaches. The first framework, the simplest one, is based on queuing theory. It introduces an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05793","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:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqytCuin8fkeX0HR6rFIRsw262/JUhmJFuzI46/bmOrA6jYlQRdif9aXylMPLJSfDRj1FV/s+96rMOtM993HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:31:06.483908Z"},"content_sha256":"654cd84a7bfec955ff578f82ebfbe6f93f4585118b29d12389081797a0c8e418","schema_version":"1.0","event_id":"sha256:654cd84a7bfec955ff578f82ebfbe6f93f4585118b29d12389081797a0c8e418"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOJXS2HN53YEIKBXN7ZVPCEXBE/bundle.json","state_url":"https://pith.science/pith/NOJXS2HN53YEIKBXN7ZVPCEXBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOJXS2HN53YEIKBXN7ZVPCEXBE/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-11T13:31:06Z","links":{"resolver":"https://pith.science/pith/NOJXS2HN53YEIKBXN7ZVPCEXBE","bundle":"https://pith.science/pith/NOJXS2HN53YEIKBXN7ZVPCEXBE/bundle.json","state":"https://pith.science/pith/NOJXS2HN53YEIKBXN7ZVPCEXBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOJXS2HN53YEIKBXN7ZVPCEXBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NOJXS2HN53YEIKBXN7ZVPCEXBE","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":"0d18803c8b1815ed4c5ed2a083990a22d94ed1dba63477e85a663610c729358e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T17:25:42Z","title_canon_sha256":"8a3a4ee8ad8df01f55de2a1a180e47bf2fcf30406d4bbfcf13ac5ac40cdfc02c"},"schema_version":"1.0","source":{"id":"1611.05793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05793","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05793v1","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05793","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"NOJXS2HN53YE","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NOJXS2HN53YEIKBX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NOJXS2HN","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:654cd84a7bfec955ff578f82ebfbe6f93f4585118b29d12389081797a0c8e418","target":"graph","created_at":"2026-05-18T00:58:02Z","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 this paper we present two analytical frameworks for calculating the performance of lock-free data structures. Lock-free data structures are based on retry loops and are called by application-specific routines. In contrast to previous work, we consider in this paper lock-free data structures in dynamic environments. The size of each of the retry loops, and the size of the application routines invoked in between, are not constant but may change dynamically. The new frameworks follow two different approaches. The first framework, the simplest one, is based on queuing theory. It introduces an a","authors_text":"Aras Atalar, Paul Renaud-Goud, Philippas Tsigas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T17:25:42Z","title":"How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05793","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:12ed4dce74bf5f96284f3def5e473b1e44bb147012c3837841955d1d2b348d13","target":"record","created_at":"2026-05-18T00:58:02Z","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":"0d18803c8b1815ed4c5ed2a083990a22d94ed1dba63477e85a663610c729358e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T17:25:42Z","title_canon_sha256":"8a3a4ee8ad8df01f55de2a1a180e47bf2fcf30406d4bbfcf13ac5ac40cdfc02c"},"schema_version":"1.0","source":{"id":"1611.05793","kind":"arxiv","version":1}},"canonical_sha256":"6b937968edeef04428376ff35788970913c40641c461c4f6714cba0132dd44da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b937968edeef04428376ff35788970913c40641c461c4f6714cba0132dd44da","first_computed_at":"2026-05-18T00:58:02.554888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:02.554888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZhmcbZoBc86fCVT2XRckOA7u3ozTvplUQvZ+dRsqU2/moIQiMFDT3knoz9hb63qpiqWNWQv2chvtXpbD+185BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:02.555393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ed4dce74bf5f96284f3def5e473b1e44bb147012c3837841955d1d2b348d13","sha256:654cd84a7bfec955ff578f82ebfbe6f93f4585118b29d12389081797a0c8e418"],"state_sha256":"b70fb893db3b7ab7e9d70d813e1f4b0a88cf19ec4cba8061ed85430252ac3776"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLjZy8O6Wb7Y2txtGnh3oeiCdkTcOt+A87i8+ET6ec52368dAclN+Vfc7Z7MELgLfb+OWfCh3A73Cb+i6xZRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:31:06.485909Z","bundle_sha256":"6303959785dc08b5d122fa91e7c6664a0e50653b534990b2ab23d6b269d58db0"}}