{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EXN45MZANC4K3SFAHRGFE2PXR2","short_pith_number":"pith:EXN45MZA","canonical_record":{"source":{"id":"1402.4043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-02-17T15:58:49Z","cross_cats_sorted":[],"title_canon_sha256":"75d70f1b452754223b1d28740a04247bcefc92cd146f19582f9d99e68baae012","abstract_canon_sha256":"0ed18497da90649419af4f201c0ffd30938fa6b8a47a5d05e6c5e6034d4d779b"},"schema_version":"1.0"},"canonical_sha256":"25dbceb32068b8adc8a03c4c5269f78e8ee500fbe0b0e7fb25bcef6d2c58ad12","source":{"kind":"arxiv","id":"1402.4043","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4043","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4043v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4043","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"EXN45MZANC4K","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXN45MZANC4K3SFA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXN45MZA","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EXN45MZANC4K3SFAHRGFE2PXR2","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-02-17T15:58:49Z","cross_cats_sorted":[],"title_canon_sha256":"75d70f1b452754223b1d28740a04247bcefc92cd146f19582f9d99e68baae012","abstract_canon_sha256":"0ed18497da90649419af4f201c0ffd30938fa6b8a47a5d05e6c5e6034d4d779b"},"schema_version":"1.0"},"canonical_sha256":"25dbceb32068b8adc8a03c4c5269f78e8ee500fbe0b0e7fb25bcef6d2c58ad12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.242544Z","signature_b64":"NhQ78AY+PlEbcHqloDCplS9pguA9TOTzAdMuSrDC6oZt3yqU6DjDX0v7VMXVnQCmotmHzZntTUXBz8bkpCiZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25dbceb32068b8adc8a03c4c5269f78e8ee500fbe0b0e7fb25bcef6d2c58ad12","last_reissued_at":"2026-05-18T02:53:07.241862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.241862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4043","source_version":3,"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VAOpy6ggfJehOU5fkCFTzTj7XaGZiaIWA34jWJMKv1D93Rhn7fyf94SGKFWW3TSkWpfzJGWSS4aJHbJ9ZbMGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:48:36.178159Z"},"content_sha256":"4771aec8aa656e8778767bc6083b806fb4349e2f051e38fe89663c75d8bfb5bf","schema_version":"1.0","event_id":"sha256:4771aec8aa656e8778767bc6083b806fb4349e2f051e38fe89663c75d8bfb5bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EXN45MZANC4K3SFAHRGFE2PXR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"James Riely, Radha Jagadeesan","submitted_at":"2014-02-17T15:58:49Z","abstract_excerpt":"Linearizability is the de facto correctness criterion for concurrent data structures. Unfortunately, linearizability imposes a performance penalty which scales linearly in the number of contending threads. Quiescent consistency is an alternative criterion which guarantees that a concurrent data structure behaves correctly when accessed sequentially. Yet quiescent consistency says very little about executions that have any contention.\n  We define quantitative quiescent consistency (QQC), a relaxation of linearizability where the degree of relaxation is proportional to the degree of contention. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4043","kind":"arxiv","version":3},"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFIr1ckLqIJO+PqGQ+P7vwyacsNoSpFygPYsydRscZXe740FdaI1bjnGt2GZTW8kFhwj78kl0c91AAgsu0kkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T12:48:36.178518Z"},"content_sha256":"721daa5599eefcfdce3fcc017ab4abee9775fcd8113db153282b2c58039175e8","schema_version":"1.0","event_id":"sha256:721daa5599eefcfdce3fcc017ab4abee9775fcd8113db153282b2c58039175e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXN45MZANC4K3SFAHRGFE2PXR2/bundle.json","state_url":"https://pith.science/pith/EXN45MZANC4K3SFAHRGFE2PXR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXN45MZANC4K3SFAHRGFE2PXR2/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-21T12:48:36Z","links":{"resolver":"https://pith.science/pith/EXN45MZANC4K3SFAHRGFE2PXR2","bundle":"https://pith.science/pith/EXN45MZANC4K3SFAHRGFE2PXR2/bundle.json","state":"https://pith.science/pith/EXN45MZANC4K3SFAHRGFE2PXR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXN45MZANC4K3SFAHRGFE2PXR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EXN45MZANC4K3SFAHRGFE2PXR2","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":"0ed18497da90649419af4f201c0ffd30938fa6b8a47a5d05e6c5e6034d4d779b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-02-17T15:58:49Z","title_canon_sha256":"75d70f1b452754223b1d28740a04247bcefc92cd146f19582f9d99e68baae012"},"schema_version":"1.0","source":{"id":"1402.4043","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4043","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4043v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4043","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"EXN45MZANC4K","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXN45MZANC4K3SFA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXN45MZA","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:721daa5599eefcfdce3fcc017ab4abee9775fcd8113db153282b2c58039175e8","target":"graph","created_at":"2026-05-18T02:53:07Z","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":"Linearizability is the de facto correctness criterion for concurrent data structures. Unfortunately, linearizability imposes a performance penalty which scales linearly in the number of contending threads. Quiescent consistency is an alternative criterion which guarantees that a concurrent data structure behaves correctly when accessed sequentially. Yet quiescent consistency says very little about executions that have any contention.\n  We define quantitative quiescent consistency (QQC), a relaxation of linearizability where the degree of relaxation is proportional to the degree of contention. ","authors_text":"James Riely, Radha Jagadeesan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-02-17T15:58:49Z","title":"Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4043","kind":"arxiv","version":3},"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:4771aec8aa656e8778767bc6083b806fb4349e2f051e38fe89663c75d8bfb5bf","target":"record","created_at":"2026-05-18T02:53:07Z","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":"0ed18497da90649419af4f201c0ffd30938fa6b8a47a5d05e6c5e6034d4d779b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-02-17T15:58:49Z","title_canon_sha256":"75d70f1b452754223b1d28740a04247bcefc92cd146f19582f9d99e68baae012"},"schema_version":"1.0","source":{"id":"1402.4043","kind":"arxiv","version":3}},"canonical_sha256":"25dbceb32068b8adc8a03c4c5269f78e8ee500fbe0b0e7fb25bcef6d2c58ad12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25dbceb32068b8adc8a03c4c5269f78e8ee500fbe0b0e7fb25bcef6d2c58ad12","first_computed_at":"2026-05-18T02:53:07.241862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:07.241862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NhQ78AY+PlEbcHqloDCplS9pguA9TOTzAdMuSrDC6oZt3yqU6DjDX0v7VMXVnQCmotmHzZntTUXBz8bkpCiZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:07.242544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4043","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4771aec8aa656e8778767bc6083b806fb4349e2f051e38fe89663c75d8bfb5bf","sha256:721daa5599eefcfdce3fcc017ab4abee9775fcd8113db153282b2c58039175e8"],"state_sha256":"da09ec62eac15904663011863e50772684a7542284ae2f2a1a5d840d55d992fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Vxg/zv6ovBVwpnQn8zE4xqRAO6And59Ol2Dz9QpDzN9Eip32n4KM3qrQo4Y8eE8iSVJqxxS/UY2jWaRTJ8kCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T12:48:36.180665Z","bundle_sha256":"aa00be2a3bca7ccf3b60d673b75d6c4cda89e57a2519aa0476432f3a040f579e"}}