{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BRP34TFRVOBONZYXBFU4JNUOWN","short_pith_number":"pith:BRP34TFR","schema_version":"1.0","canonical_sha256":"0c5fbe4cb1ab82e6e7170969c4b68eb34b0c65621c3f7f9d683b473bb412695d","source":{"kind":"arxiv","id":"1710.07588","version":4},"attestation_state":"computed","paper":{"title":"Parallel Combining: Benefits of Explicit Synchronization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anatoly Shalyto, Petr Kuznetsov, Vitaly Aksenov","submitted_at":"2017-10-20T16:07:18Z","abstract_excerpt":"Parallel batched data structures are designed to process synchronized batches of operations in a parallel computing model. In this paper, we propose parallel combining, a technique that implements a concurrent data structure from a parallel batched one. The idea is that we explicitly synchronize concurrent operations into batches: one of the processes becomes a combiner which collects concurrent requests and initiates a parallel batched algorithm involving the owners (clients) of the collected requests. Intuitively, the cost of synchronizing the concurrent calls can be compensated by running 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":"1710.07588","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-10-20T16:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"a1f5048c0cf2b57971379a5938a86a268a42021171885ed7597409afb5666689","abstract_canon_sha256":"2e15fbaacb37e8030f58360a13e69f41b613b393eebcd3c5f6926c8cf08d1d05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:00.074860Z","signature_b64":"zWtxkeFtgR23HPb3aU7VRqC4zNCg20iu5bzM5teLFcFrUXHjdVUow6/HDPvlVn6VoilP1Mvl7PX5ROOe1+CdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c5fbe4cb1ab82e6e7170969c4b68eb34b0c65621c3f7f9d683b473bb412695d","last_reissued_at":"2026-05-18T00:01:00.074194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:00.074194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Combining: Benefits of Explicit Synchronization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anatoly Shalyto, Petr Kuznetsov, Vitaly Aksenov","submitted_at":"2017-10-20T16:07:18Z","abstract_excerpt":"Parallel batched data structures are designed to process synchronized batches of operations in a parallel computing model. In this paper, we propose parallel combining, a technique that implements a concurrent data structure from a parallel batched one. The idea is that we explicitly synchronize concurrent operations into batches: one of the processes becomes a combiner which collects concurrent requests and initiates a parallel batched algorithm involving the owners (clients) of the collected requests. Intuitively, the cost of synchronizing the concurrent calls can be compensated by running t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07588","kind":"arxiv","version":4},"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":"1710.07588","created_at":"2026-05-18T00:01:00.074291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07588v4","created_at":"2026-05-18T00:01:00.074291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07588","created_at":"2026-05-18T00:01:00.074291+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRP34TFRVOBO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRP34TFRVOBONZYX","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRP34TFR","created_at":"2026-05-18T12:31:08.081275+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/BRP34TFRVOBONZYXBFU4JNUOWN","json":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN.json","graph_json":"https://pith.science/api/pith-number/BRP34TFRVOBONZYXBFU4JNUOWN/graph.json","events_json":"https://pith.science/api/pith-number/BRP34TFRVOBONZYXBFU4JNUOWN/events.json","paper":"https://pith.science/paper/BRP34TFR"},"agent_actions":{"view_html":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN","download_json":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN.json","view_paper":"https://pith.science/paper/BRP34TFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07588&json=true","fetch_graph":"https://pith.science/api/pith-number/BRP34TFRVOBONZYXBFU4JNUOWN/graph.json","fetch_events":"https://pith.science/api/pith-number/BRP34TFRVOBONZYXBFU4JNUOWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/action/storage_attestation","attest_author":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/action/author_attestation","sign_citation":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/action/citation_signature","submit_replication":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/action/replication_record"}},"created_at":"2026-05-18T00:01:00.074291+00:00","updated_at":"2026-05-18T00:01:00.074291+00:00"}