{"as_of":"2026-08-18T22:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6670f3c6475f07fb3b731d65c8be5392222fd625fcfcf85a45b981b2abc5009f","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:40:15.676788Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2509.02377/citation-record","integrity":"/paper/2509.02377/integrity","json":"/paper/2509.02377/citation-record.json","paper":"/paper/2509.02377"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:40:15.472417Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.472417Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:bd13887dc563dc991d8a767907435741a6fddeef6de482f351c6da2b9c31e65a","observation_id":"03fb88a8-1177-4a96-af11-a7efe176eec3","resolution":{"observed_at":"2026-08-05T11:40:15.472417Z","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-05T11:40:15.477988Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.477988Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:06a4a7b6d55809eb3103845fa99e24225810afe89cdbd01c53ba17c5d0200072","observation_id":"a2f1690f-0f28-45ce-bf6a-c4f322b74d9e","resolution":{"observed_at":"2026-08-05T11:40:15.477988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07662","last_updated":"2021-02-15T16:47:00Z","snapshot_observed_at":"2026-08-16T18:45:27.659994Z","submitted_at":"2021-02-15T16:47:00Z","title":"Overview of the TREC 2020 deep learning track","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07662","snapshot_observed_at":"2026-08-05T11:40:15.484693Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.484693Z"},"links":{"cited_paper":"/paper/2102.07662","citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:66e5b2156dfeea637051c996ec77cc483afa1e0109b0a1d18caf658c1d278285","observation_id":"ae6cfb1c-f54a-4d9f-bd14-de50f8b942d2","resolution":{"observed_at":"2026-08-05T11:40:15.484693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.07820","last_updated":"2020-03-18T16:56:56Z","snapshot_observed_at":"2026-08-10T13:25:09.780441Z","submitted_at":"2020-03-17T17:12:36Z","title":"Overview of the TREC 2019 deep learning track","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.07820","snapshot_observed_at":"2026-08-05T11:40:15.491459Z","title":"Voorhees","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.491459Z"},"links":{"cited_paper":"/paper/2003.07820","citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:62c3305e09aa98c5fdbe983b46bdb037272535a19445fcc306866b02a06b95ca","observation_id":"f208ede7-e06f-4e9d-ac93-64c94c312234","resolution":{"observed_at":"2026-08-05T11:40:15.491459Z","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-05T11:40:15.499581Z","title":"Dhole and Eugene Agichtein","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.499581Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:b95965f389c20b75ccca79abfab4a0d2764f95f8aee362641b8b910de2421442","observation_id":"a78835ec-25f9-4d87-9765-fc1786c3e898","resolution":{"observed_at":"2026-08-05T11:40:15.499581Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-05T11:40:15.505840Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.505840Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:70e411939a896eaa2d307c210e2ca98cb9575c5531c1bd834b958156e827f4b1","observation_id":"6ebc53ee-bef8-41d9-99db-51cf451e576b","resolution":{"observed_at":"2026-08-05T11:40:15.505840Z","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-05T11:40:15.513758Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.513758Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:86615beda41585e5720fca18a2f8d6c4ea5ea9e0c0407fd323d666d256ccdc1f","observation_id":"25ce0a4d-2354-4c42-a789-47220f0779dc","resolution":{"observed_at":"2026-08-05T11:40:15.513758Z","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-05T11:40:15.531973Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.531973Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:a3915d7e74f0ad811eb9cebca4ff7a387192b49fb60d87e2327a70e236de4079","observation_id":"4a371ec5-bcf3-45bd-bcff-13aa1ac7eaac","resolution":{"observed_at":"2026-08-05T11:40:15.531973Z","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-05T11:40:15.537170Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.537170Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:61a0cd678efe3afa6714849c81923d488e4f9fb89dceee6df34cdcf7c943d062","observation_id":"38cdc5e0-7c4a-4949-9a53-3f407fe8e53d","resolution":{"observed_at":"2026-08-05T11:40:15.537170Z","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-05T11:40:15.543338Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.543338Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:97b89cb738e5a2fa99e141e71446322a3aa79936ff5929a148d9620c8d19b280","observation_id":"e26ffc89-27ee-4f0c-bdef-bcb6bd2cc417","resolution":{"observed_at":"2026-08-05T11:40:15.543338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03653","last_updated":"2023-05-05T16:16:45Z","snapshot_observed_at":"2026-08-18T09:57:42.966695Z","submitted_at":"2023-05-05T16:16:45Z","title":"Query Expansion by Prompting Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03653","snapshot_observed_at":"2026-08-05T11:40:15.550347Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.550347Z"},"links":{"cited_paper":"/paper/2305.03653","citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:c00ccc1809ffff86b891376521d2446c5d7845b9d4726aa26980030da289e280","observation_id":"6d706749-684d-402c-9604-4338cb3ac149","resolution":{"observed_at":"2026-08-05T11:40:15.550347Z","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-05T11:40:15.557479Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.557479Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:e2b46a36f3f3aad2ebd8439ca32baa1bf9ac4cb0992b05cdc97959ee151c4939","observation_id":"1e02067e-82fd-486f-b8c0-c6d57869f672","resolution":{"observed_at":"2026-08-05T11:40:15.557479Z","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-05T11:40:15.563750Z","title":"Bruce Croft","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.563750Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:013115842fec5d5843d53c4b5e952ddeb67c9f11d73259d90851a01a342b6fe4","observation_id":"9391e3ac-97dd-41b2-8d38-ac86c1008a25","resolution":{"observed_at":"2026-08-05T11:40:15.563750Z","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-05T11:40:15.570024Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.570024Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:168072fbbef39ba8ddc8656b41317ed8f2e7ef4f89c32b65fc02757586c331cd","observation_id":"e5dd9ca4-1e91-46a8-998b-445e43aac16b","resolution":{"observed_at":"2026-08-05T11:40:15.570024Z","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":"4835.34632","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:40:16.315934Z","title":null,"venue":null,"work_id":"16d05b7f-db56-4449-956d-e03fafa6ef41","year":2021},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.576079Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:d5a2f008d2645214a34a57c11e17d30ce368db95d4249b3b70b5d75e5c83ba5d","observation_id":"a7741f39-a5a1-4385-835e-357c38e59677","resolution":{"observed_at":"2026-08-05T11:40:16.328170Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.07477","last_updated":"2023-05-12T13:46:17Z","snapshot_observed_at":"2026-08-16T15:33:34.290184Z","submitted_at":"2023-05-12T13:46:17Z","title":"Generative and Pseudo-Relevant Feedback for Sparse, Dense and Learned Sparse Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.07477","snapshot_observed_at":"2026-08-05T11:40:15.581697Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.581697Z"},"links":{"cited_paper":"/paper/2305.07477","citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:ec326c19ce62386039f6091f6c2374a58cf9e4af8f92440204156699bccaf502","observation_id":"8ac7234e-e01d-4363-9160-94b2dbdc0fd4","resolution":{"observed_at":"2026-08-05T11:40:15.581697Z","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-05T11:40:15.587671Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.587671Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:d6812294dc0a2bc6bea284bd79e41cfa16a7d9b949821ee1b45bb3016136f5cd","observation_id":"0689e3ce-3870-44fb-9739-4adde0ca6542","resolution":{"observed_at":"2026-08-05T11:40:15.587671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10506-022-09341-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:40:15.776648Z","title":null,"venue":null,"work_id":"2a51a79e-6077-406b-b124-a3d0cbff9294","year":2022},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.594262Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:f2d4ae3ae47b911483e3b5f8e6981ccc5be5d3c089fc3fc24ecc1731d9572061","observation_id":"d8157242-076b-4aaf-ba62-8aa9ed8f04f0","resolution":{"observed_at":"2026-08-05T11:40:15.783166Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T11:40:15.600242Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.600242Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:d9ff5ccfacce8b952820b873f5c2138a8e1c499b9e45d40dc3adac0c1173a481","observation_id":"5201d33e-ee2f-4bd5-bc3e-2d0ac0a3908f","resolution":{"observed_at":"2026-08-05T11:40:15.600242Z","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-05T11:40:17.429584Z","title":null,"venue":null,"work_id":"f355448e-0251-4d68-b5d3-adbc63b26f9b","year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.605476Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:fdbb70584d7d95aea98acff64953cec37567dd33c9b7fc74350d736d374bd6a3","observation_id":"47a5e817-fcc3-4f6d-81f0-146a7ee5a43b","resolution":{"observed_at":"2026-08-05T11:40:17.521995Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T11:40:15.615465Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.615465Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:09ade87038fee710f760de905032eaf8caa9f77f298ffa565180623c828d24ef","observation_id":"13a44bb4-0391-434c-ab2b-e03ccb338eba","resolution":{"observed_at":"2026-08-05T11:40:15.615465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1108/eb026866","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Journal of Documentation","work_id":"6e37d6ef-1e0c-4a4c-aa98-49aa83cf8300","year":1991},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.621412Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:06c1e954f3a925a7917030523d76432a3c65305b87674e4b2cb872110b10ec14","observation_id":"c8a29351-e7f5-4798-a4d7-2cfe760e9cb8","resolution":{"observed_at":"2026-08-05T11:40:15.751704Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T11:40:17.264001Z","title":"Robertson, Steve Walker, Susan Jones, Micheline Hancock-Beaulieu, and Mike Gatford","venue":null,"work_id":"6f629957-f73f-4b98-87c8-a5b8863dd06a","year":1994},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.626695Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:a2768b6aa3ab87bac271f0784122a997254e315e3664b5040aea3664466cb1c6","observation_id":"78e05871-6765-47d4-907c-88e2c4330803","resolution":{"observed_at":"2026-08-05T11:40:17.337185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T11:40:15.633949Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.633949Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:8c9ce3fac474bc460e41a3048e97e51334a0f0a37fa749be8c69daae95a20286","observation_id":"7f6b6ef1-9978-4f54-97c7-5ce32a63106d","resolution":{"observed_at":"2026-08-05T11:40:15.633949Z","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-05T11:40:17.099743Z","title":null,"venue":null,"work_id":"c32b11a4-4860-4f6a-9198-e69f3ced5031","year":2021},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.639670Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:a8107bba9048f8495701dbe361153f53e131d56cc14fbed841342589744943f7","observation_id":"bc36f329-cb0b-420b-9038-9a4853366c5f","resolution":{"observed_at":"2026-08-05T11:40:17.154225Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-05T11:40:15.646595Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.646595Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:7f112d070591a2dc78f23b4608581e963d5c4b940b76a55244d0614a4c0b9272","observation_id":"2dc29068-2aaa-437d-b9da-01addd28d5f2","resolution":{"observed_at":"2026-08-05T11:40:15.646595Z","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-05T11:40:15.653051Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.653051Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:3155d595180a7f721eac6140b48e6b295fc6d4cacee5208f2a34235afb9728f2","observation_id":"6800b1fa-1826-4075-9cbc-f63c71305a3d","resolution":{"observed_at":"2026-08-05T11:40:15.653051Z","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-05T11:40:16.883850Z","title":null,"venue":null,"work_id":"fb82e41e-8fba-483c-947d-1b75d02ec8f3","year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.659909Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:7628334af61eba0295d608ef0b379768ebf5b56deac1dad95324e3894274b0a2","observation_id":"007f23ea-818d-4614-a521-cb4315d4b7f0","resolution":{"observed_at":"2026-08-05T11:40:16.984924Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T11:40:15.665885Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.665885Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:c6fdffdcf3bda6adb023daac00b2d599a79cfa8d086e8e78305b4628432904dd","observation_id":"3ccf2ccc-c063-4bef-882e-c98f77296cb5","resolution":{"observed_at":"2026-08-05T11:40:15.665885Z","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-05T11:40:16.750100Z","title":"Bennett, Junaid Ahmed, and Arnold Overwijk","venue":null,"work_id":"cf0f3c99-f86d-4843-a358-6ab73895ef6e","year":2021},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.671902Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:c5e33d9dd4fd21673f8746b8db31d4954c3e8742df667749ae9a779e644d84d4","observation_id":"6f6d5f77-d455-4a16-b329-f4e744f3278c","resolution":{"observed_at":"2026-08-05T11:40:16.799338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T11:40:15.676788Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.676788Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:3c8b8ef9a96c1048845c2c8ff33fef6d4c673e79fd7e2fb218302e4415c25ce0","observation_id":"d7c1df27-18a4-434d-821e-54b5652a6229","resolution":{"observed_at":"2026-08-05T11:40:15.676788Z","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-05T11:40:15.526539Z","title":"In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (Madrid, Spain) (SIGIR ’22)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T11:40:15.526539Z"},"links":{"citing_paper":"/paper/2509.02377"},"observation_digest":"sha256:31a48f99fdf5a053a15d20a6b497e881682223fb7b9a8629829599e175338f2d","observation_id":"f8f9fcab-5641-4d87-a8a4-d93407d3755d","resolution":{"observed_at":"2026-08-05T11:40:15.526539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.02377","last_updated":"2025-09-02T14:43:59Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-10T13:25:36.956843Z","submitted_at":"2025-09-02T14:43:59Z","title":"Upcycling Candidate Tokens of Large Language Models for Query Expansion"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":26,"verified_exact":1,"verified_fuzzy":2},"total_outbound_references":32},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2509.02377."}