{"as_of":"2026-08-13T05:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:85149f878d79821795652d1ef3016713e142a28c952f5085ff8b5559033f64c6","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:23:46.177760Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.14387/citation-record","integrity":"/paper/2411.14387/integrity","json":"/paper/2411.14387/citation-record.json","paper":"/paper/2411.14387"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:45.384086Z","title":"Self-organizing binary search trees","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.384086Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:3eac74024d1c999cd612d9f9f02097a18de89c445895032e7d332d8fd4b3e30b","observation_id":"e6b8f2af-c01a-458c-b0ae-bcefb6e3de20","resolution":{"observed_at":"2026-08-12T15:23:45.384086Z","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-12T15:23:48.162299Z","title":"Direct sums in randomized communication complexity","venue":null,"work_id":"7319049a-c27f-4689-a54a-d24c5aae8dfc","year":2009},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.430784Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:0ca867cce1b26e24f4354f67103b992240cedaf551fe98d39d94c39dcfc173b9","observation_id":"8749303c-17b9-48e2-b07d-e07d39ac44dd","resolution":{"observed_at":"2026-08-12T15:23:48.166553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2310.04236","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:47.130241Z","title":"Optimization with pattern-avoiding input","venue":null,"work_id":"874ff1d3-8dc6-4ed6-ab17-08e29854cd79","year":2023},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.519508Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:cd29a86b677fc569967a26d8b309dbcc5736d2fa2e11625df4b556c61044ca37","observation_id":"45675e3f-3467-46c6-bf3c-0256da69382a","resolution":{"observed_at":"2026-08-12T15:23:47.178811Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2023.26","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.967809Z","title":"Blelloch and Magdalen Dobson","venue":null,"work_id":"26ac3d62-3f8b-459c-b68b-6db7e0b10041","year":2023},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.524742Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:1357b10b8758cbf69eec8fda8d2dd977a76534755757a568404044f710e9f51c","observation_id":"3260b575-42ee-4e04-8c66-f1204145e28e","resolution":{"observed_at":"2026-08-12T15:23:46.972426Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-13731-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.952680Z","title":"An O(log log n)-competitive binary search tree with optimal worst-case access times","venue":null,"work_id":"03b81c25-219c-4188-8cb7-9d3daaa5d596","year":2010},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.529344Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:dddc2a3daebb2dd694d7df370c24aaa9d005c9eba1d5d27ac07aef1773efaafe","observation_id":"f9499b42-684c-4aa0-9f45-fe71b29c9bd5","resolution":{"observed_at":"2026-08-12T15:23:46.957821Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2020.33","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.870208Z","title":"Pinning down the strong wilber 1 bound for binary search trees","venue":null,"work_id":"c09b3d97-4c58-45fd-a278-1b9b205fb0b2","year":2020},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.535110Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:08c3b47413f8e6a0b5527c98da12bbec5b884421f3f18f81ea6373bcaf3007b9","observation_id":"e35b4045-fd53-49c5-8fbf-150d54f41ad1","resolution":{"observed_at":"2026-08-12T15:23:46.913424Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-21840-3_13","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.841217Z","title":"Greedy is an almost optimal deque","venue":null,"work_id":"6b4732b4-5c7e-46a8-aaf3-56a571757a1b","year":2015},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.540100Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:98e89fac51c5fe4d1d66134193ce76cea8f5c3090fc7bb60f5eb2df9fd94f683","observation_id":"e13d35fb-2f2e-4ef9-bb49-02e491368f01","resolution":{"observed_at":"2026-08-12T15:23:46.846325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:45.634673Z","title":"Pattern-avoiding access in binary search trees","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.634673Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:57e5cba6fbdbb98cdbb80a339c8f4ff5a067a46bb747f60f3b4d6d2b824ed3c8","observation_id":"338a7ae9-220c-4d71-947d-164dfe2eeba4","resolution":{"observed_at":"2026-08-12T15:23:45.634673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.04892","last_updated":"2016-03-15T21:38:57Z","snapshot_observed_at":"2026-08-01T17:41:35.599057Z","submitted_at":"2016-03-15T21:38:57Z","title":"The landscape of bounds for binary search trees","version":1},"cited_work":{"arxiv_id":"1603.04892","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.04892","snapshot_observed_at":"2026-08-12T15:23:47.773346Z","title":"The landscape of bounds for binary search trees","venue":"cs.DS","work_id":"f166a742-7e10-43dd-8ab2-91761153e81b","year":2016},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.747481Z"},"links":{"cited_paper":"/paper/1603.04892","citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:6e1b2c7a31ef0e5a94c54fbf14c543b42978aaff57fafcfa996ca8cbae2774f5","observation_id":"b02bc093-3e47-4e72-9863-9b7401c75d1b","resolution":{"observed_at":"2026-08-12T15:23:47.839559Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:45.752543Z","title":"Improved pattern-avoidance bounds for greedy bsts via matrix decomposition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.752543Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:2ddc6bc2c295a9e2287d76a3426617c41202b53f98d19f541811ce5c5b4ccbf7","observation_id":"99070036-bc7e-4425-a526-62bb19010105","resolution":{"observed_at":"2026-08-12T15:23:45.752543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15426","last_updated":"2023-12-24T07:38:14Z","snapshot_observed_at":"2026-08-13T04:54:34.863197Z","submitted_at":"2023-12-24T07:38:14Z","title":"The Group Access Bounds for Binary Search Trees","version":1},"cited_work":{"arxiv_id":"2312.15426","doi":"10.48550/arxiv.2312.15426","metadata_source":"pith","pith_arxiv_id":"2312.15426","snapshot_observed_at":"2026-08-12T18:16:22.223912Z","title":"The Group Access Bounds for Binary Search Trees","venue":"cs.DS","work_id":"e1c3cdda-271d-42c8-8e23-63b5d009a24d","year":2023},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.757199Z"},"links":{"cited_paper":"/paper/2312.15426","citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:1015f9083fdd4da31093644c1a7f9b65e3ebeaaec55e6d4f1d3faaac3271ca48","observation_id":"da117c9d-4f8e-445a-bd6b-08fb2294766c","resolution":{"observed_at":"2026-08-12T15:23:46.809216Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2020.28","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.697019Z","title":"New binary search tree bounds via geometric inversions","venue":null,"work_id":"4bd899b9-fdcb-4513-81b7-3a627bf8e43f","year":2020},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.763373Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:c50c91424d1a37259a664628e30423546029990fdd6c4f010c7dc0438b8f4dcb","observation_id":"1f7bebe0-2041-4ed6-b243-9e7ac40e3701","resolution":{"observed_at":"2026-08-12T15:23:46.746490Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.577344Z","title":"Sorting pattern-avoiding permutations via 0-1 matrices forbidding product patterns","venue":null,"work_id":"9c1d1fdb-c5b3-4a8f-85da-8537eb01c7d4","year":2024},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.842416Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:99a41e96c143ec5fb44040de85b02112c8f742d0a85d3eb84a5c81d6768469f0","observation_id":"04f512d2-ec2d-4b9b-9cce-3c2708f2beca","resolution":{"observed_at":"2026-08-12T15:23:46.632640Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:45.895051Z","title":"On the dynamic finger conjecture for splay trees","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.895051Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:7b2a324f79c07546030bdb11308b17448b57d2815293670a8cab6982270e6e72","observation_id":"992a6f55-2d3b-47b3-a402-cf6f45747e65","resolution":{"observed_at":"2026-08-12T15:23:45.895051Z","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-12T15:23:45.912513Z","title":"Demaine, Dion Harmon, John Iacono, Daniel M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.912513Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:0e733d760f6cb9f45f7834c6f6cb4cea7d24b3cf1d516ffd528db9ae295a7ffe","observation_id":"4e29a1f5-6242-47c6-a137-edcad88a7e99","resolution":{"observed_at":"2026-08-12T15:23:45.912513Z","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-12T15:23:45.917359Z","title":"Demaine, Dion Harmon, John Iacono, and Mihai Patrascu","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.917359Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:2a4183a623d573279d1144982c92583e20ccb2d5e306436c8825811d689164a4","observation_id":"870d72cc-f8d0-41eb-ba9a-74ce4a5c9779","resolution":{"observed_at":"2026-08-12T15:23:45.917359Z","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-12T15:23:48.068675Z","title":"A lower bound framework for binary search trees with rotations","venue":null,"work_id":"664adc14-7d5e-41b6-a7f2-2cf91f7df704","year":2005},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.922231Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:f958d1063f0769fb8f836c503c536e3ee61d9465a3c6575e608ada53c8ad099f","observation_id":"27bceb35-04be-4afd-94fb-714021a3d4b0","resolution":{"observed_at":"2026-08-12T15:23:48.151119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2004.01.019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.543960Z","title":"On the sequential access theorem and deque conjecture for splay trees","venue":null,"work_id":"0727969b-9543-4c70-9b68-e396f37e9b7d","year":2004},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.927183Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:7717cdc8d112c5e5b1a3c3bcc7290030a62549b1efd670b64d2b41a34c361ab2","observation_id":"b3a3e4f1-e733-4199-8a27-c3e09e608818","resolution":{"observed_at":"2026-08-12T15:23:46.548584Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-22300-6_35","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.528440Z","title":"Upper bounds for maximally greedy binary search trees","venue":null,"work_id":"ba3f058e-586c-4d0f-8364-591e9def93d5","year":2011},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.931746Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:b83751a35912b52c8d044a0189e3aab8fb68a42ff3ba3251cdec099f1512bec7","observation_id":"fbac721e-f520-4c6d-9a60-ceb924688219","resolution":{"observed_at":"2026-08-12T15:23:46.533271Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:45.936142Z","title":"On yao's xor-lemma","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.936142Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:151834fb4617b4cd8c5dd347dc183f32639f260db63134adbd49106067f3da87","observation_id":"3035905f-116f-4f26-bf7e-f2bce7054a11","resolution":{"observed_at":"2026-08-12T15:23:45.936142Z","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-12T15:23:45.940303Z","title":"Better analysis of greedy binary search tree on decomposable sequences","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.940303Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:8411b68fcecd9c1cce9163b2a4e9b0c2073ee90bc387eb565bbb25b17a5e34e7","observation_id":"3bde396a-9374-428c-bfbc-ce80a81369be","resolution":{"observed_at":"2026-08-12T15:23:45.940303Z","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-12T15:23:45.944589Z","title":"In pursuit of the dynamic optimality conjecture","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.944589Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:4c2a489f319d675e20f86b3e4c7fa8fe8321319210dd37209843500e2a845d0d","observation_id":"5b74b970-603a-4762-8819-a022f32def23","resolution":{"observed_at":"2026-08-12T15:23:45.944589Z","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-12T15:23:45.949400Z","title":"Super-logarithmic depth lower bounds via the direct sum in communication complexity","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.949400Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:d4b363e31f1119ec8997e83df986cdbaf5453a9a9c2e8ee01d375cbd723f5858","observation_id":"c253f260-f3c7-470c-954e-12ba6203fb49","resolution":{"observed_at":"2026-08-12T15:23:45.949400Z","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":"6325.34509","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:47.622754Z","title":"Log-rank and lifting for and-functions","venue":null,"work_id":"03a1e620-0f40-48c5-aea8-ae9cef7d2975","year":2021},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.954377Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:46ce66cc5412275c8144e60ff3ba87f58c4673141243f121f4a6755affb917b1","observation_id":"de96596f-b079-466c-98e7-e5ab2d98cd17","resolution":{"observed_at":"2026-08-12T15:23:47.676021Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:48.044117Z","title":"Binary search trees, rectangles and patterns","venue":null,"work_id":"5db51de5-f6f3-453e-b520-426aa6a95a75","year":2016},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.958968Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:335c148997b2347abdcd4256820bfc92b77c2ea12955f314313a6f8e2f594790","observation_id":"e3a4919f-5bbe-4cc0-8277-7439d9c3811d","resolution":{"observed_at":"2026-08-12T15:23:48.049203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:45.963398Z","title":"Smooth heaps and a dual view of self-adjusting data structures","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.963398Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:fc55e57c61112b1ed4bd5139762932b4818a01455eefaed67469f7c1485e955b","observation_id":"8fb4a26e-96bc-4223-8244-0fedac13a078","resolution":{"observed_at":"2026-08-12T15:23:45.963398Z","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-12T15:23:45.967985Z","title":"Settling the relationship between wilber's bounds for dynamic optimality","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.967985Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:9614095221561ecafcbec7b992c96b39fc41ef9f51b00ba9be685548c7b79f2e","observation_id":"5149fa69-f1e8-4a90-9554-379e7934298b","resolution":{"observed_at":"2026-08-12T15:23:45.967985Z","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-12T15:23:45.995584Z","title":"A direct product theorem for discrepancy","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.995584Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:0653974dbe362ec959ff0f609dbf29b9da26eaa0ed2d084205e8c151ab7495fd","observation_id":"a20a259c-8191-4bda-ba01-c1f57b5934cf","resolution":{"observed_at":"2026-08-12T15:23:45.995584Z","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-12T15:23:46.029130Z","title":"Levy and Robert E","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.029130Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:e18cb0e0b2f8ea3fe174507c5889e94f3e0ba53404b8b6f8dbdab1b8fc1acc9b","observation_id":"8eca54fb-f81e-44cc-915e-104a00497ee3","resolution":{"observed_at":"2026-08-12T15:23:46.029130Z","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-12T15:23:48.027928Z","title":"Canonical forms for competitive binary search tree algorithms","venue":null,"work_id":"f16d4330-72ff-49d1-9db3-51cd40724a26","year":1988},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.055240Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:3551d275752358c7bb7a315e6a4ce9b03929b0ed8ad102e77c254c7981e05922","observation_id":"2198a924-9c8a-4cc8-a8bc-29d1625e6e99","resolution":{"observed_at":"2026-08-12T15:23:48.032938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45253-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.457847Z","title":"Ian Munro","venue":null,"work_id":"2946b069-299c-4bac-b6b5-1f5d294e777a","year":2000},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.095942Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:71c0a59947ca7df8a020bd3f7e1a5cf531e338e805ee0facd6bbfcd36af59aa9","observation_id":"b0186d62-62d9-4aaf-a075-fd71cd2ab889","resolution":{"observed_at":"2026-08-12T15:23:46.463473Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7082.13472","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:47.456137Z","title":"Splay trees, davenport-schinzel sequences, and the deque conjecture","venue":null,"work_id":"96682704-6db0-481f-b72f-bdff47c8e04c","year":2008},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.127088Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:a9e1cc77e903d3ce938ea45768047addb5ed9316ebe508487cae3788b2cd856c","observation_id":"c297430e-60c1-49f3-b57a-cd88e7e1c4c6","resolution":{"observed_at":"2026-08-12T15:23:47.463818Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/070684859","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.442113Z","title":"Higher lower bounds for near-neighbor and further rich problems","venue":null,"work_id":"efb2c343-24b4-4ab5-b697-fdd90f9bae58","year":2009},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.131995Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:ddad948f74ee97cf3f663d014a6346acab6f9bd22f5812b00f676114d1a318b7","observation_id":"a72ac13f-681b-4b20-ac15-448fd222e74f","resolution":{"observed_at":"2026-08-12T15:23:46.447557Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/090747270","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.399320Z","title":"A counterexample to strong parallel repetition","venue":null,"work_id":"a67b6393-3eed-4ed3-a9b7-1a46d25cafae","year":2011},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.136279Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:e262b7d33d07d8425894835bb3d2b02535346233720d145af0a979f1028bbb7e","observation_id":"559d9564-c420-4431-8c3c-a5336836c253","resolution":{"observed_at":"2026-08-12T15:23:46.431504Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:46.141141Z","title":"Separation of the monotone NC hierarchy","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.141141Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:86f881756cb30d1e5984032a87fc838d1a539a12544ab4e02d1cecd7fab830d5","observation_id":"a5f28035-cdee-487d-a859-d984a78ded2e","resolution":{"observed_at":"2026-08-12T15:23:46.141141Z","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-12T15:23:46.146126Z","title":"Dynamic binary search trees: Improved lower bounds for the greedy-future algorithm","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.146126Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:4ab5f76f07a938969c1df545c49d252d637b3f312cb0855ffc64600e6995be11","observation_id":"48c8d1ca-edd1-4523-9ad0-b26f25405e7c","resolution":{"observed_at":"2026-08-12T15:23:46.146126Z","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-12T15:23:47.933085Z","title":"Towards proving strong direct product theorems","venue":null,"work_id":"1805342e-b400-4a25-b0f8-017912b801c4","year":2001},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.150754Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:7770da9df42d1f7f8fd71df35c69cddc6a6126c099c24169b6ac4a9bf7e035de","observation_id":"ee14a028-dd42-4458-810e-eea235aceca0","resolution":{"observed_at":"2026-08-12T15:23:47.992190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/110842661","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.324121Z","title":"Sherstov","venue":null,"work_id":"e0381a1e-df08-4042-b851-61d78920e4fc","year":2012},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.155052Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:5ce6bd5edbeb94c8ac035f041e6ba175c8b293cb3f50a334e2c2595dad30ac47","observation_id":"66a001e7-4a3b-4936-983c-6f0e1d30d076","resolution":{"observed_at":"2026-08-12T15:23:46.349287Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/17m1131970","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.262385Z","title":"A counterexample to comon's conjecture","venue":null,"work_id":"816f314d-7d85-4cfc-8e8a-b63bec9e01ef","year":2018},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.159574Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:b21f9800b8f4511a130aff99fd83d6d95a24bef5cc6f9a375c37e9b4acd53855","observation_id":"5c639acf-e591-42ba-9335-52677b093410","resolution":{"observed_at":"2026-08-12T15:23:46.285984Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:46.164082Z","title":"Self-adjusting binary search trees","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.164082Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:a31babfd52375ce92db3e68aa2a235868c4c49a816a22a985ff8a6d3df4dcfbc","observation_id":"caecae26-c4c3-44dd-818d-52e36044cdd3","resolution":{"observed_at":"2026-08-12T15:23:46.164082Z","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/bf01191208","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:23:46.219226Z","title":"On the deque conjecture for the splay algorithm","venue":null,"work_id":"db19547b-e18b-474d-a345-d2c5ced379f3","year":1992},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.168695Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:4d1f065a220822f35caf26f89318ce37338f020a5e748d5caf07e3a69dde7161","observation_id":"223fdbd1-3234-4245-8006-eb2319df1381","resolution":{"observed_at":"2026-08-12T15:23:46.227118Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:23:46.173235Z","title":"O(log log n)-competitive dynamic binary search trees","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.173235Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:3bbeb5b6b4737a458c9682cfab9801fcad09614580c6949bc1c7e441e5dafa6e","observation_id":"0fd9b68a-21a2-4c11-80ae-140b25ff7698","resolution":{"observed_at":"2026-08-12T15:23:46.173235Z","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-12T15:23:46.177760Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:46.177760Z"},"links":{"citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:1e3734db8194ff39ccf3bf4843bacc60a430bb4506508d2fe818cb8f00b27ce5","observation_id":"9b1a381f-e021-4779-b60b-25835d405fc9","resolution":{"observed_at":"2026-08-12T15:23:46.177760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":19,"verified_exact":17,"verified_fuzzy":5},"total_outbound_references":43},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2411.14387."}