{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YKUEUX4AT4YJ2M77A5ZMNHL5CG","short_pith_number":"pith:YKUEUX4A","schema_version":"1.0","canonical_sha256":"c2a84a5f809f309d33ff0772c69d7d11b68ade419dbc61946743e2ffe24e6b6d","source":{"kind":"arxiv","id":"1702.04866","version":2},"attestation_state":"computed","paper":{"title":"Proust: A Design Space for Highly-Concurrent Transactional Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Eric Koskinen, Maurice Herlihy, Paul Gazzillo, Thomas D. Dickerson","submitted_at":"2017-02-16T06:07:25Z","abstract_excerpt":"Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts. A second is that existing data structures and libraries often need to be rewritten from scratch to support transactional conflict detection and rollback. This paper introduces Proust, a framework for the design and implementation of transactional data structures. Proust is designed to maximize re-use of existing well-engineered by providing transactional \"w"},"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":"1702.04866","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-16T06:07:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5c8397e551df7efc461279797279dcf6ac5d14dc6f36b03b5b95cb4f78ad2e28","abstract_canon_sha256":"02347be326fba40b753500e1532f261e2e914603c4da37be928236ec21c3457e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:44.301309Z","signature_b64":"RNR1Ggf+h9W4DC879/3UFIoQHkhUzFVz/LaLUq03GYXd+Tvx8vDB9qE8gnHORs9MTurRrEuqArNdigStSFQfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2a84a5f809f309d33ff0772c69d7d11b68ade419dbc61946743e2ffe24e6b6d","last_reissued_at":"2026-05-18T00:41:44.300767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:44.300767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proust: A Design Space for Highly-Concurrent Transactional Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Eric Koskinen, Maurice Herlihy, Paul Gazzillo, Thomas D. Dickerson","submitted_at":"2017-02-16T06:07:25Z","abstract_excerpt":"Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts. A second is that existing data structures and libraries often need to be rewritten from scratch to support transactional conflict detection and rollback. This paper introduces Proust, a framework for the design and implementation of transactional data structures. Proust is designed to maximize re-use of existing well-engineered by providing transactional \"w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04866","kind":"arxiv","version":2},"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":"1702.04866","created_at":"2026-05-18T00:41:44.300865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04866v2","created_at":"2026-05-18T00:41:44.300865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04866","created_at":"2026-05-18T00:41:44.300865+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKUEUX4AT4YJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKUEUX4AT4YJ2M77","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKUEUX4A","created_at":"2026-05-18T12:31:56.362134+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/YKUEUX4AT4YJ2M77A5ZMNHL5CG","json":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG.json","graph_json":"https://pith.science/api/pith-number/YKUEUX4AT4YJ2M77A5ZMNHL5CG/graph.json","events_json":"https://pith.science/api/pith-number/YKUEUX4AT4YJ2M77A5ZMNHL5CG/events.json","paper":"https://pith.science/paper/YKUEUX4A"},"agent_actions":{"view_html":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG","download_json":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG.json","view_paper":"https://pith.science/paper/YKUEUX4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04866&json=true","fetch_graph":"https://pith.science/api/pith-number/YKUEUX4AT4YJ2M77A5ZMNHL5CG/graph.json","fetch_events":"https://pith.science/api/pith-number/YKUEUX4AT4YJ2M77A5ZMNHL5CG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG/action/storage_attestation","attest_author":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG/action/author_attestation","sign_citation":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG/action/citation_signature","submit_replication":"https://pith.science/pith/YKUEUX4AT4YJ2M77A5ZMNHL5CG/action/replication_record"}},"created_at":"2026-05-18T00:41:44.300865+00:00","updated_at":"2026-05-18T00:41:44.300865+00:00"}