{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4GMK7ZMFIQPFOFRENIUZTTS76F","short_pith_number":"pith:4GMK7ZMF","schema_version":"1.0","canonical_sha256":"e198afe585441e5716246a2999ce5ff1484d5dc801270984d93dafa1698e544d","source":{"kind":"arxiv","id":"1709.00681","version":5},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.00681","created_at":"2026-05-18T00:14:54.578755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00681v5","created_at":"2026-05-18T00:14:54.578755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00681","created_at":"2026-05-18T00:14:54.578755+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GMK7ZMFIQPF","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GMK7ZMFIQPFOFRE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GMK7ZMF","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F","json":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F.json","graph_json":"https://pith.science/api/pith-number/4GMK7ZMFIQPFOFRENIUZTTS76F/graph.json","events_json":"https://pith.science/api/pith-number/4GMK7ZMFIQPFOFRENIUZTTS76F/events.json","paper":"https://pith.science/paper/4GMK7ZMF"},"agent_actions":{"view_html":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F","download_json":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F.json","view_paper":"https://pith.science/paper/4GMK7ZMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00681&json=true","fetch_graph":"https://pith.science/api/pith-number/4GMK7ZMFIQPFOFRENIUZTTS76F/graph.json","fetch_events":"https://pith.science/api/pith-number/4GMK7ZMFIQPFOFRENIUZTTS76F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/action/storage_attestation","attest_author":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/action/author_attestation","sign_citation":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/action/citation_signature","submit_replication":"https://pith.science/pith/4GMK7ZMFIQPFOFRENIUZTTS76F/action/replication_record"}},"created_at":"2026-05-18T00:14:54.578755+00:00","updated_at":"2026-05-18T00:14:54.578755+00:00"}