{"as_of":"2026-08-11T08:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c12d9bd572e3b975e0858e9085943c222b3252e74e7ae5699119a37544a8bc7","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:21:30.019088Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":123,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1302.3599","last_updated":"2013-02-13T14:16:12Z","snapshot_observed_at":"2026-08-09T17:35:59.929097Z","submitted_at":"2013-02-13T14:16:12Z","title":"A Discovery Algorithm for Directed Cyclic Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1302.3599","snapshot_observed_at":"2026-08-05T13:21:30.019088Z","title":"A discovery algorithm for directed cyclic graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.00846","last_updated":"2025-08-31T13:31:34Z","snapshot_observed_at":"2026-08-09T20:03:24.194954Z","submitted_at":"2025-08-31T13:31:34Z","title":"Causal SHAP: Feature Attribution with Dependency Awareness through Causal Discovery","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:21:30.019088Z"},"links":{"cited_paper":"/paper/1302.3599","citing_paper":"/paper/2509.00846"},"observation_digest":"sha256:678df118827af118bd968cabcb6c6a7dfca0d5d69aca7f66f2400dd4a9639f12","observation_id":"40474fbf-1fec-4cfd-b82b-db628e007445","resolution":{"observed_at":"2026-08-05T13:21:30.019088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1302.3599","last_updated":"2013-02-13T14:16:12Z","snapshot_observed_at":"2026-08-09T17:35:59.929097Z","submitted_at":"2013-02-13T14:16:12Z","title":"A Discovery Algorithm for Directed Cyclic Graphs","version":1},"cited_work":{"arxiv_id":"1302.3599","doi":"10.48550/arxiv.1302.3599","metadata_source":"arxiv_reference","pith_arxiv_id":"1302.3599","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"e03df3dd-ff66-4ec6-a9a5-b9a560163132","year":1996},"citing_paper":{"arxiv_id":"2607.01057","last_updated":"2026-07-01T15:22:03Z","snapshot_observed_at":"2026-08-03T17:29:02.573995Z","submitted_at":"2026-07-01T15:22:03Z","title":"Characterizing and Identifying Separable Graphical Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-02T05:59:42.344994Z"},"links":{"cited_paper":"/paper/1302.3599","citing_paper":"/paper/2607.01057"},"observation_digest":"sha256:49e9de7295e034001536dadf00503588eabd3bb90ae7472605de6659d2c8058a","observation_id":"cd2ddb4f-c4ec-4987-a5fb-e31d5c212ca3","resolution":{"observed_at":"2026-07-02T06:06:40.504881Z","resolver_source":"arxiv_id","status":"verified_exact"},"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/1302.3599/citation-record","integrity":"/paper/1302.3599/integrity","json":"/paper/1302.3599/citation-record.json","paper":"/paper/1302.3599"},"outbound":[],"paper":{"arxiv_id":"1302.3599","last_updated":"2013-02-13T14:16:12Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T17:35:59.929097Z","submitted_at":"2013-02-13T14:16:12Z","title":"A Discovery Algorithm for Directed Cyclic Graphs"},"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 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1302.3599."}