{"as_of":"2026-08-08T17:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e13bd3a3cd05a23cb65288dad2485074e7d4d4d522215a89e46a07d619e18e76","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-07T11:05:25.967485Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T11:05:26.871205Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.06570","last_updated":"2019-02-18T13:53:00Z","snapshot_observed_at":"2026-07-06T07:33:47.424274Z","submitted_at":"2019-02-18T13:53:00Z","title":"Binary Debloating for Security via Demand Driven Loading","version":1},"cited_work":{"arxiv_id":"1902.06570","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.06570","snapshot_observed_at":"2026-08-07T11:05:26.871205Z","title":"Binary Debloating for Security via Demand Driven Loading","venue":"cs.CR","work_id":"65e88bf0-9afe-4950-958d-111e3defbaa2","year":2019},"citing_paper":{"arxiv_id":"2506.03504","last_updated":"2025-06-04T02:45:27Z","snapshot_observed_at":"2026-08-07T10:59:11.348359Z","submitted_at":"2025-06-04T02:45:27Z","title":"Beyond C/C++: Probabilistic and LLM Methods for Next-Generation Software Reverse Engineering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:05:25.967485Z"},"links":{"cited_paper":"/paper/1902.06570","citing_paper":"/paper/2506.03504"},"observation_digest":"sha256:5c18dd76acfe0be059ce03af7169347d5a6b36590275648dd8ba5d2c09b7837d","observation_id":"f47ea197-76c5-4584-b3d8-40bc39bd786c","resolution":{"observed_at":"2026-08-07T11:05:26.879833Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1902.06570/citation-record","integrity":"/paper/1902.06570/integrity","json":"/paper/1902.06570/citation-record.json","paper":"/paper/1902.06570"},"outbound":[],"paper":{"arxiv_id":"1902.06570","last_updated":"2019-02-18T13:53:00Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-07-06T07:33:47.424274Z","submitted_at":"2019-02-18T13:53:00Z","title":"Binary Debloating for Security via Demand Driven Loading"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1902.06570."}