{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B2ZCGCHVCKC7IX7RFP6UWHCITT","short_pith_number":"pith:B2ZCGCHV","schema_version":"1.0","canonical_sha256":"0eb22308f51285f45ff12bfd4b1c489ced7c513fd6ac47a9333229e560141fa6","source":{"kind":"arxiv","id":"1407.6665","version":1},"attestation_state":"computed","paper":{"title":"A Tight Lower Bound for Decrease-Key in the Pure Heap Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Iacono, \\\"Ozg\\\"ur \\\"Ozkan","submitted_at":"2014-06-27T23:11:29Z","abstract_excerpt":"We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap model and show that any pure-heap-model heap (that has a \\bigoh{\\log n} amortized-time extract-min operation) must spend \\bigom{\\log\\log n} amortized time on the decrease-key operation. Our result shows that sort heaps as well as pure-heap variants of numerous other heaps have asymptotically optimal decrease-key operations in the pure heap model. In addition, our improved lower bound matches the lower bound of Fredman [J. ACM 46(4):473-501 (1999)] for pairing heaps [M.L. Fredman, R. Sedgewick, D.D. "},"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":"1407.6665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-27T23:11:29Z","cross_cats_sorted":[],"title_canon_sha256":"656a61eb433097c1f3e119eee7804ccf3b708114310108d8c73e2fd4a3aa9eff","abstract_canon_sha256":"58a92a6c7a19257dd4c484763a933a76d008d8e1fde1d2248699a1249abb280d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:38.258328Z","signature_b64":"jE8hIy/zHsQDNH/Ul2E1JLivWKWyqLrCYExCTVNayAF0wuGztqD1bhThqpdWT2c6hRxVy1Lucm1FyJrHEap5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb22308f51285f45ff12bfd4b1c489ced7c513fd6ac47a9333229e560141fa6","last_reissued_at":"2026-05-18T02:46:38.257844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:38.257844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Lower Bound for Decrease-Key in the Pure Heap Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Iacono, \\\"Ozg\\\"ur \\\"Ozkan","submitted_at":"2014-06-27T23:11:29Z","abstract_excerpt":"We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap model and show that any pure-heap-model heap (that has a \\bigoh{\\log n} amortized-time extract-min operation) must spend \\bigom{\\log\\log n} amortized time on the decrease-key operation. Our result shows that sort heaps as well as pure-heap variants of numerous other heaps have asymptotically optimal decrease-key operations in the pure heap model. In addition, our improved lower bound matches the lower bound of Fredman [J. ACM 46(4):473-501 (1999)] for pairing heaps [M.L. Fredman, R. Sedgewick, D.D. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6665","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":"1407.6665","created_at":"2026-05-18T02:46:38.257924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6665v1","created_at":"2026-05-18T02:46:38.257924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6665","created_at":"2026-05-18T02:46:38.257924+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2ZCGCHVCKC7","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2ZCGCHVCKC7IX7R","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2ZCGCHV","created_at":"2026-05-18T12:28:19.803747+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/B2ZCGCHVCKC7IX7RFP6UWHCITT","json":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT.json","graph_json":"https://pith.science/api/pith-number/B2ZCGCHVCKC7IX7RFP6UWHCITT/graph.json","events_json":"https://pith.science/api/pith-number/B2ZCGCHVCKC7IX7RFP6UWHCITT/events.json","paper":"https://pith.science/paper/B2ZCGCHV"},"agent_actions":{"view_html":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT","download_json":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT.json","view_paper":"https://pith.science/paper/B2ZCGCHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6665&json=true","fetch_graph":"https://pith.science/api/pith-number/B2ZCGCHVCKC7IX7RFP6UWHCITT/graph.json","fetch_events":"https://pith.science/api/pith-number/B2ZCGCHVCKC7IX7RFP6UWHCITT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT/action/storage_attestation","attest_author":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT/action/author_attestation","sign_citation":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT/action/citation_signature","submit_replication":"https://pith.science/pith/B2ZCGCHVCKC7IX7RFP6UWHCITT/action/replication_record"}},"created_at":"2026-05-18T02:46:38.257924+00:00","updated_at":"2026-05-18T02:46:38.257924+00:00"}