{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OY2IFPZGBUIGLWMYSTKNVBQHUX","short_pith_number":"pith:OY2IFPZG","canonical_record":{"source":{"id":"1507.01663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-07T03:22:32Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"59043237bf62a9bddfbeeb75d22c3bfdf91234acc42a743135be79a15eb9ab90","abstract_canon_sha256":"facebf490208954c9853687e7945c82deb7b4b41d5802af26dc2d7d740fba0ec"},"schema_version":"1.0"},"canonical_sha256":"763482bf260d1065d99894d4da8607a5f0119fae6074e05beaf06e4dc31c1645","source":{"kind":"arxiv","id":"1507.01663","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01663","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01663v2","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01663","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"OY2IFPZGBUIG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OY2IFPZGBUIGLWMY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OY2IFPZG","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OY2IFPZGBUIGLWMYSTKNVBQHUX","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-07T03:22:32Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"59043237bf62a9bddfbeeb75d22c3bfdf91234acc42a743135be79a15eb9ab90","abstract_canon_sha256":"facebf490208954c9853687e7945c82deb7b4b41d5802af26dc2d7d740fba0ec"},"schema_version":"1.0"},"canonical_sha256":"763482bf260d1065d99894d4da8607a5f0119fae6074e05beaf06e4dc31c1645","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:49.490211Z","signature_b64":"wo0ssXYQAW2vD4jVT3b51jIXQ9NE+ui2vjzrZNzmnnrQcrMs5nWB1lXiLtirOnPzlEr6eGvIHK3OItDnPd4rCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"763482bf260d1065d99894d4da8607a5f0119fae6074e05beaf06e4dc31c1645","last_reissued_at":"2026-05-18T01:36:49.489667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:49.489667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01663","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-18T01:36:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1ZgCqQbTq9oxA0ZSsC9lZaFIfqAlKkRsTikKo2RFoiRwSSAt5k054nAiV9Y/j1SHXLj/zv6UzK35+ERlCIWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:01:57.540658Z"},"content_sha256":"5a443537ad9f30f07476aea955a9f9ebc461d361006fae1ac07e865824992289","schema_version":"1.0","event_id":"sha256:5a443537ad9f30f07476aea955a9f9ebc461d361006fae1ac07e865824992289"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OY2IFPZGBUIGLWMYSTKNVBQHUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Strong Consistency: \"Good Enough\" in Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Hengfeng Wei, Jian Lu, Jiannong Cao, Yu Huang","submitted_at":"2015-07-07T03:22:32Z","abstract_excerpt":"A consistency/latency tradeoff arises as soon as a distributed storage system replicates data. For low latency, modern storage systems often settle for weak consistency conditions, which provide little, or even worse, no guarantee for data consistency. In this paper we propose the notion of almost strong consistency as a better balance option for the consistency/latency tradeoff. It provides both deterministically bounded staleness of data versions for each read and probabilistic quantification on the rate of \"reading stale values\", while achieving low latency. In the context of distributed st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01663","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-18T01:36:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R323I9JRo7JDTP9tENdK5UQVFS35NPUKYhrJxt/HAs5JWv3FbG3b0UKRRggD15q39FdIM+FAe94bc5/XC5ejAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:01:57.541006Z"},"content_sha256":"8ec74cf7c02ae045334fc59abc0d0ff601ed69c744cbf296781518d18d2b8582","schema_version":"1.0","event_id":"sha256:8ec74cf7c02ae045334fc59abc0d0ff601ed69c744cbf296781518d18d2b8582"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OY2IFPZGBUIGLWMYSTKNVBQHUX/bundle.json","state_url":"https://pith.science/pith/OY2IFPZGBUIGLWMYSTKNVBQHUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OY2IFPZGBUIGLWMYSTKNVBQHUX/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-02T23:01:57Z","links":{"resolver":"https://pith.science/pith/OY2IFPZGBUIGLWMYSTKNVBQHUX","bundle":"https://pith.science/pith/OY2IFPZGBUIGLWMYSTKNVBQHUX/bundle.json","state":"https://pith.science/pith/OY2IFPZGBUIGLWMYSTKNVBQHUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OY2IFPZGBUIGLWMYSTKNVBQHUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OY2IFPZGBUIGLWMYSTKNVBQHUX","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":"facebf490208954c9853687e7945c82deb7b4b41d5802af26dc2d7d740fba0ec","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-07T03:22:32Z","title_canon_sha256":"59043237bf62a9bddfbeeb75d22c3bfdf91234acc42a743135be79a15eb9ab90"},"schema_version":"1.0","source":{"id":"1507.01663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01663","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01663v2","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01663","created_at":"2026-05-18T01:36:49Z"},{"alias_kind":"pith_short_12","alias_value":"OY2IFPZGBUIG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OY2IFPZGBUIGLWMY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OY2IFPZG","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:8ec74cf7c02ae045334fc59abc0d0ff601ed69c744cbf296781518d18d2b8582","target":"graph","created_at":"2026-05-18T01:36:49Z","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":"A consistency/latency tradeoff arises as soon as a distributed storage system replicates data. For low latency, modern storage systems often settle for weak consistency conditions, which provide little, or even worse, no guarantee for data consistency. In this paper we propose the notion of almost strong consistency as a better balance option for the consistency/latency tradeoff. It provides both deterministically bounded staleness of data versions for each read and probabilistic quantification on the rate of \"reading stale values\", while achieving low latency. In the context of distributed st","authors_text":"Hengfeng Wei, Jian Lu, Jiannong Cao, Yu Huang","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-07T03:22:32Z","title":"Almost Strong Consistency: \"Good Enough\" in Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01663","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:5a443537ad9f30f07476aea955a9f9ebc461d361006fae1ac07e865824992289","target":"record","created_at":"2026-05-18T01:36:49Z","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":"facebf490208954c9853687e7945c82deb7b4b41d5802af26dc2d7d740fba0ec","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-07T03:22:32Z","title_canon_sha256":"59043237bf62a9bddfbeeb75d22c3bfdf91234acc42a743135be79a15eb9ab90"},"schema_version":"1.0","source":{"id":"1507.01663","kind":"arxiv","version":2}},"canonical_sha256":"763482bf260d1065d99894d4da8607a5f0119fae6074e05beaf06e4dc31c1645","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"763482bf260d1065d99894d4da8607a5f0119fae6074e05beaf06e4dc31c1645","first_computed_at":"2026-05-18T01:36:49.489667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:49.489667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wo0ssXYQAW2vD4jVT3b51jIXQ9NE+ui2vjzrZNzmnnrQcrMs5nWB1lXiLtirOnPzlEr6eGvIHK3OItDnPd4rCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:49.490211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a443537ad9f30f07476aea955a9f9ebc461d361006fae1ac07e865824992289","sha256:8ec74cf7c02ae045334fc59abc0d0ff601ed69c744cbf296781518d18d2b8582"],"state_sha256":"a170e10bb3554686237697b21464fe0580a256c329d8a904f78401a8d6c7289d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcYNDls8A/7lDdgNuQgMTuIPGTPrUbJ/w9EYsiikVEelfiZw46SXqNY/xkANkpbJ0ni2RktkfApkEE8jYmb+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:01:57.542934Z","bundle_sha256":"371edff8783e979416bffca9808427c0ad301c1b43bc8be754ab644999918ae6"}}