{"as_of":"2026-08-22T04:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc1b3f0e8f6e4f54d3b75ea53f2766a8bd7b036cbdba52df824aaea3788e7cc4","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-21T06:32:19.484+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-10T13:55:54.071007Z","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-10T13:55:55.670200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1301.3868","last_updated":"2013-01-16T15:51:02Z","snapshot_observed_at":"2026-08-18T02:08:41.805545Z","submitted_at":"2013-01-16T15:51:02Z","title":"Making Sensitivity Analysis Computationally Efficient","version":1},"cited_work":{"arxiv_id":"1301.3868","doi":null,"metadata_source":"pith","pith_arxiv_id":"1301.3868","snapshot_observed_at":"2026-08-10T13:55:55.670200Z","title":"Making Sensitivity Analysis Computationally Efficient","venue":"cs.AI","work_id":"424381fc-268d-411b-a5e0-aacce1225d7f","year":2013},"citing_paper":{"arxiv_id":"2501.15973","last_updated":"2025-01-27T11:34:19Z","snapshot_observed_at":"2026-08-17T12:34:17.975219Z","submitted_at":"2025-01-27T11:34:19Z","title":"Integrating Probabilistic Trees and Causal Networks for Clinical and Epidemiological Data","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T13:55:54.071007Z"},"links":{"cited_paper":"/paper/1301.3868","citing_paper":"/paper/2501.15973"},"observation_digest":"sha256:9851eb2d27ec14df5d25d7aa12bdd7fa947acc79b0332c930b7bd58d38add09c","observation_id":"6ad70da5-451d-48e0-b711-ca45c3aefc32","resolution":{"observed_at":"2026-08-10T13:55:55.675601Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1301.3868/citation-record","integrity":"/paper/1301.3868/integrity","json":"/paper/1301.3868/citation-record.json","paper":"/paper/1301.3868"},"outbound":[],"paper":{"arxiv_id":"1301.3868","last_updated":"2013-01-16T15:51:02Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T02:08:41.805545Z","submitted_at":"2013-01-16T15:51:02Z","title":"Making Sensitivity Analysis Computationally Efficient"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1301.3868."}