{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:INTLCIA4STWRN4TXCLIHROMHRR","short_pith_number":"pith:INTLCIA4","schema_version":"1.0","canonical_sha256":"4366b1201c94ed16f27712d078b9878c44790593f768f6afef7b41bb3c46b44b","source":{"kind":"arxiv","id":"1002.4248","version":2},"attestation_state":"computed","paper":{"title":"Mergeable Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"John Iacono, \\\"Ozg\\\"ur \\\"Ozkan","submitted_at":"2010-02-23T05:49:00Z","abstract_excerpt":"A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Predecessor-Search, Split and Merge. While Predecessor-Search and Split work in the normal way, the novel operation is Merge. While in a typical mergeable dictionary (e.g. 2-4 Trees), the Merge operation can only be performed on sets that span disjoint intervals in keyspace, the structure here has no such limitation, and permits the merging of arbitrarily interleaved sets. Tarjan and Brown present a data structure which"},"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":"1002.4248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-02-23T05:49:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2ffb10f28839c64865669657cf065364845bac171cd7eeada28aec36c1467bf7","abstract_canon_sha256":"1c6657def9d30243360c681592332085d2c201bd11eda396691800653c4cf2fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:37.000733Z","signature_b64":"4Lt+NZu60EYiFFMr26l/3xtaUVkQYJiiNKQYcm3Cd7lf1cn3OdU/7Bi7PQj05n2iMankeYZEgvVbay2qt3o0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4366b1201c94ed16f27712d078b9878c44790593f768f6afef7b41bb3c46b44b","last_reissued_at":"2026-05-18T03:40:36.999880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:36.999880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mergeable Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"John Iacono, \\\"Ozg\\\"ur \\\"Ozkan","submitted_at":"2010-02-23T05:49:00Z","abstract_excerpt":"A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Predecessor-Search, Split and Merge. While Predecessor-Search and Split work in the normal way, the novel operation is Merge. While in a typical mergeable dictionary (e.g. 2-4 Trees), the Merge operation can only be performed on sets that span disjoint intervals in keyspace, the structure here has no such limitation, and permits the merging of arbitrarily interleaved sets. Tarjan and Brown present a data structure which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4248","kind":"arxiv","version":2},"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":"1002.4248","created_at":"2026-05-18T03:40:37.000034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.4248v2","created_at":"2026-05-18T03:40:37.000034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4248","created_at":"2026-05-18T03:40:37.000034+00:00"},{"alias_kind":"pith_short_12","alias_value":"INTLCIA4STWR","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"INTLCIA4STWRN4TX","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"INTLCIA4","created_at":"2026-05-18T12:26:09.077623+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/INTLCIA4STWRN4TXCLIHROMHRR","json":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR.json","graph_json":"https://pith.science/api/pith-number/INTLCIA4STWRN4TXCLIHROMHRR/graph.json","events_json":"https://pith.science/api/pith-number/INTLCIA4STWRN4TXCLIHROMHRR/events.json","paper":"https://pith.science/paper/INTLCIA4"},"agent_actions":{"view_html":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR","download_json":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR.json","view_paper":"https://pith.science/paper/INTLCIA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.4248&json=true","fetch_graph":"https://pith.science/api/pith-number/INTLCIA4STWRN4TXCLIHROMHRR/graph.json","fetch_events":"https://pith.science/api/pith-number/INTLCIA4STWRN4TXCLIHROMHRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR/action/storage_attestation","attest_author":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR/action/author_attestation","sign_citation":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR/action/citation_signature","submit_replication":"https://pith.science/pith/INTLCIA4STWRN4TXCLIHROMHRR/action/replication_record"}},"created_at":"2026-05-18T03:40:37.000034+00:00","updated_at":"2026-05-18T03:40:37.000034+00:00"}