{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UIPNXKIUGNTMJFISEDO7OQVD5H","short_pith_number":"pith:UIPNXKIU","canonical_record":{"source":{"id":"1507.02722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:53:23Z","cross_cats_sorted":[],"title_canon_sha256":"a7325dea72a0498f445c7ff74a48b018186e43ee3410593b11694c8e0f65d62f","abstract_canon_sha256":"c62cb8e740bd9b25f5e3ae0d4a9ab8f76ca2af66ae86dc17b37aaa4c05331605"},"schema_version":"1.0"},"canonical_sha256":"a21edba9143366c4951220ddf742a3e9e5a0587c69dee9ee794ea91144ff0512","source":{"kind":"arxiv","id":"1507.02722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02722","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02722v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02722","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"UIPNXKIUGNTM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UIPNXKIUGNTMJFIS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UIPNXKIU","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UIPNXKIUGNTMJFISEDO7OQVD5H","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:53:23Z","cross_cats_sorted":[],"title_canon_sha256":"a7325dea72a0498f445c7ff74a48b018186e43ee3410593b11694c8e0f65d62f","abstract_canon_sha256":"c62cb8e740bd9b25f5e3ae0d4a9ab8f76ca2af66ae86dc17b37aaa4c05331605"},"schema_version":"1.0"},"canonical_sha256":"a21edba9143366c4951220ddf742a3e9e5a0587c69dee9ee794ea91144ff0512","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.358175Z","signature_b64":"DGyvFePKNsFrhC6cHPBw3b4EgMTVm0t95NT3YjcgyIGluMwBBX3UYRUp+KnX3rGTQZTP9XdTS+yYj5+EimkjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a21edba9143366c4951220ddf742a3e9e5a0587c69dee9ee794ea91144ff0512","last_reissued_at":"2026-05-18T01:37:03.357758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.357758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02722","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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"le5J07CsAz5ldw62dqVZaYwNMvDJrVbpnff493xh9k+fBVBPtLlwW1ClmPV109Wc0P8wMqk0GQCxjeL1zY++BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:35:12.687628Z"},"content_sha256":"bb7019d077746fccd26045fe1f66147900693362f7c92eb992af1392b19f6cd9","schema_version":"1.0","event_id":"sha256:bb7019d077746fccd26045fe1f66147900693362f7c92eb992af1392b19f6cd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UIPNXKIUGNTMJFISEDO7OQVD5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Time and Space Complexity of ABA Prevention and Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Philipp Woelfel, Zahra Aghazadeh","submitted_at":"2015-07-09T21:53:23Z","abstract_excerpt":"We investigate the time and space complexity of detecting and preventing ABAs in shared memory algorithms for systems with n processes and bounded base objects. To that end, we define ABA-detecting registers, which are similar to normal read/write registers, except that they allow a process q to detect with a read operation, whether some process wrote the register since q's last read. ABA-detecting registers can be implemented trivially from a single unbounded register, but we show that they have a high complexity if base objects are bounded: An obstruction-free implementation of an ABA-detect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02722","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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rwZupNrWkj+2oFYEmI2Qho1nDyZW0D3QIj6c88sWFJlPVXys9dsTstxF4XIhS7e0PrLYcQUy1mmQyPtqDaSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:35:12.687970Z"},"content_sha256":"ae63d781460d6100109c22f60ec008d13e3b60ff7a7454c125585fc3f58abe53","schema_version":"1.0","event_id":"sha256:ae63d781460d6100109c22f60ec008d13e3b60ff7a7454c125585fc3f58abe53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIPNXKIUGNTMJFISEDO7OQVD5H/bundle.json","state_url":"https://pith.science/pith/UIPNXKIUGNTMJFISEDO7OQVD5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIPNXKIUGNTMJFISEDO7OQVD5H/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-26T20:35:12Z","links":{"resolver":"https://pith.science/pith/UIPNXKIUGNTMJFISEDO7OQVD5H","bundle":"https://pith.science/pith/UIPNXKIUGNTMJFISEDO7OQVD5H/bundle.json","state":"https://pith.science/pith/UIPNXKIUGNTMJFISEDO7OQVD5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIPNXKIUGNTMJFISEDO7OQVD5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UIPNXKIUGNTMJFISEDO7OQVD5H","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":"c62cb8e740bd9b25f5e3ae0d4a9ab8f76ca2af66ae86dc17b37aaa4c05331605","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:53:23Z","title_canon_sha256":"a7325dea72a0498f445c7ff74a48b018186e43ee3410593b11694c8e0f65d62f"},"schema_version":"1.0","source":{"id":"1507.02722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02722","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02722v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02722","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"UIPNXKIUGNTM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UIPNXKIUGNTMJFIS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UIPNXKIU","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:ae63d781460d6100109c22f60ec008d13e3b60ff7a7454c125585fc3f58abe53","target":"graph","created_at":"2026-05-18T01:37:03Z","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":"We investigate the time and space complexity of detecting and preventing ABAs in shared memory algorithms for systems with n processes and bounded base objects. To that end, we define ABA-detecting registers, which are similar to normal read/write registers, except that they allow a process q to detect with a read operation, whether some process wrote the register since q's last read. ABA-detecting registers can be implemented trivially from a single unbounded register, but we show that they have a high complexity if base objects are bounded: An obstruction-free implementation of an ABA-detect","authors_text":"Philipp Woelfel, Zahra Aghazadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:53:23Z","title":"On the Time and Space Complexity of ABA Prevention and Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02722","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:bb7019d077746fccd26045fe1f66147900693362f7c92eb992af1392b19f6cd9","target":"record","created_at":"2026-05-18T01:37:03Z","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":"c62cb8e740bd9b25f5e3ae0d4a9ab8f76ca2af66ae86dc17b37aaa4c05331605","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-09T21:53:23Z","title_canon_sha256":"a7325dea72a0498f445c7ff74a48b018186e43ee3410593b11694c8e0f65d62f"},"schema_version":"1.0","source":{"id":"1507.02722","kind":"arxiv","version":1}},"canonical_sha256":"a21edba9143366c4951220ddf742a3e9e5a0587c69dee9ee794ea91144ff0512","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a21edba9143366c4951220ddf742a3e9e5a0587c69dee9ee794ea91144ff0512","first_computed_at":"2026-05-18T01:37:03.357758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:03.357758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DGyvFePKNsFrhC6cHPBw3b4EgMTVm0t95NT3YjcgyIGluMwBBX3UYRUp+KnX3rGTQZTP9XdTS+yYj5+EimkjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:03.358175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb7019d077746fccd26045fe1f66147900693362f7c92eb992af1392b19f6cd9","sha256:ae63d781460d6100109c22f60ec008d13e3b60ff7a7454c125585fc3f58abe53"],"state_sha256":"199eb412f76f711f2da9932fd555bb334512c9bdb1b684bb0fa150f8d8a4c35f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwnRooO0EJXi6a3P3HyXaoZN/CyN2mTJVPFbPkT5DBkw8rvPBxmHeTRjrKIypu6aQYMhusWiTCUL6PdFVLfYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:35:12.689931Z","bundle_sha256":"ccf526c0629ba599a3dc5ac186493d475dc1a75ae9689288a3aff419986d313b"}}