{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BQQLLUKJ3GXCSLBN2ODQOKTU3C","short_pith_number":"pith:BQQLLUKJ","schema_version":"1.0","canonical_sha256":"0c20b5d149d9ae292c2dd387072a74d89d3f62c96c9bdd2ffa38ce8022bdf670","source":{"kind":"arxiv","id":"1806.08692","version":1},"attestation_state":"computed","paper":{"title":"Improved bounds for multipass pairing heaps and path-balanced binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dani Dorfman, Haim Kaplan, L\\'aszl\\'o Kozma, Seth Pettie, Uri Zwick","submitted_at":"2018-06-22T14:26:39Z","abstract_excerpt":"We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algorithms for data structure maintenance. The pairing heap is a simple and efficient \"self-adjusting\" heap, introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. In the multipass variant (one of the original pairing heap variants described by Fredman et al.) the minimum item is extracted via repeated pairing rounds in which neighboring siblings are linked.\n  Path-balanced BSTs, proposed by Sleator (Subramanian, 1996), are a natural alternative to Splay trees (Sleator and Tarjan, 1983). In a"},"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":"1806.08692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-22T14:26:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2cc738cea8f4c3e2437cee626c95d457129c8bd453bcc293dc01ab68d4043d5f","abstract_canon_sha256":"e9e0573858a19e1b7029eca5b6e7f47dcdb6da8ef1cdbe41636c09a2fbe5a5d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:36.431780Z","signature_b64":"0R0C7bwhVfxL6897BgKE9crIwlJ1KYmVcLj3fEwrTLEAe9lmO4shazjUJ/zaCSx+SjUeUEdTJdYDSxBiSqQ4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c20b5d149d9ae292c2dd387072a74d89d3f62c96c9bdd2ffa38ce8022bdf670","last_reissued_at":"2026-05-18T00:12:36.431089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:36.431089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved bounds for multipass pairing heaps and path-balanced binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dani Dorfman, Haim Kaplan, L\\'aszl\\'o Kozma, Seth Pettie, Uri Zwick","submitted_at":"2018-06-22T14:26:39Z","abstract_excerpt":"We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algorithms for data structure maintenance. The pairing heap is a simple and efficient \"self-adjusting\" heap, introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. In the multipass variant (one of the original pairing heap variants described by Fredman et al.) the minimum item is extracted via repeated pairing rounds in which neighboring siblings are linked.\n  Path-balanced BSTs, proposed by Sleator (Subramanian, 1996), are a natural alternative to Splay trees (Sleator and Tarjan, 1983). In a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08692","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":"1806.08692","created_at":"2026-05-18T00:12:36.431185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08692v1","created_at":"2026-05-18T00:12:36.431185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08692","created_at":"2026-05-18T00:12:36.431185+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQQLLUKJ3GXC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQQLLUKJ3GXCSLBN","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQQLLUKJ","created_at":"2026-05-18T12:32:16.446611+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/BQQLLUKJ3GXCSLBN2ODQOKTU3C","json":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C.json","graph_json":"https://pith.science/api/pith-number/BQQLLUKJ3GXCSLBN2ODQOKTU3C/graph.json","events_json":"https://pith.science/api/pith-number/BQQLLUKJ3GXCSLBN2ODQOKTU3C/events.json","paper":"https://pith.science/paper/BQQLLUKJ"},"agent_actions":{"view_html":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C","download_json":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C.json","view_paper":"https://pith.science/paper/BQQLLUKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08692&json=true","fetch_graph":"https://pith.science/api/pith-number/BQQLLUKJ3GXCSLBN2ODQOKTU3C/graph.json","fetch_events":"https://pith.science/api/pith-number/BQQLLUKJ3GXCSLBN2ODQOKTU3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/action/storage_attestation","attest_author":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/action/author_attestation","sign_citation":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/action/citation_signature","submit_replication":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/action/replication_record"}},"created_at":"2026-05-18T00:12:36.431185+00:00","updated_at":"2026-05-18T00:12:36.431185+00:00"}