{"as_of":"2026-08-12T14:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d30944e7ad64b3960472ddde912a73c0ad5b7a9c2d74c4b43788366b1316979d","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:13:21.639033Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2412.14515/citation-record","integrity":"/paper/2412.14515/integrity","json":"/paper/2412.14515/citation-record.json","paper":"/paper/2412.14515"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:13:21.355643Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.355643Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:f524d62e675ae2e76d26cf1325e2965a7ad51eafb1f8c445bca54b37caafd621","observation_id":"9ce10464-e296-47a5-b64f-b42f2dd563f7","resolution":{"observed_at":"2026-08-11T12:13:21.355643Z","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-11T12:13:21.360474Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.360474Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:344aadd0329ffb90cc5050c793fe20316239dead8aa5bf385a479a26a641774b","observation_id":"cc0eebda-da3f-4ddd-9b25-edd2aea768e9","resolution":{"observed_at":"2026-08-11T12:13:21.360474Z","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-11T12:13:22.724126Z","title":null,"venue":null,"work_id":"4548c70d-cbc6-402b-8af8-749734b5050b","year":1994},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.364083Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:80e3886f5cbaab5ae23d5a459fff2a34a3761410d49718b5d18194c4f8871cdc","observation_id":"c79d777c-9596-477e-bafb-d5339ca4ded0","resolution":{"observed_at":"2026-08-11T12:13:22.735403Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:13:22.659202Z","title":null,"venue":null,"work_id":"cb12ea1d-f72a-4bf4-a46d-9aad5236e33b","year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.367393Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:264da0de5c1becdb1daa6a934fa6fbebf48c8bb3b3511e5740b418dd13872ab9","observation_id":"08497700-5624-442f-ba54-5208905eda97","resolution":{"observed_at":"2026-08-11T12:13:22.689001Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:13:22.606651Z","title":null,"venue":null,"work_id":"fbf00ea3-3efa-4efc-9fcb-6d26c246db15","year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.370767Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:99115472a196a56598b6e18b96ea081584e855facad0b77e2b467fb094d7e5a3","observation_id":"5bac6d8a-be7b-4044-9ced-3e125614416f","resolution":{"observed_at":"2026-08-11T12:13:22.627787Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-11T12:13:21.373876Z","title":"A.; Adeli, E.; Altman, R","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.373876Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:778a710741f573aae9f0f727d560ed301ca7075a52171b0dd565743407151e4f","observation_id":"08f93329-b04b-4fa9-85f0-a625b4f173f8","resolution":{"observed_at":"2026-08-11T12:13:21.373876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09800","last_updated":"2023-01-18T17:31:52Z","snapshot_observed_at":"2026-08-06T07:25:23.651829Z","submitted_at":"2022-11-17T18:58:43Z","title":"InstructPix2Pix: Learning to Follow Image Editing Instructions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09800","snapshot_observed_at":"2026-08-11T12:13:21.378477Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.378477Z"},"links":{"cited_paper":"/paper/2211.09800","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:57170df4231d2f24a044a8c786de01c51c49a8f047e34f08aef719ca9b0de091","observation_id":"17b58c6a-19b7-46cb-bbd7-041225f24725","resolution":{"observed_at":"2026-08-11T12:13:21.378477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12712","last_updated":"2023-04-13T20:41:31Z","snapshot_observed_at":"2026-08-03T04:49:15.195814Z","submitted_at":"2023-03-22T16:51:28Z","title":"Sparks of Artificial General Intelligence: Early experiments with GPT-4","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12712","snapshot_observed_at":"2026-08-11T12:13:21.382502Z","title":"T.; Li, Y.; Lundberg, S.; et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.382502Z"},"links":{"cited_paper":"/paper/2303.12712","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:9b7b28cd70079cbbe85be988e8eb0641d2247799bd556f6488074211ba7f0e63","observation_id":"cdd4a418-f2e1-42e4-9233-786587029ab9","resolution":{"observed_at":"2026-08-11T12:13:21.382502Z","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-11T12:13:22.532798Z","title":"W.; Zhou, D.; Song, D.; and Le, Q","venue":null,"work_id":"a844ea98-98b9-41ac-949e-d0ba94aa3d1c","year":2020},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.386612Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:9df9acf3c8bff6db2579f5072a1a763b2cd5cd26c250dcc59b688a57ad19c137","observation_id":"709b4c5c-38fb-4733-b762-3401970e8cdd","resolution":{"observed_at":"2026-08-11T12:13:22.572958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-11T12:13:21.389533Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.389533Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:9e55cd6248c595b0e0eb8076f6868fd381a78c1a572624ccad21e52595e8530f","observation_id":"d0b6d193-ef15-4753-b488-795d27d47ca8","resolution":{"observed_at":"2026-08-11T12:13:21.389533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.05713","last_updated":"2025-02-20T15:16:06Z","snapshot_observed_at":"2026-07-06T16:04:58.235073Z","submitted_at":"2023-08-10T17:22:28Z","title":"Testing GPT-4 with Wolfram Alpha and Code Interpreter plug-ins on math and science problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.05713","snapshot_observed_at":"2026-08-11T12:13:21.393829Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.393829Z"},"links":{"cited_paper":"/paper/2308.05713","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:28a8bba7ff5f62f4fe4f024124c94bf4b38f3098aacb3cff3c692c4fe41d8840","observation_id":"4b93e877-ac11-4e70-8cbb-61543273a64e","resolution":{"observed_at":"2026-08-11T12:13:21.393829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.10435","last_updated":"2023-01-27T15:30:27Z","snapshot_observed_at":"2026-08-12T07:50:34.802331Z","submitted_at":"2022-11-18T18:56:13Z","title":"PAL: Program-aided Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.10435","snapshot_observed_at":"2026-08-11T12:13:21.397400Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.397400Z"},"links":{"cited_paper":"/paper/2211.10435","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:d372272a2d08f4351dc15d54832e04f9ba3ad9d2c4004b0601e20c4aa007feb4","observation_id":"5ec4143d-486b-4195-b4c9-c53a409f439c","resolution":{"observed_at":"2026-08-11T12:13:21.397400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.11559","last_updated":"2022-11-18T18:50:09Z","snapshot_observed_at":"2026-08-05T09:04:05.570299Z","submitted_at":"2022-11-18T18:50:09Z","title":"Visual Programming: Compositional visual reasoning without training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.11559","snapshot_observed_at":"2026-08-11T12:13:21.402018Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.402018Z"},"links":{"cited_paper":"/paper/2211.11559","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:0f863f5eb1a01b1d1f7d961b33a3bdb93e2c8cf496f385ebcdd6ce2e06e1fb5e","observation_id":"28e812d9-a7f9-409e-9fad-6f9edc821321","resolution":{"observed_at":"2026-08-11T12:13:21.402018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.01626","last_updated":"2022-08-02T17:55:41Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-08-02T17:55:41Z","title":"Prompt-to-Prompt Image Editing with Cross Attention Control","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.01626","snapshot_observed_at":"2026-08-11T12:13:21.406492Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.406492Z"},"links":{"cited_paper":"/paper/2208.01626","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:f6869ba6ed9342701059d84739b6c75a05eb33afd3bff891d07b7c3fd9db48b8","observation_id":"0746855f-33eb-448f-830f-6387eee294e9","resolution":{"observed_at":"2026-08-11T12:13:21.406492Z","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-11T12:13:22.473857Z","title":null,"venue":null,"work_id":"5d04b577-42a8-41e7-be6a-5c91ab6fb574","year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.410842Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:0994d7cd9586e91655642a2060ef7c75e8d855b51d578f014bff5e131ec2870b","observation_id":"d53c3146-8c69-41b6-85f5-3bd2afbab6fb","resolution":{"observed_at":"2026-08-11T12:13:22.510278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09506","last_updated":"2019-05-10T22:24:55Z","snapshot_observed_at":"2026-08-04T09:51:28.249111Z","submitted_at":"2019-02-25T18:37:49Z","title":"GQA: A New Dataset for Real-World Visual Reasoning and Compositional Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09506","snapshot_observed_at":"2026-08-11T12:13:21.413671Z","title":"A.; and Manning, C","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.413671Z"},"links":{"cited_paper":"/paper/1902.09506","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:294dd85986f3d91a3e79135609427bb1fda9db87e5495cf479582360b21455fe","observation_id":"b7e567a3-46ff-4dfc-bac5-c7bad6e1c15a","resolution":{"observed_at":"2026-08-11T12:13:21.413671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1612.06890","last_updated":"2016-12-20T21:40:40Z","snapshot_observed_at":"2026-07-06T05:23:33.117300Z","submitted_at":"2016-12-20T21:40:40Z","title":"CLEVR: A Diagnostic Dataset for Compositional Language and Elementary Visual Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.06890","snapshot_observed_at":"2026-08-11T12:13:21.418101Z","title":"L.; and Girshick, R","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.418101Z"},"links":{"cited_paper":"/paper/1612.06890","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:84a3b4721bdf40fc1938f35e3e05080b50607bf186a9646f9b7d78e1a264207c","observation_id":"be93e67d-896d-4d26-a556-1b5eb0f96548","resolution":{"observed_at":"2026-08-11T12:13:21.418101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.03334","last_updated":"2021-06-10T17:15:46Z","snapshot_observed_at":"2026-08-08T11:48:41.652015Z","submitted_at":"2021-02-05T18:36:11Z","title":"ViLT: Vision-and-Language Transformer Without Convolution or Region Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.03334","snapshot_observed_at":"2026-08-11T12:13:21.422734Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.422734Z"},"links":{"cited_paper":"/paper/2102.03334","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:58c878fcb81efa8f0d7678a0ec3a2488ff465bcc84f0572c1ea1c1fd3b7e3512","observation_id":"d7ca3a37-f02d-4ec6-99e1-38073ef829e2","resolution":{"observed_at":"2026-08-11T12:13:21.422734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.02643","last_updated":"2023-04-05T17:59:46Z","snapshot_observed_at":"2026-08-08T05:14:59.435033Z","submitted_at":"2023-04-05T17:59:46Z","title":"Segment Anything","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.02643","snapshot_observed_at":"2026-08-11T12:13:21.426483Z","title":"C.; Lo, W.-Y.; et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.426483Z"},"links":{"cited_paper":"/paper/2304.02643","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:c89fd951bb9e582fc2906ba9d622cd701ec11cace0983f78dd9db4b2cde8b11a","observation_id":"2036e379-188b-4926-96a0-c464f3d53094","resolution":{"observed_at":"2026-08-11T12:13:21.426483Z","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-11T12:13:22.397434Z","title":"S.; Reid, M.; Matsuo, Y.; and Iwasawa, Y","venue":null,"work_id":"aadedc00-ba37-4691-8543-c311f9d694e2","year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.429894Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:c4308d08b4ba1e39907e3dab10feef087255d85a1b188e457554a663e4dadc5d","observation_id":"6409240f-1afd-4d61-bde7-0c5687678646","resolution":{"observed_at":"2026-08-11T12:13:22.424504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10220","last_updated":"2019-04-06T12:09:49Z","snapshot_observed_at":"2026-07-06T07:10:15.154627Z","submitted_at":"2018-10-24T07:26:47Z","title":"DSFD: Dual Shot Face Detector","version":3},"cited_work":{"arxiv_id":"1810.10220","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.10220","snapshot_observed_at":"2026-08-11T12:13:21.894927Z","title":"DSFD: Dual Shot Face Detector","venue":"cs.CV","work_id":"1226de8e-0b09-433b-84ff-33d26c88de62","year":2018},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.435637Z"},"links":{"cited_paper":"/paper/1810.10220","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:173c0b1b171be4c8070bf2cf0905260195ee19163677b382a979c30b73465a87","observation_id":"bc34e9f3-e422-4c69-b963-87f3e09ae614","resolution":{"observed_at":"2026-08-11T12:13:21.898573Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:13:22.371245Z","title":"N.; and Zhu, S.-C","venue":null,"work_id":"bf0f3100-d04c-42f9-b1dd-d1fe0944e33b","year":2020},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.442854Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:3bbfdfed7bd76290a2fe126788bcc020ad08192ca52c86e3dce5952fd16e86d8","observation_id":"c834dbe1-46a3-4d8f-8ece-5b3e76ef0821","resolution":{"observed_at":"2026-08-11T12:13:22.380221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11729","last_updated":"2022-05-24T02:33:58Z","snapshot_observed_at":"2026-08-11T10:08:51.009202Z","submitted_at":"2022-05-24T02:33:58Z","title":"From Easy to Hard: Two-stage Selector and Reader for Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":"2205.11729","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.11729","snapshot_observed_at":"2026-08-11T12:13:21.881003Z","title":"From Easy to Hard: Two-stage Selector and Reader for Multi-hop Question Answering","venue":"cs.CL","work_id":"358edb93-858e-4170-8b29-4ad9da6e459b","year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.451052Z"},"links":{"cited_paper":"/paper/2205.11729","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:4a57de9acd9c04b67597f779fbf9f6949a02e6166e90e3e241fc310188aaa086","observation_id":"5423c0b2-e0e4-46a8-83d5-c917321effd5","resolution":{"observed_at":"2026-08-11T12:13:21.885060Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:13:22.323430Z","title":null,"venue":null,"work_id":"5699cf21-b355-42d7-b6ed-bd030b88d1f1","year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.461944Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:3a273374a422aef3a6bb6764f39e59ae53ed01383536d8db4cb58d9184b1b2aa","observation_id":"f0e10005-0ee4-4b23-9299-513c36e75f76","resolution":{"observed_at":"2026-08-11T12:13:22.338279Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16434","last_updated":"2023-03-29T03:30:38Z","snapshot_observed_at":"2026-08-11T20:12:37.967451Z","submitted_at":"2023-03-29T03:30:38Z","title":"TaskMatrix.AI: Completing Tasks by Connecting Foundation Models with Millions of APIs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16434","snapshot_observed_at":"2026-08-11T12:13:21.466544Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.466544Z"},"links":{"cited_paper":"/paper/2303.16434","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:93b5060a6e33524f4ad3f39b5086c46637a70bf08f2f248892ca77a7f1c08bc0","observation_id":"88af961c-ff46-44d7-9106-02e501644a66","resolution":{"observed_at":"2026-08-11T12:13:21.466544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-11T12:13:21.470746Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.470746Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:bea8e52d8256f0b470ab5ee2ed8d9830de1c0b997d0f450b3edad520a792bdd9","observation_id":"8fb6ee43-5748-4347-934b-0184b99fb278","resolution":{"observed_at":"2026-08-11T12:13:21.470746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.13379","last_updated":"2023-09-20T22:19:30Z","snapshot_observed_at":"2026-07-06T14:46:23.137171Z","submitted_at":"2023-01-31T03:04:26Z","title":"Faithful Chain-of-Thought Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.13379","snapshot_observed_at":"2026-08-11T12:13:21.474093Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.474093Z"},"links":{"cited_paper":"/paper/2301.13379","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:dcf2ba49825152c5944ba05874df5958869d9d776138f9402038b1315fa95f78","observation_id":"2cc8d93f-a1e4-4cea-a860-00edcdcd7325","resolution":{"observed_at":"2026-08-11T12:13:21.474093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.10872","last_updated":"2018-12-12T09:56:40Z","snapshot_observed_at":"2026-08-12T07:09:52.692572Z","submitted_at":"2018-05-28T11:33:00Z","title":"DeepProbLog: Neural Probabilistic Logic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.10872","snapshot_observed_at":"2026-08-11T12:13:21.477796Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.477796Z"},"links":{"cited_paper":"/paper/1805.10872","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:070e9e3cf7d274580800bdd2e30f78a51f6bb01c6e731060d3416f590076a09a","observation_id":"d067b25a-35e6-4945-9e0e-7be5be86b9af","resolution":{"observed_at":"2026-08-11T12:13:21.477796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12584","last_updated":"2019-04-26T06:50:54Z","snapshot_observed_at":"2026-08-06T17:51:03.744239Z","submitted_at":"2019-04-26T06:50:54Z","title":"The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12584","snapshot_observed_at":"2026-08-11T12:13:21.481602Z","title":"B.; and Wu, J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.481602Z"},"links":{"cited_paper":"/paper/1904.12584","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:1ad47f7c480aefbed767e67fc5b9202190434911ba5d76b3c3c4f839d1e7fa51","observation_id":"f966759a-fbfe-4224-aba6-912c2650d979","resolution":{"observed_at":"2026-08-11T12:13:21.481602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14552","last_updated":"2023-10-22T21:22:29Z","snapshot_observed_at":"2026-08-10T10:57:09.153844Z","submitted_at":"2023-05-23T22:24:44Z","title":"Sources of Hallucination by Large Language Models on Inference Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14552","snapshot_observed_at":"2026-08-11T12:13:21.484582Z","title":"J.; Johnson, M.; and Steedman, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.484582Z"},"links":{"cited_paper":"/paper/2305.14552","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:7fad7dd5d44e2cc30f11d2f154c154b6e3c27a6f1465bf5bc142eb7350b69318","observation_id":"4367ff7d-7ac0-46a7-b027-e912aa5c1843","resolution":{"observed_at":"2026-08-11T12:13:21.484582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.06230","last_updated":"2022-07-20T12:24:25Z","snapshot_observed_at":"2026-07-06T13:09:25.356940Z","submitted_at":"2022-05-12T17:20:36Z","title":"Simple Open-Vocabulary Object Detection with Vision Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06230","snapshot_observed_at":"2026-08-11T12:13:21.488083Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.488083Z"},"links":{"cited_paper":"/paper/2205.06230","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:04f040556f1990f260d4fff9ce0df383bbd29ec2f65fdf1c9584c535ddad9f9d","observation_id":"c7af9a74-44ad-4fff-85d0-3dc25e574b62","resolution":{"observed_at":"2026-08-11T12:13:21.488083Z","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-11T12:13:22.273583Z","title":null,"venue":null,"work_id":"f8aab795-4432-4a52-a3d6-f35e102518a6","year":2020},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.492256Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:d0c96d50122e5ee695b00e61dedeff43794405edb6adaf84ee629a65dff88d5f","observation_id":"134bb0c7-29e0-45b6-bdda-1310e98978f1","resolution":{"observed_at":"2026-08-11T12:13:22.292850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.09332","last_updated":"2022-06-01T19:08:11Z","snapshot_observed_at":"2026-08-07T17:14:39.278754Z","submitted_at":"2021-12-17T05:43:43Z","title":"WebGPT: Browser-assisted question-answering with human feedback","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.09332","snapshot_observed_at":"2026-08-11T12:13:21.495507Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.495507Z"},"links":{"cited_paper":"/paper/2112.09332","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:b29b0be3e8264c9b898173592a2c9a57207c589f6a24d78d27cb19a108bf25cf","observation_id":"6c6a49de-9dca-4e7d-b5a9-6c8c636ca927","resolution":{"observed_at":"2026-08-11T12:13:21.495507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-02T11:18:37.014004Z","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-11T12:13:21.499709Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.499709Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:d24774612658fc1de2a19c91d9aa65e6e31d39964a11b491b993a0b78a29c6a7","observation_id":"b52e6a14-2792-46ef-a395-50cad963b93e","resolution":{"observed_at":"2026-08-11T12:13:21.499709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-11T12:13:21.503781Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.503781Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:c882701e55a244a84abee45acf46b2a617ffeb7f1c68ffb056c3b13a78e23556","observation_id":"0914caae-6b5a-4977-8e54-2369cfb86c1d","resolution":{"observed_at":"2026-08-11T12:13:21.503781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00020","last_updated":"2021-02-26T19:04:58Z","snapshot_observed_at":"2026-07-06T10:45:03.059688Z","submitted_at":"2021-02-26T19:04:58Z","title":"Learning Transferable Visual Models From Natural Language Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.00020","snapshot_observed_at":"2026-08-11T12:13:21.506917Z","title":"W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; Krueger, G.; and Sutskever, I","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.506917Z"},"links":{"cited_paper":"/paper/2103.00020","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:bdc1998717988ab93dad442e5276d18069382fc2d9947c6534d9c9ad227c5815","observation_id":"5e03ea82-2bdd-4dd6-8769-bab7832b808d","resolution":{"observed_at":"2026-08-11T12:13:21.506917Z","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-11T12:13:22.203665Z","title":null,"venue":null,"work_id":"1a448455-a0b2-406b-8301-5b6e3ecf912c","year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.510606Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:354bf71bb942edf383e3c0f27a38d173f21649a3e6058b1e57b00593e6fb6699","observation_id":"172bc153-6bd5-4791-b312-8388a78ec8bb","resolution":{"observed_at":"2026-08-11T12:13:22.244291Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:13:22.140110Z","title":null,"venue":null,"work_id":"938c634b-bec9-4671-b53a-c60aa4b29035","year":2021},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.513633Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:3c00b81d36d80d73e61dfc9ccd06db8b267d49e5a102bc26dfa2f86a3535c67e","observation_id":"1741b791-aeeb-4082-9914-bd6893c03286","resolution":{"observed_at":"2026-08-11T12:13:22.174468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:13:22.077461Z","title":null,"venue":null,"work_id":"5ae56aa7-1945-4635-96f9-3b7a87703864","year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.533257Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:4d769da834552a33d64d35ba2934cd5c82f9106f7c791911f14bb29e0bc03717","observation_id":"42b14909-3154-4ee0-976a-0651d53d4367","resolution":{"observed_at":"2026-08-11T12:13:22.106649Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.06588","last_updated":"2022-06-14T04:25:26Z","snapshot_observed_at":"2026-08-10T10:28:53.752617Z","submitted_at":"2022-06-14T04:25:26Z","title":"Shopping Queries Dataset: A Large-Scale ESCI Benchmark for Improving Product Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.06588","snapshot_observed_at":"2026-08-11T12:13:21.557499Z","title":"K.; Màrquez, L.; Valero, F.; Rao, N.; Zaragoza, H.; Bandyopadhyay, S.; Biswas, A.; Xing, A.; and Subbian, K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.557499Z"},"links":{"cited_paper":"/paper/2206.06588","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:7ffac02457a7c6f4708af2af43877a72b6171b94e153c8d24f28a0d88df4d626","observation_id":"bcece366-1d33-4f7e-a3ef-faaf8bbb7391","resolution":{"observed_at":"2026-08-11T12:13:21.557499Z","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-11T12:13:22.062864Z","title":null,"venue":null,"work_id":"a1e4f196-44b2-4f62-8342-01649d49a779","year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.581269Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:45af9ec5b289476489ecec9259eb014ff1b2cd74b31a740ba6aa2ca040abe9ac","observation_id":"dc5e4221-54a5-4719-a637-1414e0c0faa0","resolution":{"observed_at":"2026-08-11T12:13:22.066829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:13:22.051689Z","title":null,"venue":null,"work_id":"1201adf7-256b-4a4f-8128-de6da78a72f1","year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.585094Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:79ace28541f09f1d2649bf62bcbee7810b8b670f8db1d67bc48019092dac2307","observation_id":"cb14ae2c-d526-4ef5-bfa1-0cfcaeb39b43","resolution":{"observed_at":"2026-08-11T12:13:22.055718Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04761","last_updated":"2023-02-09T16:49:57Z","snapshot_observed_at":"2026-07-06T14:50:07.491434Z","submitted_at":"2023-02-09T16:49:57Z","title":"Toolformer: Language Models Can Teach Themselves to Use Tools","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04761","snapshot_observed_at":"2026-08-11T12:13:21.588772Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.588772Z"},"links":{"cited_paper":"/paper/2302.04761","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:dc03b93ef28e123b210a9f4d52146d6b799be3e49e948875267d73720b35c657","observation_id":"148500d2-75f5-4ccb-a90c-39fa97f022b3","resolution":{"observed_at":"2026-08-11T12:13:21.588772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06177","last_updated":"2019-09-04T00:14:56Z","snapshot_observed_at":"2026-08-12T13:33:22.070759Z","submitted_at":"2019-08-16T21:12:15Z","title":"CLUTRR: A Diagnostic Benchmark for Inductive Reasoning from Text","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.06177","snapshot_observed_at":"2026-08-11T12:13:21.593237Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.593237Z"},"links":{"cited_paper":"/paper/1908.06177","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:9fb9bfb22acfababbd4dd9e577d86d8f61f830067abad788538e88d2a7b40579","observation_id":"c7f542a9-6e2d-468c-9171-3ce6fbc184a2","resolution":{"observed_at":"2026-08-11T12:13:21.593237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09297","last_updated":"2020-11-02T06:54:52Z","snapshot_observed_at":"2026-08-07T07:19:41.700353Z","submitted_at":"2020-04-20T13:54:12Z","title":"MPNet: Masked and Permuted Pre-training for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.09297","snapshot_observed_at":"2026-08-11T12:13:21.597025Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.597025Z"},"links":{"cited_paper":"/paper/2004.09297","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:ff7711cd3ef303f2dd55d94b65387b302dc44a452aebafcb142bffb1688e3109","observation_id":"eda2b044-acef-4450-a236-a22d506104be","resolution":{"observed_at":"2026-08-11T12:13:21.597025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04615","last_updated":"2023-06-12T17:51:15Z","snapshot_observed_at":"2026-07-06T13:19:12.109592Z","submitted_at":"2022-06-09T17:05:34Z","title":"Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04615","snapshot_observed_at":"2026-08-11T12:13:21.600201Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.600201Z"},"links":{"cited_paper":"/paper/2206.04615","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:cd5cc44210b01955b6977cbb01db6a60df3e3047ec8685d8839242d9a10420bc","observation_id":"39feccbe-0adc-43cf-ab58-bfbf00ab087e","resolution":{"observed_at":"2026-08-11T12:13:21.600201Z","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-11T12:13:22.039578Z","title":null,"venue":null,"work_id":"51abfc7a-1485-4933-bda7-a408d3e466f0","year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.603727Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:cd26a3df49eb2557d258cca744229d9e57b35db7379b4fa16042aa9e6794f40c","observation_id":"ba1785ff-41e8-4d65-8ba3-d87df5c95696","resolution":{"observed_at":"2026-08-11T12:13:22.042518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-11T12:13:21.607916Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.607916Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:72c3bc1d3c953d24c2dc88255e396151793fab37032d40294988371b4ac8a629","observation_id":"36692e5f-11b3-4a7b-bf2e-3738f3c632cc","resolution":{"observed_at":"2026-08-11T12:13:21.607916Z","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-11T12:13:22.026829Z","title":"L.; Wilder, B.; and Kolter, Z","venue":null,"work_id":"6ca05ec0-3756-4297-b3b0-07638b9c0daa","year":2019},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.612473Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:41220a20514dd9513569e0c544dd47a9df90671f1a533d961d1eaad79b1cbfac","observation_id":"4b87f03b-a405-4bae-9f3a-e048d9734c2f","resolution":{"observed_at":"2026-08-11T12:13:22.030106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11171","last_updated":"2023-03-07T17:57:37Z","snapshot_observed_at":"2026-07-06T12:50:22.773056Z","submitted_at":"2022-03-21T17:48:52Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-11T12:13:21.615946Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.615946Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:4e80f44a42cc73581aa946d7327a3791b581285e4d7cba0ac5ae062cc4a7d4ac","observation_id":"c194d445-f459-46d8-85a2-d53a94d9ae59","resolution":{"observed_at":"2026-08-11T12:13:21.615946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11903","last_updated":"2023-01-10T23:07:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-01-28T02:33:07Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.11903","snapshot_observed_at":"2026-08-11T12:13:21.620307Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.620307Z"},"links":{"cited_paper":"/paper/2201.11903","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:a35aaf4e1d4d7e2ab5f0f4b9f649cb349df45abace40c612780d4f77ff610229","observation_id":"c7244a59-e7b2-4711-a202-0bd804b6d27e","resolution":{"observed_at":"2026-08-11T12:13:21.620307Z","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-11T12:13:22.015473Z","title":"S.; Wong, Y.; Kankanhalli, M.; and Shah, M","venue":null,"work_id":"7a5dc72d-e3bd-4c86-93c3-ab5199a60f9e","year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.623267Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:b3464056139651791d10540cdd3e4b245f8d9a071e7ee890c4b7f23bfee1c6f2","observation_id":"d09b7782-95d8-4ee5-bf59-b151972182b9","resolution":{"observed_at":"2026-08-11T12:13:22.018678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09600","last_updated":"2018-09-25T17:28:20Z","snapshot_observed_at":"2026-08-11T10:35:06.989614Z","submitted_at":"2018-09-25T17:28:20Z","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.09600","snapshot_observed_at":"2026-08-11T12:13:21.626991Z","title":"W.; Salakhutdinov, R.; and Manning, C","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.626991Z"},"links":{"cited_paper":"/paper/1809.09600","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:9ffc6ee159354c465cdf68a26376984b5d0295d828ee58eb162bb7b895e92abd","observation_id":"ef997bb0-abd5-468e-afa0-558849bbcb86","resolution":{"observed_at":"2026-08-11T12:13:21.626991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-11T12:13:21.630337Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.630337Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:dfcffe9d3341cc769986b10c04ecf7b75cca294aec6d0c8b59a6100f85c41d3a","observation_id":"d8849403-63f6-48be-bf73-4d0990b96446","resolution":{"observed_at":"2026-08-11T12:13:21.630337Z","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-11T12:13:22.005351Z","title":null,"venue":null,"work_id":"e1a07d4f-7783-4101-8928-1beae8e3f0dd","year":2018},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.633439Z"},"links":{"citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:7bb52f31d35a38d1b9c5524b10a098cb110d93fd05b289e536b786ca6b01b955","observation_id":"d6a853d7-af05-4220-8bcd-f979075c73d6","resolution":{"observed_at":"2026-08-11T12:13:22.007764Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09512","last_updated":"2023-12-13T16:27:16Z","snapshot_observed_at":"2026-08-06T10:09:42.054383Z","submitted_at":"2022-12-19T14:48:08Z","title":"Rethinking Label Smoothing on Multi-hop Question Answering","version":3},"cited_work":{"arxiv_id":"2212.09512","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.09512","snapshot_observed_at":"2026-08-11T12:13:21.671819Z","title":"Rethinking Label Smoothing on Multi-hop Question Answering","venue":"cs.CL","work_id":"24f737bd-0b44-49c1-b9f6-34e8db11f8cd","year":2022},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.636196Z"},"links":{"cited_paper":"/paper/2212.09512","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:5ceef5ff0417e81d45a42a20f60f5001cebab11a8b8fbed44754bee9a5f1794f","observation_id":"1c75e611-0cc1-4caf-988e-b179392c3feb","resolution":{"observed_at":"2026-08-11T12:13:21.677079Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05685","last_updated":"2023-12-24T02:01:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-09T05:55:52Z","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05685","snapshot_observed_at":"2026-08-11T12:13:21.639033Z","title":"P.; Zhang, H.; Gonzalez, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T12:13:21.639033Z"},"links":{"cited_paper":"/paper/2306.05685","citing_paper":"/paper/2412.14515"},"observation_digest":"sha256:9f28ee28fc760b21170052b9fbc8aa9b4c8b664912c9f3bc1ce1a07808bd8f7c","observation_id":"74c48a4d-dcd7-413f-a54f-96cb5201f698","resolution":{"observed_at":"2026-08-11T12:13:21.639033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.14515","last_updated":"2024-12-19T04:26:45Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T12:08:04.570243Z","submitted_at":"2024-12-19T04:26:45Z","title":"Relational Programming with Foundation Models"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":3,"verified_fuzzy":5},"total_outbound_references":57},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2412.14515."}