{"as_of":"2026-08-18T16:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0fda46881d11d448c3b8caad3e3f8f8117500ea181f918963fa06b3948f7188f","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:39:57.206673Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T01:57:29.551330Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.00751","last_updated":"2021-04-12T21:58:08Z","snapshot_observed_at":"2026-08-12T04:47:49.105285Z","submitted_at":"2020-09-01T23:45:42Z","title":"Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models","version":2},"cited_work":{"arxiv_id":"2009.00751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.00751","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2009.00751 , year=","venue":null,"work_id":"4cf2b6f6-9f06-456a-8e59-f3d8a47c1480","year":2009},"citing_paper":{"arxiv_id":"2104.08773","last_updated":"2022-03-14T09:15:08Z","snapshot_observed_at":"2026-08-14T21:03:13.110127Z","submitted_at":"2021-04-18T08:44:56Z","title":"Cross-Task Generalization via Natural Language Crowdsourcing Instructions","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-18T01:57:29.380571Z"},"links":{"cited_paper":"/paper/2009.00751","citing_paper":"/paper/2104.08773"},"observation_digest":"sha256:2ce24f3b780dcc547421fff296423251aa69e5fbd6e85f8cf08363ed66c1aee1","observation_id":"16dff007-2f91-4d45-9070-e109f4612323","resolution":{"observed_at":"2026-05-18T01:57:29.553886Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.00751","last_updated":"2021-04-12T21:58:08Z","snapshot_observed_at":"2026-08-12T04:47:49.105285Z","submitted_at":"2020-09-01T23:45:42Z","title":"Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.00751","snapshot_observed_at":"2026-08-10T22:54:57.957153Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.00430","last_updated":"2025-01-03T02:50:59Z","snapshot_observed_at":"2026-08-14T04:35:21.122527Z","submitted_at":"2024-12-31T13:11:20Z","title":"Enhancing LLM Reasoning with Multi-Path Collaborative Reactive and Reflection agents","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:54:57.957153Z"},"links":{"cited_paper":"/paper/2009.00751","citing_paper":"/paper/2501.00430"},"observation_digest":"sha256:d119a623f5f11dba0adde27fc963bf58d49aa268cba1222e77cc665745260c52","observation_id":"a5ab071c-a1d3-4e5b-8dc0-a8ec2c90a4ff","resolution":{"observed_at":"2026-08-10T22:54:57.957153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.00751","last_updated":"2021-04-12T21:58:08Z","snapshot_observed_at":"2026-08-12T04:47:49.105285Z","submitted_at":"2020-09-01T23:45:42Z","title":"Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.00751","snapshot_observed_at":"2026-08-16T12:39:57.206673Z","title":"and Sabharwal, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12256","last_updated":"2025-04-16T17:07:16Z","snapshot_observed_at":"2026-08-17T00:24:36.591851Z","submitted_at":"2025-04-16T17:07:16Z","title":"FLIP Reasoning Challenge","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T12:39:57.206673Z"},"links":{"cited_paper":"/paper/2009.00751","citing_paper":"/paper/2504.12256"},"observation_digest":"sha256:d17fed90a45491cae4bbf6283c6f3edf931c8af32c133750abe35c3c895203ab","observation_id":"ec31ab58-1ffb-41ee-90ea-85d3caa8efe2","resolution":{"observed_at":"2026-08-16T12:39:57.206673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.00751","last_updated":"2021-04-12T21:58:08Z","snapshot_observed_at":"2026-08-12T04:47:49.105285Z","submitted_at":"2020-09-01T23:45:42Z","title":"Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.00751","snapshot_observed_at":"2026-08-01T23:46:23.991864Z","title":"arXiv preprint arXiv:2009.00751 , year=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.15257","last_updated":"2026-07-16T17:51:23Z","snapshot_observed_at":"2026-08-08T02:15:17.714780Z","submitted_at":"2026-07-16T17:51:23Z","title":"SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T23:46:23.991864Z"},"links":{"cited_paper":"/paper/2009.00751","citing_paper":"/paper/2607.15257"},"observation_digest":"sha256:2b27b30c3d1c04488c18c0106bbc3dd1637a4295edffc5daffdd5751f3854fc3","observation_id":"e30d9ae3-46bd-4a23-83de-2ce9d8943660","resolution":{"observed_at":"2026-08-01T23:46:23.991864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2009.00751/citation-record","integrity":"/paper/2009.00751/integrity","json":"/paper/2009.00751/citation-record.json","paper":"/paper/2009.00751"},"outbound":[],"paper":{"arxiv_id":"2009.00751","last_updated":"2021-04-12T21:58:08Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-12T04:47:49.105285Z","submitted_at":"2020-09-01T23:45:42Z","title":"Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2009.00751."}