{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SY2Z2EWPEBZDYPUCQSIEGBPRP6","short_pith_number":"pith:SY2Z2EWP","canonical_record":{"source":{"id":"2405.07434","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-13T02:27:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8bbf5c464624aa9337ede3ce66f58b161009fee38ce171f912de37effc535d41","abstract_canon_sha256":"b982503cd99b9cef990143ff0d6e2b833f07c7483c9a364812983f7775061975"},"schema_version":"1.0"},"canonical_sha256":"96359d12cf20723c3e8284904305f17f98d79f7a06c5e7dcb18b8f356fa41be2","source":{"kind":"arxiv","id":"2405.07434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.07434","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2405.07434v1","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07434","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"SY2Z2EWPEBZD","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"SY2Z2EWPEBZDYPUC","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"SY2Z2EWP","created_at":"2026-07-05T08:18:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SY2Z2EWPEBZDYPUCQSIEGBPRP6","target":"record","payload":{"canonical_record":{"source":{"id":"2405.07434","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-13T02:27:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8bbf5c464624aa9337ede3ce66f58b161009fee38ce171f912de37effc535d41","abstract_canon_sha256":"b982503cd99b9cef990143ff0d6e2b833f07c7483c9a364812983f7775061975"},"schema_version":"1.0"},"canonical_sha256":"96359d12cf20723c3e8284904305f17f98d79f7a06c5e7dcb18b8f356fa41be2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:22.491879Z","signature_b64":"Q2W5paStyqpHvse+f69W/lOqfAqUesCrqbVeJQtftqFZGOBQNKwCQYe/9LMnyk9y/+7iRXQmmjScv1MUnyhqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96359d12cf20723c3e8284904305f17f98d79f7a06c5e7dcb18b8f356fa41be2","last_reissued_at":"2026-07-05T08:18:22.491444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:22.491444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.07434","source_version":1,"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-07-05T08:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7K3BZYe5cFAszb/590UNM2mtIwVwcE/Uju7/yoo6IZMVKjeakaxPaxxXBCktEXY7oigam4Rgq2ywUi0E1IhuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:50:04.914504Z"},"content_sha256":"650afc1871565df19f2c1bc826ec11b4dfb0dfdbb554d28d93091669289c6c69","schema_version":"1.0","event_id":"sha256:650afc1871565df19f2c1bc826ec11b4dfb0dfdbb554d28d93091669289c6c69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SY2Z2EWPEBZDYPUCQSIEGBPRP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concurrent aggregate queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Erez Petrank, Gal Sela","submitted_at":"2024-05-13T02:27:27Z","abstract_excerpt":"Concurrent data structures serve as fundamental building blocks for concurrent computing. Many concurrent counterparts have been designed for basic sequential mechanisms; however, one notable omission is a concurrent tree that supports aggregate queries. Aggregate queries essentially compile succinct information about a range of data items, for example, calculating the average salary of employees in their 30s. Such queries play an essential role in various applications and are commonly taught in undergraduate data structures courses. In this paper, we formalize a type of aggregate queries that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07434","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.07434/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjmkAD74rFJ40aYjYB+zEGCRwVzf++SsrOspF0Gogv5tgBTfPCvwmabVvhO5vZwaDtamVMdinRANPjQo7JtCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:50:04.915133Z"},"content_sha256":"2de00056670a36378fefa3947b2b6fcb500204f1e8156faea74162ba6cc061e5","schema_version":"1.0","event_id":"sha256:2de00056670a36378fefa3947b2b6fcb500204f1e8156faea74162ba6cc061e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SY2Z2EWPEBZDYPUCQSIEGBPRP6/bundle.json","state_url":"https://pith.science/pith/SY2Z2EWPEBZDYPUCQSIEGBPRP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SY2Z2EWPEBZDYPUCQSIEGBPRP6/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-07-07T07:50:04Z","links":{"resolver":"https://pith.science/pith/SY2Z2EWPEBZDYPUCQSIEGBPRP6","bundle":"https://pith.science/pith/SY2Z2EWPEBZDYPUCQSIEGBPRP6/bundle.json","state":"https://pith.science/pith/SY2Z2EWPEBZDYPUCQSIEGBPRP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SY2Z2EWPEBZDYPUCQSIEGBPRP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SY2Z2EWPEBZDYPUCQSIEGBPRP6","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":"b982503cd99b9cef990143ff0d6e2b833f07c7483c9a364812983f7775061975","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-13T02:27:27Z","title_canon_sha256":"8bbf5c464624aa9337ede3ce66f58b161009fee38ce171f912de37effc535d41"},"schema_version":"1.0","source":{"id":"2405.07434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.07434","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2405.07434v1","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07434","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"SY2Z2EWPEBZD","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"SY2Z2EWPEBZDYPUC","created_at":"2026-07-05T08:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"SY2Z2EWP","created_at":"2026-07-05T08:18:22Z"}],"graph_snapshots":[{"event_id":"sha256:2de00056670a36378fefa3947b2b6fcb500204f1e8156faea74162ba6cc061e5","target":"graph","created_at":"2026-07-05T08:18:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.07434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Concurrent data structures serve as fundamental building blocks for concurrent computing. Many concurrent counterparts have been designed for basic sequential mechanisms; however, one notable omission is a concurrent tree that supports aggregate queries. Aggregate queries essentially compile succinct information about a range of data items, for example, calculating the average salary of employees in their 30s. Such queries play an essential role in various applications and are commonly taught in undergraduate data structures courses. In this paper, we formalize a type of aggregate queries that","authors_text":"Erez Petrank, Gal Sela","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-13T02:27:27Z","title":"Concurrent aggregate queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07434","kind":"arxiv","version":1},"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:650afc1871565df19f2c1bc826ec11b4dfb0dfdbb554d28d93091669289c6c69","target":"record","created_at":"2026-07-05T08:18:22Z","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":"b982503cd99b9cef990143ff0d6e2b833f07c7483c9a364812983f7775061975","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-13T02:27:27Z","title_canon_sha256":"8bbf5c464624aa9337ede3ce66f58b161009fee38ce171f912de37effc535d41"},"schema_version":"1.0","source":{"id":"2405.07434","kind":"arxiv","version":1}},"canonical_sha256":"96359d12cf20723c3e8284904305f17f98d79f7a06c5e7dcb18b8f356fa41be2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96359d12cf20723c3e8284904305f17f98d79f7a06c5e7dcb18b8f356fa41be2","first_computed_at":"2026-07-05T08:18:22.491444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:18:22.491444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q2W5paStyqpHvse+f69W/lOqfAqUesCrqbVeJQtftqFZGOBQNKwCQYe/9LMnyk9y/+7iRXQmmjScv1MUnyhqBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:18:22.491879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.07434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:650afc1871565df19f2c1bc826ec11b4dfb0dfdbb554d28d93091669289c6c69","sha256:2de00056670a36378fefa3947b2b6fcb500204f1e8156faea74162ba6cc061e5"],"state_sha256":"355c7ba8138bb412a29b8cb96a6d3ccd04e0e998f0ccbea3cdbd6893edfaa0b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XVRD2zV1ehbhXT86nSYd4qWEmR6SCMwucvhcSRtor1OjfOOAITYC7xzoFXp7ZkmUyEOkpZIhSq2xYRHhj3xAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:50:04.917810Z","bundle_sha256":"4f844f7a0c7f8b606beb3ffdb98315f368f5e797e7e645d165801a169d448397"}}