{"as_of":"2026-08-17T18:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eff254ce8f302d9424acec33ce9327bb12dd13bdbad27cd21019ebe0fc86308c","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-17T06:30:58.91139+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-07T10:32:54.936816Z","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-07T10:32:55.214158Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1207.1429","last_updated":"2012-07-04T16:31:04Z","snapshot_observed_at":"2026-08-15T00:54:21.220405Z","submitted_at":"2012-07-04T16:31:04Z","title":"Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks","version":1},"cited_work":{"arxiv_id":"1207.1429","doi":null,"metadata_source":"pith","pith_arxiv_id":"1207.1429","snapshot_observed_at":"2026-08-07T10:32:55.214158Z","title":"Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks","venue":"cs.LG","work_id":"3f80e2b3-e442-4539-ba44-456f7ad7efb3","year":2012},"citing_paper":{"arxiv_id":"2506.05120","last_updated":"2025-06-05T15:08:01Z","snapshot_observed_at":"2026-08-17T02:36:34.602315Z","submitted_at":"2025-06-05T15:08:01Z","title":"Nonlinear Causal Discovery for Grouped Data","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T10:32:54.936816Z"},"links":{"cited_paper":"/paper/1207.1429","citing_paper":"/paper/2506.05120"},"observation_digest":"sha256:1026477ff73a1b8ae17c09158a73118a0e2bae77821338ca6146bc5c55314c71","observation_id":"a8cd1b3a-222d-4819-98ac-a00a96d06680","resolution":{"observed_at":"2026-08-07T10:32:55.220113Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1207.1429","last_updated":"2012-07-04T16:31:04Z","snapshot_observed_at":"2026-08-15T00:54:21.220405Z","submitted_at":"2012-07-04T16:31:04Z","title":"Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1207.1429","snapshot_observed_at":"2026-08-03T08:50:52.967769Z","title":"and Koller, D","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.16249","last_updated":"2026-07-26T13:13:41Z","snapshot_observed_at":"2026-08-07T10:25:26.061623Z","submitted_at":"2026-01-22T18:08:31Z","title":"Ordering-based Causal Discovery via Generalized Score Matching","version":3},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-03T08:50:52.967769Z"},"links":{"cited_paper":"/paper/1207.1429","citing_paper":"/paper/2601.16249"},"observation_digest":"sha256:e699b8834f3988db2ed7e443d971a8957f03b84a1331c7f57f47ab33c6a48f87","observation_id":"38384414-89ab-4fbd-bbb3-f27b48a74544","resolution":{"observed_at":"2026-08-03T08:50:52.967769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1207.1429/citation-record","integrity":"/paper/1207.1429/integrity","json":"/paper/1207.1429/citation-record.json","paper":"/paper/1207.1429"},"outbound":[],"paper":{"arxiv_id":"1207.1429","last_updated":"2012-07-04T16:31:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T00:54:21.220405Z","submitted_at":"2012-07-04T16:31:04Z","title":"Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1207.1429."}