{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BRP34TFRVOBONZYXBFU4JNUOWN","short_pith_number":"pith:BRP34TFR","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"},"canonical_sha256":"0c5fbe4cb1ab82e6e7170969c4b68eb34b0c65621c3f7f9d683b473bb412695d","source":{"kind":"arxiv","id":"1710.07588","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07588","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07588v4","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07588","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"BRP34TFRVOBO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BRP34TFRVOBONZYX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BRP34TFR","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BRP34TFRVOBONZYXBFU4JNUOWN","target":"record","payload":{"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"},"canonical_sha256":"0c5fbe4cb1ab82e6e7170969c4b68eb34b0c65621c3f7f9d683b473bb412695d","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"},"source_kind":"arxiv","source_id":"1710.07588","source_version":4,"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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfWve/7hjxTJ5cn1Lo7kRenJsYF8EXuX0MnLLwXE+5tG0R7GEghkO4H2dQQ22ZdS2pBpzK7YdgGeUCIMRk8yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:37:14.479053Z"},"content_sha256":"2aa97ee38ac9720631a328a32d463ecfcd322a916a22cf2a05d8b1ced9453dfc","schema_version":"1.0","event_id":"sha256:2aa97ee38ac9720631a328a32d463ecfcd322a916a22cf2a05d8b1ced9453dfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BRP34TFRVOBONZYXBFU4JNUOWN","target":"graph","payload":{"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"},"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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cVgohN2LCUoUPrDrLP6CmbdqRd4x63B9FRT7nCDH1YWXkglfZ2D2eILfI3cIpdXchi1Va3pEWBaqZCbfEKaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:37:14.479401Z"},"content_sha256":"c202b9ac1339f1a3a4da87296ef3ea64e39cc874f51a48cead0b20d8b2ec686f","schema_version":"1.0","event_id":"sha256:c202b9ac1339f1a3a4da87296ef3ea64e39cc874f51a48cead0b20d8b2ec686f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/bundle.json","state_url":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRP34TFRVOBONZYXBFU4JNUOWN/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-06-28T11:37:14Z","links":{"resolver":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN","bundle":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/bundle.json","state":"https://pith.science/pith/BRP34TFRVOBONZYXBFU4JNUOWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRP34TFRVOBONZYXBFU4JNUOWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BRP34TFRVOBONZYXBFU4JNUOWN","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":"2e15fbaacb37e8030f58360a13e69f41b613b393eebcd3c5f6926c8cf08d1d05","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-10-20T16:07:18Z","title_canon_sha256":"a1f5048c0cf2b57971379a5938a86a268a42021171885ed7597409afb5666689"},"schema_version":"1.0","source":{"id":"1710.07588","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07588","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07588v4","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07588","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"BRP34TFRVOBO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BRP34TFRVOBONZYX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BRP34TFR","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:c202b9ac1339f1a3a4da87296ef3ea64e39cc874f51a48cead0b20d8b2ec686f","target":"graph","created_at":"2026-05-18T00:01:00Z","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":"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","authors_text":"Anatoly Shalyto, Petr Kuznetsov, Vitaly Aksenov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-10-20T16:07:18Z","title":"Parallel Combining: Benefits of Explicit Synchronization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07588","kind":"arxiv","version":4},"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:2aa97ee38ac9720631a328a32d463ecfcd322a916a22cf2a05d8b1ced9453dfc","target":"record","created_at":"2026-05-18T00:01:00Z","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":"2e15fbaacb37e8030f58360a13e69f41b613b393eebcd3c5f6926c8cf08d1d05","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-10-20T16:07:18Z","title_canon_sha256":"a1f5048c0cf2b57971379a5938a86a268a42021171885ed7597409afb5666689"},"schema_version":"1.0","source":{"id":"1710.07588","kind":"arxiv","version":4}},"canonical_sha256":"0c5fbe4cb1ab82e6e7170969c4b68eb34b0c65621c3f7f9d683b473bb412695d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c5fbe4cb1ab82e6e7170969c4b68eb34b0c65621c3f7f9d683b473bb412695d","first_computed_at":"2026-05-18T00:01:00.074194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:00.074194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zWtxkeFtgR23HPb3aU7VRqC4zNCg20iu5bzM5teLFcFrUXHjdVUow6/HDPvlVn6VoilP1Mvl7PX5ROOe1+CdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:00.074860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07588","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aa97ee38ac9720631a328a32d463ecfcd322a916a22cf2a05d8b1ced9453dfc","sha256:c202b9ac1339f1a3a4da87296ef3ea64e39cc874f51a48cead0b20d8b2ec686f"],"state_sha256":"145a17884e8dc1564d6d6fce75ab57af5116964ff8ab357b2d59108b959222b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTf4a93dQNZlUP1Ukp3jSZcaKGAz54Na2aak8EAufnPb894uaURISEQc0c7qhMZeKtebF4OFrIxHHBEORzh9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:37:14.481615Z","bundle_sha256":"2db2038047e59852d931dbb1397d7fc2818ae8d182b12fe9b8a08b05f2493174"}}