{"as_of":"2026-08-12T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf2f19f4dd42ff7c07e04cb6021e0d6292a8702209af0e75baa4eeb3945a84f3","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-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-06-28T11:18:30.063163Z","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-07-02T02:06:26.475789Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1511.08963","last_updated":"2017-10-02T02:59:27Z","snapshot_observed_at":"2026-08-09T06:42:40.269657Z","submitted_at":"2015-11-29T03:52:28Z","title":"Learning Directed Acyclic Graphs with Penalized Neighbourhood Regression","version":3},"cited_work":{"arxiv_id":"1511.08963","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.08963","snapshot_observed_at":"2026-07-02T02:06:26.475789Z","title":"Learning Directed Acyclic Graphs with Penalized Neighbourhood Regression","venue":"math.ST","work_id":"9a57a9db-3372-4a7e-9102-606e7f34a351","year":2015},"citing_paper":{"arxiv_id":"2606.03227","last_updated":"2026-06-02T06:42:39Z","snapshot_observed_at":"2026-08-08T23:54:32.729567Z","submitted_at":"2026-06-02T06:42:39Z","title":"Learning Temporal Causal Structure via Smooth Differentiable Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T11:18:30.063163Z"},"links":{"cited_paper":"/paper/1511.08963","citing_paper":"/paper/2606.03227"},"observation_digest":"sha256:f4b5dba7b0d9c9e36ad5d61d23dc5077f4f8c3a7f70a0cd4251566fd30f1b023","observation_id":"641522c5-d3eb-45a9-960c-18b5a6883278","resolution":{"observed_at":"2026-07-02T02:06:26.478180Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1511.08963/citation-record","integrity":"/paper/1511.08963/integrity","json":"/paper/1511.08963/citation-record.json","paper":"/paper/1511.08963"},"outbound":[],"paper":{"arxiv_id":"1511.08963","last_updated":"2017-10-02T02:59:27Z","latest_version":3,"primary_category":"math.ST","snapshot_observed_at":"2026-08-09T06:42:40.269657Z","submitted_at":"2015-11-29T03:52:28Z","title":"Learning Directed Acyclic Graphs with Penalized Neighbourhood Regression"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1511.08963."}