{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ATTVKK3XHHBW4IU376D34WU53O","short_pith_number":"pith:ATTVKK3X","canonical_record":{"source":{"id":"1905.10818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2019-05-26T15:38:30Z","cross_cats_sorted":[],"title_canon_sha256":"fad0674e616e2cef0f3b354af15e89aaf6765326d6aeb6f28418f75525b1ee1d","abstract_canon_sha256":"1ebc5812d1c48b83e1d79820f9a155fd09966d3f58b93db50973462b0c0f591b"},"schema_version":"1.0"},"canonical_sha256":"04e7552b7739c36e229bff87be5a9ddb89a51fc9415db3e8201a9f418ef40400","source":{"kind":"arxiv","id":"1905.10818","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10818","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10818v2","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10818","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"ATTVKK3XHHBW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ATTVKK3XHHBW4IU3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ATTVKK3X","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ATTVKK3XHHBW4IU376D34WU53O","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2019-05-26T15:38:30Z","cross_cats_sorted":[],"title_canon_sha256":"fad0674e616e2cef0f3b354af15e89aaf6765326d6aeb6f28418f75525b1ee1d","abstract_canon_sha256":"1ebc5812d1c48b83e1d79820f9a155fd09966d3f58b93db50973462b0c0f591b"},"schema_version":"1.0"},"canonical_sha256":"04e7552b7739c36e229bff87be5a9ddb89a51fc9415db3e8201a9f418ef40400","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:48.797848Z","signature_b64":"SNb+cp7vVmX4wcE4mbdoDt7tUY822I6dAI+iG4FRGzlnPvk4H6dr+GcO1ODJGoHdqP1tLfx6kI358o5nFAfYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04e7552b7739c36e229bff87be5a9ddb89a51fc9415db3e8201a9f418ef40400","last_reissued_at":"2026-05-17T23:40:48.797090Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:48.797090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10818","source_version":2,"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-17T23:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CHCyrqNIrSwguw9y6KjcfOIkKdRXiifHZ7MBl5RBbvO2d856S+UFpa9PJj+NnL59kUqD7o/cFirJieC0lJWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:48:46.846387Z"},"content_sha256":"bece08644bbea742645d372662c3a197e3a786ca09ed9f3bbdac2c92ac36809b","schema_version":"1.0","event_id":"sha256:bece08644bbea742645d372662c3a197e3a786ca09ed9f3bbdac2c92ac36809b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ATTVKK3XHHBW4IU376D34WU53O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Avoiding Scalability Collapse by Restricting Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Alex Kogan, Dave Dice","submitted_at":"2019-05-26T15:38:30Z","abstract_excerpt":"Saturated locks often degrade the performance of a multithreaded application, leading to a so-called scalability collapse problem. This problem arises when a growing number of threads circulating through a saturated lock causes the overall application performance to fade or even drop abruptly. This problem is particularly (but not solely) acute on oversubscribed systems (systems with more threads than available hardware cores). In this paper, we introduce GCR (generic concurrency restriction), a mechanism that aims to avoid the scalability collapse. GCR, designed as a generic, lock-agnostic wr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10818","kind":"arxiv","version":2},"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-17T23:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9RcQiZricjlBvtVfcuaa3WZJ9LdVJiqcBw102v0lqDrFtTcUSJ2cerDv+A7RY0n/LryXvHQ/2pW1Uc52NC+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:48:46.847027Z"},"content_sha256":"dc2dc0e144e463de790542088dc96578c41e7dc058b922c6c12cab12c57df9a5","schema_version":"1.0","event_id":"sha256:dc2dc0e144e463de790542088dc96578c41e7dc058b922c6c12cab12c57df9a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATTVKK3XHHBW4IU376D34WU53O/bundle.json","state_url":"https://pith.science/pith/ATTVKK3XHHBW4IU376D34WU53O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATTVKK3XHHBW4IU376D34WU53O/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-05-28T23:48:46Z","links":{"resolver":"https://pith.science/pith/ATTVKK3XHHBW4IU376D34WU53O","bundle":"https://pith.science/pith/ATTVKK3XHHBW4IU376D34WU53O/bundle.json","state":"https://pith.science/pith/ATTVKK3XHHBW4IU376D34WU53O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATTVKK3XHHBW4IU376D34WU53O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ATTVKK3XHHBW4IU376D34WU53O","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":"1ebc5812d1c48b83e1d79820f9a155fd09966d3f58b93db50973462b0c0f591b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2019-05-26T15:38:30Z","title_canon_sha256":"fad0674e616e2cef0f3b354af15e89aaf6765326d6aeb6f28418f75525b1ee1d"},"schema_version":"1.0","source":{"id":"1905.10818","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10818","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10818v2","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10818","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"ATTVKK3XHHBW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ATTVKK3XHHBW4IU3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ATTVKK3X","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:dc2dc0e144e463de790542088dc96578c41e7dc058b922c6c12cab12c57df9a5","target":"graph","created_at":"2026-05-17T23:40: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"},"paper":{"abstract_excerpt":"Saturated locks often degrade the performance of a multithreaded application, leading to a so-called scalability collapse problem. This problem arises when a growing number of threads circulating through a saturated lock causes the overall application performance to fade or even drop abruptly. This problem is particularly (but not solely) acute on oversubscribed systems (systems with more threads than available hardware cores). In this paper, we introduce GCR (generic concurrency restriction), a mechanism that aims to avoid the scalability collapse. GCR, designed as a generic, lock-agnostic wr","authors_text":"Alex Kogan, Dave Dice","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2019-05-26T15:38:30Z","title":"Avoiding Scalability Collapse by Restricting Concurrency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10818","kind":"arxiv","version":2},"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:bece08644bbea742645d372662c3a197e3a786ca09ed9f3bbdac2c92ac36809b","target":"record","created_at":"2026-05-17T23:40: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":"1ebc5812d1c48b83e1d79820f9a155fd09966d3f58b93db50973462b0c0f591b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2019-05-26T15:38:30Z","title_canon_sha256":"fad0674e616e2cef0f3b354af15e89aaf6765326d6aeb6f28418f75525b1ee1d"},"schema_version":"1.0","source":{"id":"1905.10818","kind":"arxiv","version":2}},"canonical_sha256":"04e7552b7739c36e229bff87be5a9ddb89a51fc9415db3e8201a9f418ef40400","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04e7552b7739c36e229bff87be5a9ddb89a51fc9415db3e8201a9f418ef40400","first_computed_at":"2026-05-17T23:40:48.797090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:48.797090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SNb+cp7vVmX4wcE4mbdoDt7tUY822I6dAI+iG4FRGzlnPvk4H6dr+GcO1ODJGoHdqP1tLfx6kI358o5nFAfYCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:48.797848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10818","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bece08644bbea742645d372662c3a197e3a786ca09ed9f3bbdac2c92ac36809b","sha256:dc2dc0e144e463de790542088dc96578c41e7dc058b922c6c12cab12c57df9a5"],"state_sha256":"1cf2be579b67603d0a7d99b8697530a1719fc262b0c2b22c7ae16503d64b8282"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgGXGfhb0WChCFtkvPkn3KLn1J0V2h+GybzSZBaVikWYoTRa0YH+NyFNvM0ja1FwjMImRGh6vl5TEQKw6sNEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:48:46.850421Z","bundle_sha256":"ecca71a03a2a599ba950dc344ca39c80dd0519d4ea78575b4e9e1e4ac28cfe4f"}}