{"as_of":"2026-08-18T21:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab55e7daae9e303347a703cd3835552b5108c21ad47328e0259c7796875c3c60","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:51:29.113592Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T02:37:07.869989Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.10738","last_updated":"2019-07-24T21:37:16Z","snapshot_observed_at":"2026-08-05T08:00:03.179363Z","submitted_at":"2019-07-24T21:37:16Z","title":"Careful Selection of Knowledge to solve Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10738","snapshot_observed_at":"2026-08-14T05:51:29.113592Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1909.00596","last_updated":"2019-11-14T10:09:56Z","snapshot_observed_at":"2026-08-14T05:40:22.011297Z","submitted_at":"2019-09-02T08:36:32Z","title":"Answering questions by learning to rank -- Learning to rank by answering questions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:29.113592Z"},"links":{"cited_paper":"/paper/1907.10738","citing_paper":"/paper/1909.00596"},"observation_digest":"sha256:680ee0232c3e903162933afef43dd639b29a20491790f73818de66ecb2af4b0d","observation_id":"68ed023e-69e7-45a6-969f-ee4b71dc0488","resolution":{"observed_at":"2026-08-14T05:51:29.113592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10738","last_updated":"2019-07-24T21:37:16Z","snapshot_observed_at":"2026-08-05T08:00:03.179363Z","submitted_at":"2019-07-24T21:37:16Z","title":"Careful Selection of Knowledge to solve Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10738","snapshot_observed_at":"2026-08-09T17:26:45.564609Z","title":"Careful selection of knowledge to solve open book question answering.arXiv preprint arXiv:1907.10738, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.00899","last_updated":"2025-02-02T20:23:32Z","snapshot_observed_at":"2026-08-17T14:09:12.832357Z","submitted_at":"2025-02-02T20:23:32Z","title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T17:26:45.564609Z"},"links":{"cited_paper":"/paper/1907.10738","citing_paper":"/paper/2502.00899"},"observation_digest":"sha256:a14e760d68ff3fb4acecfd36cdd0cc9f1f82e1d1b5bf4daad0fbd449c14917ca","observation_id":"dbdf7098-7262-45bf-98e9-7d8556f0eaae","resolution":{"observed_at":"2026-08-09T17:26:45.564609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10738","last_updated":"2019-07-24T21:37:16Z","snapshot_observed_at":"2026-08-05T08:00:03.179363Z","submitted_at":"2019-07-24T21:37:16Z","title":"Careful Selection of Knowledge to solve Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10738","snapshot_observed_at":"2026-08-07T12:46:42.907393Z","title":"Careful selection of knowledge to solve open book question answering","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-14T10:14:02.911205Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:42.907393Z"},"links":{"cited_paper":"/paper/1907.10738","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:a3c04e29b901f93cd4e619e92656a535550d569534488bfd5636b76ddf826661","observation_id":"e6bd628b-c225-450c-a3f3-7c4bd75b14b7","resolution":{"observed_at":"2026-08-07T12:46:42.907393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10738","last_updated":"2019-07-24T21:37:16Z","snapshot_observed_at":"2026-08-05T08:00:03.179363Z","submitted_at":"2019-07-24T21:37:16Z","title":"Careful Selection of Knowledge to solve Open Book Question Answering","version":1},"cited_work":{"arxiv_id":"1907.10738","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.10738","snapshot_observed_at":"2026-07-04T23:49:36.405808Z","title":"Careful selection of knowledge to solve open book question answering.arXiv preprint arXiv:1907.10738","venue":null,"work_id":"f4df3bf0-7165-4a56-8916-2d7ca20f7cde","year":1907},"citing_paper":{"arxiv_id":"2605.11222","last_updated":"2026-05-11T20:33:41Z","snapshot_observed_at":"2026-08-10T21:13:45.091106Z","submitted_at":"2026-05-11T20:33:41Z","title":"ADMM-Q: An Improved Hessian-based Weight Quantizer for Post-Training Quantization of Large Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T02:35:25.946090Z"},"links":{"cited_paper":"/paper/1907.10738","citing_paper":"/paper/2605.11222"},"observation_digest":"sha256:4d1298073d6e585774b34f25e8dc856bdee89b9fc2d54901f192460e9a5355b2","observation_id":"22d13947-df0a-4219-b21b-21f1d7155a44","resolution":{"observed_at":"2026-07-04T23:49:36.405808Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1907.10738/citation-record","integrity":"/paper/1907.10738/integrity","json":"/paper/1907.10738/citation-record.json","paper":"/paper/1907.10738"},"outbound":[],"paper":{"arxiv_id":"1907.10738","last_updated":"2019-07-24T21:37:16Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-05T08:00:03.179363Z","submitted_at":"2019-07-24T21:37:16Z","title":"Careful Selection of Knowledge to solve Open Book Question Answering"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1907.10738."}