{"as_of":"2026-08-15T21:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b00b5b37a795c559e167f6715035d62197913b568265eb607dcc538e561848ed","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:59:01.785413Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T21:30:52.306558Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.00117","last_updated":"2021-01-01T00:16:34Z","snapshot_observed_at":"2026-08-15T10:22:34.322974Z","submitted_at":"2021-01-01T00:16:34Z","title":"Multi-task Retrieval for Knowledge-Intensive Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00117","snapshot_observed_at":"2026-08-11T13:59:01.785413Z","title":"arXiv preprint arXiv:2101.00117 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12591","last_updated":"2025-07-25T09:22:04Z","snapshot_observed_at":"2026-08-14T13:47:37.509193Z","submitted_at":"2024-12-17T06:48:24Z","title":"LLMs are Also Effective Embedding Models: An In-depth Overview","version":2},"reference_index":111,"source":"pdf_text","source_observed_at":"2026-08-11T13:59:01.785413Z"},"links":{"cited_paper":"/paper/2101.00117","citing_paper":"/paper/2412.12591"},"observation_digest":"sha256:fd453a153495b703cdf4d3db29cfbd28269a0794de2de3c12763d91f53e1ceef","observation_id":"21e30e3a-df9e-4aa4-be41-08208a8b87da","resolution":{"observed_at":"2026-08-11T13:59:01.785413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00117","last_updated":"2021-01-01T00:16:34Z","snapshot_observed_at":"2026-08-15T10:22:34.322974Z","submitted_at":"2021-01-01T00:16:34Z","title":"Multi-task Retrieval for Knowledge-Intensive Tasks","version":1},"cited_work":{"arxiv_id":"2101.00117","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.00117","snapshot_observed_at":"2026-08-10T21:30:52.306558Z","title":"Multi-task Retrieval for Knowledge-Intensive Tasks","venue":"cs.CL","work_id":"3884f7fe-4b88-42e5-aa6d-d402ff72c760","year":2021},"citing_paper":{"arxiv_id":"2501.04652","last_updated":"2025-07-16T21:23:37Z","snapshot_observed_at":"2026-08-14T13:29:44.104827Z","submitted_at":"2025-01-08T18:05:30Z","title":"Multi-task retriever fine-tuning for domain-specific and efficient RAG","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:30:51.745758Z"},"links":{"cited_paper":"/paper/2101.00117","citing_paper":"/paper/2501.04652"},"observation_digest":"sha256:6ce0fcbf6b93246642235acca54267feedf36b9e59ba0880bbaca270a0f386b7","observation_id":"425bf264-b026-46c1-ba65-94fb98224f2a","resolution":{"observed_at":"2026-08-10T21:30:52.315578Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2101.00117/citation-record","integrity":"/paper/2101.00117/integrity","json":"/paper/2101.00117/citation-record.json","paper":"/paper/2101.00117"},"outbound":[],"paper":{"arxiv_id":"2101.00117","last_updated":"2021-01-01T00:16:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-15T10:22:34.322974Z","submitted_at":"2021-01-01T00:16:34Z","title":"Multi-task Retrieval for Knowledge-Intensive Tasks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2101.00117."}