{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2VBALB7VIOVVQFOGFJR5FX2ZLH","short_pith_number":"pith:2VBALB7V","canonical_record":{"source":{"id":"1709.01152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T20:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"f4e5b233267d9260202d5b4ee400fd8b4669c6b51802e31ca5747368f0790a52","abstract_canon_sha256":"6a9ece92eea97656c6d8a925fd8fca15598acc7c8bb8fa4429bf38bbc18f78dc"},"schema_version":"1.0"},"canonical_sha256":"d5420587f543ab5815c62a63d2df5959d7c8cc1882cf6d6363dec036bc1da0bc","source":{"kind":"arxiv","id":"1709.01152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01152","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01152v2","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01152","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"2VBALB7VIOVV","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VBALB7VIOVVQFOG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VBALB7V","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2VBALB7VIOVVQFOGFJR5FX2ZLH","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T20:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"f4e5b233267d9260202d5b4ee400fd8b4669c6b51802e31ca5747368f0790a52","abstract_canon_sha256":"6a9ece92eea97656c6d8a925fd8fca15598acc7c8bb8fa4429bf38bbc18f78dc"},"schema_version":"1.0"},"canonical_sha256":"d5420587f543ab5815c62a63d2df5959d7c8cc1882cf6d6363dec036bc1da0bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:43.875072Z","signature_b64":"itOvEZI91OrheUmXtA37g3qBQip/b3zi7TL8SWydY40BoWrTkIrab7/ziAfEfH31GqhY4aOMJgRRQI2NVZ04BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5420587f543ab5815c62a63d2df5959d7c8cc1882cf6d6363dec036bc1da0bc","last_reissued_at":"2026-05-18T00:12:43.874624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:43.874624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01152","source_version":2,"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9NAYFcRId71WetaHDc3YrteDQuSnktPUb+vSlxqvMhrGosNxiSeQMqvOIOwuGX+UEUYGsRsbpQch0MXy/XA9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:24:04.353261Z"},"content_sha256":"f1ae74d43a5fff1f0571bfe99f855b82385a3f8379341a8ac4f48b26abe6ee5c","schema_version":"1.0","event_id":"sha256:f1ae74d43a5fff1f0571bfe99f855b82385a3f8379341a8ac4f48b26abe6ee5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2VBALB7VIOVVQFOGFJR5FX2ZLH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pairing heaps: the forward variant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dani Dorfman, Haim Kaplan, L\\'aszl\\'o Kozma, Uri Zwick","submitted_at":"2017-09-04T20:57:44Z","abstract_excerpt":"The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. It is remarkable both for its simplicity and for its excellent performance in practice. The \"magic\" of pairing heaps lies in the restructuring that happens after the deletion of the smallest item. The resulting collection of trees is consolidated in two rounds: a left-to-right pairing round, followed by a right-to-left accumulation round. Fredman et al. showed, via an elegant correspondence to splay trees, that in a pairing heap of size $n$ all operations take $O(\\log{n})$ amortiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01152","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"},"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8uJ5FlipzPami5nYMLHQMSl37ZMCHM9bR3YLvY3sLnmlWuNHrmTfpLxIsRMj5A7Iu7O7b7IYm1IhlqHbbpcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:24:04.353879Z"},"content_sha256":"4ed79c33808ff6921d631d56356b30a86d3daa7800f39ef57c15333c83ba85c2","schema_version":"1.0","event_id":"sha256:4ed79c33808ff6921d631d56356b30a86d3daa7800f39ef57c15333c83ba85c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VBALB7VIOVVQFOGFJR5FX2ZLH/bundle.json","state_url":"https://pith.science/pith/2VBALB7VIOVVQFOGFJR5FX2ZLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VBALB7VIOVVQFOGFJR5FX2ZLH/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-05T23:24:04Z","links":{"resolver":"https://pith.science/pith/2VBALB7VIOVVQFOGFJR5FX2ZLH","bundle":"https://pith.science/pith/2VBALB7VIOVVQFOGFJR5FX2ZLH/bundle.json","state":"https://pith.science/pith/2VBALB7VIOVVQFOGFJR5FX2ZLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VBALB7VIOVVQFOGFJR5FX2ZLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2VBALB7VIOVVQFOGFJR5FX2ZLH","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":"6a9ece92eea97656c6d8a925fd8fca15598acc7c8bb8fa4429bf38bbc18f78dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T20:57:44Z","title_canon_sha256":"f4e5b233267d9260202d5b4ee400fd8b4669c6b51802e31ca5747368f0790a52"},"schema_version":"1.0","source":{"id":"1709.01152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01152","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01152v2","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01152","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"2VBALB7VIOVV","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VBALB7VIOVVQFOG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VBALB7V","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:4ed79c33808ff6921d631d56356b30a86d3daa7800f39ef57c15333c83ba85c2","target":"graph","created_at":"2026-05-18T00:12:43Z","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":"The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. It is remarkable both for its simplicity and for its excellent performance in practice. The \"magic\" of pairing heaps lies in the restructuring that happens after the deletion of the smallest item. The resulting collection of trees is consolidated in two rounds: a left-to-right pairing round, followed by a right-to-left accumulation round. Fredman et al. showed, via an elegant correspondence to splay trees, that in a pairing heap of size $n$ all operations take $O(\\log{n})$ amortiz","authors_text":"Dani Dorfman, Haim Kaplan, L\\'aszl\\'o Kozma, Uri Zwick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T20:57:44Z","title":"Pairing heaps: the forward variant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01152","kind":"arxiv","version":2},"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:f1ae74d43a5fff1f0571bfe99f855b82385a3f8379341a8ac4f48b26abe6ee5c","target":"record","created_at":"2026-05-18T00:12:43Z","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":"6a9ece92eea97656c6d8a925fd8fca15598acc7c8bb8fa4429bf38bbc18f78dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T20:57:44Z","title_canon_sha256":"f4e5b233267d9260202d5b4ee400fd8b4669c6b51802e31ca5747368f0790a52"},"schema_version":"1.0","source":{"id":"1709.01152","kind":"arxiv","version":2}},"canonical_sha256":"d5420587f543ab5815c62a63d2df5959d7c8cc1882cf6d6363dec036bc1da0bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5420587f543ab5815c62a63d2df5959d7c8cc1882cf6d6363dec036bc1da0bc","first_computed_at":"2026-05-18T00:12:43.874624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:43.874624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"itOvEZI91OrheUmXtA37g3qBQip/b3zi7TL8SWydY40BoWrTkIrab7/ziAfEfH31GqhY4aOMJgRRQI2NVZ04BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:43.875072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1ae74d43a5fff1f0571bfe99f855b82385a3f8379341a8ac4f48b26abe6ee5c","sha256:4ed79c33808ff6921d631d56356b30a86d3daa7800f39ef57c15333c83ba85c2"],"state_sha256":"7c30c312ae134bb710c954e23f1ef399112c784305545d0dc4d7042f496bf8e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJA1drw+0GFjK4Yt1SzObp37IHjcvgrp+LbL08v86FQUSUYRx/mcnq7b5DpLMFO1DsVmIX9uHhLXMWfNk4biBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:24:04.357498Z","bundle_sha256":"0acb8d6f20ea9d09251b345a705b88fb823124a1c98afe347bcd48238a76c1ef"}}