{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PI7P52LVRKXJHTZJB5DZCT3VMR","short_pith_number":"pith:PI7P52LV","schema_version":"1.0","canonical_sha256":"7a3efee9758aae93cf290f47914f75644e1f312d2398c9308ec48319dfda759b","source":{"kind":"arxiv","id":"2607.24621","version":1},"attestation_state":"computed","paper":{"title":"Heaps and Their Working Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Richard Hlad\\'ik, Robert E. Tarjan, V\\'aclav Rozho\\v{n}","submitted_at":"2026-07-27T16:16:53Z","abstract_excerpt":"We construct a heap with strong beyond-worst-case performance guarantees and explore the analysis of such heaps.\n  First, we unify existing notions of the working-set bound for heaps by proving that essentially all of them are equivalent - with the notable exception of the so-called stack-like bound, which is strictly stronger. This equivalence simplifies the theoretical landscape and extends the range of applications of heaps with working-set bounds.\n  Second, we present the first heap implementation that has the amortized stack-like bound and supports $\\mathcal O(1)$-time decrease-key and $o"},"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":"2607.24621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-27T16:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"25ed24f036c7e763c229fb3b179e7b2bd4fc3af58931e5a38ee950c823c1c285","abstract_canon_sha256":"bd0079413ed540b493244255b1bf8272f2196b2b78006a05bb888dff38ae2016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:24:13.326654Z","signature_b64":"mNXr77Q6wVvmSGxvT3XB2Qi57v/MfEU2KH4jrGl5dKZFfZKFxxHGe4EXBL2aaW33C+YU7rZufdNCTezurCcSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a3efee9758aae93cf290f47914f75644e1f312d2398c9308ec48319dfda759b","last_reissued_at":"2026-07-28T02:24:13.325831Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:24:13.325831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heaps and Their Working Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Richard Hlad\\'ik, Robert E. Tarjan, V\\'aclav Rozho\\v{n}","submitted_at":"2026-07-27T16:16:53Z","abstract_excerpt":"We construct a heap with strong beyond-worst-case performance guarantees and explore the analysis of such heaps.\n  First, we unify existing notions of the working-set bound for heaps by proving that essentially all of them are equivalent - with the notable exception of the so-called stack-like bound, which is strictly stronger. This equivalence simplifies the theoretical landscape and extends the range of applications of heaps with working-set bounds.\n  Second, we present the first heap implementation that has the amortized stack-like bound and supports $\\mathcal O(1)$-time decrease-key and $o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24621","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.24621/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":"2607.24621","created_at":"2026-07-28T02:24:13.326252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.24621v1","created_at":"2026-07-28T02:24:13.326252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24621","created_at":"2026-07-28T02:24:13.326252+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI7P52LVRKXJ","created_at":"2026-07-28T02:24:13.326252+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI7P52LVRKXJHTZJ","created_at":"2026-07-28T02:24:13.326252+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI7P52LV","created_at":"2026-07-28T02:24:13.326252+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/PI7P52LVRKXJHTZJB5DZCT3VMR","json":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR.json","graph_json":"https://pith.science/api/pith-number/PI7P52LVRKXJHTZJB5DZCT3VMR/graph.json","events_json":"https://pith.science/api/pith-number/PI7P52LVRKXJHTZJB5DZCT3VMR/events.json","paper":"https://pith.science/paper/PI7P52LV"},"agent_actions":{"view_html":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR","download_json":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR.json","view_paper":"https://pith.science/paper/PI7P52LV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.24621&json=true","fetch_graph":"https://pith.science/api/pith-number/PI7P52LVRKXJHTZJB5DZCT3VMR/graph.json","fetch_events":"https://pith.science/api/pith-number/PI7P52LVRKXJHTZJB5DZCT3VMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR/action/storage_attestation","attest_author":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR/action/author_attestation","sign_citation":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR/action/citation_signature","submit_replication":"https://pith.science/pith/PI7P52LVRKXJHTZJB5DZCT3VMR/action/replication_record"}},"created_at":"2026-07-28T02:24:13.326252+00:00","updated_at":"2026-07-28T02:24:13.326252+00:00"}