{"as_of":"2026-08-16T21:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0409ad573afcef6922c47bb1d241ed653e0aee8e97ddf4e0302f8d11a6f52ea","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:58:38.214357Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:16:16.268144Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T02:33:47.790333Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"cited_work":{"arxiv_id":"1908.00563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.00563","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Smooth hea ps and a dual view of self-adjusting data structures","venue":null,"work_id":"43b95297-f7e4-45cd-ba3f-8cbafb6e9548","year":2018},"citing_paper":{"arxiv_id":"2404.04552","last_updated":"2026-05-05T13:29:15Z","snapshot_observed_at":"2026-08-13T14:53:53.620251Z","submitted_at":"2024-04-06T08:29:44Z","title":"Fast and Simple Sorting Using Partial Information","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T02:29:33.737294Z"},"links":{"cited_paper":"/paper/1908.00563","citing_paper":"/paper/2404.04552"},"observation_digest":"sha256:c51290fa8455399b364ac413cb882a7f8a595804974a8af2a4629b59f2672cd5","observation_id":"69aa3be2-cf1b-4531-971c-0163654733eb","resolution":{"observed_at":"2026-05-24T02:33:47.795213Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00563","snapshot_observed_at":"2026-07-31T10:35:54.762459Z","title":"Ian Munro and Richard Peng and Sebastian Wild and Lingyi Zhang , title =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.762459Z"},"links":{"cited_paper":"/paper/1908.00563","citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:76cc81e033b20df9d14e6c0665cf6a37a5737aa2ae0f4ae8fcacc692991289f1","observation_id":"a2fc0bcd-9ad0-4879-b184-8e1cf89c97fc","resolution":{"observed_at":"2026-07-31T10:35:54.762459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00563","snapshot_observed_at":"2026-08-12T00:16:16.268144Z","title":"arXiv , arxivId =:1908.00563 , year =","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.268144Z"},"links":{"cited_paper":"/paper/1908.00563","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:229066ab985ea85284cd45964f9e37db9e1a380588f8849a7eb4f38c32149695","observation_id":"aff3077b-fb7e-4e84-8855-25c69e2035ac","resolution":{"observed_at":"2026-08-12T00:16:16.268144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1908.00563/citation-record","integrity":"/paper/1908.00563/integrity","json":"/paper/1908.00563/citation-record.json","paper":"/paper/1908.00563"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.077936Z","title":"A polylogarithmic- competitive algorithm for the k-server problem","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.077936Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:37f1d849f6def752a43a21da09f6e2824580f3c88e85bb36f8e748d78e8811d5","observation_id":"5225e4c1-2315-45e9-9c85-0709ab7ce30c","resolution":{"observed_at":"2026-08-14T15:58:37.077936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.137612Z","title":"Online computation and competitive analysis","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.137612Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:e6c52343a3cce6056ee41ac909a9e496ed3f522f0cf981f7c55270729a374642","observation_id":"fe8ff23c-af8f-4fe5-af46-6bcdea3a604c","resolution":{"observed_at":"2026-08-14T15:58:37.137612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:40.219363Z","title":"Dyn amic optimality for skip lists and B-trees","venue":null,"work_id":"ee3727ea-10bc-4dcb-bc6b-20b04d6c2c59","year":2008},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.182537Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:243ed7df78fd7bdc909dcb37822ce032d209869e1a3d366b1313907f25c9a2eb","observation_id":"57b53f14-526e-4f57-a443-6ccdd5444b83","resolution":{"observed_at":"2026-08-14T15:58:40.225383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.219187Z","title":"Cohen, Yin Tat Lee, James R","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.219187Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:47c9e78482f8b40f9e33008ce1a85b2faaa6d9162a1be155c7af2ab486df4581","observation_id":"e434d577-fd11-4a11-924a-c494ba30829c","resolution":{"observed_at":"2026-08-14T15:58:37.219187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.259285Z","title":"Pattern-avoiding access in binary search trees","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.259285Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:af6fd25bd9a68eea45133b34194a3e1f75a20933a85be272bffb4d1643c91eac","observation_id":"ee1636c4-c21b-4cf7-a577-35a2332c1424","resolution":{"observed_at":"2026-08-14T15:58:37.259285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:40.101034Z","title":"Cohen, Rasmus Kyng, Gary L","venue":null,"work_id":"60c07baa-be63-4b8c-930b-daecc33c0be2","year":2014},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.284364Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:101aaca4ba93860c2c91ceb7b73ba777ef2f3a6f7f8280d1c73778ae99d8ec75","observation_id":"7fdb91ce-7197-4f92-ad9b-23d7862ed48b","resolution":{"observed_at":"2026-08-14T15:58:40.203434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:40.035241Z","title":"Demaine, Dion Harmon, John Iacono, Daniel Kane, a nd Mihai Pˇ atraşcu","venue":null,"work_id":"cd9eb1fd-4a8b-4b4c-9e31-91a5938b53dc","year":2009},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.313738Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:f32489dc6d5537a2719aa54c46d7eb2b97b241c05aa106d107462721bdbe223e","observation_id":"cd532d34-84fe-42dc-9f54-c4025d0f087e","resolution":{"observed_at":"2026-08-14T15:58:40.045389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.331750Z","title":"Demaine, Dion Harmon, John Iacono, and Mihai Pˇ at raşcu","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.331750Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:c8cee4ef9c56571e5f9042e30a5ece44277dea384e28463b8107422c90d10a64","observation_id":"f9ee7d13-fab7-4370-93ab-8de6dd5497b5","resolution":{"observed_at":"2026-08-14T15:58:37.331750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-39206-1_33","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.774670Z","title":"Demaine, John Iacono, Stefan Langerman, and Özgü r Özkan","venue":null,"work_id":"571a171f-db46-4a99-a13b-b7ee294360fa","year":2013},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.372478Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:bfb3ac088a79bc97e90a964e05342881d8000cc36837bd72169ceadf7f5824f3","observation_id":"3e900dc2-ecfa-475d-93c1-c7a2fea2fc0b","resolution":{"observed_at":"2026-08-14T15:58:38.780159Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:40.014574Z","title":"Non-blocking binary search trees","venue":null,"work_id":"ebea0d47-5e8d-409f-aa95-7eb269569e11","year":2010},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.398953Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:986a631d03d424bda1a86db96e0992e5fb095c97876c0328a69da3024c75abcb","observation_id":"2125fc83-f02c-41a6-909f-d7cc8038624e","resolution":{"observed_at":"2026-08-14T15:58:40.021819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.906862Z","title":"Offline algorithms for dynamic minimum s panning tree problems","venue":null,"work_id":"04801c9b-16ac-402f-8dad-0c31f786a978","year":1994},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.509181Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:5dd841d42c1664761253232d93cdabf24652a2df2a64a8ef656605b3088e2cd2","observation_id":"0b75471a-ac7a-4e67-9643-ac07f8dbb045","resolution":{"observed_at":"2026-08-14T15:58:39.980450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-48318-7_20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.639891Z","title":null,"venue":null,"work_id":"f5328a22-6836-4d78-ae59-9eee1db99188","year":1999},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.551802Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:765854a7418ed5a3ed18ab65807720e298c639861d832ee2dfb2a04f663d45eb","observation_id":"e9363691-ff89-4adc-990b-94dabcafed23","resolution":{"observed_at":"2026-08-14T15:58:38.698426Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-22300-6_36","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.622637Z","title":null,"venue":null,"work_id":"a96f324c-0dcb-4e33-bee2-5c0d3d948d3d","year":2011},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.578855Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:c39e73171a8f3f256cc714331eae8fb48c79d2541c4b56ce9683673ebc9df9e2","observation_id":"a24808b9-d136-48e2-b6aa-7fdfe6d9f02f","resolution":{"observed_at":"2026-08-14T15:58:38.628318Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-011-9489-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.579519Z","title":null,"venue":null,"work_id":"05a7a278-89a8-44dd-a375-5db6749f4937","year":2012},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.584389Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:ec3e7c8c056286fc63a4aad5bf08d2d7791fac4ad643fe20be85f2c12e6fe719","observation_id":"37bcd859-1350-4087-a3a9-24d9f8b7386e","resolution":{"observed_at":"2026-08-14T15:58:38.601882Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.887391Z","title":"New bounds on optimal binary search trees","venue":null,"work_id":"660e55e7-b001-48c6-b14f-2f8f3fd4da1c","year":2006},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.591331Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:2afc818f96e1962291c09d98ac90fe3189798b4e5b732024a8eaa3b5fb55fac6","observation_id":"62d11510-b2f1-4267-8aff-369c4348a2cb","resolution":{"observed_at":"2026-08-14T15:58:39.893377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.597232Z","title":"Introduction to online convex optimizatio n","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.597232Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:86e89adc031b7350a3d44ddd72d4774a580bfea383cafb42993be1b7dd8f470d","observation_id":"c4bc41da-4b4c-488c-811e-9f6de274d9b3","resolution":{"observed_at":"2026-08-14T15:58:37.597232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.789578Z","title":"Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spann ing tree, 2-edge, and biconnectiv- ity","venue":null,"work_id":"da3bb14f-9fda-461b-b615-48309e21fbec","year":2001},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.603033Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:0f64fca7c1b5e268070e71d657a53766adbd10fdddd58b43d1e607d0e253c603","observation_id":"b533d451-d0d6-493c-9f2e-7c5d5e2e10ab","resolution":{"observed_at":"2026-08-14T15:58:39.807463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-004-1136-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.548362Z","title":"Key-independent optimality","venue":null,"work_id":"79e5e054-76c5-496a-9a3c-d1f626bf5ee8","year":2005},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.631673Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:7e33c29e0b2a9759ef9af068c57d5e535c083ff4e8b17e9b3474961afc06fe26","observation_id":"c835dce2-6894-4eb4-b720-6e0b27a61c8a","resolution":{"observed_at":"2026-08-14T15:58:38.554926Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.680446Z","title":"In pursuit of the dynamic optimality conje cture","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.680446Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:ccdb4d7ae4315b6b86f56d7f8139433f6660e51597ee714e3ac5ef518081a66a","observation_id":"f43cf0b6-483e-4e27-90a5-99339b59db5e","resolution":{"observed_at":"2026-08-14T15:58:37.680446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.754195Z","title":"Weighted dynamic fing er in binary search trees","venue":null,"work_id":"879c4186-9626-4bc4-a5a9-96b3c4be8766","year":2016},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.755874Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:9796f3810799a38dd478c83f6b83dd8d38cc1f3d8beaf9eb76a0ba1c5dda4f28","observation_id":"2039d3b1-1c99-45a7-997b-2feb697025ae","resolution":{"observed_at":"2026-08-14T15:58:39.768430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.674304Z","title":"Kelner, Lorenzo Orecchia, Aaron Sidford, a nd Zeyuan Allen Zhu","venue":null,"work_id":"b7839d7a-f6a3-43f7-8bc0-605940f0363d","year":2013},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.767285Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:58b29c37fad14f2d016675371f97f170f8f20a454e14608b8094e7b8c9e94596","observation_id":"f94a8139-0b4b-4286-9abc-0015dddefe62","resolution":{"observed_at":"2026-08-14T15:58:39.704788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.652057Z","title":"The art of computer programming, Volume III","venue":null,"work_id":"4b472feb-8460-4067-a2e0-ae92611e3be2","year":1998},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.774002Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:a3b72138a70f6be8a0a1d49d10e59bddd01c831d786e6439e1712ff909b9ea43","observation_id":"91859d21-a80f-45df-a6f7-976d63f2f264","resolution":{"observed_at":"2026-08-14T15:58:39.658559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22028/d291-26671","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.473038Z","title":"Binary search trees, rectangles and patterns","venue":null,"work_id":"f272c2ac-cbf8-4db2-8e5a-3f9a10eebcd4","year":2016},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.780532Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:3d60fbb640c2e947bd411b8217be71c77f5073ec5a3da9ec2c00d55820834008","observation_id":"de5485d9-2552-45d4-9a5f-8ada7eedd9dc","resolution":{"observed_at":"2026-08-14T15:58:38.478684Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.812728Z","title":"Smooth heaps a nd a dual view of self-adjusting data structures","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.812728Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:e8108eb2b4489922e621d95ebf739102b6c2b92c92fbb405aee71c7ece516756","observation_id":"581f4067-253b-40d0-9a83-1315a0ab2ce7","resolution":{"observed_at":"2026-08-14T15:58:37.812728Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.904472Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.904472Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:e96038604146477892c5e21aef8b77e700b295db79dce670ce9905d03154ead9","observation_id":"9622c311-27ce-4ce9-b45b-cead4f39fe11","resolution":{"observed_at":"2026-08-14T15:58:37.904472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.954367Z","title":"A new path from splay to dyn amic optimality","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.954367Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:278a5c0c8b0fac0f4f1afecd8340f9f8bc9abd4c09ba773e390e1a18a26fdde4","observation_id":"d6d30040-1574-4461-b5a5-caf67f8705e2","resolution":{"observed_at":"2026-08-14T15:58:37.954367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.607818Z","title":null,"venue":null,"work_id":"a31197e0-d375-47c6-847b-ed51d2dcd9e0","year":1988},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.960585Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:3215249dc2aa6c86958a26b9efc8590a2743cf67ae69c03df77476f8266397f0","observation_id":"680d483c-ddc2-4770-a4ae-5378c165b161","resolution":{"observed_at":"2026-08-14T15:58:39.637648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.468647Z","title":"Com petitive algorithms for server problems","venue":null,"work_id":"88a50a54-69bd-4dcc-8d57-e3cc31819531","year":1990},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.965720Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:bc30a891e65ad22d56a88f42fdcba3054ef2e7f5dc74baf42ce37cc8174819e2","observation_id":"cd698576-962b-4309-91c7-1f0985d61eda","resolution":{"observed_at":"2026-08-14T15:58:39.545769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0304-3975(98)00264-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.367594Z","title":"On the competitiv eness of the move-to-front rule","venue":null,"work_id":"3b832c51-61f5-434d-90bf-2a4e937ecc6b","year":2000},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.058788Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:c0a4bb39c8f200deac7484272112bca35136847fc5118f4f73d30005f98c5e40","observation_id":"4a2d1ab6-aafc-466e-8d20-f3c1eca5cc09","resolution":{"observed_at":"2026-08-14T15:58:38.373626Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.360243Z","title":"Ian Munro","venue":null,"work_id":"e781b117-0aa7-479d-aa20-b4d76f3ef50f","year":2000},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.117720Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:7a0f0c42a8f7918b4845032799dd29948f3093d49893aed7820348188dff8f20","observation_id":"9b7bd14a-7396-4ac5-b82c-78ddac778e90","resolution":{"observed_at":"2026-08-14T15:58:39.411762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.03812","last_updated":"2019-03-21T01:01:38Z","snapshot_observed_at":"2026-08-15T05:03:52.587551Z","submitted_at":"2017-08-12T19:20:23Z","title":"Optimal Offline Dynamic $2,3$-Edge/Vertex Connectivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.03812","snapshot_observed_at":"2026-08-14T15:58:38.129877Z","title":"Offline dynamic higher connec- tivity, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.129877Z"},"links":{"cited_paper":"/paper/1708.03812","citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:a347912547e02b5387f99a51eeb1f0ca3259989f5df86d79f849ba4f9257952c","observation_id":"78d5d41e-4674-4162-99a1-247164358ba8","resolution":{"observed_at":"2026-08-14T15:58:38.129877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.166099Z","title":"Self-a djusting binary search trees","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.166099Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:2603aef41c29ba18b10591b12c338b98e01cb7d0e3ba1cfde8e3ad339e512a6d","observation_id":"cd92de67-8c56-48d0-80ec-4ff2de5e3078","resolution":{"observed_at":"2026-08-14T15:58:38.166099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:39.289370Z","title":"O(log log n)- competitive dynamic binary search trees","venue":null,"work_id":"5d7187d8-9b4a-4638-9b5d-058c3050563c","year":2006},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.203667Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:99711081b207d5f93ab802cc44200628e132dc631b067af2122736d863cac8af","observation_id":"5b4ff7a8-4e08-4d59-af63-19f6c2ecefba","resolution":{"observed_at":"2026-08-14T15:58:39.295108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.214357Z","title":"Lower bounds for accessing binary searc h trees with rotations","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.214357Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:5585d8ef45c7055ce4b92461ada86e970d604a2b492c5fc71d0b559906ed1447","observation_id":"6c821e56-2014-4e34-bf3d-f859bf16f8d3","resolution":{"observed_at":"2026-08-14T15:58:38.214357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45253-2_31","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:38.269300Z","title":null,"venue":null,"work_id":"a34a264f-4cf6-45b6-906d-c1e2fb39ac98","year":null},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.123143Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:ab7d6b558f3aebe143586114dfaea0d75e7f0c3d283d27c04cfee6a8ea887da0","observation_id":"69566b91-0760-4a11-a1d0-239d86b77f84","resolution":{"observed_at":"2026-08-14T15:58:38.350914Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.449298Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.449298Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:c6a00e669d00138e15e1725d2ddd7bdee152dab6a60a327c956cc9b4df7a1dc5","observation_id":"87b4edbf-9434-4b1b-a687-090efdf1d697","resolution":{"observed_at":"2026-08-14T15:58:37.449298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:37.761023Z","title":"doi:10.1137/1.9781611974331.ch49","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:37.761023Z"},"links":{"citing_paper":"/paper/1908.00563"},"observation_digest":"sha256:3d43000a28f60b032e26ffb0ba029d4bf54ff8963825d373cccd3a5e6bda814e","observation_id":"f388f409-8235-4768-af7b-af4adb1da00f","resolution":{"observed_at":"2026-08-14T15:58:37.761023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":8,"verified_fuzzy":13},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 3 inbound Pith citation observations for arXiv:1908.00563."}