{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6BGYOWL3GCA3Y7JEZPIVVOOSFO","short_pith_number":"pith:6BGYOWL3","canonical_record":{"source":{"id":"2110.05545","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-10-11T18:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"7388fce5f1876adea43a2789d22bf26e60a596737a401ee3e50974e247383a8b","abstract_canon_sha256":"3dc20c4d330cfdecc7bb4fa1222749ac13ae395effb8e88acabbd35e898e9659"},"schema_version":"1.0"},"canonical_sha256":"f04d87597b3081bc7d24cbd15ab9d22bb3ca44f63a7612a00920f42dd976d454","source":{"kind":"arxiv","id":"2110.05545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.05545","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2110.05545v1","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05545","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"6BGYOWL3GCA3","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"6BGYOWL3GCA3Y7JE","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"6BGYOWL3","created_at":"2026-07-05T03:22:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6BGYOWL3GCA3Y7JEZPIVVOOSFO","target":"record","payload":{"canonical_record":{"source":{"id":"2110.05545","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-10-11T18:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"7388fce5f1876adea43a2789d22bf26e60a596737a401ee3e50974e247383a8b","abstract_canon_sha256":"3dc20c4d330cfdecc7bb4fa1222749ac13ae395effb8e88acabbd35e898e9659"},"schema_version":"1.0"},"canonical_sha256":"f04d87597b3081bc7d24cbd15ab9d22bb3ca44f63a7612a00920f42dd976d454","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:03.963444Z","signature_b64":"qyqkoJUiDpTgyT3CVmX7AeGiM6VtgE6NG+5A3ivjbnHFwqtTKRpw07OtRl5ky4OKFFohaBsbl50dJurnIz6ICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f04d87597b3081bc7d24cbd15ab9d22bb3ca44f63a7612a00920f42dd976d454","last_reissued_at":"2026-07-05T03:22:03.962956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:03.962956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.05545","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-07-05T03:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rf9v/RnmlcIGVcgPtI4tKyfkITTPMuBZTcFZnKuYXEFPuys1n3NoM4z9Xj/hU9/UjPrppjDTk3NLXFTocDaJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:01:19.043759Z"},"content_sha256":"b49ba2032f8d0419a66d7ecdb92147e2f7ac5c6aeb6bdcea61dfc0f50d425e64","schema_version":"1.0","event_id":"sha256:b49ba2032f8d0419a66d7ecdb92147e2f7ac5c6aeb6bdcea61dfc0f50d425e64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6BGYOWL3GCA3Y7JEZPIVVOOSFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Peformance Prediction for Coarse-Grained Locking: MCS Case","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniil Bolotov, Petr Kuznetsov, Vitaly Aksenov","submitted_at":"2021-10-11T18:29:59Z","abstract_excerpt":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. It was already shown that simple stochastic analysis can predict the throughput of coarse-grained lock-based algorithms using CLH lock. In this short paper, we extend this analysis to algorithms based on the popular MCS lock."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05545","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/2110.05545/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-07-05T03:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vu/hhsW/fPeL9SC+nQXqZ6SFid+PiHCMAhRuBYYKr3oRvWG3K6kzxFhOvRh/HfvJFEG0cZVjosb7P0/SSUgICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:01:19.044371Z"},"content_sha256":"3b72cbb9c143f0a9e6a6f2b430866143050f05fc0c0a416494f2b18ccf7f235c","schema_version":"1.0","event_id":"sha256:3b72cbb9c143f0a9e6a6f2b430866143050f05fc0c0a416494f2b18ccf7f235c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BGYOWL3GCA3Y7JEZPIVVOOSFO/bundle.json","state_url":"https://pith.science/pith/6BGYOWL3GCA3Y7JEZPIVVOOSFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BGYOWL3GCA3Y7JEZPIVVOOSFO/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-08-11T18:01:19Z","links":{"resolver":"https://pith.science/pith/6BGYOWL3GCA3Y7JEZPIVVOOSFO","bundle":"https://pith.science/pith/6BGYOWL3GCA3Y7JEZPIVVOOSFO/bundle.json","state":"https://pith.science/pith/6BGYOWL3GCA3Y7JEZPIVVOOSFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BGYOWL3GCA3Y7JEZPIVVOOSFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6BGYOWL3GCA3Y7JEZPIVVOOSFO","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":"3dc20c4d330cfdecc7bb4fa1222749ac13ae395effb8e88acabbd35e898e9659","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-10-11T18:29:59Z","title_canon_sha256":"7388fce5f1876adea43a2789d22bf26e60a596737a401ee3e50974e247383a8b"},"schema_version":"1.0","source":{"id":"2110.05545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.05545","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2110.05545v1","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05545","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"6BGYOWL3GCA3","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"6BGYOWL3GCA3Y7JE","created_at":"2026-07-05T03:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"6BGYOWL3","created_at":"2026-07-05T03:22:03Z"}],"graph_snapshots":[{"event_id":"sha256:3b72cbb9c143f0a9e6a6f2b430866143050f05fc0c0a416494f2b18ccf7f235c","target":"graph","created_at":"2026-07-05T03:22: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.05545/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. It was already shown that simple stochastic analysis can predict the throughput of coarse-grained lock-based algorithms using CLH lock. In this short paper, we extend this analysis to algorithms based on the popular MCS lock.","authors_text":"Daniil Bolotov, Petr Kuznetsov, Vitaly Aksenov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-10-11T18:29:59Z","title":"Peformance Prediction for Coarse-Grained Locking: MCS Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05545","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:b49ba2032f8d0419a66d7ecdb92147e2f7ac5c6aeb6bdcea61dfc0f50d425e64","target":"record","created_at":"2026-07-05T03:22: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":"3dc20c4d330cfdecc7bb4fa1222749ac13ae395effb8e88acabbd35e898e9659","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-10-11T18:29:59Z","title_canon_sha256":"7388fce5f1876adea43a2789d22bf26e60a596737a401ee3e50974e247383a8b"},"schema_version":"1.0","source":{"id":"2110.05545","kind":"arxiv","version":1}},"canonical_sha256":"f04d87597b3081bc7d24cbd15ab9d22bb3ca44f63a7612a00920f42dd976d454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f04d87597b3081bc7d24cbd15ab9d22bb3ca44f63a7612a00920f42dd976d454","first_computed_at":"2026-07-05T03:22:03.962956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:22:03.962956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qyqkoJUiDpTgyT3CVmX7AeGiM6VtgE6NG+5A3ivjbnHFwqtTKRpw07OtRl5ky4OKFFohaBsbl50dJurnIz6ICQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:22:03.963444Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.05545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b49ba2032f8d0419a66d7ecdb92147e2f7ac5c6aeb6bdcea61dfc0f50d425e64","sha256:3b72cbb9c143f0a9e6a6f2b430866143050f05fc0c0a416494f2b18ccf7f235c"],"state_sha256":"26558391ee7fafa48d6ad1499ac0de3f9bd28ef263f25954f68fab8d11d0253f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuAlb/NJAQl96VGejzrnO480H0m8rmFT+31rDMEH66SOJP8Z1PDbO9fEYn2Ziw0DD0vbz8qP//ti31VTLRwjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:01:19.050821Z","bundle_sha256":"49e150f49189e3435852244b7a731227f544b68fd52a7a075597698066b78384"}}