{"as_of":"2026-08-11T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3bc8adc2e42c83139e22f5d8633a372cae0ed1836397f6d1e5608263365ceaf0","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:55:35.492836Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T20:50:31.901768Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14705","snapshot_observed_at":"2026-08-03T20:50:31.901768Z","title":"[ES04] Niklas E´ en and Niklas S¨ orensson","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-11T05:38:25.065358Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:31.901768Z"},"links":{"cited_paper":"/paper/2501.14705","citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:1fbb98ddaf1692d710f5428e3dfac9d838dcfc90179b25ffb84e9d6150d85eee","observation_id":"505d3e93-9dc2-4f1a-9488-404454c91119","resolution":{"observed_at":"2026-08-03T20:50:31.901768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.14705/citation-record","integrity":"/paper/2501.14705/integrity","json":"/paper/2501.14705/citation-record.json","paper":"/paper/2501.14705"},"outbound":[{"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-10T14:55:35.348849Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.348849Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:0b87b3252ba8b32e944a5a5538001a105c2248a3c71e24d19584c96deb00de80","observation_id":"829da86f-8ff4-44c3-8f39-8d35079f02df","resolution":{"observed_at":"2026-08-10T14:55:35.348849Z","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-10T14:55:35.354303Z","title":"Np-hardness of euclidean sum-of-squares clustering","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.354303Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:a5e673a24001f1ef0cb5bdfb7eefb803880cb5f90dd67235897dc773cf15933c","observation_id":"634cd201-08cf-49ea-aa1a-14cf7b96e795","resolution":{"observed_at":"2026-08-10T14:55:35.354303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.13319","last_updated":"2019-05-30T21:28:12Z","snapshot_observed_at":"2026-08-10T18:39:13.771066Z","submitted_at":"2019-05-30T21:28:12Z","title":"MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalisms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.13319","snapshot_observed_at":"2026-08-10T14:55:35.358982Z","title":"Mathqa: Towards interpretable math word problem solving with operation-based formalisms","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.358982Z"},"links":{"cited_paper":"/paper/1905.13319","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:d3a4ed26b6098cddc3a19c51cb66d3ebbe3191587a6d1b6d7f3f0215d6a2a075","observation_id":"f061b69d-5db7-4931-9b86-23d93a5781d1","resolution":{"observed_at":"2026-08-10T14:55:35.358982Z","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-10T14:55:35.977580Z","title":"Proof verification and the hardness of approximation problems","venue":null,"work_id":"d64e9f9e-68d1-4bfb-90a3-a5f14a3a3118","year":1998},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.364659Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:b153ec953896943f572e2247e9c389a1c605b08173dbe0bf4f9bb237eb588069","observation_id":"8470c591-cb03-4582-8bda-8ebd2bdcc7c6","resolution":{"observed_at":"2026-08-10T14:55:35.982862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.960601Z","title":"Complexity and approximation: Combinatorial optimization problems and their approximability properties","venue":null,"work_id":"13a6967d-ce6f-44d3-b482-5d4a9a50b619","year":2012},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.369386Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:f3963905692fbe415fd7ea7876fdfd3ebcfec0d9693b26db6a3982d0dd88a756","observation_id":"9319c6a2-ecff-40fb-b821-bbe4d7ebaa79","resolution":{"observed_at":"2026-08-10T14:55:35.965934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10631","last_updated":"2024-03-15T19:14:39Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-16T17:54:07Z","title":"Llemma: An Open Language Model For Mathematics","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10631","snapshot_observed_at":"2026-08-10T14:55:35.374062Z","title":"Llemma: An open language model for mathematics.(2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.374062Z"},"links":{"cited_paper":"/paper/2310.10631","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:7b97be59dbe975f6ce919d0d2d202f963c813ca6d05ef16db59b4cc7c70c2ba9","observation_id":"5b7a98c9-0a12-4b27-be54-14f5fea4f919","resolution":{"observed_at":"2026-08-10T14:55:35.374062Z","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-10T14:55:35.945201Z","title":"Proving theorems with computers","venue":null,"work_id":"7dba3fe6-c4f9-4929-8adc-18c937a12a11","year":2020},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.379640Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:103c534dc6e51cc8dafe6328640de45dedcf726a9811e2dc6a4d96a6e1ff8725","observation_id":"003bfa6b-22a5-4483-a6f9-ec21cdf110c8","resolution":{"observed_at":"2026-08-10T14:55:35.949955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.929701Z","title":"Induced matchings","venue":null,"work_id":"4263dd7e-38a7-44b0-a6df-f43bc5421510","year":1989},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.384454Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:fedb5593c974be9080f26d507d7721d8705b73dc66cbb818d95dd6b2a9d30621","observation_id":"216ac862-bec7-47ea-b7f4-b0ef9a6c84f4","resolution":{"observed_at":"2026-08-10T14:55:35.934521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.388863Z","title":"Training verifiers to solve math word problems, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.388863Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:8929ec3c4c9f578f5ac0a8fd25274eac03aad2a03390b3d916aeb605c680a072","observation_id":"c29ec0ae-0586-4bdc-85c7-291c363a47a6","resolution":{"observed_at":"2026-08-10T14:55:35.388863Z","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-10T14:55:35.913960Z","title":"Automatic evaluation of reductions between np-complete problems","venue":null,"work_id":"4b5c43de-0016-42eb-b9c8-66854b17adc0","year":2014},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.393426Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:cdc49d2046df066cf571ed47d173e9bd612365d637bf47d309668a343866f387","observation_id":"3ec9e37c-edd2-46c8-b481-69c4ec779e5f","resolution":{"observed_at":"2026-08-10T14:55:35.918758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.898705Z","title":"Algorithms","venue":null,"work_id":"d79cc641-748d-4971-975f-a196e07cfb04","year":2006},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.397851Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:ab8e61fdc9547acedbc5e4c92eff4f4870441ce5b6768b7094a8727ac8a8a560","observation_id":"d83198c8-7f2a-496f-8b0a-ea76831dcf60","resolution":{"observed_at":"2026-08-10T14:55:35.903556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.402484Z","title":"Qlora: Efficient finetuning of quantized llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.402484Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:bfe2f43a914fba2f24148458d82b2c9df5628810adac0cf2f3be264cf5c6fc3f","observation_id":"e7dfdec7-47bd-42f3-99f4-b19866509ba2","resolution":{"observed_at":"2026-08-10T14:55:35.402484Z","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-10T14:55:35.871931Z","title":"The pcp theorem by gap amplification","venue":null,"work_id":"dfb0c1c3-41c5-4e66-b339-d41e2a021c3b","year":2007},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.406966Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:be1fbab8af82453323d26bcd6adea374f48fcbcb25623cb2f267dbea214c4c84","observation_id":"cafba56d-ac92-4211-b585-2221cfb0e570","resolution":{"observed_at":"2026-08-10T14:55:35.877274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.855515Z","title":"Interactive proofs and the hardness of approximating cliques","venue":null,"work_id":"29ee14a3-bb63-498f-baad-476af9fe4d04","year":1996},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.411517Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:537d7b399ac9b3cca9477d9d9eb0ad029776e80a5da6a17e02e9a861dfcaab0f","observation_id":"476683c2-5838-41bd-a6ef-2d25887efe96","resolution":{"observed_at":"2026-08-10T14:55:35.860514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.840211Z","title":"On the parameterized complexity of cutting a few vertices from a graph","venue":null,"work_id":"7d159152-22e1-4666-a0ab-0422cacf23d9","year":2013},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.416070Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:5a631f50d6b53588c44465498de535e9c417f014a56eab76828af490ae248f74","observation_id":"14755e54-9ce5-401c-9321-ee8d59d7d6c3","resolution":{"observed_at":"2026-08-10T14:55:35.845132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.825501Z","title":"Computers and intractability, volume 174","venue":null,"work_id":"f40c4780-7a68-4942-a7ac-4fb17a863888","year":1979},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.420776Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:5723f0bacf54f68b91239eb0097c01df2e483910a97be39b6e9fa804e93c2001","observation_id":"484c0cfc-4935-44ca-8d61-dcd1be748868","resolution":{"observed_at":"2026-08-10T14:55:35.830190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.810463Z","title":"Some simplified np-complete problems","venue":null,"work_id":"c4b25218-6ecb-481b-bc12-f3a7ed2cdaa3","year":1974},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.425294Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:8897614fdef606d3d3eb8f243ac861f60a72d450cb4d797b9ec3ab997e037c18","observation_id":"3e5561b0-13d7-43f2-b980-62ebf6a8694f","resolution":{"observed_at":"2026-08-10T14:55:35.815190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.794787Z","title":"Some np-complete geometric problems","venue":null,"work_id":"e5f3f240-9022-4df9-b136-bebece76aa9d","year":1976},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.430008Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:624babac6ba710612d877885ea20d630316cbfffad5386dea8303735a43d5f3a","observation_id":"cea40604-ce14-49de-a9c8-b8fa9a88acef","resolution":{"observed_at":"2026-08-10T14:55:35.799746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-08-10T12:35:09.020030Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-10T14:55:35.434665Z","title":"Measuring massive multitask language understanding","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.434665Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:032a302fa15dc7c16000317bc4ab87687d033bdbe08c41c662b5d61df27a1492","observation_id":"962d8596-0464-41ea-8506-40fa9451586c","resolution":{"observed_at":"2026-08-10T14:55:35.434665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-10T14:55:35.439993Z","title":"Measuring mathematical problem solving with the math dataset","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.439993Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:589792178903778d90308f847016420d2dd36e43dac2ba0a83bc72045387d521","observation_id":"b67fa884-a224-4552-9a6b-274e89e9eaba","resolution":{"observed_at":"2026-08-10T14:55:35.439993Z","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-10T14:55:35.445459Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.445459Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:d485aa5c8eac4089ad58626596ebb8405a1d9528ae70755a06c7ad302e277aae","observation_id":"15572fb2-a6d6-4e95-8ba2-d759c431433c","resolution":{"observed_at":"2026-08-10T14:55:35.445459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-08-10T14:55:35.450210Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.450210Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:a9b9e42aadc529eacaa2c78f23992d4a63d3d6f381ca7668d97a032cf2b77e97","observation_id":"696a899f-ad82-4e0d-9537-b8ff13e41766","resolution":{"observed_at":"2026-08-10T14:55:35.450210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-09T20:34:52.923500Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-10T14:55:35.455560Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.455560Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:333249047a1abca549baa398df16132ac5c362eb9ed33bb960a94aa21b1ac570","observation_id":"f924f917-8f99-4f31-88f2-427a582b22a1","resolution":{"observed_at":"2026-08-10T14:55:35.455560Z","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-10T14:55:35.769056Z","title":"Computational complexity","venue":null,"work_id":"6ceaba7f-c9bd-4586-846c-a644339923b8","year":1994},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.459968Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:722686ba86f6f1b415d905ee4738da326538eb2c4fe017c80b6e39832f66f96e","observation_id":"263d08d3-46f9-41b7-b032-1ebb95742d5f","resolution":{"observed_at":"2026-08-10T14:55:35.773932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01344","last_updated":"2022-02-03T00:17:00Z","snapshot_observed_at":"2026-08-10T22:15:10.655844Z","submitted_at":"2022-02-03T00:17:00Z","title":"Formal Mathematics Statement Curriculum Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01344","snapshot_observed_at":"2026-08-10T14:55:35.464689Z","title":"Formal mathematics statement curriculum learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.464689Z"},"links":{"cited_paper":"/paper/2202.01344","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:61633218fa831c7d9c318a852de72fbfb65eb31e2f6a66a826fc6d52b6542c5a","observation_id":"1f0d19df-7035-4e95-adb6-926b8a6326d3","resolution":{"observed_at":"2026-08-10T14:55:35.464689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03057","last_updated":"2022-10-06T17:03:34Z","snapshot_observed_at":"2026-07-06T14:00:37.875054Z","submitted_at":"2022-10-06T17:03:34Z","title":"Language Models are Multilingual Chain-of-Thought Reasoners","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03057","snapshot_observed_at":"2026-08-10T14:55:35.469708Z","title":"Language models are multilingual chain-of-thought reasoners","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.469708Z"},"links":{"cited_paper":"/paper/2210.03057","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:53092c5bba819f3859c9e30a18f7fe076f5e96816d29295b4c586350ea03a7af","observation_id":"f160b418-9534-4743-a593-1eaf8195b7e0","resolution":{"observed_at":"2026-08-10T14:55:35.469708Z","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-10T14:55:35.752953Z","title":"A promising path towards autoformalization and general artificial intelligence","venue":null,"work_id":"634879c1-0830-400e-bc0b-c76e9ab4d410","year":2020},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.474572Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:9c02abc9479bcf34d90b2a2a96aacf6d274503311efb2743ffc130c30b365491","observation_id":"62cd3022-132f-4a2e-a332-8a467ff59086","resolution":{"observed_at":"2026-08-10T14:55:35.757919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13048","last_updated":"2021-06-03T19:15:08Z","snapshot_observed_at":"2026-08-10T11:45:16.885523Z","submitted_at":"2020-12-24T00:55:46Z","title":"ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13048","snapshot_observed_at":"2026-08-10T14:55:35.479192Z","title":"Proofwriter: Generating implications, proofs, and abductive statements over natural language","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.479192Z"},"links":{"cited_paper":"/paper/2012.13048","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:42408bb4b6aebbec388699ed3bf1bc4d6cc1382ca198326afc4a26ec55e40e3b","observation_id":"7051c2c7-8365-4f6c-8c1d-a0770abf7d8a","resolution":{"observed_at":"2026-08-10T14:55:35.479192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-10T14:55:35.483701Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.483701Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:dd7cdb9f4b2a65e9f6d14cf33167301d580cafa2fb098865ddfd3d026d4d13c4","observation_id":"03e08029-d541-45f3-8140-3c07af404cd8","resolution":{"observed_at":"2026-08-10T14:55:35.483701Z","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-10T14:55:35.736735Z","title":"The clrs algorithmic reasoning benchmark","venue":null,"work_id":"a1fffa78-3737-46c9-8870-0d8eb8a8346b","year":2022},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.488463Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:f112ffdb2dd0d8524e0ff47844052aad8e236dfdd8e4ab34632a8e7ba8056930","observation_id":"3b316a3d-ffd0-4d02-9af9-788e2ae63d8f","resolution":{"observed_at":"2026-08-10T14:55:35.742545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T14:55:35.718686Z","title":"Karp: a language for np reductions","venue":null,"work_id":"5afae980-6da8-4bb6-8811-a3b4e35ec6b9","year":2022},"citing_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T14:55:35.492836Z"},"links":{"citing_paper":"/paper/2501.14705"},"observation_digest":"sha256:8fbb623163e48176217ab9b8f7f6d53b310fe76508dba0fbe695bca47b432602","observation_id":"c3e43c61-91b8-48cd-9c74-fe60607401d9","resolution":{"observed_at":"2026-08-10T14:55:35.724834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T14:30:43.120307Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":31},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2501.14705."}