{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ORV42EHMR7P3EXXQUW723X66IC","short_pith_number":"pith:ORV42EHM","schema_version":"1.0","canonical_sha256":"746bcd10ec8fdfb25ef0a5bfaddfde40850485462cb4b5923c83fb22f6870007","source":{"kind":"arxiv","id":"1901.00718","version":1},"attestation_state":"computed","paper":{"title":"Mergeable Dictionaries With Shifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Mikko Berggren Etienne, Philip Bille","submitted_at":"2019-01-03T13:58:15Z","abstract_excerpt":"We revisit the mergeable dictionaries with shift problem, where the goal is to maintain a family of sets subject to search, split, merge, make-set, and shift operations. The search, split, and make-set operations are the usual well-known textbook operations. The merge operation merges two sets and the shift operation adds or subtracts an integer from all elements in a set. Note that unlike the join operation on standard balanced search tree structures, such as AVL trees or 2-4 trees, the merge operation has no restriction on the key space of the input sets and supports merging arbitrarily inte"},"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":"1901.00718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-03T13:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"56a0e87f969c93fe86b22f80c146cbf03c54cf25a2c509dfded7d8c6ee0b3ee8","abstract_canon_sha256":"1048aa413769650bfbd4b80718050ec6c3b28fa62a436fff7b9360409cf9b9ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:01.561103Z","signature_b64":"b0L04FFlQHN2Clg6UhmonZ+qdtNJlKBG1PDCs7Cb2OHkxhypn6/DfuOHJIHJhQwI4xPMZlv4cvHQ1OM2FK3wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"746bcd10ec8fdfb25ef0a5bfaddfde40850485462cb4b5923c83fb22f6870007","last_reissued_at":"2026-05-17T23:57:01.560563Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:01.560563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mergeable Dictionaries With Shifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Mikko Berggren Etienne, Philip Bille","submitted_at":"2019-01-03T13:58:15Z","abstract_excerpt":"We revisit the mergeable dictionaries with shift problem, where the goal is to maintain a family of sets subject to search, split, merge, make-set, and shift operations. The search, split, and make-set operations are the usual well-known textbook operations. The merge operation merges two sets and the shift operation adds or subtracts an integer from all elements in a set. Note that unlike the join operation on standard balanced search tree structures, such as AVL trees or 2-4 trees, the merge operation has no restriction on the key space of the input sets and supports merging arbitrarily inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00718","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.00718","created_at":"2026-05-17T23:57:01.560642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00718v1","created_at":"2026-05-17T23:57:01.560642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00718","created_at":"2026-05-17T23:57:01.560642+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORV42EHMR7P3","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORV42EHMR7P3EXXQ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORV42EHM","created_at":"2026-05-18T12:33:24.271573+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/ORV42EHMR7P3EXXQUW723X66IC","json":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC.json","graph_json":"https://pith.science/api/pith-number/ORV42EHMR7P3EXXQUW723X66IC/graph.json","events_json":"https://pith.science/api/pith-number/ORV42EHMR7P3EXXQUW723X66IC/events.json","paper":"https://pith.science/paper/ORV42EHM"},"agent_actions":{"view_html":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC","download_json":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC.json","view_paper":"https://pith.science/paper/ORV42EHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00718&json=true","fetch_graph":"https://pith.science/api/pith-number/ORV42EHMR7P3EXXQUW723X66IC/graph.json","fetch_events":"https://pith.science/api/pith-number/ORV42EHMR7P3EXXQUW723X66IC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC/action/storage_attestation","attest_author":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC/action/author_attestation","sign_citation":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC/action/citation_signature","submit_replication":"https://pith.science/pith/ORV42EHMR7P3EXXQUW723X66IC/action/replication_record"}},"created_at":"2026-05-17T23:57:01.560642+00:00","updated_at":"2026-05-17T23:57:01.560642+00:00"}