{"as_of":"2026-08-09T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac104671c93d10035c9d2464de2af3983709b640710bb93f2b3974f435386c8c","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T14:59:43.156193Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.18603/citation-record","integrity":"/paper/2607.18603/integrity","json":"/paper/2607.18603/citation-record.json","paper":"/paper/2607.18603"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-01T14:59:39.498945Z","title":"Dense Passage Retrieval for Open-Domain Question Answering , journal =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:39.498945Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:5f1ff459b38ac7db3091a9903eb3cb968c42772461a5c97f7c01cb4771d6ec56","observation_id":"af35ea3e-a2f8-4db9-9361-290926f28624","resolution":{"observed_at":"2026-08-01T14:59:39.498945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.12832","last_updated":"2020-06-04T05:28:21Z","snapshot_observed_at":"2026-08-04T09:38:32.896372Z","submitted_at":"2020-04-27T14:21:03Z","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.12832","snapshot_observed_at":"2026-08-01T14:59:39.565022Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:39.565022Z"},"links":{"cited_paper":"/paper/2004.12832","citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:8f6a5083df53bd689fdbe55f3c81bd8270eac60e7d6eae2b9bfa9757bdb6077d","observation_id":"12c039b2-cc0c-4f87-95ac-454865984857","resolution":{"observed_at":"2026-08-01T14:59:39.565022Z","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-01T14:59:39.650667Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:39.650667Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:d1b956d97ccdbc4654c1680ec45090f59090055ec6ef4d71f0c07bc920583621","observation_id":"97e38f1f-8440-47a0-85f5-3bd6724b2331","resolution":{"observed_at":"2026-08-01T14:59:39.650667Z","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-01T14:59:39.741836Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:39.741836Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:d385f6b7fdc0c2f3e4eb9ff7ddd8b1eac6218c1102e1f94c9127e9a9a558a4dd","observation_id":"fd09a651-ed0f-4641-83cc-4a76801ba1e6","resolution":{"observed_at":"2026-08-01T14:59:39.741836Z","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-01T14:59:39.868905Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:39.868905Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:70d199cde1c22f887f9740fbfcd1b63131fba4118e81b314bfc0d06529cf2cc5","observation_id":"70d54502-b872-4df9-b7f0-d58134e9421c","resolution":{"observed_at":"2026-08-01T14:59:39.868905Z","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-01T14:59:39.967412Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:39.967412Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:d6a2db79d3b984e14f6ef248586199f0cbe4bb6503d94c8f6af81251e73e5bb2","observation_id":"d547e30b-4c1a-49d2-8348-4d59c69ae1fc","resolution":{"observed_at":"2026-08-01T14:59:39.967412Z","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-01T14:59:40.103373Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.103373Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:24ba03e1af73cacd03ebb4f3b7a6a7fec155574e68d0e58dc70f3b0a9d5a12d6","observation_id":"10535def-845e-4a01-b14c-e295f741ba4e","resolution":{"observed_at":"2026-08-01T14:59:40.103373Z","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-01T14:59:40.189498Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.189498Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:8a2c08183190b2801756468c748ac15d4b1d29e1fcc8fba2999e98f66d4deac3","observation_id":"fcf97da9-77a1-4e0c-ae98-d8da9a28b958","resolution":{"observed_at":"2026-08-01T14:59:40.189498Z","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-01T14:59:40.289373Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.289373Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:3deb39d120547e0b3bf1b4969a4dbd23900eddc6db5afc7b8358e1c20891da71","observation_id":"4391ff21-1d91-4447-8f2b-c739f61f8454","resolution":{"observed_at":"2026-08-01T14:59:40.289373Z","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-01T14:59:40.404557Z","title":"2021 , eprint=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.404557Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:99649ec8378ea7c72cf7ae8cc37c7af6251f60c010852dd389374e887c3f94d3","observation_id":"516f3f77-dc4f-40ad-8b4b-c430ab22fcd1","resolution":{"observed_at":"2026-08-01T14:59:40.404557Z","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-01T14:59:40.535208Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.535208Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:338f04586954b64f572e511b37654645e6c3da44b83100508e6b533f75e1d252","observation_id":"7c89ea6d-6e0b-4b08-aa98-9a5c018d002b","resolution":{"observed_at":"2026-08-01T14:59:40.535208Z","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-01T14:59:40.635071Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.635071Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:97c7f595111a220995865bb39ccbf53f200c0174b3fb79305388a3c8045ea694","observation_id":"30290721-8cf9-4602-962b-844436f00616","resolution":{"observed_at":"2026-08-01T14:59:40.635071Z","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-01T14:59:40.701122Z","title":"2020 , eprint=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.701122Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:0dd5ad86a8a0631d073b5f3bd1d17e4ca5c8027b99336fd084f34e1a338a3d23","observation_id":"eb5f6487-8f4e-4749-8e34-1482f0f2a708","resolution":{"observed_at":"2026-08-01T14:59:40.701122Z","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-01T14:59:40.768562Z","title":"2021 , eprint=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.768562Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:b9f95f58a91f79e61e0e4ff2d6169006c90da54afc6d1397c2c71a3b4963d5b0","observation_id":"50b77644-221e-45be-93a9-9ad67bbb9123","resolution":{"observed_at":"2026-08-01T14:59:40.768562Z","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-01T14:59:40.827151Z","title":"Survey of Hallucination in Natural Language Generation , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.827151Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:c96dbe9bf9f52f8f0966b5a12746120ac3061920bed9b83a62b5a2fe74971331","observation_id":"498eeb5d-8d77-465e-8cc1-3dcf8909a0d3","resolution":{"observed_at":"2026-08-01T14:59:40.827151Z","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-01T14:59:40.906984Z","title":"R a D e R : Reasoning-aware Dense Retrieval Models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:40.906984Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:45510c1f9d357f234654be02f2c375be6c380ffc468393de98771baf4e392c58","observation_id":"cb4ea1fb-fe1f-420c-8b37-97b2d4411ad1","resolution":{"observed_at":"2026-08-01T14:59:40.906984Z","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-01T14:59:41.003425Z","title":"2026 , eprint=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.003425Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:8f1e4e2a91f234c262dacc2d837e85704a6cee32ad7492da3ce86801cf993925","observation_id":"754d9231-170b-4927-b953-8d7175f51fe1","resolution":{"observed_at":"2026-08-01T14:59:41.003425Z","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-01T14:59:41.110378Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.110378Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:5851b68c97542bdabb232c3e5c2e2a3ad94f10005d8b0b1980e6228186488a0b","observation_id":"09dfa6c0-15e9-4804-bce8-1aa5f5d0f396","resolution":{"observed_at":"2026-08-01T14:59:41.110378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05176","last_updated":"2025-06-11T02:54:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-05T15:49:48Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05176","snapshot_observed_at":"2026-08-01T14:59:41.199958Z","title":"arXiv preprint arXiv:2506.05176 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.199958Z"},"links":{"cited_paper":"/paper/2506.05176","citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:c09a7015ffbe199fbbf163fcdb907327bd745855b0bfce8b72e9b3a31c48d956","observation_id":"5ea71b43-8cda-4347-a93a-6e56fad474d9","resolution":{"observed_at":"2026-08-01T14:59:41.199958Z","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-01T14:59:41.277066Z","title":"and Jones, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.277066Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:c824ba17ceb09048ef6df79d72a523a7643e03fceaadd4767d7cf21435941c69","observation_id":"e6e55630-7021-4bc9-ba03-365a9fbaaf4b","resolution":{"observed_at":"2026-08-01T14:59:41.277066Z","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-01T14:59:41.373435Z","title":"Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.373435Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:109bf17b0c7279ade875300a00ef221cc67da3ffcb1ed37e5bdec3ddcc4bc7bc","observation_id":"22dcb8a5-590f-4598-a5e9-eee7b1d0f96f","resolution":{"observed_at":"2026-08-01T14:59:41.373435Z","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-01T14:59:41.436947Z","title":"2021 , eprint=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.436947Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:76bdb45d1d47031c97301bde290051f6bc694391f48193aaac354323a2b30f36","observation_id":"bdbde0cb-395d-40de-80ac-cc50255af36d","resolution":{"observed_at":"2026-08-01T14:59:41.436947Z","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-01T14:59:41.505135Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.505135Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:ddeb89c27b02afdc1824b956659caad8ec88fffe0c907da1dbc7857816cdbb55","observation_id":"681e8ae7-2bb5-43d1-b264-a688b3181bd9","resolution":{"observed_at":"2026-08-01T14:59:41.505135Z","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-01T14:59:41.601191Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.601191Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:919092cd401fcf81578e40581340d602816e8805a50488445e3728b38188926f","observation_id":"4607160b-dd86-46ec-a1fc-82f026d3864c","resolution":{"observed_at":"2026-08-01T14:59:41.601191Z","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-01T14:59:41.693826Z","title":"2026 , eprint=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.693826Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:3e713b23c451a68b438c600546972ab863bc1818dab32ab92e7d0fa1eb823127","observation_id":"e61adeda-d672-45ce-9354-5a9ce15b0379","resolution":{"observed_at":"2026-08-01T14:59:41.693826Z","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-01T14:59:41.798886Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.798886Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:a249fe3840d920b690cde44ba24a6bb45714705f1254926e5a47ec453e119aa5","observation_id":"431380ea-4254-4603-ab66-381715eb9c96","resolution":{"observed_at":"2026-08-01T14:59:41.798886Z","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-01T14:59:41.887815Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.887815Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:9baf42d26a03a9f47dc12edd449e5986430d4a490a749a56d729c2862458e620","observation_id":"efb14ed1-6d43-4127-a929-e63805f79600","resolution":{"observed_at":"2026-08-01T14:59:41.887815Z","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-01T14:59:41.993656Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:41.993656Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:67e1397d2e18b244734980b358c4b3fbfd73fb6515a7c3257781c470993cfc74","observation_id":"ed6ee7c6-a24b-4d5a-a90b-3a3a921b969a","resolution":{"observed_at":"2026-08-01T14:59:41.993656Z","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-01T14:59:42.085928Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.085928Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:4a8ec02c40a5ebe9398cddb30f5d9238c7e081b9be8003bdd5b40b07cd8fd207","observation_id":"9511f3cd-c600-43d9-aeb2-26f34007c4e0","resolution":{"observed_at":"2026-08-01T14:59:42.085928Z","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-01T14:59:42.184331Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.184331Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:e3b5a5c66dddf79714231a2dc51638dec628e38d804751ada52d3f8281b28404","observation_id":"347fe732-e828-43a4-9d4c-0859dbeef08a","resolution":{"observed_at":"2026-08-01T14:59:42.184331Z","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-01T14:59:42.275696Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.275696Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:c403d080ae8833d9610313be1b477fb7ee6ea2a42afd0b6c56ba7c80f9a3eff1","observation_id":"8465f38b-8edd-459f-9021-1ff5354f928e","resolution":{"observed_at":"2026-08-01T14:59:42.275696Z","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-01T14:59:42.348244Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.348244Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:3a63e02006c09993d1182622f038c9b280d64e20727029ab32db9501c17f991a","observation_id":"2e391a12-62a0-4d73-ab36-3d7dae9610bb","resolution":{"observed_at":"2026-08-01T14:59:42.348244Z","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-01T14:59:42.416590Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.416590Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:a9d0344090fee649ac16d573eb63f4577f2884f0b211af4df95ef7debb8c4ad6","observation_id":"2c2aa7b0-8e24-4c7e-9b07-1d828c984d7a","resolution":{"observed_at":"2026-08-01T14:59:42.416590Z","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-01T14:59:42.487328Z","title":"2024 , month =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.487328Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:d1d7cbecb798eacbbad8a710a4286ec47add21df7b0233195d4f123fbd00d849","observation_id":"095ad3d9-9f26-49a9-b1fb-90767f884b87","resolution":{"observed_at":"2026-08-01T14:59:42.487328Z","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-01T14:59:42.588731Z","title":"2020 , eprint=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.588731Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:fb9a393d38804374c2974646fdab21c243e0b8e96a001203d3b9de74ad8206d5","observation_id":"8b230ff1-5f6c-4d09-bfe5-33ccacbe0cfa","resolution":{"observed_at":"2026-08-01T14:59:42.588731Z","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-01T14:59:42.685800Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.685800Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:471582d017906572e035351fe537cb143bab4ecdf57ccc485e1bee3297ca702d","observation_id":"76a4e322-8469-43b8-ad17-13a890d31f87","resolution":{"observed_at":"2026-08-01T14:59:42.685800Z","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-01T14:59:42.786374Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.786374Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:5433642e39cf1dd74e4ac5ba6dd0cb9e7d9ce0b6c47b1a7679cf486e772d4945","observation_id":"9b8303d3-5f2a-4e7b-b689-7a12d8a9b0f0","resolution":{"observed_at":"2026-08-01T14:59:42.786374Z","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-01T14:59:42.852984Z","title":"European Conference on Information Retrieval , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.852984Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:000921f4f0ce8c9c11c4addcfffc34424f5df95c355640e975635aea307eea1b","observation_id":"97d1b723-8cbb-4da2-9d45-52a2f886f740","resolution":{"observed_at":"2026-08-01T14:59:42.852984Z","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-01T14:59:42.901680Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:42.901680Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:937e7f9477dc95d696ec1361df6aa5508f01d889e6b136013fbf5e81d5d0c2a6","observation_id":"7ea47d79-c24c-4e8e-9446-9f5098255eed","resolution":{"observed_at":"2026-08-01T14:59:42.901680Z","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-01T14:59:43.012618Z","title":"2026 , url=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:43.012618Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:08cf6d1f11dd9cdabeafdbd5e9bb020d85eca38fd7505a2c9d82dc440b187045","observation_id":"155529e9-68b7-40ad-bb7e-21b7780cdf9a","resolution":{"observed_at":"2026-08-01T14:59:43.012618Z","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-01T14:59:43.092406Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:43.092406Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:b6b804f78d734a761b4fc543abe43ecbf98c754b251675c3a27698f1d4bf208d","observation_id":"2418d9f7-67e9-4815-9442-27d1b5497015","resolution":{"observed_at":"2026-08-01T14:59:43.092406Z","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-01T14:59:43.156193Z","title":"International Conference on Information and Knowledge Management , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T14:59:43.156193Z"},"links":{"citing_paper":"/paper/2607.18603"},"observation_digest":"sha256:a1b3072793f6026e2c63c676fae12e530f522b4e7d75949eeafb57fd8a25eed9","observation_id":"4754adf6-4bda-4e50-ba95-40cbe9a28221","resolution":{"observed_at":"2026-08-01T14:59:43.156193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18603","last_updated":"2026-07-21T00:32:55Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T19:48:49.318693Z","submitted_at":"2026-07-21T00:32:55Z","title":"AutoIndex: Learning Representation Programs for Retrieval"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2607.18603."}