{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KQGKJD7BNS3VGHIEW7SIE62ZDN","short_pith_number":"pith:KQGKJD7B","canonical_record":{"source":{"id":"1707.08357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T10:24:36Z","cross_cats_sorted":[],"title_canon_sha256":"777cfc317a73fd360c93f869d18cf10bf0598cd094dcdf75ad9605b598825450","abstract_canon_sha256":"7a30034c6ff13c2375253aac2d8dc94fee2428c743848e13b4d10a05eb35ab7a"},"schema_version":"1.0"},"canonical_sha256":"540ca48fe16cb7531d04b7e4827b591b4ca65d7f3835a9ae0264c70db2a70d70","source":{"kind":"arxiv","id":"1707.08357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08357","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08357v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08357","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"KQGKJD7BNS3V","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KQGKJD7BNS3VGHIE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KQGKJD7B","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KQGKJD7BNS3VGHIEW7SIE62ZDN","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T10:24:36Z","cross_cats_sorted":[],"title_canon_sha256":"777cfc317a73fd360c93f869d18cf10bf0598cd094dcdf75ad9605b598825450","abstract_canon_sha256":"7a30034c6ff13c2375253aac2d8dc94fee2428c743848e13b4d10a05eb35ab7a"},"schema_version":"1.0"},"canonical_sha256":"540ca48fe16cb7531d04b7e4827b591b4ca65d7f3835a9ae0264c70db2a70d70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.447977Z","signature_b64":"CZSbIyio6eF0CGbi/eeDnwdXJweh084DwcZ/efPchKXyH9srgLgcEVRIcgkRgudF6+ge+OZACU14KCWmSibZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"540ca48fe16cb7531d04b7e4827b591b4ca65d7f3835a9ae0264c70db2a70d70","last_reissued_at":"2026-05-18T00:39:24.447390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.447390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08357","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-18T00:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86zpOjTU0SYW9GarrW1tVNS9z3I/4ehrpn7AhXmimoBUU9g0zOjkUivI9E1LgZvlNCt5sQVvLpRbgHgefW+LDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:12:39.650651Z"},"content_sha256":"64426cff42ef5061110aed6bbc5efcf18abd7a797d986a4a590ebf168894ba13","schema_version":"1.0","event_id":"sha256:64426cff42ef5061110aed6bbc5efcf18abd7a797d986a4a590ebf168894ba13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KQGKJD7BNS3VGHIEW7SIE62ZDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajay Singh, Anila Kumari, G Monika, Sathya Peri","submitted_at":"2017-07-26T10:24:36Z","abstract_excerpt":"Writing concurrent programs for shared memory multiprocessor systems is a nightmare. This hinders users to exploit the full potential of multiprocessors. STM (Software Transactional Memory) is a promising concurrent programming paradigm which addresses woes of programming for multiprocessor systems.\n  In this paper, we implement BTO (Basic Timestamp Ordering), SGT (Serialization Graph Testing) and MVTO(Multi-Version Time-Stamp Ordering) concurrency control protocols and build an STM(Software Transactional Memory) library to evaluate the performance of these protocols. The deferred write approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08357","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-18T00:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgjI1R+y2tAockRzfB9FWH2b1/32OMT4I/k2Drji6ap4xvSScs1K2OjHHpzMEvdWp7CcxZ8H60qNz2Y3/Ti8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:12:39.651388Z"},"content_sha256":"39ce6a1e2d11f3fcf026b75f6461b9e2d29e8cd81b460f02966feb76fe09bb86","schema_version":"1.0","event_id":"sha256:39ce6a1e2d11f3fcf026b75f6461b9e2d29e8cd81b460f02966feb76fe09bb86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/bundle.json","state_url":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/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-26T09:12:39Z","links":{"resolver":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN","bundle":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/bundle.json","state":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KQGKJD7BNS3VGHIEW7SIE62ZDN","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":"7a30034c6ff13c2375253aac2d8dc94fee2428c743848e13b4d10a05eb35ab7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T10:24:36Z","title_canon_sha256":"777cfc317a73fd360c93f869d18cf10bf0598cd094dcdf75ad9605b598825450"},"schema_version":"1.0","source":{"id":"1707.08357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08357","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08357v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08357","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"KQGKJD7BNS3V","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KQGKJD7BNS3VGHIE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KQGKJD7B","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:39ce6a1e2d11f3fcf026b75f6461b9e2d29e8cd81b460f02966feb76fe09bb86","target":"graph","created_at":"2026-05-18T00:39:24Z","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":"Writing concurrent programs for shared memory multiprocessor systems is a nightmare. This hinders users to exploit the full potential of multiprocessors. STM (Software Transactional Memory) is a promising concurrent programming paradigm which addresses woes of programming for multiprocessor systems.\n  In this paper, we implement BTO (Basic Timestamp Ordering), SGT (Serialization Graph Testing) and MVTO(Multi-Version Time-Stamp Ordering) concurrency control protocols and build an STM(Software Transactional Memory) library to evaluate the performance of these protocols. The deferred write approa","authors_text":"Ajay Singh, Anila Kumari, G Monika, Sathya Peri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T10:24:36Z","title":"Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08357","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:64426cff42ef5061110aed6bbc5efcf18abd7a797d986a4a590ebf168894ba13","target":"record","created_at":"2026-05-18T00:39:24Z","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":"7a30034c6ff13c2375253aac2d8dc94fee2428c743848e13b4d10a05eb35ab7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T10:24:36Z","title_canon_sha256":"777cfc317a73fd360c93f869d18cf10bf0598cd094dcdf75ad9605b598825450"},"schema_version":"1.0","source":{"id":"1707.08357","kind":"arxiv","version":1}},"canonical_sha256":"540ca48fe16cb7531d04b7e4827b591b4ca65d7f3835a9ae0264c70db2a70d70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"540ca48fe16cb7531d04b7e4827b591b4ca65d7f3835a9ae0264c70db2a70d70","first_computed_at":"2026-05-18T00:39:24.447390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:24.447390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CZSbIyio6eF0CGbi/eeDnwdXJweh084DwcZ/efPchKXyH9srgLgcEVRIcgkRgudF6+ge+OZACU14KCWmSibZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:24.447977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64426cff42ef5061110aed6bbc5efcf18abd7a797d986a4a590ebf168894ba13","sha256:39ce6a1e2d11f3fcf026b75f6461b9e2d29e8cd81b460f02966feb76fe09bb86"],"state_sha256":"30d9617074d7997fecadfd7702e5d358cda2d8532ccd6396cd14b96bebb9c0c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWNuataTL++Zv4mQhGN0hdoSoevJUPTSZreKn7fBLqkrZoVlfByfsvMPwv/UgZ3fxpVezG9GApjQ9iUBi8d6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:12:39.655041Z","bundle_sha256":"3c81c6d94ce8aa897d0e100499341506cc55843b7ebd697fc1fe1f39b02c3e88"}}