{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TQPCONPMLU7FDLKCKS7EJT3TTT","short_pith_number":"pith:TQPCONPM","schema_version":"1.0","canonical_sha256":"9c1e2735ec5d3e51ad4254be44cf739cd1e5abcdc48a59be42516f9d6aab13dc","source":{"kind":"arxiv","id":"1908.02741","version":4},"attestation_state":"computed","paper":{"title":"Parallel Finger Search Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Seth Gilbert, Wei Quan Lim","submitted_at":"2019-08-07T17:35:50Z","abstract_excerpt":"In this paper we present two versions of a parallel finger structure FS on p processors that supports searches, insertions and deletions, and has a finger at each end. This is to our knowledge the first implementation of a parallel search structure that is work-optimal with respect to the finger bound and yet has very good parallelism (within a factor of O( (log p)^2 ) of optimal). We utilize an extended implicit batching framework that transparently facilitates the use of FS by any parallel program P that is modelled by a dynamically generated DAG D where each node is either a unit-time instr"},"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":"1908.02741","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-07T17:35:50Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f0fe6cbcd5fb743efdf472536386e385ce1bfddc637b331f34c8c40010f48240","abstract_canon_sha256":"e1e9015dd466505562f12b190cdb3b8c7b77d6b240ed76918a3035306c057fe3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:15.209918Z","signature_b64":"Lzocb2v65LV3JjowjnfDX8G01o9/WX35vdEFXnBOjF0F0DaJSfEMil+hjS3RgJ1hWkfouC1qFQtDU23Bk/4ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c1e2735ec5d3e51ad4254be44cf739cd1e5abcdc48a59be42516f9d6aab13dc","last_reissued_at":"2026-07-05T00:11:15.209471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:15.209471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Finger Search Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Seth Gilbert, Wei Quan Lim","submitted_at":"2019-08-07T17:35:50Z","abstract_excerpt":"In this paper we present two versions of a parallel finger structure FS on p processors that supports searches, insertions and deletions, and has a finger at each end. This is to our knowledge the first implementation of a parallel search structure that is work-optimal with respect to the finger bound and yet has very good parallelism (within a factor of O( (log p)^2 ) of optimal). We utilize an extended implicit batching framework that transparently facilitates the use of FS by any parallel program P that is modelled by a dynamically generated DAG D where each node is either a unit-time instr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02741","kind":"arxiv","version":4},"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/1908.02741/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.02741","created_at":"2026-07-05T00:11:15.209524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02741v4","created_at":"2026-07-05T00:11:15.209524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02741","created_at":"2026-07-05T00:11:15.209524+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQPCONPMLU7F","created_at":"2026-07-05T00:11:15.209524+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQPCONPMLU7FDLKC","created_at":"2026-07-05T00:11:15.209524+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQPCONPM","created_at":"2026-07-05T00:11:15.209524+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/TQPCONPMLU7FDLKCKS7EJT3TTT","json":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT.json","graph_json":"https://pith.science/api/pith-number/TQPCONPMLU7FDLKCKS7EJT3TTT/graph.json","events_json":"https://pith.science/api/pith-number/TQPCONPMLU7FDLKCKS7EJT3TTT/events.json","paper":"https://pith.science/paper/TQPCONPM"},"agent_actions":{"view_html":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT","download_json":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT.json","view_paper":"https://pith.science/paper/TQPCONPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02741&json=true","fetch_graph":"https://pith.science/api/pith-number/TQPCONPMLU7FDLKCKS7EJT3TTT/graph.json","fetch_events":"https://pith.science/api/pith-number/TQPCONPMLU7FDLKCKS7EJT3TTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT/action/storage_attestation","attest_author":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT/action/author_attestation","sign_citation":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT/action/citation_signature","submit_replication":"https://pith.science/pith/TQPCONPMLU7FDLKCKS7EJT3TTT/action/replication_record"}},"created_at":"2026-07-05T00:11:15.209524+00:00","updated_at":"2026-07-05T00:11:15.209524+00:00"}