{"as_of":"2026-08-10T18:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fcc6326aef770425f3ace5657b467216ab3f875943c149ca52231206d01e97f","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:07:23.276928Z","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-20T21:33:46.386254Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.10144","last_updated":"2025-01-24T15:43:41Z","snapshot_observed_at":"2026-07-06T17:45:07.023305Z","submitted_at":"2024-03-15T09:43:52Z","title":"NLP Verification: Towards a General Methodology for Certifying Robustness","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10144","snapshot_observed_at":"2026-08-07T01:07:23.276928Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11874","last_updated":"2025-06-13T15:26:58Z","snapshot_observed_at":"2026-08-09T21:30:20.290791Z","submitted_at":"2025-06-13T15:26:58Z","title":"A Short Survey on Formalising Software Requirements using Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T01:07:23.276928Z"},"links":{"cited_paper":"/paper/2403.10144","citing_paper":"/paper/2506.11874"},"observation_digest":"sha256:d8dcefeedd26e43e95390e1c28f6dea6f1a08d6781685ee1b5b2fd1ce96e9907","observation_id":"a0e305d4-2da5-4ffb-bd6b-ba20c24303c8","resolution":{"observed_at":"2026-08-07T01:07:23.276928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10144","last_updated":"2025-01-24T15:43:41Z","snapshot_observed_at":"2026-07-06T17:45:07.023305Z","submitted_at":"2024-03-15T09:43:52Z","title":"NLP Verification: Towards a General Methodology for Certifying Robustness","version":3},"cited_work":{"arxiv_id":"2403.10144","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.10144","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Daggitt, Omri Isac, Guy Katz, Verena Rieser, and Oliver Lemon","venue":null,"work_id":"1839ed26-2a07-42e7-9b5e-3984b6f04123","year":2024},"citing_paper":{"arxiv_id":"2604.18882","last_updated":"2026-04-20T22:02:57Z","snapshot_observed_at":"2026-07-06T23:05:39.724237Z","submitted_at":"2026-04-20T22:02:57Z","title":"Formally Verified Patent Analysis via Dependent Type Theory: Machine-Checkable Certificates from a Hybrid AI + Lean 4 Pipeline","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T03:59:28.532545Z"},"links":{"cited_paper":"/paper/2403.10144","citing_paper":"/paper/2604.18882"},"observation_digest":"sha256:f269901f0abf8bc33817b04f660f63e61f74b0f8d56599b6011cc6f4f730168b","observation_id":"c21b1d37-6913-4580-855b-528931c632e8","resolution":{"observed_at":"2026-05-11T12:16:05.213481Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10144","last_updated":"2025-01-24T15:43:41Z","snapshot_observed_at":"2026-07-06T17:45:07.023305Z","submitted_at":"2024-03-15T09:43:52Z","title":"NLP Verification: Towards a General Methodology for Certifying Robustness","version":3},"cited_work":{"arxiv_id":"2403.10144","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.10144","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Daggitt, Omri Isac, Guy Katz, Verena Rieser, and Oliver Lemon","venue":null,"work_id":"1839ed26-2a07-42e7-9b5e-3984b6f04123","year":2024},"citing_paper":{"arxiv_id":"2605.16407","last_updated":"2026-05-13T12:01:41Z","snapshot_observed_at":"2026-08-02T00:32:49.840013Z","submitted_at":"2026-05-13T12:01:41Z","title":"Proof-Carrying Certificates for LLM Pipelines: A Trust-Boundary Architecture","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T21:30:55.435207Z"},"links":{"cited_paper":"/paper/2403.10144","citing_paper":"/paper/2605.16407"},"observation_digest":"sha256:d0844d392ec7cb89ce001de50dcbfef42e3430763b57e1e051e82c77dca7e54d","observation_id":"65dcb7a8-fdff-4e15-8919-9bc1ed6923c7","resolution":{"observed_at":"2026-05-20T21:33:46.389145Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.10144/citation-record","integrity":"/paper/2403.10144/integrity","json":"/paper/2403.10144/citation-record.json","paper":"/paper/2403.10144"},"outbound":[],"paper":{"arxiv_id":"2403.10144","last_updated":"2025-01-24T15:43:41Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:45:07.023305Z","submitted_at":"2024-03-15T09:43:52Z","title":"NLP Verification: Towards a General Methodology for Certifying Robustness"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.10144."}