{"as_of":"2026-08-17T15:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:335edfe960430a1ee9822810773cdd95d3d25d7401d5d4656e20e0508716c1dd","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:30:44.815207Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2508.18444/citation-record","integrity":"/paper/2508.18444/integrity","json":"/paper/2508.18444/citation-record.json","paper":"/paper/2508.18444"},"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-05T16:30:50.224753Z","title":"In: SC22: International Conference for High Performance Computing, Networking, Storage and Analysis","venue":null,"work_id":"504110bc-afe9-4e5f-83bb-3fa1dc2c5c0f","year":2022},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.608051Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:9b78a0fcb421666578d60df4fcd55d3de53d8dd7a274a0f0467702d6de1052ca","observation_id":"d121120a-a856-4526-bbb5-b48e7b0754dc","resolution":{"observed_at":"2026-08-05T16:30:50.274754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:50.051509Z","title":"In: Learn- ing","venue":null,"work_id":"be34244e-474e-4b44-85fd-df0af18061db","year":2010},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.614692Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:4e194bec4508ac8020ba922f7d3eed3d362bb8a726e43426a2e37e1cb4f46c98","observation_id":"6a7e7274-9277-48da-bc09-340b90841ec6","resolution":{"observed_at":"2026-08-05T16:30:50.105091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:44.620452Z","title":"In: Proceedings of the 22nd International Conference on Machine Learning (ICML)","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.620452Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:e60bf10df7ae10faac7c55ad29a8c8a96379a16dc223516adeda423e2e841b94","observation_id":"511e8672-6028-4ff3-80c7-5b4893882026","resolution":{"observed_at":"2026-08-05T16:30:44.620452Z","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-05T16:30:49.914751Z","title":"ACM Transactions on Recommender Systems (2024)","venue":null,"work_id":"baecc476-0eac-4559-8a97-f26aa806246b","year":2024},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.626822Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:83cd5b55493dfd27651017ec238748bdbecf60aa3f0abfa5e5aec694b3adf704","observation_id":"10f1cc59-c6a2-4d96-8c1c-e9fc3908a7c5","resolution":{"observed_at":"2026-08-05T16:30:49.945132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:49.724749Z","title":"In: Advances in Neural Information Processing Systems (NeurIPS) (2017)","venue":null,"work_id":"c6c410d1-8dcb-4a42-8f1b-8af45f0fd725","year":2017},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.632780Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:ec618affe04e1835defcbc6cf1efd3f54be0fafd6c6171c67c7dc12055a66f13","observation_id":"a8e6ff70-c412-43ae-b96f-2a50819f6699","resolution":{"observed_at":"2026-08-05T16:30:49.775007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:44.640058Z","title":"In: Burstein, J., Doran, C., Solorio, T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.640058Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:f65d90babce8d5984262d54d7f22689efb49fc91ee5f4f4bae8f1bf8338b071e","observation_id":"8a1c00f2-e967-4bc6-8daf-ee46d38d6492","resolution":{"observed_at":"2026-08-05T16:30:44.640058Z","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-05T16:30:49.590491Z","title":"https://www.elastic.co/elasticsearch/ (2025), version 8.x","venue":null,"work_id":"16b07b2e-bb76-4365-be63-0b49d6516000","year":2025},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.646784Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:449c038a2c02cc5271de8697c89d3e8ac2f4ad22f42a899a0a8edc3281278e65","observation_id":"22acbdce-4508-4b10-949e-3856f4dde193","resolution":{"observed_at":"2026-08-05T16:30:49.625316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:49.434749Z","title":"https://eur- lex.europa.eu/eli/reg/2016/679/oj (2016), regulation (EU) 2016/679 of the Eu- ropean Parliament and of the Council","venue":null,"work_id":"6365685e-d38b-41f4-bac9-ea5731b8c9eb","year":2016},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.652188Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:7d6dfcd028a5edd71457579dc366691d20ae1ec16bb313f9ee8f6ff73d4704eb","observation_id":"55b648d4-4187-4035-b6c1-61a49fb3062e","resolution":{"observed_at":"2026-08-05T16:30:49.483850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:49.280193Z","title":"Open Research Europe1, 68 (2023)","venue":null,"work_id":"6f3454c9-a3a5-4920-9b6c-11e3f885f32c","year":2023},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.656733Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:cfa0955eca6ea43576507fda7e010f52c4e0cc50361c22568cd64fa10cb55026","observation_id":"be7b5a44-de3b-47aa-9ac3-ef3ba325afb9","resolution":{"observed_at":"2026-08-05T16:30:49.324749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12433","last_updated":"2025-02-03T02:14:26Z","snapshot_observed_at":"2026-08-16T14:09:08.017164Z","submitted_at":"2024-06-18T09:29:18Z","title":"LLM4Rerank: LLM-based Auto-Reranking Framework for Recommendations","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12433","snapshot_observed_at":"2026-08-05T16:30:44.661685Z","title":"arXiv preprint arXiv:2406.12433 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.661685Z"},"links":{"cited_paper":"/paper/2406.12433","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:b5f6d4565d4f3fc270705774ebf7d17f38879135a6dd3301b76602e297e04aff","observation_id":"dcc100e4-aa24-41f5-bae0-ebf8fe6a9ef5","resolution":{"observed_at":"2026-08-05T16:30:44.661685Z","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-05T16:30:49.129872Z","title":"ACM Transactions on Information Systems42(3), 1–23 (2024) 16 Islam et al","venue":null,"work_id":"66965f89-ddb7-40c6-809c-fe008f5f97c3","year":2024},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.666106Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:7f9508722c508ddad7577f1026b86fe9e7b309f912ded30392d5551ec0fe0227","observation_id":"d031b4dc-abb0-4561-9ced-5f66b8a7c20e","resolution":{"observed_at":"2026-08-05T16:30:49.174895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:48.979170Z","title":"In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management","venue":null,"work_id":"accd4dcf-5681-4bf1-baa5-08f8fdbe3415","year":2016},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.670133Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:e34443d1b544e8e1c41007f7f8a1c6db4603311492715e01a9d1b238af208970","observation_id":"e5728cd8-7cda-49ae-93f5-58bbe9ea773f","resolution":{"observed_at":"2026-08-05T16:30:49.026371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:48.833447Z","title":"In: Proceedings of the 24th ACM international on conference on information and knowledge management","venue":null,"work_id":"32a7c5a7-18ee-4901-94b1-dcb949f29da9","year":2015},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.674573Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:2c57ea57197f853a90cc01a221919d21f27531384b33fd0546755baa01a656cd","observation_id":"259be096-fc00-450b-93a2-cddbf28f555d","resolution":{"observed_at":"2026-08-05T16:30:48.874750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:48.687329Z","title":"In: Proceedings of the 2000 ACM conference on Computer supported cooperative work","venue":null,"work_id":"96fd743b-a68f-4019-a17c-83f53f795a65","year":2000},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.678827Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:0353ba422ab6ce693fa313d0dfda64816345b2eb277a3d8ea76442872ecd2d58","observation_id":"39edaf60-d22f-46fc-ab49-6a14b2500d87","resolution":{"observed_at":"2026-08-05T16:30:48.724741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:48.544903Z","title":"In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Manage- ment","venue":null,"work_id":"5ef02fc4-d546-40b4-9e2c-4dd0694ee4df","year":2013},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.683029Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:5662340c1b28b200c4827c2c144875ce94e682cbd19c609feab4c80a43cdf5f3","observation_id":"376fe0b8-9982-4727-8bd2-eb75db0dd6c8","resolution":{"observed_at":"2026-08-05T16:30:48.595165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:48.374742Z","title":"In: Proceedings of the 44th International ACM SIGIR conference on Research and Development in Information Retrieval","venue":null,"work_id":"36e0ac7b-500b-4ab3-ba4a-0611244f883e","year":2021},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.687098Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:80fee861745810b070ea0e759b8c984ced96580bc41e49bc2231bd22c3fd4c2c","observation_id":"6d7e7bb7-f62e-42e8-9baf-1941f4e5cbc3","resolution":{"observed_at":"2026-08-05T16:30:48.414843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.11601","last_updated":"2021-06-05T01:19:31Z","snapshot_observed_at":"2026-08-16T18:22:31.741074Z","submitted_at":"2021-05-25T01:42:47Z","title":"Personalized Transformer for Explainable Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.11601","snapshot_observed_at":"2026-08-05T16:30:44.691214Z","title":"arXiv preprint arXiv:2105.11601 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.691214Z"},"links":{"cited_paper":"/paper/2105.11601","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:9a4ad1cf00aeaaa2f775f8e1d4c7fb50723b84bc09c7b2a3b410384b8d088be9","observation_id":"be36e7f7-d702-4bd2-ac51-7a7edcedbc6f","resolution":{"observed_at":"2026-08-05T16:30:44.691214Z","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-05T16:30:48.246899Z","title":"In: Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","venue":null,"work_id":"f6964ea4-c9b1-4671-9803-394f817365a7","year":2023},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.695718Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:c14cffc6cc5062622944c08f3f1a5e6117d40f434aa4e6dc5e6e3b5aae970e3f","observation_id":"d5f09c51-5d2d-4de1-a577-42b62197018a","resolution":{"observed_at":"2026-08-05T16:30:48.285426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12399","last_updated":"2024-04-24T08:48:13Z","snapshot_observed_at":"2026-08-16T14:41:35.826327Z","submitted_at":"2023-11-21T07:22:48Z","title":"A Survey of Graph Meets Large Language Model: Progress and Future Directions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12399","snapshot_observed_at":"2026-08-05T16:30:44.699730Z","title":"arXiv preprint arXiv:2311.12399 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.699730Z"},"links":{"cited_paper":"/paper/2311.12399","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:90d09fb743ffc99af80e5250e73e8b28db41a8cf6b479c9aca77b29f2d0d8722","observation_id":"ff58e449-fa34-4908-8602-5de7b8b32287","resolution":{"observed_at":"2026-08-05T16:30:44.699730Z","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-05T16:30:44.704262Z","title":"In: Proceedings of the ACM on Web Conference 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.704262Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:eb8435a0275d264821575ce84f1b552a31be5c984617c56621792f8bf75f711c","observation_id":"91e49bfb-66cc-43e1-b6cf-d1c79640020e","resolution":{"observed_at":"2026-08-05T16:30:44.704262Z","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-05T16:30:48.044744Z","title":"In: Text Summarization Branches Out","venue":null,"work_id":"67e21543-2e02-4d75-be25-c6978acd4ed7","year":2004},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.708788Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:aaf5bee9a820d267d01c9de668f9ba167b94339d03316717106f4b8af4dbbc9b","observation_id":"11d5e21b-9ef9-4767-bb5c-9ea37ef9bd0b","resolution":{"observed_at":"2026-08-05T16:30:48.085191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:44.713056Z","title":"ACM Trans","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.713056Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:0116c0e9aff9e1c2628e2c340140d62123608e56839307c0ab5c599882da4770","observation_id":"4d2fd348-10df-4561-a2bc-c1863624a94e","resolution":{"observed_at":"2026-08-05T16:30:44.713056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07439","last_updated":"2025-04-10T04:08:38Z","snapshot_observed_at":"2026-08-16T12:42:30.447274Z","submitted_at":"2025-04-10T04:08:38Z","title":"LLM4Ranking: An Easy-to-use Framework of Utilizing Large Language Models for Document Reranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07439","snapshot_observed_at":"2026-08-05T16:30:44.717414Z","title":"arXiv preprint arXiv:2504.07439 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.717414Z"},"links":{"cited_paper":"/paper/2504.07439","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:284d2495ce591c03da196199d50dd560ec040014d788f1d334f3cb4ae372f8d6","observation_id":"d496271f-8ce4-4a74-a82f-71155e20ee26","resolution":{"observed_at":"2026-08-05T16:30:44.717414Z","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-05T16:30:47.884786Z","title":"In: Proceedings of the 29th ACM Interna- tional Conference on Information & Knowledge Management","venue":null,"work_id":"c62bfbbc-6549-4063-bc93-516fb84e83ed","year":2020},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.721960Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:a5891cde9d4249b744038b749441a19c7225b315fbce4491976fc9440c85ffad","observation_id":"c4be9bc7-4c5d-4346-88ae-fe064ac57ef3","resolution":{"observed_at":"2026-08-05T16:30:47.925751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:47.714744Z","title":"In: Proceedings of the 31st International Conference on Neural Information Processing Systems (NeurIPS)","venue":null,"work_id":"499a61e6-a473-47a3-ad14-1747d85ac015","year":2017},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.726328Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:82ad479dd950976a1a1655395241eaab14cf76f1dc61e044d54107f86065955c","observation_id":"0bedf67d-bbd2-4068-bb39-d9a7ebc0f2d2","resolution":{"observed_at":"2026-08-05T16:30:47.774741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02377","last_updated":"2024-09-22T14:50:52Z","snapshot_observed_at":"2026-08-16T13:46:15.048382Z","submitted_at":"2024-06-04T14:55:14Z","title":"XRec: Large Language Models for Explainable Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02377","snapshot_observed_at":"2026-08-05T16:30:44.730893Z","title":"arXiv preprint arXiv:2406.02377 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.730893Z"},"links":{"cited_paper":"/paper/2406.02377","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:511df090ded31a60e9d450217eb06dbb5ad9cce7dde239d491d49c5eb3c9d0be","observation_id":"45b26abd-08be-475e-b415-e917eb68d612","resolution":{"observed_at":"2026-08-05T16:30:44.730893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-12T23:25:05.204139Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-05T16:30:44.736208Z","title":"In: arXiv preprint arXiv:1901.04085 (2019) How Reliable are LLMs for Reasoning on the Re-ranking task? 17","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.736208Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:c5c8df50f8526238d9b1334cbc4fd42b947770f6f09344fd05767cc8652d3a7a","observation_id":"349a4e3a-3311-462b-9b35-9a90cc4e03b5","resolution":{"observed_at":"2026-08-05T16:30:44.736208Z","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-05T16:30:44.741003Z","title":"In: Proceedings of the 40th annual meeting of the Association for Computational Linguistics","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.741003Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:00ea191f7ef86d71bdf4d0ff7b8817b14f97df181f3aa21cc165178876846504","observation_id":"9055641d-c253-481f-886a-3366ae621f75","resolution":{"observed_at":"2026-08-05T16:30:44.741003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13337","last_updated":"2024-12-17T21:16:59Z","snapshot_observed_at":"2026-08-14T02:11:20.332841Z","submitted_at":"2024-12-17T21:16:59Z","title":"Unveiling the Secret Recipe: A Guide For Supervised Fine-Tuning Small LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13337","snapshot_observed_at":"2026-08-05T16:30:44.745578Z","title":"arXiv preprint arXiv:2412.13337 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.745578Z"},"links":{"cited_paper":"/paper/2412.13337","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:ae30f7ee0aeb9a815d2c708efdf4668dba6656468358e903a4e0946b12c4e046","observation_id":"9a21d251-f405-4f7e-8753-18363244b8e2","resolution":{"observed_at":"2026-08-05T16:30:44.745578Z","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-05T16:30:47.429572Z","title":"In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","venue":null,"work_id":"455df350-bcf8-428e-ac9f-ebfc6c067fb8","year":2060},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.750374Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:144a68a4e3644bb212552cc4b260f0a394e4a67f9327837749d157e8ae1ac02e","observation_id":"09996c14-deb8-4e58-904e-789e0464219e","resolution":{"observed_at":"2026-08-05T16:30:47.474738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:47.254740Z","title":"In: Interna- tional Conference on Learning Representations (ICLR) (2023)","venue":null,"work_id":"2758e6fe-6633-49fc-b74a-684ddc3690e6","year":2023},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.755530Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:ff002893bc9f40bd004b6f2c422f3ac8d79f8b5f878feb3c2e56e86b68632878","observation_id":"8ae2d6f0-bf01-4dbb-ac6a-83a6d5177028","resolution":{"observed_at":"2026-08-05T16:30:47.304740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:47.080874Z","title":"why should i trust you?","venue":null,"work_id":"ea665d21-87eb-4ebc-ab1d-38016c22ca9b","year":2016},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.761192Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:e8bb8120a0469635e9e617639499fc54fecda4b7fc724f700adf951347f8f8cc","observation_id":"bdf6c8bd-5f16-4aa9-92b5-3f8ed2b91ced","resolution":{"observed_at":"2026-08-05T16:30:47.134744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0026825","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: ACM SIGIR Conference","venue":"Lecture notes in computer science","work_id":"cbba1666-c7e6-474d-8dc0-ed9fc1f71c7a","year":1994},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.765604Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:b329f7cedb87f58e3d6366fda9a14bd50f44017c5b59b43b5659718ddedfe7ce","observation_id":"0d335e8b-d7da-4cee-ba46-66f005d88f18","resolution":{"observed_at":"2026-08-05T16:30:44.854575Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:46.939840Z","title":"Foundations and Trends in Information Retrieval3(4), 333–389 (2009)","venue":null,"work_id":"f28b31ac-6680-4262-afdc-201891f5c241","year":2009},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.770478Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:07f53112711f78d83287b81c33c636b79efabf30b09032a8d0389c05f0bd7256","observation_id":"79736fc1-37e2-44cd-9c20-df9cc4af13f9","resolution":{"observed_at":"2026-08-05T16:30:46.954751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:46.744739Z","title":"In: Proceedings of the 10th international conference on World Wide Web","venue":null,"work_id":"8aa8d9cd-d983-468c-84a7-5930d4de8b76","year":2001},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.774565Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:ccb03d61ce80b31373af29ea9571b07333930905ee093df26a5ce0b9df8b427d","observation_id":"74098c6c-362a-4c06-a75e-4bcd4f716621","resolution":{"observed_at":"2026-08-05T16:30:46.824746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:46.534746Z","title":"In: The adaptive web: methods and strategies of web personal- ization, pp","venue":null,"work_id":"126576d3-191d-4d24-b4e1-f4cc0daee5c9","year":2007},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.778419Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:1436bccbc1bfdb9fb2dffef3470094aa9334ebb7cc6b84980d26ebceba181af1","observation_id":"51d2ffeb-c1e9-4bdd-acd8-1389d9e01600","resolution":{"observed_at":"2026-08-05T16:30:46.584742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-05T16:30:44.782689Z","title":"In: arXiv preprint arXiv:1707.06347 (2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.782689Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:9c63a4770a7f5df756671fa7af98153f79a2165eafc0de9c44cb46c3485d2be6","observation_id":"6a411637-bce2-453c-af59-00d56a330700","resolution":{"observed_at":"2026-08-05T16:30:44.782689Z","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-05T16:30:46.362359Z","title":"In: Proceedings of the 2018 world wide web conference","venue":null,"work_id":"7a440c25-7f00-46db-af39-b989e5fd7a12","year":2018},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.787304Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:fdd7b496f70907deaa910f67d7791bcda5d5c9d93061ccbbb03361cea0c5ee1e","observation_id":"ca4f3ebd-0eee-4a43-8a9c-8cd65579a4fd","resolution":{"observed_at":"2026-08-05T16:30:46.394739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:46.223521Z","title":"In: Proceedings of the 40th International ACM SIGIR Con- ference on Research and Development in Information Retrieval","venue":null,"work_id":"d1eccbee-5c1b-4154-b789-2d6f0470b0b6","year":2017},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.791483Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:b14d08df82f9d36abef530904dec90754f0d1c6d883e64f2116378e284381308","observation_id":"8eba56e9-4fe3-433f-b8c9-a68da325dfa3","resolution":{"observed_at":"2026-08-05T16:30:46.247042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09865","last_updated":"2025-05-24T17:28:10Z","snapshot_observed_at":"2026-08-16T13:25:34.508847Z","submitted_at":"2024-08-19T10:12:52Z","title":"MAPLE: Enhancing Review Generation with Multi-Aspect Prompt LEarning in Explainable Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09865","snapshot_observed_at":"2026-08-05T16:30:44.795692Z","title":"arXiv preprint arXiv:2408.09865 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.795692Z"},"links":{"cited_paper":"/paper/2408.09865","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:160c88ff22d939e39dfc53e300bc9afc82b53427bdd3999e99d23cce62949f45","observation_id":"59fc61b2-52b0-47db-bb0b-521022f1d9ab","resolution":{"observed_at":"2026-08-05T16:30:44.795692Z","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-05T16:30:46.167157Z","title":"In: First Conference on Language Modeling (2024)","venue":null,"work_id":"21b553ec-8f88-46e7-ae81-dd3cd60f775c","year":2024},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.800747Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:ee3b1b5918c8ea996357b68ae82fc1b79dcc9a2a5dd31062639bb0d5255c2afa","observation_id":"c4eff209-5d01-430f-ba36-ecea6fe42040","resolution":{"observed_at":"2026-08-05T16:30:46.172352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09675","last_updated":"2020-02-24T18:59:28Z","snapshot_observed_at":"2026-07-29T15:42:51.774083Z","submitted_at":"2019-04-21T23:08:53Z","title":"BERTScore: Evaluating Text Generation with BERT","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09675","snapshot_observed_at":"2026-08-05T16:30:44.804770Z","title":"arXiv preprint arXiv:1904.09675 (2019)","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.804770Z"},"links":{"cited_paper":"/paper/1904.09675","citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:559e7772f31e34773291eea4c43e7c54032afa143873536e61c0e3049e9ad25c","observation_id":"f304546c-f018-4af9-890e-dcdb3c87fdf6","resolution":{"observed_at":"2026-08-05T16:30:44.804770Z","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-05T16:30:46.114749Z","title":"In: Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval","venue":null,"work_id":"f0d50cab-9b4e-43e1-a90c-2176dd6504a3","year":2014},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.810901Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:264fbfc36d60a041e77386db59cb6745141b016d1aac2cade3f32db791b9658b","observation_id":"80be5243-272b-4b25-a08b-473cdefe0020","resolution":{"observed_at":"2026-08-05T16:30:46.121094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T16:30:44.815207Z","title":"arXiv preprint arXiv:2308.07107 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T16:30:44.815207Z"},"links":{"citing_paper":"/paper/2508.18444"},"observation_digest":"sha256:e998145868120cf4e8419d647c44ab4aaf9edb4d40bfddd8851549da1422ffc9","observation_id":"fe3b97ed-24bd-4da5-b4df-91f216f90df8","resolution":{"observed_at":"2026-08-05T16:30:44.815207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.18444","last_updated":"2026-05-26T14:37:13Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-05T16:30:44.040752Z","submitted_at":"2025-08-25T19:48:39Z","title":"How Reliable are LLMs for Reasoning on the Re-ranking task?"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":44},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2508.18444."}