{"as_of":"2026-08-16T20:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b225fafa3d029dfc45e9aa3638c0c57603b5a911a2ab755bc83e72d8f6c8354b","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:16:51.060703Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.00100/citation-record","integrity":"/paper/2509.00100/integrity","json":"/paper/2509.00100/citation-record.json","paper":"/paper/2509.00100"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.241198Z","title":"Efficient-shot learning: A framework for improving few-shot learning efficiency","venue":null,"work_id":"0d95645c-e129-4750-8279-eaf5e5819aa2","year":2021},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.004388Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:185741c71a88676455283f3ddfdab0a2229cf0c1ba73d3e8386d2b025d98aedd","observation_id":"a4e63843-4ead-4c0d-8bf2-4069cb548c98","resolution":{"observed_at":"2026-08-05T15:16:51.244600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.231620Z","title":"Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity","venue":null,"work_id":"9c4f9c8d-fb92-47d0-a427-a78299b2c5fd","year":2022},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.008127Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:dc1f4a2f82881b6dd956ec3e53accf711d6c0ed4993a43b4aa5eef9259c92c03","observation_id":"b9c9a2c9-00a7-4146-9c4c-fac7cb022360","resolution":{"observed_at":"2026-08-05T15:16:51.235346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07548","last_updated":"2022-01-18T12:42:30Z","snapshot_observed_at":"2026-08-16T17:49:15.847143Z","submitted_at":"2021-10-14T17:16:19Z","title":"Quantum theory without classical time: octonions, and a theoretical derivation of the fine structure constant 1/137","version":2},"cited_work":{"arxiv_id":"2110.07548","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.07548","snapshot_observed_at":"2026-08-05T15:16:51.111253Z","title":"Quantum theory without classical time: octonions, and a theoretical derivation of the fine structure constant 1/137","venue":"physics.gen-ph","work_id":"84afdbe8-684c-4a0f-8350-476042d9311a","year":2021},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.011333Z"},"links":{"cited_paper":"/paper/2110.07548","citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:1c42442e2f498c1f2e50d030ffe126a0d691b4b6d9cfc00bf244145f58c0b748","observation_id":"c01585ec-1e97-4d07-bf10-ed725f7bd9f2","resolution":{"observed_at":"2026-08-05T15:16:51.116685Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.221624Z","title":"Deep clustering with cluster-aware repre- sentation learning","venue":null,"work_id":"a4b3a8fa-fdd1-41e1-8af3-f60dc931c1c8","year":2020},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.015076Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:ad928858d10070d27090714cf5c905a54c0752f4a0e374b5e285286b613946af","observation_id":"f92ec6f8-5c19-4b93-a53f-65173e50dda0","resolution":{"observed_at":"2026-08-05T15:16:51.224977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.212587Z","title":"Flexible and effi- cient modular models with shared representations","venue":null,"work_id":"6cd7d6fe-f9dc-469f-ba66-05044ac617a2","year":2021},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.018896Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:d8106c2c57306c6d95d1476b23a48a1caa486871e4c14b79e94973644a58fc00","observation_id":"444565ac-d728-4e78-b3c0-6c4ff97df808","resolution":{"observed_at":"2026-08-05T15:16:51.215843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.203375Z","title":"DeBERTa: Decoding-enhanced BERT with disentangled attention","venue":null,"work_id":"fbf07b6c-2c16-4c5a-b43d-ac0d4ebf9692","year":2021},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.022345Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:e920f2626bf3b2dd3a4db025240716de1ac234fc74f60941815d9ad2806dba2a","observation_id":"a276c10e-164e-4feb-8ec5-62c042f6de01","resolution":{"observed_at":"2026-08-05T15:16:51.206713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-05T15:16:51.025854Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.025854Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:ff81e68b848cda6c3dcaf3e5f29acbb90aa6386a23d16dcaa588f255d18cb5c1","observation_id":"a8989f44-6681-440e-add4-4a69c72575df","resolution":{"observed_at":"2026-08-05T15:16:51.025854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.188143Z","title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","venue":null,"work_id":"88624f33-5f3e-4647-8b4a-f02a6f3c795e","year":2020},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.029670Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:584f9381ae692d80244f0ff7f57d62cac9f2272a91d9156c18ac8534e284758c","observation_id":"90d2df3a-7735-4c92-a5f6-086d2948f108","resolution":{"observed_at":"2026-08-05T15:16:51.191733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.01638","last_updated":"2022-01-02T18:56:39Z","snapshot_observed_at":"2026-08-16T18:27:04.039289Z","submitted_at":"2021-05-04T17:32:53Z","title":"The impact of nuclear deformation on relativistic heavy-ion collisions: assessing consistency in nuclear physics across energy scales","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.01638","snapshot_observed_at":"2026-08-05T15:16:51.032457Z","title":"Dense representation learning for passage retrieval","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.032457Z"},"links":{"cited_paper":"/paper/2105.01638","citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:91f56ebad7d8b027f5f472c0720bb12988f1622626307f9ece1a20557aa63ae2","observation_id":"51a255d5-52f8-4f5d-8829-e4d7eeb02890","resolution":{"observed_at":"2026-08-05T15:16:51.032457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.178089Z","title":"Some methods for classification and analysis of multivariate observations","venue":null,"work_id":"1e737495-68e1-4ef1-9e57-77aa2fa565cd","year":1967},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.035691Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:a5f20b3b09f0b3ec8c037867377ba54b33b8cabf473f217cf08f91555c0740ea","observation_id":"f020c9e1-63d9-471b-b4e9-9f101f45368d","resolution":{"observed_at":"2026-08-05T15:16:51.181734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.168601Z","title":"hdbscan: Hierarchical density based clustering","venue":null,"work_id":"eb91963b-16ac-4169-949e-2bcc014b6dc5","year":2017},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.038642Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:f273502f9fd29ce2c76b3c4ccbf576969bd3d4f3a3d89bd75d46787a9311ce8c","observation_id":"2942ef9b-5de7-4a05-a0c7-5824ac0849a6","resolution":{"observed_at":"2026-08-05T15:16:51.172001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-12T23:25:05.204139Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-05T15:16:51.041467Z","title":"Passage re-ranking with bert","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.041467Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:c81953d775a43e2a0f2283ead0d64a398058a736f37d2e712b7565ec417a5fdf","observation_id":"e390fd88-df75-49f4-bde0-1f31fb8eb567","resolution":{"observed_at":"2026-08-05T15:16:51.041467Z","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-05T15:16:51.044576Z","title":"Gpt-4 technical report, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.044576Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:b8a7be7df7feb6e09a292a5f4c0d7fdef44e7f828571865591c8648ecfbc2be8","observation_id":"ce82ee5c-06d3-4083-85dd-92378f3923f2","resolution":{"observed_at":"2026-08-05T15:16:51.044576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.153713Z","title":"Squad: 100,000+ questions for machine comprehension of text","venue":null,"work_id":"78d5a877-cebd-41be-aefc-a06a0854b352","year":2016},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.048316Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:bc05d64bec3ccee70f686758d24f0d45344741f445678c86e9c0a4d9bf3d5e92","observation_id":"a8635cee-3fbe-4ea9-8a1c-9211789b77c8","resolution":{"observed_at":"2026-08-05T15:16:51.156933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.143510Z","title":"Col- BERTv2: Effective and efficient passage search via lightweight late interaction","venue":null,"work_id":"ce9dd483-6a51-4107-8bdf-eab973063957","year":2022},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.051169Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:3dd6fbd633c4e2c102bf2f480e232da851d94c2043134593712145066c9d15f7","observation_id":"eb465a86-939f-4acd-9af7-2a846b4af7db","resolution":{"observed_at":"2026-08-05T15:16:51.147685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.06538","last_updated":"2017-01-23T18:10:00Z","snapshot_observed_at":"2026-08-13T11:35:07.866136Z","submitted_at":"2017-01-23T18:10:00Z","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.06538","snapshot_observed_at":"2026-08-05T15:16:51.054361Z","title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.054361Z"},"links":{"cited_paper":"/paper/1701.06538","citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:a67ad41b8424121da8f04d26f5fec7c50574d09d496bea0b02459405e14a5429","observation_id":"af100655-bb93-4faa-a9a6-b8edd1681ead","resolution":{"observed_at":"2026-08-05T15:16:51.054361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.133136Z","title":null,"venue":null,"work_id":"82351695-78a7-4f72-8a9e-c74e801da114","year":1979},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.057632Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:8d5973377528cd753a3151768cf74fc1024a90732600d3655bb346dabdd57a37","observation_id":"f1b62c7a-7819-477b-bd0c-cf28af48c572","resolution":{"observed_at":"2026-08-05T15:16:51.136427Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:16:51.123684Z","title":"Hotpotqa: A new dataset for diverse, explainable multi-hop question answering","venue":null,"work_id":"d409fa0d-0d77-48e5-9552-c08c507c6183","year":2018},"citing_paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:16:51.060703Z"},"links":{"citing_paper":"/paper/2509.00100"},"observation_digest":"sha256:3c64322de0ca842784e3112859ab7cea588b934b623cbb909ddc1dfd21bf729d","observation_id":"de55adc2-94b8-4c9a-a202-5e516c7b0990","resolution":{"observed_at":"2026-08-05T15:16:51.127086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.00100","last_updated":"2025-08-27T17:45:16Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T15:16:50.801330Z","submitted_at":"2025-08-27T17:45:16Z","title":"MODE: Mixture of Document Experts for RAG"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":18},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2509.00100."}