{"as_of":"2026-08-09T16:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b67c134799c8f59abde0811a24be03ea6782b6593c97c247ceb599a68661a6f0","coverage":[{"denominator":74,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":74,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:47:23.254829Z","state":"measured"},{"denominator":75,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":75,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:52:35.257465Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T23:52:37.165372Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"cited_work":{"arxiv_id":"2502.05369","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.05369","snapshot_observed_at":"2026-08-06T23:52:37.165372Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","venue":"cs.DB","work_id":"030637e8-46fe-41a7-89eb-b44bcddc8bd5","year":2025},"citing_paper":{"arxiv_id":"2506.15987","last_updated":"2025-06-19T03:16:25Z","snapshot_observed_at":"2026-08-07T22:37:49.296222Z","submitted_at":"2025-06-19T03:16:25Z","title":"Filter-Centric Vector Indexing: Geometric Transformation for Efficient Filtered Vector Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:52:35.257465Z"},"links":{"cited_paper":"/paper/2502.05369","citing_paper":"/paper/2506.15987"},"observation_digest":"sha256:a1f2c3221c24c9bad2eb0db3ab1d09dd4263146959792507e485f075855a7a3c","observation_id":"8e59bf37-462e-429a-b48b-bb1119f2a549","resolution":{"observed_at":"2026-08-06T23:52:37.246231Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05369/citation-record","integrity":"/paper/2502.05369/integrity","json":"/paper/2502.05369/citation-record.json","paper":"/paper/2502.05369"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:25.891171Z","title":null,"venue":null,"work_id":"ef2d08a5-bdef-49f8-8ace-02d6b78f4f09","year":2011},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.939133Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:5e4bc1c494ff74425d2e75adeb9f91189910a9e1486e145523411b75eeaa4100","observation_id":"cfe91fec-abac-4454-af84-b131fda88ab5","resolution":{"observed_at":"2026-08-08T19:47:25.895577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7910/dvn/jgvf9a/y54si9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:23.346216Z","title":"FB Dataset","venue":null,"work_id":"e65cc791-981b-4151-bb1a-925f085f33bb","year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.944353Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:1cafd5139e52517620500f7f60044db4ca216c325ca35ac457de038655d75889","observation_id":"05021d24-beea-424d-a4af-c7ea22bef4ce","resolution":{"observed_at":"2026-08-08T19:47:23.350412Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.878009Z","title":"OSM Dataset","venue":null,"work_id":"9cdfd1a0-ab8f-46ba-9016-3ef006ff061a","year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.949021Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:4b874c0fddaa4107a1ba7666c78a59b2c260edcef4ceb21899ae229bb1a0a944","observation_id":"b1bfb490-dd49-4f37-97c5-847e0c820bdd","resolution":{"observed_at":"2026-08-08T19:47:25.882219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7910/dvn/jgvf9a/svn8pi","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:23.332655Z","title":"WikiTS Dataset","venue":null,"work_id":"5da9a058-ba46-47f4-b958-6c0bcba54bb9","year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.953489Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:23a409c0633282eaaff5d3821374604fab2430b7385a91a460efeae84e64e239","observation_id":"6d3de6cf-c52f-484b-8eef-193da5073c10","resolution":{"observed_at":"2026-08-08T19:47:23.337088Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.864645Z","title":"Bourbon Code","venue":null,"work_id":"5e4e63ac-63c5-4cbd-97fc-0422edd92dab","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.957869Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:a9de0468e88b2498db7cc2d3648da3277662147862ef8fec2a7a376f3ff7c211","observation_id":"d0b4534f-7cb9-4453-ac50-70ac33ef2da7","resolution":{"observed_at":"2026-08-08T19:47:25.868848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.851553Z","title":"TridentKV Code","venue":null,"work_id":"269b2b72-601b-465a-b1e5-297e8178da6d","year":2021},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.962200Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:6c4bc517e6e1d2731ef2392d49c92acd26fbef19eec0082d6d5877f8af6c5b85","observation_id":"64ec9142-ab8c-47cb-a517-30405bd22cb1","resolution":{"observed_at":"2026-08-08T19:47:25.855823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.837544Z","title":null,"venue":null,"work_id":"1c0559bc-2086-4b96-bc8c-5d8c3d2ada2a","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.967019Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:5f8f1606f11afbda140ed5b9f578e7cf7d72e1f9fe168f170588e2828f276e0f","observation_id":"47c7ac30-e3a9-4c66-9ef0-31df4ede772e","resolution":{"observed_at":"2026-08-08T19:47:25.842042Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:22.971040Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.971040Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:bf2575f16d0c88e5cdbf76ff2fa22ef17ba82a37ef107ca2568d71c623d882a3","observation_id":"4a85194a-142c-421b-bc00-fb3c150a6b09","resolution":{"observed_at":"2026-08-08T19:47:22.971040Z","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-08T19:47:25.816131Z","title":null,"venue":null,"work_id":"f21bebe0-78b3-4d47-b53d-ad74c709bee4","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.975497Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:3f18be5a04bed2d3f299ba857719a78e1637b40ae9c110246dc41f3231ce4092","observation_id":"503ea827-883f-4c4c-9dd3-769f476114fc","resolution":{"observed_at":"2026-08-08T19:47:25.820133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.803420Z","title":null,"venue":null,"work_id":"ca62e1dc-58d9-456a-a184-ab4a3de00487","year":2008},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.979601Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:093691cf5356960ddfedf11db7943b5f877c915088834bfc39bd075163564dda","observation_id":"091c00e6-60b1-418a-920b-70a4db24888f","resolution":{"observed_at":"2026-08-08T19:47:25.807547Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.791077Z","title":null,"venue":null,"work_id":"24b4f490-db8a-4707-8814-34c344a9d0c7","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.983963Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:e89d8842fac254e40a6086d12c446319775fe5a630181680aa5a15746f15c4c3","observation_id":"96e22aaa-8cb4-495c-bad0-e989393f643e","resolution":{"observed_at":"2026-08-08T19:47:25.795176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.778451Z","title":null,"venue":null,"work_id":"f235678b-909c-43f1-9e8b-d95a8dd72354","year":2007},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.988429Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:6a1f34f5d08485c76e14877808635888f3e4ea2ac27dac4d069cc84f120c553a","observation_id":"2ad92a1d-2700-499e-a3de-aa7ccef0edf0","resolution":{"observed_at":"2026-08-08T19:47:25.782569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:22.992705Z","title":"Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.992705Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:13a0a710f8cc7d461b05aae9e47c88b6bc8ccb4f14527ea716b376a3f92d0005","observation_id":"b19e87aa-2961-4b16-b7c7-d468a2603411","resolution":{"observed_at":"2026-08-08T19:47:22.992705Z","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-08T19:47:25.764882Z","title":null,"venue":null,"work_id":"d7cb2f99-bc58-4092-a395-e412edaedb8e","year":2008},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:22.997181Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:6ccb34974e6eebfe506692519a81c3565026fe34085a2ee519c6d7ea3760a2dc","observation_id":"35063325-3ff3-466c-9c0e-92611d7fbce3","resolution":{"observed_at":"2026-08-08T19:47:25.769222Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.751778Z","title":"Arpaci-Dusseau, and Remzi H","venue":null,"work_id":"56e2904e-c2ae-4102-bae9-d721cf7f2875","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.001364Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:3d9fa8fda57aad34338a0d8f263fde468159ed7641e2da237aa581c6f553637f","observation_id":"08f9a747-14b1-444f-96ff-8574f4d50332","resolution":{"observed_at":"2026-08-08T19:47:25.755894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.738641Z","title":null,"venue":null,"work_id":"554c2534-3125-4e55-a748-3c394f9be7a4","year":2018},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.005620Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:b36b9a5ec104032d1d280f8db282f66e930fb1b720036a983a13bb2499955a27","observation_id":"8cdf8cac-f952-4d95-be40-636f2643ddd5","resolution":{"observed_at":"2026-08-08T19:47:25.742973Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.725879Z","title":null,"venue":null,"work_id":"a3728781-3d7e-49b0-bf72-3d3922bd1a04","year":2018},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.009878Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:f993dd1704e120cdaf52a2e251570010df71807e14f4567e40175c40207b14f7","observation_id":"5b56c256-6838-4ae8-9811-2030d1e88ce7","resolution":{"observed_at":"2026-08-08T19:47:25.729945Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.712253Z","title":null,"venue":null,"work_id":"c41a3c3b-3365-4b5d-8288-ba2f3026c84e","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.014103Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:99936a323e8e58e1c54797e0c722490194685808d296419285949a5dbb9382f1","observation_id":"a315cfb7-a000-471a-a959-2b91c5623597","resolution":{"observed_at":"2026-08-08T19:47:25.716859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.698237Z","title":null,"venue":null,"work_id":"499a3650-c0ed-419a-aa1a-d8e30ad618e4","year":2017},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.018494Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:a9574e465adbbf7a36a6e9492e74343350b9d169e8a0aa38208a8a2af56f0cea","observation_id":"b246cfcf-282e-401d-9634-c8ab2d25cece","resolution":{"observed_at":"2026-08-08T19:47:25.702307Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.684687Z","title":null,"venue":null,"work_id":"1cda1826-7bd3-4671-83ae-fed59413fdc2","year":2021},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.022719Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:3a4acf0ef6f29b0f78406245d78917f5e63deb637e5b96aa4d1c91988e3d628b","observation_id":"cbfbb062-9448-4f2f-9ae4-55139c88cdec","resolution":{"observed_at":"2026-08-08T19:47:25.689575Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:25.247782Z","title":null,"venue":null,"work_id":"b14ff926-8abd-493d-87a2-601ab3a0fe9d","year":2018},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.026962Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:33f91962ede90c87a16de854b9a8f772906de111a2f324d34e041c8658cd26d0","observation_id":"988f276c-721a-4847-b86b-58025fed49f2","resolution":{"observed_at":"2026-08-08T19:47:25.251990Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:25.093871Z","title":null,"venue":null,"work_id":"7d7445ab-cc3a-4df1-9010-f483df8c15eb","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.031286Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:cd10d7fe3921a97f7c86b8d30a74478695c06864af5197ea65f1f1f8b7234a18","observation_id":"23e325b7-9ed0-4321-aa90-34c70446848e","resolution":{"observed_at":"2026-08-08T19:47:25.098674Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.670970Z","title":null,"venue":null,"work_id":"6aca2410-822c-48e3-b947-2fb3fadbcf0f","year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.035407Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:1d39f700ab2da197ff68748a7e1b7db472292a8eaf38d2a1f68cc86887eb812c","observation_id":"60bb289b-1851-4e23-98b8-bf5aeb4652a0","resolution":{"observed_at":"2026-08-08T19:47:25.675439Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.658043Z","title":null,"venue":null,"work_id":"f02f92fe-2b96-4173-80af-de70b44cb330","year":2025},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.039639Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:71a200fbcd9f5515c3400104f0d095a614d0a0bf0ddd4239fc1836cd8e442fbc","observation_id":"7b0c6fc3-dc96-4dbd-86c5-eb2115587d01","resolution":{"observed_at":"2026-08-08T19:47:25.662197Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19090","last_updated":"2024-07-26T21:11:58Z","snapshot_observed_at":"2026-08-06T11:53:08.627565Z","submitted_at":"2024-07-26T21:11:58Z","title":"MetaHive: A Cache-Optimized Metadata Management for Heterogeneous Key-Value Stores","version":1},"cited_work":{"arxiv_id":"2407.19090","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.19090","snapshot_observed_at":"2026-08-08T19:47:24.914236Z","title":"MetaHive: A Cache-Optimized Metadata Management for Heterogeneous Key-Value Stores","venue":"cs.DB","work_id":"80b088be-e0df-478f-b542-811d55ccfecf","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.043776Z"},"links":{"cited_paper":"/paper/2407.19090","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:6051bce1b9fd042338f4238f99ec4998b93c65a173f987f7b749290bab8d4df8","observation_id":"d7f924b1-2d8b-4e98-9e86-a8edb6be8042","resolution":{"observed_at":"2026-08-08T19:47:24.918948Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.645141Z","title":null,"venue":null,"work_id":"3aca337f-20d9-47c7-95cb-494fefcd9778","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.048548Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:d2cec648fc406e4f51359afd2b136ce529e620ac7a2dc450d0a9289e4eef19b0","observation_id":"355a5167-5e79-4975-835b-03ad313095d9","resolution":{"observed_at":"2026-08-08T19:47:25.649315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.10549","last_updated":"2020-08-24T16:41:47Z","snapshot_observed_at":"2026-08-06T05:19:58.060643Z","submitted_at":"2020-08-24T16:41:47Z","title":"On sampling from data with duplicate records","version":1},"cited_work":{"arxiv_id":"2008.10549","doi":null,"metadata_source":"pith","pith_arxiv_id":"2008.10549","snapshot_observed_at":"2026-08-08T19:47:24.896458Z","title":"On sampling from data with duplicate records","venue":"cs.LG","work_id":"48dd0399-5f69-475d-b041-fab2f4675048","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.052775Z"},"links":{"cited_paper":"/paper/2008.10549","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:34572904bff24efd4d4ca903455e9379d5057f7282ce279a63bbded63d51bbc9","observation_id":"426054a3-b57a-4550-823c-a53525f255eb","resolution":{"observed_at":"2026-08-08T19:47:24.901014Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:23.057378Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.057378Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:979d067d63eef252f2f8da7fa0816f7d6e30d13c278354aa2c11a3f82c0e4e92","observation_id":"69294674-594a-4705-aac7-da7363c208d6","resolution":{"observed_at":"2026-08-08T19:47:23.057378Z","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-08T19:47:25.623755Z","title":null,"venue":null,"work_id":"27944185-1743-4adf-ba47-14b52bfc9ff1","year":2021},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.061548Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:3c07ded64a89919584d484b8f486c36c1757516f26477e1b3d5b4b3063b657e2","observation_id":"1e1b58c1-a968-4de4-801b-b77c2b24955d","resolution":{"observed_at":"2026-08-08T19:47:25.627859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:24.876384Z","title":"Chaudhari, Evimaria Terzi, and Manos Athanas- soulis","venue":null,"work_id":"84a1ad22-fc91-4bf1-873e-27656dade420","year":2022},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.065735Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:e8b423ae5b35ccd75baa4977f339c8dc7a0384c3065ba1fc8495a7ca6ef39291","observation_id":"2f3f9612-3e52-4ace-a7ba-004b779bddfe","resolution":{"observed_at":"2026-08-08T19:47:24.883200Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:23.069878Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.069878Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:e22a7da4b5db17f95cc67418f6c4633c4292201a337973b3698c9755c24817e2","observation_id":"80f10ba2-3e50-4c3c-b7ea-709119a4c566","resolution":{"observed_at":"2026-08-08T19:47:23.069878Z","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-08T19:47:25.589084Z","title":null,"venue":null,"work_id":"20eefa47-00ec-4196-8433-f556454a6789","year":null},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.078223Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:9f77d12c891bba2edffa49efc7599523ec0884a84cd6f30567096a860c7f4357","observation_id":"334c8d04-6d22-4446-85c0-5c9c12a25045","resolution":{"observed_at":"2026-08-08T19:47:25.593371Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.562899Z","title":null,"venue":null,"work_id":"71efbf92-088b-496d-a0fc-4962290c03fd","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.087223Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:0b592f9c5caf291aca377ab0b3ddd505697fd0cb7a8048527c2b20cc6d0e0ed4","observation_id":"010263da-38e6-4c57-b01f-c524c31b903d","resolution":{"observed_at":"2026-08-08T19:47:25.567311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.549979Z","title":null,"venue":null,"work_id":"97ff0789-c790-4703-abe2-b5134ce8f413","year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.091472Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:639638961c11d4f1a2ca652b04fe958f95a9481c28d85565d62495356803e2ce","observation_id":"721641d3-2314-4cc3-9d6c-4293c5fa9cf2","resolution":{"observed_at":"2026-08-08T19:47:25.554173Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.536004Z","title":null,"venue":null,"work_id":"9ba12f1b-bc23-481f-a43b-346b64c267df","year":2018},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.095697Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:3f1b654e6ef89d6ea191a5b75c1f68e1a16de9bb5435389140f179f9a509251b","observation_id":"1f3e56e4-1352-42b2-99f0-f2573e2efcd2","resolution":{"observed_at":"2026-08-08T19:47:25.540748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.521817Z","title":null,"venue":null,"work_id":"82e76480-629d-4bd6-93cb-3ed8363afcfc","year":2010},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.099850Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:6dee231e59fafdfb23c056cfacfbc55cb5da44362ccb732d32c4601079a7d3ca","observation_id":"932d3f12-b149-425b-962d-99a15a2f1207","resolution":{"observed_at":"2026-08-08T19:47:25.526232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:23.103878Z","title":"Shane Culpepper, and Renata Borovica-Gajic","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.103878Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:c85923e6ca1588429ccea50dbe7256ce2b6eae7e2818c31c081abf7510b8c5de","observation_id":"fc203fbb-aa4f-4cfa-96d3-ae36d6099f8e","resolution":{"observed_at":"2026-08-08T19:47:23.103878Z","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-08T19:47:25.507331Z","title":null,"venue":null,"work_id":"c282da21-90cd-4c20-a831-380341c922bc","year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.108115Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:a93bf403873ebdb9528d465d1d31f5e792d01f05bded5ab7ae502b2e54588488","observation_id":"9ab43cef-d417-4d96-8591-a7f3e450dd04","resolution":{"observed_at":"2026-08-08T19:47:25.511594Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.492679Z","title":null,"venue":null,"work_id":"301ce701-fc1d-41bc-86a3-ba217a034083","year":2023},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.112196Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:b8eda0080099644101cce012bef1ba44e81ada342f5cc2c34b63fa368e5d4e90","observation_id":"4bd2dea5-6e7d-4f12-a2d1-81c8dd605fe8","resolution":{"observed_at":"2026-08-08T19:47:25.497213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.478803Z","title":null,"venue":null,"work_id":"34c4a0ec-ff1c-443f-a9f7-a6d2155385cc","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.116175Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:da8aaaddab6feccf138d8e33e0cc626c036cbd24362f7ce73dc5f4b03abcd675","observation_id":"1d46a67c-07c6-4906-a809-b5d62bb6d224","resolution":{"observed_at":"2026-08-08T19:47:25.483044Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:24.704856Z","title":null,"venue":null,"work_id":"9221430d-ec18-45f0-993b-49a37e2be6d8","year":2023},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.120375Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:6c2be5cfd730a17f071b9d8307bd0337a1d00f3983fc3844a91ca03ea900e4ee","observation_id":"8616fd5c-6608-4f77-b1ea-fd5c2bc2e70b","resolution":{"observed_at":"2026-08-08T19:47:24.709211Z","resolver_source":"arxiv_id_nonexistent","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.465625Z","title":null,"venue":null,"work_id":"9f5baa72-3e85-48af-b072-32d0b5617b8e","year":2019},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.124429Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:7904b050f7979e2e3cf12a8715c1eea6c61af0b7ce809b9e3a9c1378d5750200","observation_id":"f3b12b93-c3fa-40ff-8d75-e92d311d203e","resolution":{"observed_at":"2026-08-08T19:47:25.469803Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08540","last_updated":"2020-05-18T09:06:29Z","snapshot_observed_at":"2026-08-06T17:11:10.648548Z","submitted_at":"2020-05-18T09:06:29Z","title":"Approximate Denial Constraints","version":1},"cited_work":{"arxiv_id":"2005.08540","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08540","snapshot_observed_at":"2026-08-08T19:47:24.513100Z","title":"Approximate Denial Constraints","venue":"cs.DB","work_id":"529a99ff-7daf-4f88-9bf2-2bdd8a6b7f2d","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.128486Z"},"links":{"cited_paper":"/paper/2005.08540","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:32ec807c44d1a34ddbf28ee25aca2ca9952c455ffed72ad735e0c925a5feaa9f","observation_id":"26da4190-ed51-4ee1-87d4-6a404cb65b40","resolution":{"observed_at":"2026-08-08T19:47:24.517798Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:23.132955Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.132955Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:4c28e95c280bc306fa720123026cba9c24c52ae1028ed0f6f81e2e08b6f274a2","observation_id":"4ea86d6a-e4a5-4a25-8da4-102254cf5a07","resolution":{"observed_at":"2026-08-08T19:47:23.132955Z","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-08T19:47:23.141381Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.141381Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:0232d7b3c4661b92e12892296aac0a9116f046f27d9173dc9348c8e2a3589a64","observation_id":"ac288a42-fd97-478b-83af-41ba12807c56","resolution":{"observed_at":"2026-08-08T19:47:23.141381Z","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-08T19:47:25.443536Z","title":null,"venue":null,"work_id":"863c7c21-f6fd-4ec0-8eba-fe6ba17a5082","year":2017},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.146316Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:48dd6de3b05cbee645567305a3cae12b009dfc02e587fe9263980e50aa895670","observation_id":"d3e18d64-3e8d-40fe-ad2f-d488988b0b66","resolution":{"observed_at":"2026-08-08T19:47:25.447756Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:24.332455Z","title":null,"venue":null,"work_id":"0a968bbe-3b73-47b6-965b-5fd985edbaf6","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.150525Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:df994c5c2a6ef4e30f4622c67959226d333106cd75d0bc6bf0b24630d2e2a9fb","observation_id":"04fe129e-1125-44c9-8c6f-d98003d60ed9","resolution":{"observed_at":"2026-08-08T19:47:24.336632Z","resolver_source":"arxiv_id_nonexistent","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.430420Z","title":null,"venue":null,"work_id":"0fd81eb2-9eb4-4217-9f54-53efce0495f8","year":2023},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.154826Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:f96fb577f3818d526f74a09f844c71cc7dbb4e8a469be0360d1a0884bfb7216f","observation_id":"51f3eb0c-78d8-4259-b4b4-20fe3b0c74f1","resolution":{"observed_at":"2026-08-08T19:47:25.434865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17178","last_updated":"2025-04-24T01:24:55Z","snapshot_observed_at":"2026-08-07T15:59:41.809830Z","submitted_at":"2025-04-24T01:24:55Z","title":"How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice","version":1},"cited_work":{"arxiv_id":"2504.17178","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.17178","snapshot_observed_at":"2026-08-08T19:47:24.141659Z","title":"How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice","venue":"cs.DB","work_id":"cc2b64b0-edac-4b8b-8996-ec94bddc7341","year":2025},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.159030Z"},"links":{"cited_paper":"/paper/2504.17178","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:5f75e6977ffc2150afef1905a5876fe2a3cbf8231b378cecfda20f5dc696775e","observation_id":"8000f5a2-c9e3-4816-9daa-4cd4bbc0f1bc","resolution":{"observed_at":"2026-08-08T19:47:24.146314Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.417809Z","title":null,"venue":null,"work_id":"a02b8ee4-19ee-485a-9ad6-6502caebb925","year":2015},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.163505Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:dee981090211518b6cb824096bb8d076ce4ed84001640fd5e803f2d3af446f38","observation_id":"5c267f4d-a93a-43d0-a86f-a2d469f81405","resolution":{"observed_at":"2026-08-08T19:47:25.421920Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:24.123860Z","title":null,"venue":null,"work_id":"8cc68ea2-3880-40cb-b642-074fcd1de942","year":2023},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.167823Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:0b566f6b31d8afa6f393947c44fed0227bd9fccf89a33389970cb6058d00be17","observation_id":"5e461a1c-1a7d-44d2-abf1-895d3faa4404","resolution":{"observed_at":"2026-08-08T19:47:24.128091Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.403806Z","title":null,"venue":null,"work_id":"671e5838-7421-465a-b2f7-ae2c36886831","year":2022},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.171946Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:a327929c951271ddef49ce59c28d23ff078220f8ef9a2c28bd957a864fc88f10","observation_id":"1bdc5ec0-6948-4327-b910-97c1795ad458","resolution":{"observed_at":"2026-08-08T19:47:25.408458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.389725Z","title":null,"venue":null,"work_id":"a8c8db05-6abd-471c-ab38-406134325290","year":2023},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.176053Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:d7a7f46e839af5897ec812302acb59dcc4182b8a0d6af4115f3e658cccccb03e","observation_id":"6c2292ac-582f-4c1d-aa98-c32b95a37192","resolution":{"observed_at":"2026-08-08T19:47:25.393810Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14905","last_updated":"2021-11-29T19:23:58Z","snapshot_observed_at":"2026-07-06T12:13:20.920994Z","submitted_at":"2021-11-29T19:23:58Z","title":"Bounding the Last Mile: Efficient Learned String Indexing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14905","snapshot_observed_at":"2026-08-08T19:47:23.180173Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.180173Z"},"links":{"cited_paper":"/paper/2111.14905","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:51d49fab56409a7324c46254b19bf1a955e312046bebf504350f8b0bd54ffdba","observation_id":"81b0c82f-33df-47fc-916a-1484739a52d3","resolution":{"observed_at":"2026-08-08T19:47:23.180173Z","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-08T19:47:25.376766Z","title":null,"venue":null,"work_id":"cf6957ce-425d-4908-8161-9bd8d5a1fcf8","year":2023},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.184454Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:92bd95e6b64608c0b0ab755a262c5392522f9c3f0fb93cd2a4bc91c8121a9f0b","observation_id":"72a4eb8a-cd8d-4ba1-82bc-17faa17842b4","resolution":{"observed_at":"2026-08-08T19:47:25.380924Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.363383Z","title":null,"venue":null,"work_id":"1c270ad5-2e29-4861-9386-d4f3746a85c5","year":2017},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.188624Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:8502a72864b9ab6838ccf9e17b458ffb50127ed30f310bf23719b75b10830b95","observation_id":"8f0456b4-2c3d-4f10-9e25-c449a95c4b58","resolution":{"observed_at":"2026-08-08T19:47:25.367878Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.350179Z","title":null,"venue":null,"work_id":"71bbc6fe-50a6-494f-b69e-4295cf65cfbd","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.192580Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:00a6a1c7b61927d89d5607abcf58b0cf0cb2aff34d5f5178c5abcb015e3d60e8","observation_id":"5d953373-6b2a-421d-9d9b-5d866f8e3dac","resolution":{"observed_at":"2026-08-08T19:47:25.354428Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18892","last_updated":"2025-04-11T04:35:34Z","snapshot_observed_at":"2026-07-06T18:37:43.309281Z","submitted_at":"2024-06-27T05:08:09Z","title":"LearnedKV: Integrating LSM and Learned Index for Superior Performance on Storage","version":2},"cited_work":{"arxiv_id":"2406.18892","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.18892","snapshot_observed_at":"2026-08-08T19:47:23.920747Z","title":"LearnedKV: Integrating LSM and Learned Index for Superior Performance on Storage","venue":"cs.DB","work_id":"5ed1e4e0-d40d-43bf-87f0-653fd2d1d7de","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.196451Z"},"links":{"cited_paper":"/paper/2406.18892","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:f232b2cfb17c0058189cb37a8489e518d717e392590b701b67a8a3d8ec16a2f9","observation_id":"76c726eb-0e63-4411-a767-a24b8d808125","resolution":{"observed_at":"2026-08-08T19:47:23.926251Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.337239Z","title":null,"venue":null,"work_id":"426f8379-c823-48ed-9819-9b71114cb6be","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.200833Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:2335e12868be15e138a6d1477b1963fadbdde18bc8b7f58488caeb0198f348c8","observation_id":"1a93ad5d-42fb-4cc8-8bf9-13935b07f17d","resolution":{"observed_at":"2026-08-08T19:47:25.341346Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:23.901770Z","title":null,"venue":null,"work_id":"877b3a3d-d9e2-4637-8e58-0d19e4d3cf20","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.205068Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:a7fdc493da10c8b3ff8e7646882c576a3b9272d78abf58cd4951a3fe3902b428","observation_id":"e9b5185b-0259-46cf-ae4c-b0374713c6e0","resolution":{"observed_at":"2026-08-08T19:47:23.906113Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3634915","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:23.292846Z","title":null,"venue":null,"work_id":"4b57475e-3a63-480a-b14e-d8be31128156","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.209190Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:95b730100b384664e05c979fcbe000e7e9e1a6c3ea44f6cb6ab06bbc2ab99866","observation_id":"db798bbe-2ba5-4d92-a983-f45b744142d6","resolution":{"observed_at":"2026-08-08T19:47:23.298182Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:23.213261Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.213261Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:e5636bc71c983390e53589fb8c8a304aae4919113a3c6f4e7aba0cec718c7a26","observation_id":"000fc7fd-7fd6-4f35-9c4f-aed01dec4f3f","resolution":{"observed_at":"2026-08-08T19:47:23.213261Z","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-08T19:47:25.315107Z","title":null,"venue":null,"work_id":"8547c31a-a139-4651-b034-7e92477614d9","year":2020},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.221602Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:326c0608eddb9db3fe46673e63f2f6ee56e8f597a527c98eef7f59d842613743","observation_id":"44f4bbe0-f7c0-46d0-af34-05cf80771a9f","resolution":{"observed_at":"2026-08-08T19:47:25.319145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.302153Z","title":null,"venue":null,"work_id":"f27a6e02-c197-47f4-b152-12845310a005","year":null},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.225712Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:b83aba3413ea316ad40577edc2973d120ff8b9197c678ae1197216531c3ce429","observation_id":"0636989e-9194-4935-a926-d60e0ebb531c","resolution":{"observed_at":"2026-08-08T19:47:25.306147Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.289063Z","title":null,"venue":null,"work_id":"4ac478f6-5a65-4e1b-bc51-059417a98cbb","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.234166Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:077315b2a42f63af09afa7217d59c56293c1a9cf392dbafa86edd9b9ae2d824e","observation_id":"109b70c1-b5d1-4325-8b93-96831155ba17","resolution":{"observed_at":"2026-08-08T19:47:25.293121Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.275799Z","title":null,"venue":null,"work_id":"2ee21d7c-ebe2-4cd6-8b52-9f1ffc2b141e","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.238345Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:85fe38a4ad27cf7d27985f6cb21b60027357ba5d607f0841b16f1d67e9508fe7","observation_id":"e2afda06-bd10-4a51-8125-8b473391b45d","resolution":{"observed_at":"2026-08-08T19:47:25.280516Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:23.738965Z","title":null,"venue":null,"work_id":"6adfb574-3525-4227-99fd-a58c717b587c","year":2022},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.242446Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:8f114dd2632c4a7953f53074f15a31e378d8c00b426278fd531a378fd77c0fd2","observation_id":"c8d7e2b6-b6e5-4116-9b46-3244c1bec333","resolution":{"observed_at":"2026-08-08T19:47:23.743150Z","resolver_source":"arxiv_id_nonexistent","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15581","last_updated":"2024-07-22T12:17:01Z","snapshot_observed_at":"2026-08-04T10:15:15.222567Z","submitted_at":"2024-07-22T12:17:01Z","title":"vLSM: Low tail latency and I/O amplification in LSM-based KV stores","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15581","snapshot_observed_at":"2026-08-08T19:47:23.229915Z","title":"arXiv preprint arXiv:2407.15581 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.229915Z"},"links":{"cited_paper":"/paper/2407.15581","citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:934ce382323be8c19e326c90c14fae9c75f4097f926cdf94247882645126c70f","observation_id":"befd6dd2-d3b6-4e9f-b1a5-fe547ccc1be5","resolution":{"observed_at":"2026-08-08T19:47:23.229915Z","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-08T19:47:25.262402Z","title":null,"venue":null,"work_id":"a51af990-b700-45e1-93fe-627651ef1986","year":2022},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.250610Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:6856666f73a96ef5c7a5ae7a39a1bee064dfb4828b8e6ebf11502ed41671b026","observation_id":"682e50ef-d902-4438-b222-1a90919a7b47","resolution":{"observed_at":"2026-08-08T19:47:25.266880Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:23.559442Z","title":null,"venue":null,"work_id":"3ff4a5bc-f3ab-4c6f-aa16-575d2b5bd34b","year":2025},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.254829Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:5ee2d746d0b095b7078588d50854e8a712c5cd2837a166b7c6c31688280016d5","observation_id":"6fbfd2f5-d090-4600-be05-c21222838c63","resolution":{"observed_at":"2026-08-08T19:47:23.564816Z","resolver_source":"arxiv_id_nonexistent","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:23.246484Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.246484Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:83e58e06dc0d72ab0c21ec0081716890d664354fa91de44b673b68246beaac01","observation_id":"190f0905-193f-40f6-a4a8-3f1f31da4437","resolution":{"observed_at":"2026-08-08T19:47:23.246484Z","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-08T19:47:25.576098Z","title":"In 17th USENIX Conference on File and Storage Technologies (FAST 19)","venue":null,"work_id":"e26054a8-f59e-462f-80ba-d383651d897c","year":null},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.082468Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:59ba1cde1440e90f0e9450d3f13af2a85c9f35b272705afecaa4a641d0d316c6","observation_id":"7471e1c5-3cfe-47db-800b-81670f226585","resolution":{"observed_at":"2026-08-08T19:47:25.580524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:47:24.493516Z","title":"VLDB Endow","venue":null,"work_id":"6d32d7f9-31e7-4128-8e00-929b5c725259","year":2021},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.137281Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:cc77f2a2816516eb08bdb3af11103242de66a293f30ef3be8374982fe2f0bda7","observation_id":"6e54a4eb-b28d-41e9-b3b5-b488edfcca7f","resolution":{"observed_at":"2026-08-08T19:47:24.497803Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T19:47:25.601909Z","title":"The VLDB Journal (2024), 1–24","venue":null,"work_id":"7c2f816a-0a4c-415c-a150-b0d0de716e64","year":2024},"citing_paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T19:47:23.074037Z"},"links":{"citing_paper":"/paper/2502.05369"},"observation_digest":"sha256:c4d278c5186655da30b44c5e4cb3d82782a15e421f9fea4d7fe65467e6bdf86c","observation_id":"734763e5-573b-4bd9-9a0c-5e63a680a2f9","resolution":{"observed_at":"2026-08-08T19:47:25.606175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05369","last_updated":"2025-09-02T00:35:44Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-08T19:34:23.011666Z","submitted_at":"2025-02-07T22:48:14Z","title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees"},"reference_resolution":{"displayed":74,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":14,"verified_fuzzy":6},"total_outbound_references":74},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 74 of 74 outbound references and 1 inbound Pith citation observation for arXiv:2502.05369."}