{"as_of":"2026-08-08T09:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54494fd5f34f2d3f9cdcde3576272ce22bbde40d6ddd0e81810992b3d5376b8e","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:39:44.674144Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.04678/citation-record","integrity":"/paper/2506.04678/integrity","json":"/paper/2506.04678/citation-record.json","paper":"/paper/2506.04678"},"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-07T10:39:47.315861Z","title":"https://github.com/google/leveldb","venue":null,"work_id":"a1765971-451d-40bf-b378-71a9a938097b","year":2023},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:42.994361Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:f0672e5b2d03e2e4da093c09dbaa5dfe4f01bbc565ea8082f586443d2e7fa2a3","observation_id":"9b15c696-ef44-46f6-a9d7-8e75ed9dd949","resolution":{"observed_at":"2026-08-07T10:39:47.367881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:47.214967Z","title":"https://rocksdb.org/","venue":null,"work_id":"33e07bc3-3a06-4f27-bd1b-9839a03965fe","year":2023},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.082872Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:55672d7581b94519b469c5b65548b4ce6354adb0c333b223bf54449e4f0e1728","observation_id":"fb2159d4-a487-464d-a6f1-5352f7dcd78a","resolution":{"observed_at":"2026-08-07T10:39:47.264987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:47.110459Z","title":"Hadoop-hbase for large-scale data","venue":null,"work_id":"c440c236-556d-43ff-a21f-f5740aec2abb","year":2011},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.153691Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:1f74eb37e1878895a6d7dba663acea23f60020d8431651763cffc4bdf6105649","observation_id":"786fa835-50e3-4965-87b3-b134f23d9d4b","resolution":{"observed_at":"2026-08-07T10:39:47.152169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:46.963421Z","title":"Cassandra: a decentralized structured storage system.ACM SIGOPS operating systems review, 44(2):35–40, 2010","venue":null,"work_id":"8ebfb5d5-f804-495b-aeb6-3a1ccb94c7c7","year":2010},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.286641Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:4948902a4ef6e2c60390b5b972e34cc32ac389fa2de26f984ce7eaa7bb948335","observation_id":"7ac35644-3a44-408b-9923-0476f7e4bb13","resolution":{"observed_at":"2026-08-07T10:39:46.999391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:46.824441Z","title":"Tidb storage design and implementation: Distributed transaction log analysis.TiDB Official Documentation, 2024","venue":null,"work_id":"bc4e994a-5559-4ee9-a026-7029ec7dc76c","year":2024},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.360734Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:b9d8403b05b3f0edf631e53f28582b754b6b176df945683ea5ceecd70889eaf5","observation_id":"b81d41c5-a2b2-471a-b265-0282ecda494f","resolution":{"observed_at":"2026-08-07T10:39:46.862307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:46.668144Z","title":"O’Neil, Edward Cheng, Dieter Gawlick, and Elizabeth O’Neil","venue":null,"work_id":"9eb5ddd4-b6a3-4a1a-b50b-3b9ba24ceb85","year":1996},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.452710Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:967658e30512f178c6a4006186a81a089205ccb9a5cbff441792446fd8ef4c3d","observation_id":"d14d765e-fa64-41cc-aa2d-d84f8d30efce","resolution":{"observed_at":"2026-08-07T10:39:46.749421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:46.525705Z","title":"Exploring cascaded write amplification in lsm-tree based key-value stores with solid-state disks","venue":null,"work_id":"c820cfe8-721d-4ee2-a5bd-bcaf25659ae1","year":2019},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.528792Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:60d681ae9bd52d6fe78cba0a061d9600dd1286263608cb7da6ef803f2598acb6","observation_id":"140398f4-d648-4a86-8d66-087e2bfff487","resolution":{"observed_at":"2026-08-07T10:39:46.599412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:46.420498Z","title":"Wisckey: Separating keys from values in ssd-conscious storage","venue":null,"work_id":"67375130-459f-46a6-8ff5-afcdda5f6a2b","year":2016},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.630099Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:27ecf1878c18b93b5925b9a04f1c42d95298c0d51dcd722ec5f8bf191ac834dd","observation_id":"f5b714d6-a23d-418e-a14d-6785ec2179e0","resolution":{"observed_at":"2026-08-07T10:39:46.491706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:46.264414Z","title":"{MatrixKV}: Reducing write stalls and write amplification in {LSM-tree} based {KV} stores with matrix container in {NVM}","venue":null,"work_id":"82114882-f033-4625-832c-0d604fcfe1b3","year":2020},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.719501Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:6075007a5213fcef7e8eb682ba1ea05de936d2cf68535756f3c7c38fc38fc6f3","observation_id":"6d7219e4-0a6a-458f-97de-3dc521ffbcf5","resolution":{"observed_at":"2026-08-07T10:39:46.346021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:46.134124Z","title":"Pebblesdb: Building key-value stores using fragmented log-structured merge trees","venue":null,"work_id":"0c976e07-6c52-4bc0-945f-472aba8bca0e","year":2017},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.799245Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:d43cda18df630234cde94e5d1b03d0255d167e8b146aaebac1df7b235ccb95f5","observation_id":"94a7dcb7-f8f6-4640-8c95-d617c921161d","resolution":{"observed_at":"2026-08-07T10:39:46.190837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:45.968455Z","title":"Atlas: Baidu’s key-value storage system for cloud data","venue":null,"work_id":"9bcbe8fe-aa18-482e-87cf-f092f98e9291","year":2015},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:43.900291Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:4360dd9322fee98280a7aab26ed777ac3a4451885389cb02310c361d233300d6","observation_id":"2c8a064d-8252-4045-a190-0cd6d82d22ed","resolution":{"observed_at":"2026-08-07T10:39:46.036588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:45.842206Z","title":"BlobDB: A RocksDB-integrated Key-Value Separation Solu- tion","venue":null,"work_id":"59cf6b70-eb4b-427b-ac36-9fc8d3cfc049","year":2020},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.007246Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:12af527ca0ec9948f920f9bb48e24ee83bdb6e9e5e323746a1f298e51563ff3c","observation_id":"e750e401-c08f-4550-a9ad-4e2fb530d0c7","resolution":{"observed_at":"2026-08-07T10:39:45.902155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:45.660114Z","title":"{HashKV}: Enabling efficient updates in {KV} storage via hashing","venue":null,"work_id":"173cfcdd-582a-44c0-a62d-0695a4ee306d","year":2018},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.111740Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:9c1ddeb4491c9237db49bac4b1a0d4aebdcda78119fa2e385865cb90c102e2bf","observation_id":"be9f2c62-9c55-4887-97e7-646cc0473730","resolution":{"observed_at":"2026-08-07T10:39:45.747495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:45.507356Z","title":"Titan: A RocksDB Plugin to Reduce Write Amplification","venue":null,"work_id":"07084ed7-b172-41f8-911d-80af4dc27c52","year":null},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.205930Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:7a78ae9c08981073bb992f266f519e0adb4b4414f51dcc2271cf6d591f4f57ad","observation_id":"45cce2b8-56f7-49e4-9ff2-682ae486fc58","resolution":{"observed_at":"2026-08-07T10:39:45.577010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:45.204512Z","title":"Kreon: An efficient memory-mapped key-value store for flash storage","venue":null,"work_id":"3b1918a5-2b3b-48a6-be1b-d02110fde84a","year":2021},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.370468Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:c7221d37dc2ed89236182f8abd679291d17d01b05dafd85ad563917ef58228fd","observation_id":"3df74034-ede3-4282-bcd8-02640235199b","resolution":{"observed_at":"2026-08-07T10:39:45.289533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:45.057166Z","title":"Differentiated {Key-Value} storage management for balanced {I/O} performance","venue":null,"work_id":"f3adccc5-c5d2-47cc-bde8-f97606744a05","year":2021},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.476993Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:e190ae920da00e828023358cd255c0ecd47252d9adae3d1efd25e6cc6653bf47","observation_id":"30b635a1-53a7-4988-ad9e-f70082045dca","resolution":{"observed_at":"2026-08-07T10:39:45.120685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:44.900208Z","title":"Enhancing lsm- tree key-value stores for read-modify-writes via key-delta separation","venue":null,"work_id":"d160947b-312d-4a92-8ce7-c7166c87fd64","year":2024},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.570158Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:8c2379df9d1bb1966e738ba483047bf1d479bcacfad8f913dbf87a7c6dd8095b","observation_id":"588f4ad7-85d4-4a39-9a04-53bae68dcc38","resolution":{"observed_at":"2026-08-07T10:39:44.969441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:44.768289Z","title":"Benchmarking cloud serving systems with ycsb","venue":null,"work_id":"b0033fdd-5943-4ac9-8588-ae2e5e63ceb2","year":2010},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.674144Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:5e9f58bf07e59e87627c808e60c8f1f36e4c4fa8b4a94af0175013e751b878d4","observation_id":"cfae3ba1-c5b9-43a4-a161-9ed6cfb4197c","resolution":{"observed_at":"2026-08-07T10:39:44.827685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:39:45.376974Z","title":null,"venue":null,"work_id":"39762252-b91d-4040-b5f4-6a22c315626f","year":2025},"citing_paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T10:39:44.316097Z"},"links":{"citing_paper":"/paper/2506.04678"},"observation_digest":"sha256:0c25831b88fcb748f8d081ca8812f534a8c84a92f0d98002ba69f91ed50b201e","observation_id":"311381f8-2560-488b-9366-a1c8ff6c85ea","resolution":{"observed_at":"2026-08-07T10:39:45.439532Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04678","last_updated":"2025-06-09T01:41:08Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T10:33:16.750309Z","submitted_at":"2025-06-05T06:54:25Z","title":"BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":0,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":19},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2506.04678."}