{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BQQLLUKJ3GXCSLBN2ODQOKTU3C","short_pith_number":"pith:BQQLLUKJ","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"},"canonical_sha256":"0c20b5d149d9ae292c2dd387072a74d89d3f62c96c9bdd2ffa38ce8022bdf670","source":{"kind":"arxiv","id":"1806.08692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08692","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08692v1","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08692","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"BQQLLUKJ3GXC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BQQLLUKJ3GXCSLBN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BQQLLUKJ","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BQQLLUKJ3GXCSLBN2ODQOKTU3C","target":"record","payload":{"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"},"canonical_sha256":"0c20b5d149d9ae292c2dd387072a74d89d3f62c96c9bdd2ffa38ce8022bdf670","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"},"source_kind":"arxiv","source_id":"1806.08692","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-18T00:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMTfrxIjt+fqcL6ybEXLoV6YDSkEoGdRIxCcG+dQGh9LeEIEA7EUZzO85b6xCpCHHYWEmpnRIwszyXAdDn/kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:21:46.922711Z"},"content_sha256":"7f7af346341d7985fa0e0fa22242c671ec9618993104133274ffd2c4b4977331","schema_version":"1.0","event_id":"sha256:7f7af346341d7985fa0e0fa22242c671ec9618993104133274ffd2c4b4977331"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BQQLLUKJ3GXCSLBN2ODQOKTU3C","target":"graph","payload":{"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"},"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-18T00:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmuhkxKTfWdtbzzwp8TNAWl/ZTh5wNGNBG4FMRZ8wmk9J3YiUykLv5tsx8jRyuI73Ydl3Rq8pu6ufxg1NG/LBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:21:46.923398Z"},"content_sha256":"ca5dd02a2c9aa9336964f221e9191f67f680ddd5a81d24ed3c7cacaba031887f","schema_version":"1.0","event_id":"sha256:ca5dd02a2c9aa9336964f221e9191f67f680ddd5a81d24ed3c7cacaba031887f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/bundle.json","state_url":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/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-05T16:21:46Z","links":{"resolver":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C","bundle":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/bundle.json","state":"https://pith.science/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQQLLUKJ3GXCSLBN2ODQOKTU3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BQQLLUKJ3GXCSLBN2ODQOKTU3C","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":"e9e0573858a19e1b7029eca5b6e7f47dcdb6da8ef1cdbe41636c09a2fbe5a5d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-22T14:26:39Z","title_canon_sha256":"2cc738cea8f4c3e2437cee626c95d457129c8bd453bcc293dc01ab68d4043d5f"},"schema_version":"1.0","source":{"id":"1806.08692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08692","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08692v1","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08692","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"BQQLLUKJ3GXC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BQQLLUKJ3GXCSLBN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BQQLLUKJ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:ca5dd02a2c9aa9336964f221e9191f67f680ddd5a81d24ed3c7cacaba031887f","target":"graph","created_at":"2026-05-18T00:12:36Z","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":"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","authors_text":"Dani Dorfman, Haim Kaplan, L\\'aszl\\'o Kozma, Seth Pettie, Uri Zwick","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-22T14:26:39Z","title":"Improved bounds for multipass pairing heaps and path-balanced binary search trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08692","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:7f7af346341d7985fa0e0fa22242c671ec9618993104133274ffd2c4b4977331","target":"record","created_at":"2026-05-18T00:12:36Z","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":"e9e0573858a19e1b7029eca5b6e7f47dcdb6da8ef1cdbe41636c09a2fbe5a5d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-22T14:26:39Z","title_canon_sha256":"2cc738cea8f4c3e2437cee626c95d457129c8bd453bcc293dc01ab68d4043d5f"},"schema_version":"1.0","source":{"id":"1806.08692","kind":"arxiv","version":1}},"canonical_sha256":"0c20b5d149d9ae292c2dd387072a74d89d3f62c96c9bdd2ffa38ce8022bdf670","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c20b5d149d9ae292c2dd387072a74d89d3f62c96c9bdd2ffa38ce8022bdf670","first_computed_at":"2026-05-18T00:12:36.431089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:36.431089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0R0C7bwhVfxL6897BgKE9crIwlJ1KYmVcLj3fEwrTLEAe9lmO4shazjUJ/zaCSx+SjUeUEdTJdYDSxBiSqQ4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:36.431780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f7af346341d7985fa0e0fa22242c671ec9618993104133274ffd2c4b4977331","sha256:ca5dd02a2c9aa9336964f221e9191f67f680ddd5a81d24ed3c7cacaba031887f"],"state_sha256":"d5dba41bdbd3a4d16ffd64116a004a721462dd735f65ee0addbc43c33e7119bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRJxm+24lrc2HNWLM+nBDlZ7cFzzWNJR8KL5+XHT+us9ZeGVSlfc5mPAXWfTwoXR43Oo5dH+M2QsV3TpavnbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:21:46.926600Z","bundle_sha256":"4f28f2a3513c7c593d64d01448ee8f7daa6d408379db8e512f65265459b6b9a3"}}