{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KXCLQABBHE2O3LBDSPHDS7NBVQ","short_pith_number":"pith:KXCLQABB","canonical_record":{"source":{"id":"1905.01200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-03T14:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"a10ae70c24c6977298ed723c513935e603e639cc468acb9f122925fb874202ef","abstract_canon_sha256":"855585ae4bee989673f37ca8ddeb9d4eb4820eedf48b0c99df8fb84e7473ddfb"},"schema_version":"1.0"},"canonical_sha256":"55c4b800213934edac2393ce397da1ac35abc6ee86be879bc335d633671eed9c","source":{"kind":"arxiv","id":"1905.01200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01200","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01200v1","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01200","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"KXCLQABBHE2O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KXCLQABBHE2O3LBD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KXCLQABB","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KXCLQABBHE2O3LBDSPHDS7NBVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-03T14:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"a10ae70c24c6977298ed723c513935e603e639cc468acb9f122925fb874202ef","abstract_canon_sha256":"855585ae4bee989673f37ca8ddeb9d4eb4820eedf48b0c99df8fb84e7473ddfb"},"schema_version":"1.0"},"canonical_sha256":"55c4b800213934edac2393ce397da1ac35abc6ee86be879bc335d633671eed9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.533089Z","signature_b64":"Ec1kKdN5KeIYBCSQyzKfob8vfW5aNXWc/BpVGx4LqjY6hJi+Yk6/jmCcQeFB78kaYOda4DBDCjVUJ718T+OmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c4b800213934edac2393ce397da1ac35abc6ee86be879bc335d633671eed9c","last_reissued_at":"2026-05-17T23:47:06.532550Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.532550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01200","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-05-17T23:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTKLsetQmL0NovKbk9jrPMP6PP4GsKWvpTXRzaGmQLwRCbQxE/mRd3ivVmgoOy0iBLh3VVfMalcxNNoJ9jevCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:39:10.620876Z"},"content_sha256":"22a9f1b27bbdc85ebe31f65cb4c1725eb79732880efa946d6b2fa58a1e48f222","schema_version":"1.0","event_id":"sha256:22a9f1b27bbdc85ebe31f65cb4c1725eb79732880efa946d6b2fa58a1e48f222"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KXCLQABBHE2O3LBDSPHDS7NBVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Approach to Achieve Compositionality using Optimized Multi-Version Object Based Transactional Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Archit Somani, Chirag Juyal, Sandeep Kulkarni, Sathya Peri, Sweta Kumari","submitted_at":"2019-05-03T14:23:29Z","abstract_excerpt":"In the modern era of multi-core systems, the main aim is to utilize the cores properly. This utilization can be done by concurrent programming. But developing a flawless and well-organized concurrent program is difficult. Software Transactional Memory Systems (STMs) are a convenient programming interface which assist the programmer to access the shared memory concurrently without worrying about consistency issues such as priority-inversion, deadlock, livelock, etc. Another important feature that STMs facilitate is compositionality of concurrent programs with great ease. It composes different c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01200","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":""},"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:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Tnm4B/VjrW97uQjEG2aEBmejgiKJu9H0jj/jpdxIV5FqdURm0ofF/9UPQ6UIxXvmDLMZouIfB/dMVdruwaYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:39:10.621299Z"},"content_sha256":"bd3715102a6a7b7ab32ac3cb75fe949612992f4e0dc4802ab50bc13667c9cb9d","schema_version":"1.0","event_id":"sha256:bd3715102a6a7b7ab32ac3cb75fe949612992f4e0dc4802ab50bc13667c9cb9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXCLQABBHE2O3LBDSPHDS7NBVQ/bundle.json","state_url":"https://pith.science/pith/KXCLQABBHE2O3LBDSPHDS7NBVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXCLQABBHE2O3LBDSPHDS7NBVQ/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-20T08:39:10Z","links":{"resolver":"https://pith.science/pith/KXCLQABBHE2O3LBDSPHDS7NBVQ","bundle":"https://pith.science/pith/KXCLQABBHE2O3LBDSPHDS7NBVQ/bundle.json","state":"https://pith.science/pith/KXCLQABBHE2O3LBDSPHDS7NBVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXCLQABBHE2O3LBDSPHDS7NBVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KXCLQABBHE2O3LBDSPHDS7NBVQ","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":"855585ae4bee989673f37ca8ddeb9d4eb4820eedf48b0c99df8fb84e7473ddfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-03T14:23:29Z","title_canon_sha256":"a10ae70c24c6977298ed723c513935e603e639cc468acb9f122925fb874202ef"},"schema_version":"1.0","source":{"id":"1905.01200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01200","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01200v1","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01200","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"KXCLQABBHE2O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KXCLQABBHE2O3LBD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KXCLQABB","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:bd3715102a6a7b7ab32ac3cb75fe949612992f4e0dc4802ab50bc13667c9cb9d","target":"graph","created_at":"2026-05-17T23:47:06Z","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":"In the modern era of multi-core systems, the main aim is to utilize the cores properly. This utilization can be done by concurrent programming. But developing a flawless and well-organized concurrent program is difficult. Software Transactional Memory Systems (STMs) are a convenient programming interface which assist the programmer to access the shared memory concurrently without worrying about consistency issues such as priority-inversion, deadlock, livelock, etc. Another important feature that STMs facilitate is compositionality of concurrent programs with great ease. It composes different c","authors_text":"Archit Somani, Chirag Juyal, Sandeep Kulkarni, Sathya Peri, Sweta Kumari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-03T14:23:29Z","title":"An Efficient Approach to Achieve Compositionality using Optimized Multi-Version Object Based Transactional Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01200","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:22a9f1b27bbdc85ebe31f65cb4c1725eb79732880efa946d6b2fa58a1e48f222","target":"record","created_at":"2026-05-17T23:47:06Z","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":"855585ae4bee989673f37ca8ddeb9d4eb4820eedf48b0c99df8fb84e7473ddfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-03T14:23:29Z","title_canon_sha256":"a10ae70c24c6977298ed723c513935e603e639cc468acb9f122925fb874202ef"},"schema_version":"1.0","source":{"id":"1905.01200","kind":"arxiv","version":1}},"canonical_sha256":"55c4b800213934edac2393ce397da1ac35abc6ee86be879bc335d633671eed9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55c4b800213934edac2393ce397da1ac35abc6ee86be879bc335d633671eed9c","first_computed_at":"2026-05-17T23:47:06.532550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:06.532550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ec1kKdN5KeIYBCSQyzKfob8vfW5aNXWc/BpVGx4LqjY6hJi+Yk6/jmCcQeFB78kaYOda4DBDCjVUJ718T+OmCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:06.533089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22a9f1b27bbdc85ebe31f65cb4c1725eb79732880efa946d6b2fa58a1e48f222","sha256:bd3715102a6a7b7ab32ac3cb75fe949612992f4e0dc4802ab50bc13667c9cb9d"],"state_sha256":"eda0974667719402a7b37ba199497b63c84ad52d8a394f714e2bc5f0ab3981ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7wDiI/yUJKJ50icHcjLQ8axXtr3zMMR/3P0Ui24eLAPv+lUwRKCTJgNKxtomB1YF4E+tp/DhfHrf8eRyTVUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:39:10.623268Z","bundle_sha256":"959eb506924a57bad5975390052bdcbb2943e410061eeb304c9af38ff9c6871b"}}