{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OWIE7ADWSXIZCNZTLRHZMSGR3Q","short_pith_number":"pith:OWIE7ADW","canonical_record":{"source":{"id":"2606.24250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T07:36:40Z","cross_cats_sorted":[],"title_canon_sha256":"747ba896aeb8043d88725645501030a6acdb0b84e177e7d273b904a251bd7ac3","abstract_canon_sha256":"3d713a0878c4fe998d7460d41c8dd619377d58642d5bd82f99d535a85e4828e0"},"schema_version":"1.0"},"canonical_sha256":"75904f807695d19137335c4f9648d1dc226c9fa451b0f9f18ea1771e50f6b14c","source":{"kind":"arxiv","id":"2606.24250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24250","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24250v1","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24250","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"OWIE7ADWSXIZ","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"pith_short_16","alias_value":"OWIE7ADWSXIZCNZT","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"pith_short_8","alias_value":"OWIE7ADW","created_at":"2026-06-24T01:14:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OWIE7ADWSXIZCNZTLRHZMSGR3Q","target":"record","payload":{"canonical_record":{"source":{"id":"2606.24250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T07:36:40Z","cross_cats_sorted":[],"title_canon_sha256":"747ba896aeb8043d88725645501030a6acdb0b84e177e7d273b904a251bd7ac3","abstract_canon_sha256":"3d713a0878c4fe998d7460d41c8dd619377d58642d5bd82f99d535a85e4828e0"},"schema_version":"1.0"},"canonical_sha256":"75904f807695d19137335c4f9648d1dc226c9fa451b0f9f18ea1771e50f6b14c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:48.017868Z","signature_b64":"H4dFnscqVSkroLrle+leSocCbcBmfpISvH3bbdkw/peAsDR59plVdogzzA10FGY5spgUuaHql61QOf5Qg+eVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75904f807695d19137335c4f9648d1dc226c9fa451b0f9f18ea1771e50f6b14c","last_reissued_at":"2026-06-24T01:14:48.017507Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:48.017507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.24250","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-06-24T01:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5NDg6NnHYfRr+eQl3WAL7PrLw5MuMBhIaJ4CvtdyEPQuSBYhs4DyBmA6o+B4DgZwpYJrp4p1kRT8I6KAau4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T01:55:04.840109Z"},"content_sha256":"a3e441163dc40f3dfd2164a162a768d5ba72c51bf9661c293b38ae1181df28ac","schema_version":"1.0","event_id":"sha256:a3e441163dc40f3dfd2164a162a768d5ba72c51bf9661c293b38ae1181df28ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OWIE7ADWSXIZCNZTLRHZMSGR3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Denis Korotchenko, Vitaly Aksenov","submitted_at":"2026-06-23T07:36:40Z","abstract_excerpt":"This paper presents a new lock, SemanticLock, based on the conflict graph between operations. We can consider it a generalization of a read-write lock where conflicts exist between write operations and all other operations. We demonstrate the effectiveness of our lock in two applications. In the first, we design a toy data structure: an array supporting point queries and different range queries. In the second, potentially of greater interest, we augment an existing concurrent data structure, ConcurrentHashMap, with additional long-running operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24250","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.24250/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-24T01:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/b718fBZbafNJemzvUJb+rcxYbAHGwTqLHd6RZ+LWGlt5yhLBfe9hsQH4kV4tnD4/2KQDdxtwDDeLT/wc7zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T01:55:04.840496Z"},"content_sha256":"ca4e6745270d26afb1c16f1ee66eae2939d7c3cdaeb5691c0cf78d5ebab04648","schema_version":"1.0","event_id":"sha256:ca4e6745270d26afb1c16f1ee66eae2939d7c3cdaeb5691c0cf78d5ebab04648"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWIE7ADWSXIZCNZTLRHZMSGR3Q/bundle.json","state_url":"https://pith.science/pith/OWIE7ADWSXIZCNZTLRHZMSGR3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWIE7ADWSXIZCNZTLRHZMSGR3Q/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-28T01:55:04Z","links":{"resolver":"https://pith.science/pith/OWIE7ADWSXIZCNZTLRHZMSGR3Q","bundle":"https://pith.science/pith/OWIE7ADWSXIZCNZTLRHZMSGR3Q/bundle.json","state":"https://pith.science/pith/OWIE7ADWSXIZCNZTLRHZMSGR3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWIE7ADWSXIZCNZTLRHZMSGR3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OWIE7ADWSXIZCNZTLRHZMSGR3Q","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":"3d713a0878c4fe998d7460d41c8dd619377d58642d5bd82f99d535a85e4828e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T07:36:40Z","title_canon_sha256":"747ba896aeb8043d88725645501030a6acdb0b84e177e7d273b904a251bd7ac3"},"schema_version":"1.0","source":{"id":"2606.24250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24250","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24250v1","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24250","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"OWIE7ADWSXIZ","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"pith_short_16","alias_value":"OWIE7ADWSXIZCNZT","created_at":"2026-06-24T01:14:48Z"},{"alias_kind":"pith_short_8","alias_value":"OWIE7ADW","created_at":"2026-06-24T01:14:48Z"}],"graph_snapshots":[{"event_id":"sha256:ca4e6745270d26afb1c16f1ee66eae2939d7c3cdaeb5691c0cf78d5ebab04648","target":"graph","created_at":"2026-06-24T01:14:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.24250/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a new lock, SemanticLock, based on the conflict graph between operations. We can consider it a generalization of a read-write lock where conflicts exist between write operations and all other operations. We demonstrate the effectiveness of our lock in two applications. In the first, we design a toy data structure: an array supporting point queries and different range queries. In the second, potentially of greater interest, we augment an existing concurrent data structure, ConcurrentHashMap, with additional long-running operations.","authors_text":"Denis Korotchenko, Vitaly Aksenov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T07:36:40Z","title":"Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24250","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:a3e441163dc40f3dfd2164a162a768d5ba72c51bf9661c293b38ae1181df28ac","target":"record","created_at":"2026-06-24T01:14:48Z","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":"3d713a0878c4fe998d7460d41c8dd619377d58642d5bd82f99d535a85e4828e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T07:36:40Z","title_canon_sha256":"747ba896aeb8043d88725645501030a6acdb0b84e177e7d273b904a251bd7ac3"},"schema_version":"1.0","source":{"id":"2606.24250","kind":"arxiv","version":1}},"canonical_sha256":"75904f807695d19137335c4f9648d1dc226c9fa451b0f9f18ea1771e50f6b14c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75904f807695d19137335c4f9648d1dc226c9fa451b0f9f18ea1771e50f6b14c","first_computed_at":"2026-06-24T01:14:48.017507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:48.017507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H4dFnscqVSkroLrle+leSocCbcBmfpISvH3bbdkw/peAsDR59plVdogzzA10FGY5spgUuaHql61QOf5Qg+eVCA==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:48.017868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3e441163dc40f3dfd2164a162a768d5ba72c51bf9661c293b38ae1181df28ac","sha256:ca4e6745270d26afb1c16f1ee66eae2939d7c3cdaeb5691c0cf78d5ebab04648"],"state_sha256":"65c906d2d7fd72172c70e7e631951d217aa03c5f3edcdc22f5a364a97dd34cc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQ8XdK4fuZRX0888Vri7q6clTg59nEc6jAChg0rP8VI6+MHKVBYJqGmGuDzVb6/+XDl0cuMKrTIpbY+prekKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T01:55:04.842541Z","bundle_sha256":"1fdc351ca6a0a44ced16af6ca710a7f06b6210f3694c9306f7de4c2e6398fafb"}}