{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4GMK7ZMFIQPFOFRENIUZTTS76F","short_pith_number":"pith:4GMK7ZMF","canonical_record":{"source":{"id":"1709.00681","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-03T08:22:44Z","cross_cats_sorted":[],"title_canon_sha256":"51c5cb9eb727f35f68bfb41475f31324ccf9ab909ecbf0b08b0340727afb9993","abstract_canon_sha256":"719786fdbfd838e598d984f39c65e5983aa87000d854ce0abaee950dc908418a"},"schema_version":"1.0"},"canonical_sha256":"e198afe585441e5716246a2999ce5ff1484d5dc801270984d93dafa1698e544d","source":{"kind":"arxiv","id":"1709.00681","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00681","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00681v5","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00681","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"4GMK7ZMFIQPF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GMK7ZMFIQPFOFRE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GMK7ZMF","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4GMK7ZMFIQPFOFRENIUZTTS76F","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00681","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-03T08:22:44Z","cross_cats_sorted":[],"title_canon_sha256":"51c5cb9eb727f35f68bfb41475f31324ccf9ab909ecbf0b08b0340727afb9993","abstract_canon_sha256":"719786fdbfd838e598d984f39c65e5983aa87000d854ce0abaee950dc908418a"},"schema_version":"1.0"},"canonical_sha256":"e198afe585441e5716246a2999ce5ff1484d5dc801270984d93dafa1698e544d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:54.579258Z","signature_b64":"fTcpp07rXQqxBkp1KffzviVj9r4LniNom9ezF/VtzpIIRLCbVVtG/+Tl71OnMsHeFffk0H+GaoQ0Dd504waHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e198afe585441e5716246a2999ce5ff1484d5dc801270984d93dafa1698e544d","last_reissued_at":"2026-05-18T00:14:54.578655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:54.578655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00681","source_version":5,"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:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyVEkRVdrg0QSpVKAjPVxZ+GRqIm9XYEQGcXkYEHMGb5P47PMqVGpFmdPWsx83/djgiO0Go+lD9awIMaId8LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:43:25.940064Z"},"content_sha256":"8453c4ab7274577d728ab33eb6de70fb7984ced5f2ecc70b18f882859cb06ad7","schema_version":"1.0","event_id":"sha256:8453c4ab7274577d728ab33eb6de70fb7984ced5f2ecc70b18f882859cb06ad7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4GMK7ZMFIQPFOFRENIUZTTS76F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient means of Achieving Composability using Object based Conflicts on Transactional Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajay Singh, Archit Somani, Sathya Peri","submitted_at":"2017-09-03T08:22:44Z","abstract_excerpt":"Composing together the individual atomic methods of concurrent data-structures (cds) pose multiple design and consistency challenges. In this context composition provided by transactions in software transaction memory (STM) can be handy. However, most of the STMs offer read/write primitives to access shared cds. These read/write primitives result in unnecessary aborts. Instead, semantically rich higher-level methods of the underlying cds like lookup, insert or delete (in case of hash-table or lists) aid in ignoring unimportant lower level read/write conflicts and allow better concurrency. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00681","kind":"arxiv","version":5},"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:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRguAN0NoXeca0btDlD/ELGMBZU6/KZpcHxXvE2e4Oz48kHHWWx1xFZrv1aw3SYEIj2bO9uiVX0JVVWIbt6wBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:43:25.940448Z"},"content_sha256":"903f1a05cda3bd45fcbb55f343d608711874d508f8e7a999f39391ed1b1d507f","schema_version":"1.0","event_id":"sha256:903f1a05cda3bd45fcbb55f343d608711874d508f8e7a999f39391ed1b1d507f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/bundle.json","state_url":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/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-28T01:43:25Z","links":{"resolver":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F","bundle":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/bundle.json","state":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4GMK7ZMFIQPFOFRENIUZTTS76F","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":"719786fdbfd838e598d984f39c65e5983aa87000d854ce0abaee950dc908418a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-03T08:22:44Z","title_canon_sha256":"51c5cb9eb727f35f68bfb41475f31324ccf9ab909ecbf0b08b0340727afb9993"},"schema_version":"1.0","source":{"id":"1709.00681","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00681","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00681v5","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00681","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"4GMK7ZMFIQPF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GMK7ZMFIQPFOFRE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GMK7ZMF","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:903f1a05cda3bd45fcbb55f343d608711874d508f8e7a999f39391ed1b1d507f","target":"graph","created_at":"2026-05-18T00:14:54Z","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":"Composing together the individual atomic methods of concurrent data-structures (cds) pose multiple design and consistency challenges. In this context composition provided by transactions in software transaction memory (STM) can be handy. However, most of the STMs offer read/write primitives to access shared cds. These read/write primitives result in unnecessary aborts. Instead, semantically rich higher-level methods of the underlying cds like lookup, insert or delete (in case of hash-table or lists) aid in ignoring unimportant lower level read/write conflicts and allow better concurrency. In t","authors_text":"Ajay Singh, Archit Somani, Sathya Peri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-03T08:22:44Z","title":"Efficient means of Achieving Composability using Object based Conflicts on Transactional Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00681","kind":"arxiv","version":5},"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:8453c4ab7274577d728ab33eb6de70fb7984ced5f2ecc70b18f882859cb06ad7","target":"record","created_at":"2026-05-18T00:14:54Z","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":"719786fdbfd838e598d984f39c65e5983aa87000d854ce0abaee950dc908418a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-03T08:22:44Z","title_canon_sha256":"51c5cb9eb727f35f68bfb41475f31324ccf9ab909ecbf0b08b0340727afb9993"},"schema_version":"1.0","source":{"id":"1709.00681","kind":"arxiv","version":5}},"canonical_sha256":"e198afe585441e5716246a2999ce5ff1484d5dc801270984d93dafa1698e544d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e198afe585441e5716246a2999ce5ff1484d5dc801270984d93dafa1698e544d","first_computed_at":"2026-05-18T00:14:54.578655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:54.578655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTcpp07rXQqxBkp1KffzviVj9r4LniNom9ezF/VtzpIIRLCbVVtG/+Tl71OnMsHeFffk0H+GaoQ0Dd504waHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:54.579258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00681","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8453c4ab7274577d728ab33eb6de70fb7984ced5f2ecc70b18f882859cb06ad7","sha256:903f1a05cda3bd45fcbb55f343d608711874d508f8e7a999f39391ed1b1d507f"],"state_sha256":"df7160ba2b3f555667021c5e2743b7726b6daeeeb30f8143b68afcf50dc2b29b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhIcJv0qXHJi2hLcib2/ld+VzOleROKvoOgM9CXgB9zfPhMqAHteaM3I2xQs8GREP/y8XZUEnok1QzKeW+hDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:43:25.942570Z","bundle_sha256":"8fb0bbcce0445e71fdad87a3dc12897a09425dd21abda89299b9e425d9b9a116"}}