{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M6LZMORPLKILO5LNP74OTIBERV","short_pith_number":"pith:M6LZMORP","schema_version":"1.0","canonical_sha256":"6797963a2f5a90b7756d7ff8e9a0248d7669852c9ea5b773985b8ef2c405b166","source":{"kind":"arxiv","id":"1908.00563","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Optimality Refuted -- For Tournament Heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Lingyi Zhang, Richard Peng, Sebastian Wild","submitted_at":"2019-08-01T18:08:19Z","abstract_excerpt":"We prove a separation between offline and online algorithms for finger-based tournament heaps undergoing key modifications. These heaps are implemented by binary trees with keys stored on leaves, and intermediate nodes tracking the min of their respective subtrees. They represent a natural starting point for studying self-adjusting heaps due to the need to access the root-to-leaf path upon modifications. We combine previous studies on the competitive ratios of unordered binary search trees by [Fredman WADS2011] and on order-by-next request by [Mart\\'inez-Roura TCS2000] and [Munro ESA2000] to s"},"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":"1908.00563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-01T18:08:19Z","cross_cats_sorted":[],"title_canon_sha256":"197f899a87609b2d5b39ca270ffaa8c3ed4d8d6c9583cb7f4fac064867a9e627","abstract_canon_sha256":"9ebe8d33e3a617373fb6861fd3ab9bda5e0fb39117ed7392d671023bf14b7880"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:06.510076Z","signature_b64":"qklqUXakHKUOm/KNWdvj8o4Av/UwZVzCZYMsiOgarTBGLE3lZ2lN+QVe4GSXOezauZNWqFdT7yEx1XzO6UxPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6797963a2f5a90b7756d7ff8e9a0248d7669852c9ea5b773985b8ef2c405b166","last_reissued_at":"2026-07-04T23:51:06.509566Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:06.509566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Optimality Refuted -- For Tournament Heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Lingyi Zhang, Richard Peng, Sebastian Wild","submitted_at":"2019-08-01T18:08:19Z","abstract_excerpt":"We prove a separation between offline and online algorithms for finger-based tournament heaps undergoing key modifications. These heaps are implemented by binary trees with keys stored on leaves, and intermediate nodes tracking the min of their respective subtrees. They represent a natural starting point for studying self-adjusting heaps due to the need to access the root-to-leaf path upon modifications. We combine previous studies on the competitive ratios of unordered binary search trees by [Fredman WADS2011] and on order-by-next request by [Mart\\'inez-Roura TCS2000] and [Munro ESA2000] to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00563","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/1908.00563/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":"1908.00563","created_at":"2026-07-04T23:51:06.509638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.00563v1","created_at":"2026-07-04T23:51:06.509638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00563","created_at":"2026-07-04T23:51:06.509638+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6LZMORPLKIL","created_at":"2026-07-04T23:51:06.509638+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6LZMORPLKILO5LN","created_at":"2026-07-04T23:51:06.509638+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6LZMORP","created_at":"2026-07-04T23:51:06.509638+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.04552","citing_title":"Fast and Simple Sorting Using Partial Information","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV","json":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV.json","graph_json":"https://pith.science/api/pith-number/M6LZMORPLKILO5LNP74OTIBERV/graph.json","events_json":"https://pith.science/api/pith-number/M6LZMORPLKILO5LNP74OTIBERV/events.json","paper":"https://pith.science/paper/M6LZMORP"},"agent_actions":{"view_html":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV","download_json":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV.json","view_paper":"https://pith.science/paper/M6LZMORP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.00563&json=true","fetch_graph":"https://pith.science/api/pith-number/M6LZMORPLKILO5LNP74OTIBERV/graph.json","fetch_events":"https://pith.science/api/pith-number/M6LZMORPLKILO5LNP74OTIBERV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV/action/storage_attestation","attest_author":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV/action/author_attestation","sign_citation":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV/action/citation_signature","submit_replication":"https://pith.science/pith/M6LZMORPLKILO5LNP74OTIBERV/action/replication_record"}},"created_at":"2026-07-04T23:51:06.509638+00:00","updated_at":"2026-07-04T23:51:06.509638+00:00"}