{"as_of":"2026-08-22T20:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fd7eff497fa965b8a455c4e58e6734aa9f179ed9b74fb66052562606bfab8c8","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:33:40.627190Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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-05-16T15:50:25.654519Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-16T15:51:05.202501Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"cited_work":{"arxiv_id":"2412.09983","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.09983","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d584d197-8079-4dd6-b2ee-d2cd6c88de1d","year":null},"citing_paper":{"arxiv_id":"2601.05649","last_updated":"2026-01-09T09:11:05Z","snapshot_observed_at":"2026-08-15T03:30:25.895525Z","submitted_at":"2026-01-09T09:11:05Z","title":"Statistical Foundations of DIME: Risk Estimation for Practical Index Selection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-16T15:50:25.654519Z"},"links":{"cited_paper":"/paper/2412.09983","citing_paper":"/paper/2601.05649"},"observation_digest":"sha256:39d66604df322eb6298e1e5a12787d2d1f225a169ea486466af003412894d9f7","observation_id":"baf3beae-97db-45ec-bc01-f42692844fb5","resolution":{"observed_at":"2026-05-16T15:51:05.205185Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.09983/citation-record","integrity":"/paper/2412.09983/integrity","json":"/paper/2412.09983/citation-record.json","paper":"/paper/2412.09983"},"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-11T16:33:40.971418Z","title":null,"venue":null,"work_id":"42d3acb5-bf9a-449a-b26d-279a8a0ad7c4","year":2023},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.523437Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:9d816200ee780bb74385dde408b412a24d421a3c44687cb62b0f6cd29e42496a","observation_id":"ab9d85e5-0ec0-40e1-966e-470a455f1bde","resolution":{"observed_at":"2026-08-11T16:33:40.975667Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.957067Z","title":null,"venue":null,"work_id":"828f63c0-b441-4ddd-a0f4-c2a321639e2c","year":2021},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.529620Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:815dbeaa35e8ee13af8e0ecdf1d548e256228e7c995992ead35f1c9e03f6ba50","observation_id":"467781ac-f60c-4fea-86ed-d63231d5143e","resolution":{"observed_at":"2026-08-11T16:33:40.961395Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.942197Z","title":null,"venue":null,"work_id":"e57c7bfc-bafa-47cd-aa73-b6f47b2b3850","year":2016},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.534636Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:df73a2a373219d8a1d802d3be1b14f0ad0d0169bfb34a159e46fd93a47da3d80","observation_id":"32ddcf95-53a7-4fe7-85d0-aa74046951e3","resolution":{"observed_at":"2026-08-11T16:33:40.946661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.539425Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.539425Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:8f851e4b6f803f24fc37943c1925023eec8d2c0f5b3045405f00dbad03bdbfd9","observation_id":"c4753714-1ace-4451-9fe0-3b6fbe5768bb","resolution":{"observed_at":"2026-08-11T16:33:40.539425Z","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-11T16:33:40.915812Z","title":null,"venue":null,"work_id":"a24ecf23-f18f-458b-83d0-6fdc8941174c","year":2021},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.544192Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:ef4688df09a7788be66b3a20099801f7ac991a801dc45f0f02a77e1bdad23e7c","observation_id":"86a3522e-4985-4c55-b8ae-4e3664b799cf","resolution":{"observed_at":"2026-08-11T16:33:40.919870Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.900912Z","title":"Voorhees","venue":null,"work_id":"9973ac25-46ce-4f8a-8df5-d2da04d0eaea","year":2020},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.549784Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:433b981e00b59fab44a41f64c30fb3a8a70d68fdb2f0a730248a8951a7c5e44d","observation_id":"30d938c1-d912-4c5f-8bd8-0ef1bdf27ce2","resolution":{"observed_at":"2026-08-11T16:33:40.905524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.885741Z","title":"Dumais, George W","venue":null,"work_id":"dbfcbe48-54a2-4be7-869f-cfc5b336b365","year":1988},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.556099Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:61cbcecb32164276570f76ee5c687ae592dee2bce6c5107ff8b91ceebfb551a5","observation_id":"7f29b914-4021-42a0-b7b1-1f910c40e6ac","resolution":{"observed_at":"2026-08-11T16:33:40.890836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.870691Z","title":null,"venue":null,"work_id":"b6c8b098-6b86-4c12-b3c8-2813ffa21cc8","year":2024},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.561105Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:7c703b3532a259bcfeb9a090901d816622ff34b7ae614ad9bbe1d73df637400b","observation_id":"57f44641-e85c-43ca-aac4-21e94c299606","resolution":{"observed_at":"2026-08-11T16:33:40.875766Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.855564Z","title":null,"venue":null,"work_id":"62bf6dc3-ae01-464d-8572-434c0da294b1","year":2024},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.566157Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:8be1aec63f02b9d4d08f170084baa22859066dcf6f05e8f9b003b986db7917f1","observation_id":"dc737f44-0e03-471a-9e7b-87d08cd03f73","resolution":{"observed_at":"2026-08-11T16:33:40.860331Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.840802Z","title":"Lin, and Allan Hanbury","venue":null,"work_id":"eb49b1de-b520-4a0e-84c1-4fd6bbfa94f6","year":2021},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.571120Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:f2376af1446e0226d669f9f4810e77c82e9bd8a80222d50d6b03129e23de61d2","observation_id":"64acbb65-7e44-4a1f-998b-01cbadb84003","resolution":{"observed_at":"2026-08-11T16:33:40.845592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.825102Z","title":null,"venue":null,"work_id":"b23ce967-403e-4218-ba87-ac02f90215ef","year":2022},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.576059Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:d041aa357cbc312c18549adf4455b7ee55d4bb09eca8f3787999ea15f3369019","observation_id":"3f7b98cd-515e-478d-99e5-3a9b09bb94bb","resolution":{"observed_at":"2026-08-11T16:33:40.830601Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.809529Z","title":null,"venue":null,"work_id":"95ef69e0-579f-4d3a-8976-5f188bf531db","year":2021},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.580972Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:ba645c2cfd3db2a93d3970d7641b8456fb5b75217a230129de96f21a9a4182ea","observation_id":"b41195ba-eabd-4f21-83ef-a1aec6168ab3","resolution":{"observed_at":"2026-08-11T16:33:40.814747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.791800Z","title":null,"venue":null,"work_id":"9af77a87-1406-454e-81a7-405d278b8a70","year":2022},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.585147Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:800fe0d9196107628ae9943dadc33007500f78e68dab7721999cafee34b2d90b","observation_id":"1f6c1d46-dbb7-4b9f-80f8-ae3c45afd2c6","resolution":{"observed_at":"2026-08-11T16:33:40.797283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.773982Z","title":null,"venue":null,"work_id":"ae1c4111-86b2-4440-a1ed-3122e6d63bd3","year":2022},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.589473Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:7fc4953af2ce8db333c0bc213c368a3afe97f381661f68c07a9df27143441fdc","observation_id":"8d78dd50-4cc9-4588-9543-eb6da15d971e","resolution":{"observed_at":"2026-08-11T16:33:40.779052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.758565Z","title":null,"venue":null,"work_id":"ace75eaa-8607-4a79-9b9b-8168a61e1d52","year":2021},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.593685Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:1b419afce0a9d4fc75be3e1e906bdf1032ed8eb3e7fec701235c5ebecf806a49","observation_id":"899d9085-b7dd-4bb6-a527-5c7006c02ab9","resolution":{"observed_at":"2026-08-11T16:33:40.762840Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.742384Z","title":null,"venue":null,"work_id":"44cc6126-2ef9-4af8-94e1-25b15596d0e6","year":2004},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.598218Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:e8dcbe3c7d62065a448a53c24cbd2d1206f4b4a5d9cccfe4c00ce0eb5dce54d6","observation_id":"0bc623af-8b1b-40fd-b5ca-8d5e1ec09b6f","resolution":{"observed_at":"2026-08-11T16:33:40.746969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.726324Z","title":null,"venue":null,"work_id":"813e2404-a735-4e6c-9586-c58700eb954d","year":1901},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.602294Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:accf1f0823db3cf65902edeef6aa56cd9fe21c80658e6ee1d3867b0f38e35868","observation_id":"49f50c95-e756-4bf9-9fc2-f2f81c85b89d","resolution":{"observed_at":"2026-08-11T16:33:40.731231Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.709797Z","title":null,"venue":null,"work_id":"566d5d72-f0bb-4e36-a640-e729ba9575cb","year":2021},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.606491Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:af1aa5c3506aee0294e09e3f10b4099cdf844eb1b690fe515a4e6a568a898cef","observation_id":"c37e2b4d-07da-4212-945a-24e88559f960","resolution":{"observed_at":"2026-08-11T16:33:40.714808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.611358Z","title":"Bennett, Junaid Ahmed, and Arnold Overwijk","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.611358Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:61b0a81c7822603d9adc97175218529044a53f14c4d160a5e5ee7d7657d8f6ea","observation_id":"8f8e99ee-232e-44bb-88d9-55609064f436","resolution":{"observed_at":"2026-08-11T16:33:40.611358Z","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-11T16:33:40.664951Z","title":null,"venue":null,"work_id":"a84aef52-7528-4cc7-8691-2871b082fdd9","year":2024},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.627190Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:0ca8e5b4e9d581278e4455878a24756c3e7b494e8a1fb750f8e460faea4e8135","observation_id":"8417c623-8b2d-47f0-83c8-2b5595354719","resolution":{"observed_at":"2026-08-11T16:33:40.671120Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T16:33:40.681975Z","title":null,"venue":null,"work_id":"65c95e51-e582-4a25-9960-f11c08ea229e","year":null},"citing_paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:40.621566Z"},"links":{"citing_paper":"/paper/2412.09983"},"observation_digest":"sha256:69d5a393e00b9615b8bd4f95d6516e631df5bf664e079af609324408f0c2c3f4","observation_id":"fa1db78f-5e4e-4e57-b86c-48e790300ac9","resolution":{"observed_at":"2026-08-11T16:33:40.686852Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.09983","last_updated":"2024-12-13T09:09:20Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-16T09:42:50.824420Z","submitted_at":"2024-12-13T09:09:20Z","title":"Static Pruning in Dense Retrieval using Matrix Decomposition"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":21},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 1 inbound Pith citation observation for arXiv:2412.09983."}