{"as_of":"2026-08-18T12:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45279715218a976718139e4defc7654318e3d15c6d77c425366d193daf8a39b4","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-18T06:34:40.430872+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-15T21:05:27.389318Z","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-15T15:01:36.106549Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1206.6875","last_updated":"2012-06-27T16:30:42Z","snapshot_observed_at":"2026-08-15T00:55:13.212453Z","submitted_at":"2012-06-27T16:30:42Z","title":"A simple approach for finding the globally optimal Bayesian network structure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.6875","snapshot_observed_at":"2026-08-15T21:05:27.389318Z","title":"Silander and P","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.11089","last_updated":"2025-09-09T05:48:26Z","snapshot_observed_at":"2026-08-15T20:55:47.086103Z","submitted_at":"2025-05-16T10:23:19Z","title":"Inexact Column Generation for Bayesian Network Structure Learning via Difference-of-Submodular Optimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:27.389318Z"},"links":{"cited_paper":"/paper/1206.6875","citing_paper":"/paper/2505.11089"},"observation_digest":"sha256:a868785c1c04c9c6c76e77242c8083756cf08627e9324599ed7039ab12c924a6","observation_id":"f557ec38-6263-41bb-afa6-95505c940c4e","resolution":{"observed_at":"2026-08-15T21:05:27.389318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1206.6875","last_updated":"2012-06-27T16:30:42Z","snapshot_observed_at":"2026-08-15T00:55:13.212453Z","submitted_at":"2012-06-27T16:30:42Z","title":"A simple approach for finding the globally optimal Bayesian network structure","version":1},"cited_work":{"arxiv_id":"1206.6875","doi":null,"metadata_source":"pith","pith_arxiv_id":"1206.6875","snapshot_observed_at":"2026-08-15T15:01:36.106549Z","title":"A simple approach for finding the globally optimal Bayesian network structure","venue":"cs.AI","work_id":"cd8447d4-a945-4cd4-899f-5f689765a78c","year":2012},"citing_paper":{"arxiv_id":"2608.02877","last_updated":"2026-08-03T20:59:26Z","snapshot_observed_at":"2026-08-17T23:02:18.065670Z","submitted_at":"2026-08-03T20:59:26Z","title":"GoT-CD: Graph-of-Thoughts Causal Discovery and the Fragility of Post-hoc Path-Specific Fairness Audits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:01:35.888948Z"},"links":{"cited_paper":"/paper/1206.6875","citing_paper":"/paper/2608.02877"},"observation_digest":"sha256:967f11f6f8615cfe266cffdd504156b9c18e0d40aeb5d99b859f9790205a58fb","observation_id":"fe305422-d0c0-4e95-8ea0-fa246bd2f895","resolution":{"observed_at":"2026-08-15T15:01:36.113311Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1206.6875/citation-record","integrity":"/paper/1206.6875/integrity","json":"/paper/1206.6875/citation-record.json","paper":"/paper/1206.6875"},"outbound":[],"paper":{"arxiv_id":"1206.6875","last_updated":"2012-06-27T16:30:42Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T00:55:13.212453Z","submitted_at":"2012-06-27T16:30:42Z","title":"A simple approach for finding the globally optimal Bayesian network structure"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1206.6875."}