{"as_of":"2026-08-10T10:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1720eac658104ada4534c3441d11b8626d790ae8b965086f8f00d9e3aa7c6e77","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T16:17:55.193481Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2607.26427/citation-record","integrity":"/paper/2607.26427/integrity","json":"/paper/2607.26427/citation-record.json","paper":"/paper/2607.26427"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T16:17:55.027106Z","title":"Bruce Croft","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.027106Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:17729008b3845c025587475261a1cd212741569c5dd31a89d5cb0f7c02eea6ef","observation_id":"2aec7ad2-e00f-46d8-bdeb-7bd60456fe52","resolution":{"observed_at":"2026-08-01T16:17:55.027106Z","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-01T16:17:55.030446Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.030446Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:be8cd767ddfd40bb52cd4e4ea537d3630acf19d08f5ed78aa4849ccdd2962304","observation_id":"62098523-397b-4baa-bc8a-e078f5275177","resolution":{"observed_at":"2026-08-01T16:17:55.030446Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02019","last_updated":"2019-03-19T18:36:25Z","snapshot_observed_at":"2026-07-06T07:05:59.910542Z","submitted_at":"2018-10-04T01:35:14Z","title":"Seq2Slate: Re-ranking and Slate Optimization with RNNs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02019","snapshot_observed_at":"2026-08-01T16:17:55.033270Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.033270Z"},"links":{"cited_paper":"/paper/1810.02019","citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:598c58df5977f10f37ceb2fc60ee8e0e3f63ae6595be0030ad93bf795fa24e2c","observation_id":"d2463af5-af01-47cc-8db8-f54fe7cd98d3","resolution":{"observed_at":"2026-08-01T16:17:55.033270Z","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-01T16:17:55.036371Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.036371Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:3fa014b41f160447e5dd2f91b52583e503e1e0fafa4cf6acd63adc170225b2a6","observation_id":"e1b0dcd1-67ad-4d59-a9f7-7c10c79290ad","resolution":{"observed_at":"2026-08-01T16:17:55.036371Z","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-01T16:17:55.039063Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.039063Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:55c56ef0658881ef01313d3dacb3f7e6d753668a431372ce9d4655451b5d1e20","observation_id":"0bb33414-95fb-470d-aed3-ff61a15658a4","resolution":{"observed_at":"2026-08-01T16:17:55.039063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01318","last_updated":"2023-02-02T18:44:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-02T18:44:11Z","title":"Accelerating Large Language Model Decoding with Speculative Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01318","snapshot_observed_at":"2026-08-01T16:17:55.041622Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.041622Z"},"links":{"cited_paper":"/paper/2302.01318","citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:3d5ccdc4e73612179cf95aac65f9b34ee192d7c522cd7b158ce8686770565acc","observation_id":"b7c9540f-ce81-44c8-b2d6-9ee33e96f438","resolution":{"observed_at":"2026-08-01T16:17:55.041622Z","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-01T16:17:55.044795Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.044795Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:16b723d592b953a06918c169d28f94006b827b5a9412afe684ccd46e15d824d3","observation_id":"2902ac7c-3d85-4d43-bc2d-70ae47209efc","resolution":{"observed_at":"2026-08-01T16:17:55.044795Z","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-01T16:17:55.047491Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.047491Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:7f834347e022639f112ebc127303f7a96dde48f90c563ea0b2187d1b743392f0","observation_id":"b92ba01e-0338-4c5a-9fb7-ecb107cd1ac5","resolution":{"observed_at":"2026-08-01T16:17:55.047491Z","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-01T16:17:55.049907Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.049907Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:df95767026c75ff03f07a9874f8a9dfa57bf53aa31b13d5ae7742ffe416d254b","observation_id":"2b2251de-945b-49ff-a5b7-d6ec60755951","resolution":{"observed_at":"2026-08-01T16:17:55.049907Z","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-01T16:17:55.052274Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.052274Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:69b904bf4c23ac8487c9a3542544a1b519db8bdb11e00c7cc9f1d94c881d344c","observation_id":"7425d85d-276d-4cd9-b78b-f0937cf34d7f","resolution":{"observed_at":"2026-08-01T16:17:55.052274Z","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-01T16:17:55.054654Z","title":"Fu, Stefano Ermon, Atri Rudra, and Christopher Ré","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.054654Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:df1aff380b10bca4b62cd40f97ce8a401f45da90977c9dca82c2d72a79f6dd06","observation_id":"a92cead6-ea2c-4e14-8de7-901258791e79","resolution":{"observed_at":"2026-08-01T16:17:55.054654Z","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-01T16:17:55.057417Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.057417Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:1fc44f274e3391829ec7d9870cbad30c51695350f8e971da06986f01f0111685","observation_id":"e1568f6e-f121-45fa-b825-af9c03c59943","resolution":{"observed_at":"2026-08-01T16:17:55.057417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.12057","last_updated":"2021-04-02T02:22:07Z","snapshot_observed_at":"2026-08-09T06:41:49.044724Z","submitted_at":"2021-02-24T04:15:40Z","title":"Revisit Recommender System in the Permutation Prospective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.12057","snapshot_observed_at":"2026-08-01T16:17:55.059851Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.059851Z"},"links":{"cited_paper":"/paper/2102.12057","citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:ed587205a2282446170a68492b71a9b93f20bdb871e9f6ea60bd9eb09e13217a","observation_id":"f57c7f19-063c-44ad-b59e-260f8aee65a1","resolution":{"observed_at":"2026-08-01T16:17:55.059851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.00860","last_updated":"2021-04-07T01:48:53Z","snapshot_observed_at":"2026-08-08T05:04:10.213367Z","submitted_at":"2021-04-02T02:40:23Z","title":"GRN: Generative Rerank Network for Context-wise Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.00860","snapshot_observed_at":"2026-08-01T16:17:55.062625Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.062625Z"},"links":{"cited_paper":"/paper/2104.00860","citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:f1ea03210e51bae76df52c861d95bb8225ce4eee75b24ae8fb77c3b7524207b9","observation_id":"0314693d-b0bd-4c9b-900d-e97bb0c838c3","resolution":{"observed_at":"2026-08-01T16:17:55.062625Z","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-01T16:17:55.065630Z","title":"Courville, and Yoshua Bengio","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.065630Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:53c1074a95cc2e2e765fb378e3d187f6119ce1c289546b2eb63eb66c1aa419cb","observation_id":"0aa96e25-a037-4333-8d16-421493c3ece6","resolution":{"observed_at":"2026-08-01T16:17:55.065630Z","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-01T16:17:55.067943Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.067943Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:4b9afcc82cf883346a60aec0f72c3ab209108f9e2a4297dcc95608e18ba45da6","observation_id":"8067689f-2d41-41f4-bbc1-a4987742f212","resolution":{"observed_at":"2026-08-01T16:17:55.067943Z","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-01T16:17:55.070395Z","title":"Maxwell Harper and Joseph A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.070395Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:6029c7b8001862732eab8fb6bdfc4df506c41565733902d6b640007302f1b0e6","observation_id":"9af3ef1f-7df8-4220-84ee-da48043b8876","resolution":{"observed_at":"2026-08-01T16:17:55.070395Z","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-01T16:17:55.072865Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.072865Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:cff95e3c8fc65763e736ac0b40a27197dc1299ba796f5834016f5cd3e2e2d0a7","observation_id":"7db7025e-af29-43e6-8134-1bf99a7c8bbf","resolution":{"observed_at":"2026-08-01T16:17:55.072865Z","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-01T16:17:55.075421Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.075421Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:9348197daafebb2add3d5f4c67f7d10b4d0c24a56650972bcdb4693f6d5d1b36","observation_id":"b4e947a5-eeb8-4415-9e79-95f2f92b92ae","resolution":{"observed_at":"2026-08-01T16:17:55.075421Z","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-01T16:17:55.077807Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.077807Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:4ff0f41ac9b0d6a9eca42fce58451d5d35015fd753fef05e4cb173c9fe00c656","observation_id":"3b7c1a4b-8bca-454b-b909-e0cff2c74205","resolution":{"observed_at":"2026-08-01T16:17:55.077807Z","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-01T16:17:55.080272Z","title":"Mann, and Danilo J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.080272Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:4d76f44196e1e1e6787d37100e1dce73a49951e1b5c3372698cfee702e0ab84a","observation_id":"b88fc853-c2c3-4b0e-8fdd-18bd72b6d018","resolution":{"observed_at":"2026-08-01T16:17:55.080272Z","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-01T16:17:55.082726Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.082726Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:e12a0056b016ee300f922246f033508a7e9cb1f5b9be9880adea9f1a27f62175","observation_id":"0c7f693c-b34d-44e5-bf0a-8bc8671c71f1","resolution":{"observed_at":"2026-08-01T16:17:55.082726Z","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-01T16:17:55.085298Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.085298Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:27328fa53be063509e1a3fced6d71331f0cfdc9f31820739e80b146470ed89ce","observation_id":"1237c2d5-db25-494d-9e76-d9e010547ba4","resolution":{"observed_at":"2026-08-01T16:17:55.085298Z","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-01T16:17:55.087812Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.087812Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:4a572cad763e15163d3cc3b9288381ce887a382875d98e4146503c8b862b46b7","observation_id":"2b313c67-4f4d-4701-b42e-c407ff7dbdfb","resolution":{"observed_at":"2026-08-01T16:17:55.087812Z","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-01T16:17:55.092765Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.092765Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:5c03083531f6b6b6fc7f2e5f6c73b820085bdadc2d345e46203baa42b96731c2","observation_id":"bf933a9f-e5f2-4ce5-b4ad-c8bb6bdbdc8b","resolution":{"observed_at":"2026-08-01T16:17:55.092765Z","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-01T16:17:55.095307Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.095307Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:ffa78fd1017f76befb9b06b09fe9ad4145302c9e2ad4ae30a6341d8f288e8baf","observation_id":"49764a4e-3660-49be-a006-01d309e8095b","resolution":{"observed_at":"2026-08-01T16:17:55.095307Z","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-01T16:17:55.099923Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.099923Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:c1611f52c0ee5ae5b674578290dbb28b96385e9e4150bba52aa8bad7d414ebdf","observation_id":"991decdb-e1c2-4a6a-acb7-35a5854e8f8a","resolution":{"observed_at":"2026-08-01T16:17:55.099923Z","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-01T16:17:55.102238Z","title":"McAuley, Dong Zheng, Peng Jiang, and Kun Gai","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.102238Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:5ee1a8bb030d310940c104c696f7ede697f07d0e172b08b00b195ca84d5a3fff","observation_id":"d41866e0-7468-424d-84fd-77ca6c8c881c","resolution":{"observed_at":"2026-08-01T16:17:55.102238Z","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-01T16:17:55.104919Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.104919Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:47edc9824af0fc7a7e36132e2465b302050b362316e264221b25f77aa42e8f25","observation_id":"af2ab622-9870-4b4f-80b3-07294353638e","resolution":{"observed_at":"2026-08-01T16:17:55.104919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2024.naac","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T16:19:07.750816Z","title":null,"venue":null,"work_id":"c408ad44-fcf8-4073-b376-1309a82d526f","year":2024},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.107272Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:5aa2302b94ea603fa0fa114e8f92d89e00a16bfa8a118aaaf968d65fe02618e8","observation_id":"e1cdb26f-eba4-4d7a-b22e-c053dbe14521","resolution":{"observed_at":"2026-08-01T16:19:07.758983Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T16:17:55.109716Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.109716Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:a00d11cc77912de8da64b11d10ec6a3c3805f2faa35963f33a73996abf4ec3ed","observation_id":"d6fcf7cb-2dfa-4cb2-8d51-96d409e00f1a","resolution":{"observed_at":"2026-08-01T16:17:55.109716Z","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-01T16:17:55.114955Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.114955Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:6800c7b69d7f10a9a7ed44b2873b002e0cb40f7ae4eb5201e86628a286bfd232","observation_id":"f7726d68-7796-472d-bd8c-0ee4ba7edcaa","resolution":{"observed_at":"2026-08-01T16:17:55.114955Z","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-01T16:17:55.117276Z","title":"Tran, Jonah Samost, Maciej Kula, Ed H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.117276Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:eb59c5fbeba9e9a1821a94a97be3318109379acbe239d99ff1c8eba500da9ee2","observation_id":"2cc84608-37a7-45d4-af66-dd7ce687f0ef","resolution":{"observed_at":"2026-08-01T16:17:55.117276Z","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-01T16:17:55.119668Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.119668Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:595ad31a9ad2718a264d423f5f35e27ff80e4a375af47242956ee3428ae5ba2d","observation_id":"2ab17693-e8d8-4c3c-9c49-e63f3b47ff00","resolution":{"observed_at":"2026-08-01T16:17:55.119668Z","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-01T16:17:55.124674Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.124674Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:1066c80cedfbe1411e18db4000ad677ee7858512fb1d4309af16903ece6fe608","observation_id":"945c7322-7ad5-488f-96b5-957246f725ab","resolution":{"observed_at":"2026-08-01T16:17:55.124674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2022.emnlp-main.179","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"36702b80-1cb7-4888-a1f4-638d74d738f8","year":2022},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.127668Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:5e23568cda8c07405a20762ba45278e490b9d1952c1a237b38754245a2346e5c","observation_id":"7ce623d8-b152-4bbf-a7bb-058095d3608b","resolution":{"observed_at":"2026-08-01T16:19:07.640667Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T16:17:55.130187Z","title":null,"venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.130187Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:e5688b3e549a88a74bd1472efa53cc0b93b187d0f99cb4c926d81b4e657bf0f9","observation_id":"9f022fde-a402-41ba-bee2-9d624c804e8f","resolution":{"observed_at":"2026-08-01T16:17:55.130187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-01T16:17:55.132495Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.132495Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:195fdc855867191ced1d86e11fd12b1cc007525e348619398455fd162d29df4b","observation_id":"1fee5da1-1cbe-4a91-a4e9-ebb5c3200838","resolution":{"observed_at":"2026-08-01T16:17:55.132495Z","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-01T16:17:55.135332Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.135332Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:ec8300630853972fa32184a77b1bc976b817011b18c422d9ffa0ed888eb89f64","observation_id":"1ba54c94-e456-4347-bb56-732c178a9541","resolution":{"observed_at":"2026-08-01T16:17:55.135332Z","resolver_source":null,"status":"malformed_identifier"},"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-01T16:17:55.137926Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.137926Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:18fe1d48125deea34101609c15c15b5730d3b97affd6231f7e581b970efbe1b3","observation_id":"291cdc47-3be3-4e43-bc20-f27f82981554","resolution":{"observed_at":"2026-08-01T16:17:55.137926Z","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-01T16:17:55.140450Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.140450Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:823ff78cfa61242e569a66cc2dec74911de634d0b47a9c3e195a711902d2bc9c","observation_id":"713f0e32-96a4-46cb-99b8-d5a7b6de689c","resolution":{"observed_at":"2026-08-01T16:17:55.140450Z","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-01T16:17:55.142851Z","title":"Cohen, and Donald Metzler","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.142851Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:3e876c26373d23e309ff6f45b504094566e675fc0f12c85bf6ad0649693bce21","observation_id":"881d4ef1-b03a-4c76-bc84-04c0fdcb6da6","resolution":{"observed_at":"2026-08-01T16:17:55.142851Z","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-01T16:17:55.145100Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.145100Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:8ddd24045e6df0a8359e01ce718545ec26465b27d43faed28ae421fb1479ece2","observation_id":"b6fd96e2-dc42-4d75-9bd9-d349b15455f6","resolution":{"observed_at":"2026-08-01T16:17:55.145100Z","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-01T16:17:55.147648Z","title":"Gomez, Łukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.147648Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:0bf4caf20be68050e283dfedf8e82fab57a40ab47425aeb19077328c31a2f020","observation_id":"0596c83d-5d55-4d73-918e-8eea6de4e90c","resolution":{"observed_at":"2026-08-01T16:17:55.147648Z","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-01T16:17:55.149927Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.149927Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:54c227a2ca3dd975b94fb5515b25980f0e73d3ea7c24bf187b37c7a71c199749","observation_id":"e4886f6a-d6f2-4c3f-b84f-332e4f1ed4e0","resolution":{"observed_at":"2026-08-01T16:17:55.149927Z","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-01T16:17:55.152236Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.152236Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:112f2d12801a230da244ebac3799ad11cdffd68ae745add5212e9bd3a608dd64","observation_id":"76614467-7d15-4637-9f2f-3f01d2309b56","resolution":{"observed_at":"2026-08-01T16:17:55.152236Z","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-01T16:17:55.154430Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.154430Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:089d511be535e20f8fe2fc9a605653a2c2a32452cd412374aaaa7f994790f9c8","observation_id":"ef54f612-b575-4c97-946c-aa4a52d32b1a","resolution":{"observed_at":"2026-08-01T16:17:55.154430Z","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-01T16:17:55.156672Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.156672Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:61a857feb58d95592d786661e86b730357a2978795bb45a271d2f32ea4fd6549","observation_id":"399537e2-56c7-46c3-b38e-f80f8e3b0bba","resolution":{"observed_at":"2026-08-01T16:17:55.156672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.12206","last_updated":"2020-05-25T16:24:01Z","snapshot_observed_at":"2026-07-06T09:23:06.794032Z","submitted_at":"2020-05-25T16:24:01Z","title":"Generator and Critic: A Deep Reinforcement Learning Approach for Slate Re-ranking in E-commerce","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.12206","snapshot_observed_at":"2026-08-01T16:17:55.161387Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.161387Z"},"links":{"cited_paper":"/paper/2005.12206","citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:00d5011dcbed5d9e79d2791e95e9f2d218692b637502c4a7a192d1c6f04c0b2d","observation_id":"20859215-7af9-485c-a68f-c4efdbc6d9bc","resolution":{"observed_at":"2026-08-01T16:17:55.161387Z","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-01T16:17:55.163982Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.163982Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:a03d0b93d2454e9c680eea487efd0af0f20bcd0321c009001e027527894268ac","observation_id":"f7fcb0ba-e3fd-4438-aff5-95dad5529bd3","resolution":{"observed_at":"2026-08-01T16:17:55.163982Z","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-01T16:17:55.166366Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.166366Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:5112c8e1a5e00ac813ee582f1bb8180b8ef3230a5e5aad506b15e81b0291fae4","observation_id":"ac2b69ea-9430-47cb-ae12-242427351c5b","resolution":{"observed_at":"2026-08-01T16:17:55.166366Z","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-01T16:17:55.168578Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.168578Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:ef0d4366ad0fc0a75a3788718e3794b6536802fa47ac6330897b49438af2e051","observation_id":"84a4dd57-9bfd-4b86-b9a8-4160e075d3b6","resolution":{"observed_at":"2026-08-01T16:17:55.168578Z","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-01T16:17:55.174048Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.174048Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:552debec8353616128197952271ed1d0148ecbd66365302161ef86cd93d8e9b6","observation_id":"c908b312-4554-4867-b1ab-7cc4b444677f","resolution":{"observed_at":"2026-08-01T16:17:55.174048Z","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-01T16:17:55.176290Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.176290Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:076f7395efbd55cbba1c35eb3b516c4a960ec38a460fdc228196391e7ab514f0","observation_id":"beda32d7-0792-4543-9f96-ac0a7b573bf0","resolution":{"observed_at":"2026-08-01T16:17:55.176290Z","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-01T16:17:55.178562Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.178562Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:a508ddf160d2c49cdf511c15e13baedb3d6bc4c3df6ed0f214937f551c2e9a35","observation_id":"213d2bbd-52ea-47c0-9e19-2a2599a41770","resolution":{"observed_at":"2026-08-01T16:17:55.178562Z","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-01T16:17:55.181181Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.181181Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:0a6d09d4e901fd9eba9b0bf4ca94d6fa58ff1ac1fe83893eb81fc4c3e199386a","observation_id":"3810e2c7-0c91-470f-b900-a63d50a49c3e","resolution":{"observed_at":"2026-08-01T16:17:55.181181Z","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-01T16:17:55.183520Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.183520Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:6cf182e1b114cc3a9b3ad24c531353739eb30020edf95f1f36225c55511c4b48","observation_id":"24783964-73a6-489c-bf39-6cb74d2bbb1a","resolution":{"observed_at":"2026-08-01T16:17:55.183520Z","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-01T16:17:55.185813Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.185813Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:6165a249ee40e7522175ca609d4367f2598c07cd20ea1461b1c3c9012ad7161d","observation_id":"8e8c215d-c69a-4688-bc74-98aa4acc1527","resolution":{"observed_at":"2026-08-01T16:17:55.185813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.20900","last_updated":"2025-10-28T09:32:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-08-28T15:29:51Z","title":"OneRec-V2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.20900","snapshot_observed_at":"2026-08-01T16:17:55.188275Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.188275Z"},"links":{"cited_paper":"/paper/2508.20900","citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:46ee71c01df1441eddd242ccd1732acbf0284446cf1f53800d0034dd8cef2fb0","observation_id":"3f78cfda-fec4-4308-afbf-5168609b60d5","resolution":{"observed_at":"2026-08-01T16:17:55.188275Z","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-01T16:17:55.191085Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.191085Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:85caebc1638b20b3437c0064c0ea50c323119d1cda396aac73fa9c700519d2ee","observation_id":"ca9be3a3-a28e-4abe-b263-e40e42e4e15b","resolution":{"observed_at":"2026-08-01T16:17:55.191085Z","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-01T16:17:55.193481Z","title":"pair space always yields4 × improvement","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.193481Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:7d68da0a11c90e4e6456ac12ca1cf16e962a73adcd9443d74d1e91d992bb5d22","observation_id":"217d9cdf-ac3a-4476-afed-da71f2d8a848","resolution":{"observed_at":"2026-08-01T16:17:55.193481Z","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-01T16:17:55.112462Z","title":"InProceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, SIGIR 2020, Virtual Event, China, July 25-30, 2020, Jimmy X","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.112462Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:1ca1d29bb5520e10995b67842ccfe650861a52a7fc81a03aa3279ed73fc4a14a","observation_id":"c4989ea5-72d2-4cf3-bed5-141c748613bf","resolution":{"observed_at":"2026-08-01T16:17:55.112462Z","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-01T16:17:55.171423Z","title":"InFindings of the Association for Computational Linguistics: EMNLP 2023, Singapore, December 6-10, 2023 (Findings of ACL, Vol","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.171423Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:837338ef65110881ae9f35890428afb562a4cb40f7da1537d39ddc99d727ea4b","observation_id":"b634e5eb-38c0-4110-b7a4-6f06760d3a67","resolution":{"observed_at":"2026-08-01T16:17:55.171423Z","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-01T16:17:55.122162Z","title":"InProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining(Barcelona, Spain)(KDD ’24)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.122162Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:b773b547fe37c57c6143db3c1f081b665aa959aa1ab76309432da228f47cedd3","observation_id":"e709e158-90f1-4d91-a8d9-6a37dd9bf8dc","resolution":{"observed_at":"2026-08-01T16:17:55.122162Z","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-01T16:17:55.159070Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T16:17:55.159070Z"},"links":{"citing_paper":"/paper/2607.26427"},"observation_digest":"sha256:946f38bcfbb0f675620de2c964b75fa0ad410a9909cdbf3c8971a958b9504edf","observation_id":"62721634-6df3-4fb9-9b31-26dbf4582d23","resolution":{"observed_at":"2026-08-01T16:17:55.159070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.26427","last_updated":"2026-07-29T03:14:09Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-01T23:25:15.022767Z","submitted_at":"2026-07-29T03:14:09Z","title":"PSG: Pair-Space Generation for Efficient Generative Reranking"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":61,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":65},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2607.26427."}