{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SQQ2I5B4AQN3MQAXFUOBZ6QXFM","short_pith_number":"pith:SQQ2I5B4","canonical_record":{"source":{"id":"1603.05922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-18T16:55:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bf0ed50711f51e62619f804ea8a837c0a2c0f5adf83a582662ca9c7f6ea9d8db","abstract_canon_sha256":"8f3c0b42cf32f24dce899bb2581714cbbb0014c8a6837dba7c35c1d90b8baf2e"},"schema_version":"1.0"},"canonical_sha256":"9421a4743c041bb640172d1c1cfa172b3003cff91b6c6cf4da70051690643c7d","source":{"kind":"arxiv","id":"1603.05922","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05922","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05922v1","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05922","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"SQQ2I5B4AQN3","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SQQ2I5B4AQN3MQAX","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SQQ2I5B4","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SQQ2I5B4AQN3MQAXFUOBZ6QXFM","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-18T16:55:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bf0ed50711f51e62619f804ea8a837c0a2c0f5adf83a582662ca9c7f6ea9d8db","abstract_canon_sha256":"8f3c0b42cf32f24dce899bb2581714cbbb0014c8a6837dba7c35c1d90b8baf2e"},"schema_version":"1.0"},"canonical_sha256":"9421a4743c041bb640172d1c1cfa172b3003cff91b6c6cf4da70051690643c7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.295568Z","signature_b64":"zrH2hcdd88n0FtQ3fdQUxGWBLS5rr2asOz9a0q75PztyFl91npDYXwi5uPhhbGu1FcN1dCy254YhI9gUGCAEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9421a4743c041bb640172d1c1cfa172b3003cff91b6c6cf4da70051690643c7d","last_reissued_at":"2026-05-18T01:18:53.294926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.294926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05922","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-05-18T01:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDt81otgyNpaApQ537LYVjh3ItK9wNjN5dCpHTV6I8/EFyOxYSnO7zQRYrPBp0pvKAsE23NSiIU6x0/P1hTNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:55:43.008252Z"},"content_sha256":"56f7803d3403f2caa4bec73cc497324a3b1b62161fb5dd5f4d0cfa0581af2d2a","schema_version":"1.0","event_id":"sha256:56f7803d3403f2caa4bec73cc497324a3b1b62161fb5dd5f4d0cfa0581af2d2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SQQ2I5B4AQN3MQAXFUOBZ6QXFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Empirical Evaluation of a Thread-Safe Dynamic Range Min-Max Tree using HTM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Erick Elejalde, Jose Fuentes-Sep\\'ulveda, Leo Ferres","submitted_at":"2016-03-18T16:55:16Z","abstract_excerpt":"Succinct trees, such as wavelet trees and those based on, for instance, range Min-Max trees (RMMTs), are a family of practical data structures that store information close to their information-theoretic space lower bound. These structures are often static; meaning that once they are built, nodes cannot be added, deleted or modified. This read-only property simplifies concurrency. However, newer versions of these data structures allow for a fair degree of dynamism. Parallel programming using Hardware Transactional Memory(HTM), has been available in mainstream microprocessors since a few years a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05922","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":""},"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-18T01:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZM6k5dnUAD49TqKvPIgOf8SKXJc+81g+x3XyH7N6ggFrTZ4adp3674zCawMxaSvLvbgnexEh7RV7bsivYCyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:55:43.008618Z"},"content_sha256":"8790941a781d732096228a53b2870c66f7f2b9e9b3121c58d0522cab405c4f1f","schema_version":"1.0","event_id":"sha256:8790941a781d732096228a53b2870c66f7f2b9e9b3121c58d0522cab405c4f1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQQ2I5B4AQN3MQAXFUOBZ6QXFM/bundle.json","state_url":"https://pith.science/pith/SQQ2I5B4AQN3MQAXFUOBZ6QXFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQQ2I5B4AQN3MQAXFUOBZ6QXFM/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-25T06:55:43Z","links":{"resolver":"https://pith.science/pith/SQQ2I5B4AQN3MQAXFUOBZ6QXFM","bundle":"https://pith.science/pith/SQQ2I5B4AQN3MQAXFUOBZ6QXFM/bundle.json","state":"https://pith.science/pith/SQQ2I5B4AQN3MQAXFUOBZ6QXFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQQ2I5B4AQN3MQAXFUOBZ6QXFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SQQ2I5B4AQN3MQAXFUOBZ6QXFM","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":"8f3c0b42cf32f24dce899bb2581714cbbb0014c8a6837dba7c35c1d90b8baf2e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-18T16:55:16Z","title_canon_sha256":"bf0ed50711f51e62619f804ea8a837c0a2c0f5adf83a582662ca9c7f6ea9d8db"},"schema_version":"1.0","source":{"id":"1603.05922","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05922","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05922v1","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05922","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"SQQ2I5B4AQN3","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SQQ2I5B4AQN3MQAX","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SQQ2I5B4","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:8790941a781d732096228a53b2870c66f7f2b9e9b3121c58d0522cab405c4f1f","target":"graph","created_at":"2026-05-18T01:18:53Z","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":"Succinct trees, such as wavelet trees and those based on, for instance, range Min-Max trees (RMMTs), are a family of practical data structures that store information close to their information-theoretic space lower bound. These structures are often static; meaning that once they are built, nodes cannot be added, deleted or modified. This read-only property simplifies concurrency. However, newer versions of these data structures allow for a fair degree of dynamism. Parallel programming using Hardware Transactional Memory(HTM), has been available in mainstream microprocessors since a few years a","authors_text":"Erick Elejalde, Jose Fuentes-Sep\\'ulveda, Leo Ferres","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-18T16:55:16Z","title":"Empirical Evaluation of a Thread-Safe Dynamic Range Min-Max Tree using HTM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05922","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:56f7803d3403f2caa4bec73cc497324a3b1b62161fb5dd5f4d0cfa0581af2d2a","target":"record","created_at":"2026-05-18T01:18:53Z","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":"8f3c0b42cf32f24dce899bb2581714cbbb0014c8a6837dba7c35c1d90b8baf2e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-18T16:55:16Z","title_canon_sha256":"bf0ed50711f51e62619f804ea8a837c0a2c0f5adf83a582662ca9c7f6ea9d8db"},"schema_version":"1.0","source":{"id":"1603.05922","kind":"arxiv","version":1}},"canonical_sha256":"9421a4743c041bb640172d1c1cfa172b3003cff91b6c6cf4da70051690643c7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9421a4743c041bb640172d1c1cfa172b3003cff91b6c6cf4da70051690643c7d","first_computed_at":"2026-05-18T01:18:53.294926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:53.294926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zrH2hcdd88n0FtQ3fdQUxGWBLS5rr2asOz9a0q75PztyFl91npDYXwi5uPhhbGu1FcN1dCy254YhI9gUGCAEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:53.295568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05922","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56f7803d3403f2caa4bec73cc497324a3b1b62161fb5dd5f4d0cfa0581af2d2a","sha256:8790941a781d732096228a53b2870c66f7f2b9e9b3121c58d0522cab405c4f1f"],"state_sha256":"12fee1ebfdba453ceacb9f6948c57a671f17e5035bd83da478f468ef77e89891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNsroTZCcwDprJB+TMqY3JJgfCtbalSL3SSohw8tUxq2t1CJqlIdpKhDl/I11lHi0FQJUoEU1pSbVSa4Vwv9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:55:43.010543Z","bundle_sha256":"10680530ba751fe1ef128a15da53630a19755b11849fc8b9bd6983f4dd15de82"}}