{"as_of":"2026-08-14T18:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:44ebfeb124ac36dd913f1307d333e6b868f6cbb0d123f524cdc65c5e9ff25321","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:33:31.416678Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-08T16:26:27.430214Z","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-08T16:26:27.703130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"cited_work":{"arxiv_id":"2412.10039","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.10039","snapshot_observed_at":"2026-08-08T16:26:27.703130Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","venue":"stat.ME","work_id":"1a007c5f-078d-4d42-bba0-f8afbdb6c7b2","year":2024},"citing_paper":{"arxiv_id":"2502.06232","last_updated":"2025-02-12T10:21:54Z","snapshot_observed_at":"2026-08-09T14:49:24.892070Z","submitted_at":"2025-02-10T08:07:23Z","title":"Score-Based Causal Discovery with Temporal Background Information","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T16:26:27.430214Z"},"links":{"cited_paper":"/paper/2412.10039","citing_paper":"/paper/2502.06232"},"observation_digest":"sha256:a852bff8f4e3a11243d90857fc4cc511da4994160bc6053250569552816b18c2","observation_id":"bc7026c1-67ad-47e0-b776-78f0aba2f149","resolution":{"observed_at":"2026-08-08T16:26:27.707247Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.10039/citation-record","integrity":"/paper/2412.10039/integrity","json":"/paper/2412.10039/citation-record.json","paper":"/paper/2412.10039"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1515/sagmb-2013-0017","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.450906Z","title":"Comparison of statistical methods for finding network motifs","venue":null,"work_id":"9d4424c3-445f-406e-bd1e-1e4ef252b51f","year":2014},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.902067Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:5e3940c22d1cd7de2dbb543036c998dbb0cee5f6bc1ea4a477c7565cdfed9807","observation_id":"fe601a61-5e11-45e6-b309-d833e947f420","resolution":{"observed_at":"2026-08-11T16:33:31.547621Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.743214Z","title":"Learning high-dimensional directed acyclic graphs with mixed data-types","venue":null,"work_id":"c0afd452-1bd7-4da1-a0af-dee552b94ae6","year":2019},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.956897Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:6e03cf68b2106200895d4e7e311bee66fa75964d047fa6c9720ada8fcf548e87","observation_id":"73db47d9-f913-4ced-9cc4-046b3e0fc8a3","resolution":{"observed_at":"2026-08-11T16:33:32.816923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.604920Z","title":"Fast scalable and accurate discovery of dags using the best order score search and grow shrink trees","venue":null,"work_id":"7cb6513e-1ca6-4ee6-9f7d-c1820a97fe28","year":2023},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.960980Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:10a3b9d9ae9191306ca7a8c5abaab3dc4974793418bc331c1dad506b9ad63a5c","observation_id":"751ef67b-0e77-4585-9cbb-e48f24b77969","resolution":{"observed_at":"2026-08-11T16:33:32.645978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19503","last_updated":"2024-06-27T19:36:26Z","snapshot_observed_at":"2026-08-12T23:33:18.976954Z","submitted_at":"2024-06-27T19:36:26Z","title":"Improving Finite Sample Performance of Causal Discovery by Exploiting Temporal Structure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19503","snapshot_observed_at":"2026-08-11T16:33:30.965374Z","title":"Improving finite sample performance of causal discovery by exploiting temporal structure","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.965374Z"},"links":{"cited_paper":"/paper/2406.19503","citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:b7a0b8d694ff13a8e592541e0b45ed64ac13200f1da3c0064ee62b22f039e3ee","observation_id":"f5e658b4-b3a2-4a2d-9c9f-bc17d3107481","resolution":{"observed_at":"2026-08-11T16:33:30.965374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.593677Z","title":"Tuning causal discovery algorithms","venue":null,"work_id":"22840ae5-708a-4b90-9b24-b6c8f1940e3f","year":2020},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.971029Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:78709d4121fba2de22e347fe3a9370f033b25c1ded2b1ebc48ed4e486e1eb4d0","observation_id":"54b2564f-327c-42d5-aeb3-a8ccadae4517","resolution":{"observed_at":"2026-08-11T16:33:32.597545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:30.976249Z","title":"Optimal structure identification with greedy search","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.976249Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:748945801e746a010d63194565ac73ca10d9b3cb45735439a358b82a08b2060c","observation_id":"08814538-dc5d-4540-bcb2-f2098694a6fe","resolution":{"observed_at":"2026-08-11T16:33:30.976249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09565","last_updated":"2024-12-19T13:27:40Z","snapshot_observed_at":"2026-08-14T00:10:08.117682Z","submitted_at":"2023-05-16T16:02:18Z","title":"Toward Falsifying Causal Graphs Using a Permutation-Based Test","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.09565","snapshot_observed_at":"2026-08-11T16:33:30.980277Z","title":"Toward falsifying causal graphs using a permutation-based test","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.980277Z"},"links":{"cited_paper":"/paper/2305.09565","citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:804ded73b2926c9bf0a1680ded1abf33395d91f45416fe2e198c02518c7f4d7d","observation_id":"6eefeffa-d111-4ed1-b186-df383bc8373c","resolution":{"observed_at":"2026-08-11T16:33:30.980277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.572805Z","title":"The case for evaluating causal models using interventional measures and empirical data","venue":null,"work_id":"8c298a14-c333-411f-be39-a3a986b74be7","year":2019},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.984730Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:b3abfb88e98d1545f3524063b5dd1dfb446caa9e5ad3c003d323c3dc0eb7c42a","observation_id":"8549fee6-b311-4431-be65-42cf9acbe03e","resolution":{"observed_at":"2026-08-11T16:33:32.577710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.558536Z","title":"Can algorithms replace expert knowledge for causal inference? a case study on novice use of causal discovery","venue":null,"work_id":"ed427f3f-7317-4cd1-859b-9446c6fde4f3","year":2024},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.990002Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:b1529616ec8e491a2b4f34b0d6c893a240eb03654123ab59de1c7a5daa55cd81","observation_id":"ac5cdece-6d67-459d-bb6a-843f59a2738e","resolution":{"observed_at":"2026-08-11T16:33:32.563997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.441228Z","title":"Adjustment identification distance: A gadjid for causal structure learning","venue":null,"work_id":"b56ce980-7c23-4598-ab3a-dcf42d2ab739","year":2024},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.994453Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:0a46b77d46b857b35ceeaee8dcf8e91fcb64bfafaadd6abdd1822d13334bf1d1","observation_id":"5a8929c8-e81f-462d-8d45-3b1248bab1be","resolution":{"observed_at":"2026-08-11T16:33:32.495656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.428793Z","title":"The (mis) use of overlap of confidence intervals to assess effect modification","venue":null,"work_id":"b213fef0-5ebc-4a7e-9959-944e3c2383c7","year":2011},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:30.998408Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:60541d47c08ffa6854e960a2275236f4002982799ed2b33f587a165c7f4e2e48","observation_id":"b43ddc80-2f01-4bb8-aa45-301d58d25362","resolution":{"observed_at":"2026-08-11T16:33:32.433149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.416141Z","title":"Gradient-based neural dag learning","venue":null,"work_id":"569c5ddf-1a0e-4bd3-a4cd-e726e727adf1","year":2020},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.002761Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:e3b6f0feb21794c3ce33fbf6848aa42f7c09a51e3098534af31c41cf43ef8f95","observation_id":"56e12bba-1d72-4a15-9845-e02e16c8d5c4","resolution":{"observed_at":"2026-08-11T16:33:32.420280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.402858Z","title":"Greedy relaxations of the sparsest permutation algorithm","venue":null,"work_id":"67af1e04-ebb4-4f34-877e-00b3d8506395","year":2022},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.069090Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:17c1a34c2110d3471d7462bdec8beef1bea2c0263052658c76822c79d8ef9c36","observation_id":"44f18399-c50e-4687-9dea-5f0e47f7d42a","resolution":{"observed_at":"2026-08-11T16:33:32.407410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04697","last_updated":"2020-06-08T15:53:20Z","snapshot_observed_at":"2026-08-13T04:42:28.385668Z","submitted_at":"2020-06-08T15:53:20Z","title":"Supervised Whole DAG Causal Discovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04697","snapshot_observed_at":"2026-08-11T16:33:31.140836Z","title":"Supervised whole dag causal discovery","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.140836Z"},"links":{"cited_paper":"/paper/2006.04697","citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:8d8eadbcee06b5e60e2bea99ad863532ead86d43aa6d44bb7847df10452e0793","observation_id":"d7977c7c-8b19-47f6-9ecf-197f16810372","resolution":{"observed_at":"2026-08-11T16:33:31.140836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.237862Z","title":"SID: Structural Intervention Distance, 2023","venue":null,"work_id":"48e4d03d-2635-4957-8cef-ad4f33db776e","year":2023},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.145075Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:5b8b88c2b203c46cd12341bf9019e7ab4fca9905f70a3b56d5be5c8eb5e010c3","observation_id":"d1d4fbb5-e08a-4a53-b808-637d5e390d76","resolution":{"observed_at":"2026-08-11T16:33:32.310289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.148925Z","title":"Structural intervention distance for evaluating causal graphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.148925Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:bcce55d7f65e9480a23bcb4e0941ad98dc32dd07e95bc42060d6f4edc327bd36","observation_id":"f284d773-6b23-4211-9380-203283910aca","resolution":{"observed_at":"2026-08-11T16:33:31.148925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.216736Z","title":"Data-driven model building for life-course epidemiology","venue":null,"work_id":"d3cceee1-7000-40dc-ae03-1e83e4c2b180","year":1907},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.152696Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:0bf663878ae5e386510a5641cbf757b2472d89fe270aa525a35e5d527e6722df","observation_id":"1b35d1d8-81d5-463e-aab9-f79d435a0368","resolution":{"observed_at":"2026-08-11T16:33:32.220992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.203314Z","title":"causalDisco: Tools for Causal Discovery on Observational Data, 2022","venue":null,"work_id":"ac87bd45-3c73-4e40-b901-e43d9c69cd2e","year":2022},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.157661Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:28169dc3e0b2406520b8ee55ef19551feb82deda6516cafe539509792f88ec79","observation_id":"ab7dd7ac-d9a6-4d1d-b1ea-5450873619e5","resolution":{"observed_at":"2026-08-11T16:33:32.208266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.189564Z","title":"Constructing causal life-course models: Comparative study of data-driven and theory-driven approaches","venue":null,"work_id":"a254c6a1-6a1d-42a0-992b-1577499a5088","year":1917},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.162292Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:fee4bb5e9be98c770ce7cb9e7736cb3f328086943618a4ddad54a2c405ee8cdf","observation_id":"67e76126-9913-47e1-bbf2-a40ec7ad9ae3","resolution":{"observed_at":"2026-08-11T16:33:32.194549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:32.094430Z","title":"Causal discovery for observational sciences using supervised machine learning","venue":null,"work_id":"6738940c-bd4b-4eca-8d48-fc9e4a6c438f","year":2023},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.166646Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:4ccd600c86b2ea0e2c75ef70b8228d25c5d0fc54f1f277d864eeca0c925fbb85","observation_id":"0fbcac51-11c7-4943-b693-d392ed0d6171","resolution":{"observed_at":"2026-08-11T16:33:32.181004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.919137Z","title":"Tetrad—a toolbox for causal discovery","venue":null,"work_id":"f3357123-7685-4e76-a4db-6e19743fd243","year":2018},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.170897Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:f501d38677e15ac0fa5130a6b534477cadbae121c33de3d9b4d3e25c4341751c","observation_id":"9de5d3ce-e995-40b0-865d-4af83bf77274","resolution":{"observed_at":"2026-08-11T16:33:31.994204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.175286Z","title":"Causal protein-signaling networks derived from multiparameter single-cell data","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.175286Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:4cfe3eff1284bf577761dc33add32f9fb2dd57395059d158fc397589c59ac0d3","observation_id":"51c94605-5d15-4fbb-9c27-091fd3375e13","resolution":{"observed_at":"2026-08-11T16:33:31.175286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.226207Z","title":"A linear non-gaussian acyclic model for causal discovery","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.226207Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:2621d6c42937786df876f5172cfc255087088d56f6db79c35e2d801833d9eb4d","observation_id":"89643f5d-4e33-4682-9652-9e75c0f60fce","resolution":{"observed_at":"2026-08-11T16:33:31.226207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.305533Z","title":"An algorithm for fast recovery of sparse causal graphs","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.305533Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:3c35237c211b99face0b095c2ca6a52d4166aca36a68408ef1193ce71ee11cdb","observation_id":"baef92f3-0a86-487a-9553-fba6b3c8c983","resolution":{"observed_at":"2026-08-11T16:33:31.305533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.395521Z","title":"Causation, prediction, and search","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.395521Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:8f3cb4c192f9c843246a76d63482bcdb67efcce245f06bf85737f0bc6454ef18","observation_id":"34afdc1a-abf2-4cd4-af1f-8d7dbbc39b19","resolution":{"observed_at":"2026-08-11T16:33:31.395521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.399236Z","title":"The max-min hill-climbing bayesian network structure learning algorithm","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.399236Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:c3ba569a1ad9bab5551db681fda28ac54c78211f547b1517a70f7a8e1e1716e0","observation_id":"e69bcacb-85ae-4484-a95f-b6587873cb4c","resolution":{"observed_at":"2026-08-11T16:33:31.399236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.864376Z","title":"Separation-based distance measures for causal graphs","venue":null,"work_id":"273a6ecc-f1b5-4c2b-b34f-661837964019","year":2025},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.403293Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:363484f47cb882f4f744dced022652892f1a1bc57e3976aecd1822a79309c03a","observation_id":"dc21edcc-e96d-4f07-b184-26fc24a4e38a","resolution":{"observed_at":"2026-08-11T16:33:31.868768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.850527Z","title":"Causal structure learning with one-dimensional convolutional neural networks","venue":null,"work_id":"52971da0-c7f3-4b12-bcd3-af598f44fbb7","year":2021},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.407154Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:1d94a7d59aa8d6e530ef0d38128d34ec56858e4bbf0955e56ba21dbccd1f3ec3","observation_id":"aa7576a3-ed6d-484d-ae56-6435c356c820","resolution":{"observed_at":"2026-08-11T16:33:31.855929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.700220Z","title":"Dag-gnn: Dag structure learning with graph neural networks","venue":null,"work_id":"23030bd1-2498-4a5a-84f5-788428fe39f5","year":2019},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.411387Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:7d130e1bcf5233c6b65f6e3541c267a31b6534c42d277eabf282933d4714db0e","observation_id":"c3720b27-6984-48a5-be34-d40af180deb8","resolution":{"observed_at":"2026-08-11T16:33:31.783482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:31.416678Z","title":"Dags with no tears: Continuous optimization for structure learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T16:33:31.416678Z"},"links":{"citing_paper":"/paper/2412.10039"},"observation_digest":"sha256:572ddbc7a7b0c9b1a7b521fcfeb1e56db69f214329bf26f111025e8b8034b81f","observation_id":"b4e200b5-5bef-48bd-a4e6-0516dd94d65b","resolution":{"observed_at":"2026-08-11T16:33:31.416678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.10039","last_updated":"2025-06-12T10:20:38Z","latest_version":2,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-11T16:22:42.387443Z","submitted_at":"2024-12-13T11:00:26Z","title":"Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":30},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2412.10039."}