{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DFYIYN2SVMBYBBEH4XPLUXWBAS","short_pith_number":"pith:DFYIYN2S","canonical_record":{"source":{"id":"1412.8324","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-29T12:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"533cdb504ac13d04b1cb29e12a9887ac94cf0e2a8013400441369da558f9ef3c","abstract_canon_sha256":"f8f36d2903a13b73c3b1f8cdd7e668ab0b80b0424f9d78959ba3963060d77e65"},"schema_version":"1.0"},"canonical_sha256":"19708c3752ab03808487e5deba5ec10484f76d972c647afa60254e489007a3c1","source":{"kind":"arxiv","id":"1412.8324","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8324","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8324v3","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8324","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"DFYIYN2SVMBY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DFYIYN2SVMBYBBEH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DFYIYN2S","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DFYIYN2SVMBYBBEH4XPLUXWBAS","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8324","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-29T12:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"533cdb504ac13d04b1cb29e12a9887ac94cf0e2a8013400441369da558f9ef3c","abstract_canon_sha256":"f8f36d2903a13b73c3b1f8cdd7e668ab0b80b0424f9d78959ba3963060d77e65"},"schema_version":"1.0"},"canonical_sha256":"19708c3752ab03808487e5deba5ec10484f76d972c647afa60254e489007a3c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:04.764090Z","signature_b64":"9Mz8jZFmI/xDPkoDwYZAGACjqdAMA9HVwMvJTIaQ7thbH/j36qam5Wr114Xf2wHLA5oCWac7i+Ohp3YsS0s2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19708c3752ab03808487e5deba5ec10484f76d972c647afa60254e489007a3c1","last_reissued_at":"2026-05-18T00:24:04.763625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:04.763625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8324","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-18T00:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zs1N4eA3nR/8ud5XgVOd707NwrtI6hAqLjpLhSD9bAc1Oy34kxH3VgpML24OBaAf+rliI1kZkAmciPuZjfg8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:29:52.354222Z"},"content_sha256":"7904f11c47d87a473545d8864df3165c78c77f780de638f7ae49cf4d4a3ef15d","schema_version":"1.0","event_id":"sha256:7904f11c47d87a473545d8864df3165c78c77f780de638f7ae49cf4d4a3ef15d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DFYIYN2SVMBYBBEH4XPLUXWBAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constructive Proof on the Compositionality of Linearizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Haoxiang Lin","submitted_at":"2014-12-29T12:50:42Z","abstract_excerpt":"Linearizability is the strongest correctness property for both shared memory and message passing systems. One of its useful features is the compositionality: a history (execution) is linearizable if and only if each object (component) subhistory is linearizable. In this paper, we propose a new hierarchical system model to address challenges in modular development of cloud systems. Object are defined by induction from the most fundamental atomic Boolean registers, and histories are represented as countable well-ordered structures of events to deal with both finite and infinite executions. Then,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8324","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-18T00:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQxaXj8Et2oPdpB3XTlST/wq5ML5h73xatOAtdwS4juKwnmS5hzPCb0G4pq2I/IWA9Eh1HrnlzMGgvyeIgyrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:29:52.354597Z"},"content_sha256":"acf79751e95b01a70c56e34d627466f84258846802b34c5c143d3e0014516b47","schema_version":"1.0","event_id":"sha256:acf79751e95b01a70c56e34d627466f84258846802b34c5c143d3e0014516b47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFYIYN2SVMBYBBEH4XPLUXWBAS/bundle.json","state_url":"https://pith.science/pith/DFYIYN2SVMBYBBEH4XPLUXWBAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFYIYN2SVMBYBBEH4XPLUXWBAS/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-23T15:29:52Z","links":{"resolver":"https://pith.science/pith/DFYIYN2SVMBYBBEH4XPLUXWBAS","bundle":"https://pith.science/pith/DFYIYN2SVMBYBBEH4XPLUXWBAS/bundle.json","state":"https://pith.science/pith/DFYIYN2SVMBYBBEH4XPLUXWBAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFYIYN2SVMBYBBEH4XPLUXWBAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DFYIYN2SVMBYBBEH4XPLUXWBAS","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":"f8f36d2903a13b73c3b1f8cdd7e668ab0b80b0424f9d78959ba3963060d77e65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-29T12:50:42Z","title_canon_sha256":"533cdb504ac13d04b1cb29e12a9887ac94cf0e2a8013400441369da558f9ef3c"},"schema_version":"1.0","source":{"id":"1412.8324","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8324","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8324v3","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8324","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"DFYIYN2SVMBY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DFYIYN2SVMBYBBEH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DFYIYN2S","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:acf79751e95b01a70c56e34d627466f84258846802b34c5c143d3e0014516b47","target":"graph","created_at":"2026-05-18T00:24:04Z","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 strongest correctness property for both shared memory and message passing systems. One of its useful features is the compositionality: a history (execution) is linearizable if and only if each object (component) subhistory is linearizable. In this paper, we propose a new hierarchical system model to address challenges in modular development of cloud systems. Object are defined by induction from the most fundamental atomic Boolean registers, and histories are represented as countable well-ordered structures of events to deal with both finite and infinite executions. Then,","authors_text":"Haoxiang Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-29T12:50:42Z","title":"A Constructive Proof on the Compositionality of Linearizability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8324","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:7904f11c47d87a473545d8864df3165c78c77f780de638f7ae49cf4d4a3ef15d","target":"record","created_at":"2026-05-18T00:24:04Z","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":"f8f36d2903a13b73c3b1f8cdd7e668ab0b80b0424f9d78959ba3963060d77e65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-29T12:50:42Z","title_canon_sha256":"533cdb504ac13d04b1cb29e12a9887ac94cf0e2a8013400441369da558f9ef3c"},"schema_version":"1.0","source":{"id":"1412.8324","kind":"arxiv","version":3}},"canonical_sha256":"19708c3752ab03808487e5deba5ec10484f76d972c647afa60254e489007a3c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19708c3752ab03808487e5deba5ec10484f76d972c647afa60254e489007a3c1","first_computed_at":"2026-05-18T00:24:04.763625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:04.763625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Mz8jZFmI/xDPkoDwYZAGACjqdAMA9HVwMvJTIaQ7thbH/j36qam5Wr114Xf2wHLA5oCWac7i+Ohp3YsS0s2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:04.764090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8324","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7904f11c47d87a473545d8864df3165c78c77f780de638f7ae49cf4d4a3ef15d","sha256:acf79751e95b01a70c56e34d627466f84258846802b34c5c143d3e0014516b47"],"state_sha256":"9a75d2fa54d75407e0386cf435cac03a27b8ba5c23ad231d992c876660341ea2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vj7a9N2ugziMOTstNaOP8aT2eNxs4bE+rtYAn5rZyu43YmZIzkwGHb67pVIdU0vV/mt8YMCUoOIW8NACuoqZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:29:52.356454Z","bundle_sha256":"c082aa1f8a513b03aea5f966ab5587f52022a3d3d54f9b3058886784c77cfcc5"}}