{"as_of":"2026-08-13T06:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6167401be62f4490e89014411ae0717bea70ec1c9e3a188ffe5d27da5a3bdddf","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:21:55.231788Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2412.00546/citation-record","integrity":"/paper/2412.00546/integrity","json":"/paper/2412.00546/citation-record.json","paper":"/paper/2412.00546"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:21:54.959917Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:54.959917Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:37fcbf90e48be24686a37d015c3312398e9c8c66ef3cae819285203cab6ac58b","observation_id":"4bf151b7-4556-45d4-af81-5c7527e210be","resolution":{"observed_at":"2026-08-12T05:21:54.959917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-12T05:21:54.966886Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:54.966886Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:f97a4482011c44d7f3ba8461b5421537c1aad22b609ea3fb492c8e927cf9a356","observation_id":"64efd7a8-95da-4eb2-aba5-b5c90b62fe88","resolution":{"observed_at":"2026-08-12T05:21:54.966886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-12T05:21:54.975069Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:54.975069Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:e6f69cc6fbdac1feb4c6d6726f776092f63a01aec1aef7159768bbdc8e5d4110","observation_id":"d7229dd4-1067-428e-a99d-b1e09cfb1b95","resolution":{"observed_at":"2026-08-12T05:21:54.975069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.11657","last_updated":"2021-06-30T06:28:59Z","snapshot_observed_at":"2026-08-12T22:41:03.519209Z","submitted_at":"2018-07-31T04:31:05Z","title":"Removing Bias and Incentivizing Precision in Peer-grading","version":7},"cited_work":{"arxiv_id":"1807.11657","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.11657","snapshot_observed_at":"2026-08-12T05:21:55.758309Z","title":"Removing Bias and Incentivizing Precision in Peer-grading","venue":"cs.GT","work_id":"e567ee6a-656e-4668-8e83-27ef8732afe6","year":2018},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:54.980507Z"},"links":{"cited_paper":"/paper/1807.11657","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:8ac25515cd128e5d753e78b299f545bb90e626e67104ae7953b47edb4a28712b","observation_id":"274b31cc-8aa0-464d-b269-431e71824cf2","resolution":{"observed_at":"2026-08-12T05:21:55.765524Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05029","last_updated":"2023-10-08T06:18:14Z","snapshot_observed_at":"2026-08-13T05:54:39.850690Z","submitted_at":"2023-10-08T06:18:14Z","title":"Walking Down the Memory Maze: Beyond Context Limit through Interactive Reading","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05029","snapshot_observed_at":"2026-08-12T05:21:54.986282Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:54.986282Z"},"links":{"cited_paper":"/paper/2310.05029","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:54c22cacc08261f1e33cfd78561b183cb7ec12b95b190e8aa3591cbdbca9d85d","observation_id":"728d6504-6dfb-4311-afc7-744cb7ca3939","resolution":{"observed_at":"2026-08-12T05:21:54.986282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15595","last_updated":"2023-06-28T04:26:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-27T16:26:26Z","title":"Extending Context Window of Large Language Models via Positional Interpolation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15595","snapshot_observed_at":"2026-08-12T05:21:54.992738Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:54.992738Z"},"links":{"cited_paper":"/paper/2306.15595","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:9a49ee063701cd061a6116b5f24b040901a993a7e30dc803f598e803703953a5","observation_id":"b0247792-3725-428d-a8d5-e521c99071ba","resolution":{"observed_at":"2026-08-12T05:21:54.992738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10509","last_updated":"2019-04-23T19:29:47Z","snapshot_observed_at":"2026-08-09T19:46:04.857927Z","submitted_at":"2019-04-23T19:29:47Z","title":"Generating Long Sequences with Sparse Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.10509","snapshot_observed_at":"2026-08-12T05:21:54.999278Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:54.999278Z"},"links":{"cited_paper":"/paper/1904.10509","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:37d642b55016ef1b69e18526631950237a9738a211933ce927d691ee38858693","observation_id":"5771a0ee-c7ec-4d9c-bcbd-5457eedf48ca","resolution":{"observed_at":"2026-08-12T05:21:54.999278Z","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-12T05:21:56.278989Z","title":null,"venue":null,"work_id":"284ec314-6236-4965-921a-4e1fb429c439","year":2007},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.004601Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:f6c21a5ee724e07aad036d67500695bf0523ca18ec18de8c336380ba0cf2da28","observation_id":"7dc62cdc-a21f-4c7e-b476-985103e43510","resolution":{"observed_at":"2026-08-12T05:21:56.284821Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.03178","last_updated":"2016-04-11T23:56:21Z","snapshot_observed_at":"2026-08-13T04:10:35.808377Z","submitted_at":"2016-04-11T23:56:21Z","title":"Incentives for Truthful Peer Grading","version":1},"cited_work":{"arxiv_id":"1604.03178","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.03178","snapshot_observed_at":"2026-08-12T05:21:55.645364Z","title":"Incentives for Truthful Peer Grading","venue":"cs.GT","work_id":"41f48525-6085-4fa1-8c70-810396138c13","year":2016},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.009693Z"},"links":{"cited_paper":"/paper/1604.03178","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:a38a4c0f0c3ed677d950e84bfda980d9ec1d39a7d331bcc17b7a5cabd676a35b","observation_id":"7abafe89-e7b1-497c-a3d9-a5c878b2e585","resolution":{"observed_at":"2026-08-12T05:21:55.651889Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","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-12T05:21:55.015193Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.015193Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:f85cdc96a635ca0446662ba5e2897a727932def6a57c06e78eb5a2be5cc70646","observation_id":"a3495457-166c-4d16-a323-89c919fde4b3","resolution":{"observed_at":"2026-08-12T05:21:55.015193Z","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-12T05:21:56.256032Z","title":null,"venue":null,"work_id":"d95d63b7-cb47-40ac-9130-ed04c6187077","year":1960},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.021603Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:57fd3b4ce5b842b4acc99ab0a089f2fe84a5f2545142594607d29950ac0ce023","observation_id":"e657180a-700f-42cb-83ee-a7164584206c","resolution":{"observed_at":"2026-08-12T05:21:56.262029Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:56.236523Z","title":null,"venue":null,"work_id":"21f51619-be88-46e0-8b5d-88302d44a0af","year":2023},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.027059Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:10205bc0631ff2c3942d6ac355513f1f3d51f8f1b1c8e7604e2f1c0bc1b937c2","observation_id":"9b282550-b3f4-428d-af31-161503ec61ce","resolution":{"observed_at":"2026-08-12T05:21:56.242658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:56.216792Z","title":null,"venue":null,"work_id":"fc89ead2-712d-48e5-9774-dc268192cf78","year":2005},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.032251Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:a59be38ae4fde6cb7b445e7baf06b0b89a041f40fdf55c4ae75a8609f59e0fc3","observation_id":"e0615a54-137f-4dde-8941-16f67b097304","resolution":{"observed_at":"2026-08-12T05:21:56.221908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:55.038098Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.038098Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:d939ccf103099364f7470f112814e2d9927b44d976fe01ff711b01343a975fca","observation_id":"65a28f5b-5c80-4f8a-be37-9bdae715a976","resolution":{"observed_at":"2026-08-12T05:21:55.038098Z","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-12T05:21:56.161758Z","title":null,"venue":null,"work_id":"ede4f68c-a7e4-4371-8bf5-66c1e5e906f2","year":null},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.049940Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:94c0e36e41d71b8a7f83a44f49686382275e323821eb176b8af0e5def4592243","observation_id":"53f784d2-b460-45cf-9573-38c17d635d3e","resolution":{"observed_at":"2026-08-12T05:21:56.167874Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:56.114999Z","title":null,"venue":null,"work_id":"360e0382-e50e-45f7-99dd-ac4b0fbd6dc8","year":2020},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.060322Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:cf3b7d85ff96083ef3bd279e859ca0eeb1882aad9333dceae2aa2fecd12502f7","observation_id":"92a2bb3f-b8cd-4fff-a8a6-eafaa9a6738d","resolution":{"observed_at":"2026-08-12T05:21:56.124302Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:56.139141Z","title":"In Findings of the Association for Computational Linguistics ACL 2024","venue":null,"work_id":"0fb3acce-95b8-4da4-8afb-dd53862647bf","year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.055186Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:7a5560a061b50219dda6b9a7c6efecc2fe8e50321eeab27e1473ebd52c6e09a8","observation_id":"403544a2-e513-42bf-9c00-0156f2f85b91","resolution":{"observed_at":"2026-08-12T05:21:56.147424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:56.095473Z","title":null,"venue":null,"work_id":"6376202c-519f-4d87-b0fc-fd3271a600f5","year":2023},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.079703Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:2adf957196c2bc3b27afec8d8b875056bf681f73d4350c759f1dbdadbe9b620c","observation_id":"c5ca8f6f-f3c0-42d3-8f3e-ef0f8c3bbc04","resolution":{"observed_at":"2026-08-12T05:21:56.100815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-12T05:21:55.072173Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.072173Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:24918b9c946b14a8b004ecc31967a6be32402775ed9ee83d730fc2956c28dbbf","observation_id":"02afa4e3-c243-4c7e-8d6d-223a5d1a7a0e","resolution":{"observed_at":"2026-08-12T05:21:55.072173Z","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-12T05:21:55.092104Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.092104Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:7bd05201364fc3322f7a6f6f248fee69952e70c883770961889d51f9a5053f6d","observation_id":"c788e1f7-9a59-4869-945e-d0c800a14d02","resolution":{"observed_at":"2026-08-12T05:21:55.092104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06839","last_updated":"2024-08-12T03:53:35Z","snapshot_observed_at":"2026-08-13T05:52:48.072330Z","submitted_at":"2023-10-10T17:59:58Z","title":"LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06839","snapshot_observed_at":"2026-08-12T05:21:55.085505Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.085505Z"},"links":{"cited_paper":"/paper/2310.06839","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:93cf95b1e7a51c8f7bbc6f689a0c8f227237c2f2c1d964d3066b59879c5b6d67","observation_id":"3b9c502a-5f8a-4e94-9c22-a18d932344a4","resolution":{"observed_at":"2026-08-12T05:21:55.085505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02060","last_updated":"2024-06-12T02:46:16Z","snapshot_observed_at":"2026-08-13T00:39:10.515138Z","submitted_at":"2024-04-02T15:59:11Z","title":"Long-context LLMs Struggle with Long In-context Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02060","snapshot_observed_at":"2026-08-12T05:21:55.102289Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.102289Z"},"links":{"cited_paper":"/paper/2404.02060","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:832391c541c236b3242576fa4c8531108c72595285829f1f8a0d2233b9200822","observation_id":"dc4b51a0-15ed-4183-a61d-228a514687e8","resolution":{"observed_at":"2026-08-12T05:21:55.102289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.14902","last_updated":"2020-08-20T05:43:22Z","snapshot_observed_at":"2026-08-11T02:59:59.701652Z","submitted_at":"2020-07-29T15:18:46Z","title":"Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.14902","snapshot_observed_at":"2026-08-12T05:21:55.097279Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.097279Z"},"links":{"cited_paper":"/paper/2007.14902","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:ccf8a6eaf8624acf58f93f927c465d9d45834bafe3268964bf9eb5ee1bb23588","observation_id":"e71d45e2-3559-4f95-80c1-a03a31bd19a2","resolution":{"observed_at":"2026-08-12T05:21:55.097279Z","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-12T05:21:55.112390Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.112390Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:d6e915fcbbaabb2d98963b4b28d569f502ccaf1d793adb91786d0927c474e138","observation_id":"c05e3dd7-1587-4ecd-ad4c-cd96e28f1fd8","resolution":{"observed_at":"2026-08-12T05:21:55.112390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.12102","last_updated":"2023-04-24T13:55:47Z","snapshot_observed_at":"2026-08-10T13:56:54.136201Z","submitted_at":"2023-04-24T13:55:47Z","title":"Unlocking Context Constraints of LLMs: Enhancing Context Efficiency of LLMs with Self-Information-Based Content Filtering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.12102","snapshot_observed_at":"2026-08-12T05:21:55.107313Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.107313Z"},"links":{"cited_paper":"/paper/2304.12102","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:c3844f1dcbc8956cb2ac326706be992a7c6b66cfa3e572a3026f6c9c8b2fbfb3","observation_id":"2f86fc52-0db2-44b3-bde5-845b316f71a9","resolution":{"observed_at":"2026-08-12T05:21:55.107313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.03505","last_updated":"2022-04-05T19:39:13Z","snapshot_observed_at":"2026-07-06T12:57:54.902287Z","submitted_at":"2022-04-05T19:39:13Z","title":"Integrating Rankings into Quantized Scores in Peer Review","version":1},"cited_work":{"arxiv_id":"2204.03505","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.03505","snapshot_observed_at":"2026-08-12T05:21:55.444359Z","title":"Integrating Rankings into Quantized Scores in Peer Review","venue":"cs.IR","work_id":"5417689a-7f05-4c61-bc96-62c94fae0bff","year":2022},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.127066Z"},"links":{"cited_paper":"/paper/2204.03505","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:6a3913dd134a67ac0a59e1b34abb84ea9ede79b81176dad298b322d50348d557","observation_id":"0268880d-33d9-48ad-bd87-586623ce5d00","resolution":{"observed_at":"2026-08-12T05:21:55.452089Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:56.036370Z","title":null,"venue":null,"work_id":"e668e14d-f611-4dee-ae11-4a490508b6a2","year":2011},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.132093Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:ea36989156b4c72c80804faad86f506c64240e10ef65d9d307ffcfc3f0b29595","observation_id":"a5209dbc-0a94-40cc-afb6-76913a820146","resolution":{"observed_at":"2026-08-12T05:21:56.042246Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:55.122447Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.122447Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:0a93523ccfe118d53185987750fb9b1b795838a6faef17ad7215749b95a6d628","observation_id":"e85a4e4f-b750-4e9d-9d86-6e3557cdf1af","resolution":{"observed_at":"2026-08-12T05:21:55.122447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.06713","last_updated":"2020-03-14T22:29:50Z","snapshot_observed_at":"2026-08-10T16:05:55.321384Z","submitted_at":"2020-03-14T22:29:50Z","title":"Document Ranking with a Pretrained Sequence-to-Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.06713","snapshot_observed_at":"2026-08-12T05:21:55.143151Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.143151Z"},"links":{"cited_paper":"/paper/2003.06713","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:5b0d8ca9e59f53fd88eebf197be64d0d35c9179d127c049402a1203dfda09517","observation_id":"a652a6fc-eca3-43b8-a447-aed2f32c5f19","resolution":{"observed_at":"2026-08-12T05:21:55.143151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.07496","last_updated":"2023-04-03T00:07:58Z","snapshot_observed_at":"2026-08-10T13:24:30.630293Z","submitted_at":"2022-04-15T14:51:41Z","title":"Improving Passage Retrieval with Zero-Shot Question Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.07496","snapshot_observed_at":"2026-08-12T05:21:55.149300Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.149300Z"},"links":{"cited_paper":"/paper/2204.07496","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:093dcb24b1b3b5f46c9466bc9bea49023c8d0f04b7f37ca3d760df09da11ca8b","observation_id":"b00b584f-1290-4481-b66f-0327247f961c","resolution":{"observed_at":"2026-08-12T05:21:55.149300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08865","last_updated":"2024-04-13T01:13:59Z","snapshot_observed_at":"2026-08-13T00:30:57.518365Z","submitted_at":"2024-04-13T01:13:59Z","title":"LLM In-Context Recall is Prompt Dependent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08865","snapshot_observed_at":"2026-08-12T05:21:55.137383Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.137383Z"},"links":{"cited_paper":"/paper/2404.08865","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:027e6a37906af955c6439d039c4dbda302fe22daa105594da30a840cfd2e7e69","observation_id":"367a4d9f-f59c-4da3-8be6-df3dd5b36ed4","resolution":{"observed_at":"2026-08-12T05:21:55.137383Z","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-12T05:21:55.982346Z","title":null,"venue":null,"work_id":"7fc431f4-1f83-4647-a5da-3878d3406c6f","year":2018},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.161686Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:6a39c1f4195e3745a014f747e58237c8134ebcfc2b7ee237328783f1198d7bc6","observation_id":"abe62445-346a-4fd7-b2d1-f953e1f5ffe0","resolution":{"observed_at":"2026-08-12T05:21:55.996406Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:55.959280Z","title":null,"venue":null,"work_id":"c8c67d9b-0b17-4215-b3f7-a03dcd37ab4a","year":1967},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.167650Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:49884d214f2f8a11431cb60b768f880f03d21b71a1f86c12b076ee00ec22d7f9","observation_id":"78b61e9f-38ec-435b-bc91-6dce31a433c5","resolution":{"observed_at":"2026-08-12T05:21:55.965985Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:56.010081Z","title":null,"venue":null,"work_id":"7a3d59a8-8224-4365-bb96-1b1d3aceb2c8","year":2013},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.155256Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:12f74aff84201be6aba7df05c8f397886b7bb80e74c6deec15c2687dc8c4be88","observation_id":"7c16d10b-0c8c-4347-a422-556a85840df2","resolution":{"observed_at":"2026-08-12T05:21:56.016596Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-12T05:21:55.185572Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.185572Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:189ad040a0e2a78747e2cbc377c9a80df393b2d92f85a93f68a98159445b78eb","observation_id":"09cffcbf-917e-48bb-a3dd-ba383e32e893","resolution":{"observed_at":"2026-08-12T05:21:55.185572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.02080","last_updated":"2022-07-21T07:44:13Z","snapshot_observed_at":"2026-08-10T22:45:29.185791Z","submitted_at":"2021-11-03T09:12:33Z","title":"An Explanation of In-context Learning as Implicit Bayesian Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.02080","snapshot_observed_at":"2026-08-12T05:21:55.192934Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.192934Z"},"links":{"cited_paper":"/paper/2111.02080","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:13f74d826ed9651a420b5aded719894ca6fbb22f727c5700d568695fe26bd790","observation_id":"5bd0ab59-7455-4cdd-bb5f-a560b76efac9","resolution":{"observed_at":"2026-08-12T05:21:55.192934Z","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-12T05:21:55.935563Z","title":null,"venue":null,"work_id":"3b4a85fb-9535-488a-a1d4-64dc5983eeea","year":1967},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.173488Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:20dd8ecfe451ddfb1241cc9c3b845176a77aef0af40d86e16b4442b638cb00b4","observation_id":"d5769c75-73ec-42b7-ab37-5a2db76ec6f9","resolution":{"observed_at":"2026-08-12T05:21:55.941105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02485","last_updated":"2024-07-02T17:59:17Z","snapshot_observed_at":"2026-08-12T23:30:11.293443Z","submitted_at":"2024-07-02T17:59:17Z","title":"RankRAG: Unifying Context Ranking with Retrieval-Augmented Generation in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02485","snapshot_observed_at":"2026-08-12T05:21:55.204721Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.204721Z"},"links":{"cited_paper":"/paper/2407.02485","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:4e3e13cbbac2eebbe7323ee52ace50cc072127c29908c704f4be9e5981b5c5f9","observation_id":"e0e11c14-cf58-460d-beb5-e61a766f08d6","resolution":{"observed_at":"2026-08-12T05:21:55.204721Z","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-12T05:21:55.210809Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.210809Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:e886793525002124d034b66777c1f949e873dac592080c6f0949ab9ed0d612d7","observation_id":"60e0fb1a-a6b4-4d2c-b351-fd70b2a80d11","resolution":{"observed_at":"2026-08-12T05:21:55.210809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-12T05:21:55.199500Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.199500Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:9229bd25ba6cda5615bc872604c13d4fdc20d3db9f5615f40dbf5abfbfe3c518","observation_id":"674e019e-e562-47aa-9177-4e5aab5ad406","resolution":{"observed_at":"2026-08-12T05:21:55.199500Z","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-12T05:21:55.885582Z","title":null,"venue":null,"work_id":"e53b2c05-336d-4a5e-bb42-ebbea4d1e61d","year":2021},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.221775Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:10cb0aa1e0586b577e65e98d42f39d913d1353654cad3324de5d90baacd63134","observation_id":"d4301e6f-e847-4060-b0bc-cd5a15bb3eb4","resolution":{"observed_at":"2026-08-12T05:21:55.893942Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T05:21:55.860271Z","title":null,"venue":null,"work_id":"5964f3b4-ae91-43db-aeff-681979829ffe","year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.226913Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:4141a63308db19d08cc61165dcecc220545d6b51d2d5d44c4b4cfbe347d9022c","observation_id":"5cc7a993-5f20-405d-ae0d-1cb06007ac9a","resolution":{"observed_at":"2026-08-12T05:21:55.869416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11931","last_updated":"2024-06-17T13:51:35Z","snapshot_observed_at":"2026-08-07T06:30:25.302107Z","submitted_at":"2024-06-17T13:51:35Z","title":"DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11931","snapshot_observed_at":"2026-08-12T05:21:55.216297Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.216297Z"},"links":{"cited_paper":"/paper/2406.11931","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:0626bd794c781c5738a25090139fc004aa5af46e3ff1a50ad0b1e85a715cbec8","observation_id":"f2a2ee4e-7dc4-4c56-99c8-1c2251c12719","resolution":{"observed_at":"2026-08-12T05:21:55.216297Z","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-12T05:21:55.837414Z","title":null,"venue":null,"work_id":"d55f580d-ad87-4f94-bcf9-5215505eb00c","year":2021},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.231788Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:c11f691245901fc5975f5eb22c2540e2a74a80f33a3d0d5b9e03cf66c799119c","observation_id":"5c25953d-d5a2-44b9-86da-92f7663ce757","resolution":{"observed_at":"2026-08-12T05:21:55.844909Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09110","last_updated":"2023-10-01T21:44:23Z","snapshot_observed_at":"2026-08-10T23:10:13.900680Z","submitted_at":"2022-11-16T18:51:34Z","title":"Holistic Evaluation of Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09110","snapshot_observed_at":"2026-08-12T05:21:55.117620Z","title":"arXiv preprint arXiv:2211.09110 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.117620Z"},"links":{"cited_paper":"/paper/2211.09110","citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:2c0e30e4db83bb84782498e3b95fcf97d8578c7c1332fbd473d41ed2056bc53e","observation_id":"63c82884-8e57-4f5a-8d98-b09919060252","resolution":{"observed_at":"2026-08-12T05:21:55.117620Z","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-12T05:21:56.182803Z","title":"In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","venue":null,"work_id":"6725c7d9-e978-4a1e-827a-d3284ff6b715","year":null},"citing_paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T05:21:55.044095Z"},"links":{"citing_paper":"/paper/2412.00546"},"observation_digest":"sha256:f2ee030b66ecda9b712c9d7b55523ce13141725a3bfe8d69b87470e00357d8e6","observation_id":"f7505eb4-7c9e-476d-a060-3c29f8c68a1f","resolution":{"observed_at":"2026-08-12T05:21:56.188720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.00546","last_updated":"2024-11-30T17:39:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T17:25:59.671054Z","submitted_at":"2024-11-30T17:39:59Z","title":"Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":3,"verified_fuzzy":2},"total_outbound_references":46},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2412.00546."}