{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:O52VW6MBM7XT4SUAFPH2RNMQTF","short_pith_number":"pith:O52VW6MB","canonical_record":{"source":{"id":"2507.20041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-26T19:07:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"69e5d9dde0fb5f7fa6234259ce5ed6a5c36ba13c1ece0b16b09beb69831f1120","abstract_canon_sha256":"e2c837d30779d071e9abfbaf76cb3dff56af2d277e112c0b2a42bd90b2fec5cf"},"schema_version":"1.0"},"canonical_sha256":"77755b798167ef3e4a802bcfa8b5909967f50576b8945de71f87330d151e2bd3","source":{"kind":"arxiv","id":"2507.20041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20041","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20041v1","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20041","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"O52VW6MBM7XT","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"pith_short_16","alias_value":"O52VW6MBM7XT4SUA","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"pith_short_8","alias_value":"O52VW6MB","created_at":"2026-07-05T11:43:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:O52VW6MBM7XT4SUAFPH2RNMQTF","target":"record","payload":{"canonical_record":{"source":{"id":"2507.20041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-26T19:07:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"69e5d9dde0fb5f7fa6234259ce5ed6a5c36ba13c1ece0b16b09beb69831f1120","abstract_canon_sha256":"e2c837d30779d071e9abfbaf76cb3dff56af2d277e112c0b2a42bd90b2fec5cf"},"schema_version":"1.0"},"canonical_sha256":"77755b798167ef3e4a802bcfa8b5909967f50576b8945de71f87330d151e2bd3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:47.145172Z","signature_b64":"ersI+ZRDT5WlDcNHG4OWijZ5KIyqz2VwQB976BPz2pgg8T19CX6EU9ShlSViGqZnr11ydjKyqePv70MKsmbGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77755b798167ef3e4a802bcfa8b5909967f50576b8945de71f87330d151e2bd3","last_reissued_at":"2026-07-05T11:43:47.144725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:47.144725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.20041","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-05T11:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjhmmynYzEfMxenlwLIqUQCLPQ2NU1f2RQrOHYoWsv7Wxfo7CKuQ4bzrEMxCpgGngxp9FFcdeoqwBjgIJy2HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:10:00.952842Z"},"content_sha256":"0d525a66e681551e4fb47b952092df943abc3d67445d67202bd6558ea1a4175c","schema_version":"1.0","event_id":"sha256:0d525a66e681551e4fb47b952092df943abc3d67445d67202bd6558ea1a4175c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:O52VW6MBM7XT4SUAFPH2RNMQTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Daniel Manor, Mor Perry, Moshe Sulamy","submitted_at":"2025-07-26T19:07:16Z","abstract_excerpt":"In concurrent data structures, the efficiency of set operations can vary significantly depending on the workload characteristics. Numerous concurrent set implementations are optimized and fine-tuned to excel in scenarios characterized by predominant read operations. However, they often perform poorly when confronted with workloads that heavily prioritize updates. Additionally, current leading-edge concurrent sets optimized for update-heavy tasks typically lack efficiency in handling atomic range queries. This study introduces the MTASet, which leverages a concurrent (a,b)-tree implementation. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20041","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/2507.20041/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-05T11:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xnYL1yXoPAdXqixn1c3dTTm44S2ncAdgalv3+Q0zfrG5DM/jXnhtSF2Uyw+bqwjmJSqfzUhz7u0im2AENeobAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:10:00.953210Z"},"content_sha256":"1ae257829e80983d6991097047c0069ba6554be66d0f879fa8390cab0a2bf144","schema_version":"1.0","event_id":"sha256:1ae257829e80983d6991097047c0069ba6554be66d0f879fa8390cab0a2bf144"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O52VW6MBM7XT4SUAFPH2RNMQTF/bundle.json","state_url":"https://pith.science/pith/O52VW6MBM7XT4SUAFPH2RNMQTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O52VW6MBM7XT4SUAFPH2RNMQTF/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-06T15:10:00Z","links":{"resolver":"https://pith.science/pith/O52VW6MBM7XT4SUAFPH2RNMQTF","bundle":"https://pith.science/pith/O52VW6MBM7XT4SUAFPH2RNMQTF/bundle.json","state":"https://pith.science/pith/O52VW6MBM7XT4SUAFPH2RNMQTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O52VW6MBM7XT4SUAFPH2RNMQTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:O52VW6MBM7XT4SUAFPH2RNMQTF","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":"e2c837d30779d071e9abfbaf76cb3dff56af2d277e112c0b2a42bd90b2fec5cf","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-26T19:07:16Z","title_canon_sha256":"69e5d9dde0fb5f7fa6234259ce5ed6a5c36ba13c1ece0b16b09beb69831f1120"},"schema_version":"1.0","source":{"id":"2507.20041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20041","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20041v1","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20041","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"O52VW6MBM7XT","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"pith_short_16","alias_value":"O52VW6MBM7XT4SUA","created_at":"2026-07-05T11:43:47Z"},{"alias_kind":"pith_short_8","alias_value":"O52VW6MB","created_at":"2026-07-05T11:43:47Z"}],"graph_snapshots":[{"event_id":"sha256:1ae257829e80983d6991097047c0069ba6554be66d0f879fa8390cab0a2bf144","target":"graph","created_at":"2026-07-05T11:43:47Z","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/2507.20041/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In concurrent data structures, the efficiency of set operations can vary significantly depending on the workload characteristics. Numerous concurrent set implementations are optimized and fine-tuned to excel in scenarios characterized by predominant read operations. However, they often perform poorly when confronted with workloads that heavily prioritize updates. Additionally, current leading-edge concurrent sets optimized for update-heavy tasks typically lack efficiency in handling atomic range queries. This study introduces the MTASet, which leverages a concurrent (a,b)-tree implementation. ","authors_text":"Daniel Manor, Mor Perry, Moshe Sulamy","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-26T19:07:16Z","title":"MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20041","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:0d525a66e681551e4fb47b952092df943abc3d67445d67202bd6558ea1a4175c","target":"record","created_at":"2026-07-05T11:43:47Z","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":"e2c837d30779d071e9abfbaf76cb3dff56af2d277e112c0b2a42bd90b2fec5cf","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-26T19:07:16Z","title_canon_sha256":"69e5d9dde0fb5f7fa6234259ce5ed6a5c36ba13c1ece0b16b09beb69831f1120"},"schema_version":"1.0","source":{"id":"2507.20041","kind":"arxiv","version":1}},"canonical_sha256":"77755b798167ef3e4a802bcfa8b5909967f50576b8945de71f87330d151e2bd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77755b798167ef3e4a802bcfa8b5909967f50576b8945de71f87330d151e2bd3","first_computed_at":"2026-07-05T11:43:47.144725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:47.144725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ersI+ZRDT5WlDcNHG4OWijZ5KIyqz2VwQB976BPz2pgg8T19CX6EU9ShlSViGqZnr11ydjKyqePv70MKsmbGDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:47.145172Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d525a66e681551e4fb47b952092df943abc3d67445d67202bd6558ea1a4175c","sha256:1ae257829e80983d6991097047c0069ba6554be66d0f879fa8390cab0a2bf144"],"state_sha256":"26bb542975ed9d83c71fd1407d7866499c8b0f130ab20d01e5ae1b16802524d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/odGMbWVD6i12cplyCRyYvykQTQUHdiGjqOjlVcRnfZ1khLWqX7c6UZEvu1ii3xxHdNw2Ny9UeViQEEAncmrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:10:00.955291Z","bundle_sha256":"eddef5c9a3b46f9900471f6f64818e3de37ece0c4206e37ebd809a989772c1f3"}}