{"as_of":"2026-08-11T18:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a614a39a0090853e7bf017ea0506e79497c1ee80eab63b954e8e9f9ca11c6dc9","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:16:23.971894Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.19578/citation-record","integrity":"/paper/2412.19578/integrity","json":"/paper/2412.19578/citation-record.json","paper":"/paper/2412.19578"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.720283Z","title":"’virus and epidemic’: Causal knowledge activates prediction error circuitry,","venue":null,"work_id":"b5cf2a84-af3e-45ec-ab4a-9589be0eea81","year":2010},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.752601Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:738ef73ab2325a1ad0b0fd3a1c45bf23873de8bb4d099dc980dbb3e443739a88","observation_id":"3a3a2549-fe46-41d2-a711-f113477c7620","resolution":{"observed_at":"2026-08-11T00:16:24.725511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1911.10500","last_updated":"2019-12-23T16:20:53Z","snapshot_observed_at":"2026-08-11T15:41:29.745802Z","submitted_at":"2019-11-24T11:04:56Z","title":"Causality for Machine Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.10500","snapshot_observed_at":"2026-08-11T00:16:23.758183Z","title":"Causality for machine learning,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.758183Z"},"links":{"cited_paper":"/paper/1911.10500","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:a7642c1502db34a481b3292ca1ccd95f4816f0283f0829bd2c19753dc8bcba43","observation_id":"ff955741-3309-44b1-b9e1-f731c2592a0e","resolution":{"observed_at":"2026-08-11T00:16:23.758183Z","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-11T00:16:24.704413Z","title":"From correlation to causation networks: a simple approximate learning algorithm and its application to high-dimensional plant gene expression data,","venue":null,"work_id":"6e18cf6d-0e46-469b-aca1-c40eee75e5ef","year":2007},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.763602Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:21632728cab698a9192ce2d8b5cd47b6c825f1820af7345e8396f73fa0dfa015","observation_id":"c8541e12-0dbc-4d63-866b-0ed72ad9b053","resolution":{"observed_at":"2026-08-11T00:16:24.709101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.675716Z","title":"Learning bayesian networks is np-complete,","venue":null,"work_id":"cfc6294d-3fda-4b05-8da8-25ebb688dbb7","year":1995},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.773730Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:e5e7cfda4037e59641fda4d57fa3ab92bf530020d1175f44b1bfd8f2b4eb5850","observation_id":"8c4a33a6-91c8-48a5-9e08-398dda95d2bc","resolution":{"observed_at":"2026-08-11T00:16:24.680419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.659768Z","title":"Causal discovery with reinforcement learning,","venue":null,"work_id":"254919b8-b2eb-4b3c-8ddf-1f34e5ce4a07","year":2020},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.778167Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:72c88bae463384ab35b2d9cac5b60c39bf04b2e912b79d49bb40a1e8baa334cc","observation_id":"1b896bf6-d886-47a0-bcdb-b22fd0ac4db3","resolution":{"observed_at":"2026-08-11T00:16:24.665410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.644271Z","title":"Estimating the Dimension of a Model,","venue":null,"work_id":"a4ce3e60-8c78-410c-ae2e-a9a47303a903","year":1978},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.783225Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:f858f860cbbb7d372a5c2e5712568ca393ac67dccc1c7f0e340edf405bd70da8","observation_id":"9371cffc-bcf2-452d-91f5-64dcaf609c99","resolution":{"observed_at":"2026-08-11T00:16:24.649157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:23.787518Z","title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.787518Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:3ce1976a9ffc0a6168f420b1471594a95b3b596ccbb26aa02c36e3469d9b58b2","observation_id":"febd5bc0-497b-4bfc-9543-2341586f2a86","resolution":{"observed_at":"2026-08-11T00:16:23.787518Z","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-11T00:16:24.618185Z","title":"Policy gradient methods for reinforcement learning with function approxima- tion,","venue":null,"work_id":"51fddd43-2ff1-42d0-a337-2fa1e253e8cc","year":1999},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.791547Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:6afb0df2fd348c2e7239ed1dfa2e79c3712384cf50fadd39dd7bb403272d39d3","observation_id":"52fcbfc4-dfbe-4116-be2f-c41d1f31ad12","resolution":{"observed_at":"2026-08-11T00:16:24.623325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.603096Z","title":"Trust region policy optimization,","venue":null,"work_id":"894d6d37-fccd-4246-ab61-2004904c4a0f","year":2015},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.795650Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:9f09176267f65938c96ad3008d966fc3625cb4ee9ac6df5cce632cb8f40e5bdc","observation_id":"45ad2c72-b893-4585-8bdc-0b7879068ebd","resolution":{"observed_at":"2026-08-11T00:16:24.607836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-11T00:16:23.799849Z","title":"Proximal policy optimization algorithms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.799849Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:ccaf0e728ef5bec1cdd0c36089cb7194aaa444cd8c2ae9015da2b6f03792ff7b","observation_id":"8c17b5e1-f94a-4102-b573-00f3be016a21","resolution":{"observed_at":"2026-08-11T00:16:23.799849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-11T00:16:23.804436Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.804436Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:8e7d1cd9e7722a7f738eccbe6a345c51f6db21bb6c2fd5bc617992112b2d369b","observation_id":"184215e8-a1fe-4b89-bc9b-cde8757cdc05","resolution":{"observed_at":"2026-08-11T00:16:23.804436Z","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-11T00:16:24.587554Z","title":"Approximating discrete probability distri- butions with dependence trees,","venue":null,"work_id":"965af0b8-a543-4bbb-a262-13ee9f182d2d","year":1968},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.809326Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:285806551f15e6dd757187d4175b4b96bf9028d3c22055d2d8c1d31c6d3e1942","observation_id":"e6086f89-8ebf-4d1b-b1a5-6b4ff46dc59f","resolution":{"observed_at":"2026-08-11T00:16:24.592433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.571950Z","title":"The max-min hill- climbing bayesian network structure learning algorithm,","venue":null,"work_id":"f8c57ec0-0a57-4e99-9397-624723697217","year":2006},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.813672Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:89c5c94b5815333fdc062efaad24a0c59b556d0fda7ae91cf8a5178150733a38","observation_id":"fb9157af-2389-48e6-9988-c8615c6d072e","resolution":{"observed_at":"2026-08-11T00:16:24.577328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.556243Z","title":"Dags with NO TEARS: continuous optimization for structure learning,","venue":null,"work_id":"f09fc0aa-24b2-43de-9075-949ff344b259","year":2018},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.817889Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:379f19e4fa80077f3abc658863188925bbd2bff380e2801429d9b7ae955db064","observation_id":"56705c56-326f-447a-9fce-736049671ca8","resolution":{"observed_at":"2026-08-11T00:16:24.561268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.541518Z","title":"Generalized score functions for causal discovery,","venue":null,"work_id":"7045137e-ff93-483b-bf90-d52fba18e18c","year":2018},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.821978Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:eca48aa17b878442797bb00e7782bc65e5979ff19a4509316b6416ef47b04f0e","observation_id":"2edb3afa-cd42-42fb-ab5d-63000d4ea8ae","resolution":{"observed_at":"2026-08-11T00:16:24.546004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.526425Z","title":"Causal discovery with continuous additive noise models,","venue":null,"work_id":"4cee812a-c921-43a6-a7d3-d3b6755937d9","year":2009},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.826339Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:7e09ce36540106b7b186015efef16f97adc47891e1369281a9cdfb9a5299cf71","observation_id":"0eb3bfb3-03a4-4702-91bd-6a9c8432d952","resolution":{"observed_at":"2026-08-11T00:16:24.531048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.509842Z","title":"A machine learning approach to classify pedestrians’ event based on imu and gps,","venue":null,"work_id":"4a4d5657-9604-4f13-b46d-e23475284b13","year":2019},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.830523Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:1150a70942882b72751b3ab0fa2bd080af2cd804b4d0b871d3b8fbc6c1be60e7","observation_id":"6722d0b7-3f4a-4547-9fca-4b095dc4e057","resolution":{"observed_at":"2026-08-11T00:16:24.515118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.495083Z","title":"Deep learning versus traditional solutions for group trajectory outliers,","venue":null,"work_id":"2954af47-aa69-4575-849d-d0e50256218b","year":2020},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.834431Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:b2b24d70440c71253497b11925a13edf3b3cc68be0297ec9dfe3c93071e94165","observation_id":"59d5b341-eccd-428b-b1a4-bedb5059e479","resolution":{"observed_at":"2026-08-11T00:16:24.499683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.480944Z","title":"Iterative feedback and learning control. servo systems applications,","venue":null,"work_id":"1b726c71-5213-462b-a058-89215927d3a5","year":2007},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.838574Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:df9ee06fb7f2132b370a032757a1d8790d57f0cf7b96362803523cdfa8d3a8ff","observation_id":"3cb29365-e3df-43ec-84c6-f0e78576ddb2","resolution":{"observed_at":"2026-08-11T00:16:24.485467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.465247Z","title":"Adaptive ekf-based vehicle state estimation with online assessment of local observability,","venue":null,"work_id":"88c6c0f5-ac67-4c8d-ba18-1d34332827c7","year":2016},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.843198Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:2826c2d62560a3069169d31d8fb1189da029564c69be0a2e37b773b846786c30","observation_id":"e9db1719-3ca3-495b-a130-1d0e5326fa47","resolution":{"observed_at":"2026-08-11T00:16:24.470724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.449073Z","title":"Learning functional causal models with generative neural networks,","venue":null,"work_id":"cfeb3cb3-16ad-48f7-bb1b-9558a2ae6b4c","year":2017},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.847636Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:1b11a76b878cf0cee8d8047a5fd0c7f4b07e01f760fd5ac6af250f5368182c19","observation_id":"e89725c7-e918-4c75-a222-980e875ec994","resolution":{"observed_at":"2026-08-11T00:16:24.454424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.433054Z","title":"Structural Agnostic Modeling: Adversarial Learning of Causal Graphs,","venue":null,"work_id":"b0c442e6-f082-4300-8d1d-aacf7a67fae5","year":2018},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.851940Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:a00dcf227e55419b5c80ea922788a1642138457b5a57e613ad60f949856b5067","observation_id":"1c418afc-5b1b-461c-9e96-ac40a2a536df","resolution":{"observed_at":"2026-08-11T00:16:24.438071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.417354Z","title":"DAG-GNN: DAG structure learning with graph neural networks,","venue":null,"work_id":"daebd252-9dcf-4ea8-bbd5-c3586bf50c1d","year":2019},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.856592Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:d61ff0e2d9b96450e3d020f722f4e5e88b4f760b214e18233c68352c2c3f8cc2","observation_id":"e9b72fbe-e06e-449c-8128-b9d876458032","resolution":{"observed_at":"2026-08-11T00:16:24.422505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.401534Z","title":"A new model for learning in graph domains,","venue":null,"work_id":"61832fa1-c4f2-4145-bdba-c7f8aff25b4a","year":2005},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.860901Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:1eeb085465df787bb5c378d937065f8666ee4c222adcef2a87e439a1c1569858","observation_id":"0f473df5-fa80-4f7f-b040-65900fe8814a","resolution":{"observed_at":"2026-08-11T00:16:24.406715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.385405Z","title":"The graph neural network model,","venue":null,"work_id":"515838a3-2a1b-4135-8e2a-6d1115f6d216","year":2009},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.865491Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:6905a4cbcd6d3dfc10545b5d5059ee71be5ed88c41d429072b042bbf9e86bb6a","observation_id":"609e598e-6526-44aa-aff5-e6f6b2b2edb2","resolution":{"observed_at":"2026-08-11T00:16:24.391107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05467","last_updated":"2023-12-01T08:37:27Z","snapshot_observed_at":"2026-08-02T21:31:41.024748Z","submitted_at":"2019-11-07T06:30:47Z","title":"ChebNet: Efficient and Stable Constructions of Deep Neural Networks with Rectified Power Units via Chebyshev Approximations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05467","snapshot_observed_at":"2026-08-11T00:16:23.869935Z","title":"Chebnet: Efficient and stable constructions of deep neural networks with rectified power units using chebyshev approximations,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.869935Z"},"links":{"cited_paper":"/paper/1911.05467","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:f6652e4f0a01944be5a44b7cbbace4d301f2f0c4d512bf30a76a69c0cd03a8f0","observation_id":"cdb8993d-0427-4a39-9310-7688354fd097","resolution":{"observed_at":"2026-08-11T00:16:23.869935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.02216","last_updated":"2018-09-10T14:26:58Z","snapshot_observed_at":"2026-08-10T12:30:48.918405Z","submitted_at":"2017-06-07T14:51:05Z","title":"Inductive Representation Learning on Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02216","snapshot_observed_at":"2026-08-11T00:16:23.874792Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.874792Z"},"links":{"cited_paper":"/paper/1706.02216","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:373a25b9c07526c2c54333c5587ab28dbc24434723d42d1417faf984c848c42e","observation_id":"ea85c78e-b1f0-48e1-a9fc-850a0fb285df","resolution":{"observed_at":"2026-08-11T00:16:23.874792Z","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-11T00:16:23.880027Z","title":"Deep reinforcement learning for multiagent systems: A review of challenges, solutions, and applications,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.880027Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:48cef98e9096a7ea8155ca247ee2d3d7bd9cb0065ab6f5adbf83fe398b59518c","observation_id":"f56e34bf-35e4-4d1b-abc5-b1e6c98e4e45","resolution":{"observed_at":"2026-08-11T00:16:23.880027Z","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-11T00:16:24.359141Z","title":"Survey of model-based reinforce- ment learning: Applications on robotics,","venue":null,"work_id":"bb363693-319d-4c13-a68f-687fe3285427","year":2017},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.884511Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:392befd72f93664bc2ade4540cd64ffa28d9cf1566f7630713276d75eb43cc57","observation_id":"8b7a1b97-585c-4403-a955-c9ca5c932d3d","resolution":{"observed_at":"2026-08-11T00:16:24.364116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.343675Z","title":"Online rein- forcement learning control for the personalization of a robotic knee prosthesis,","venue":null,"work_id":"1ce30636-c843-46a4-936c-2171c651cd22","year":2020},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.888893Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:abf0a79c9c56ff62f93e24ff9b29b462c12c4fa9b11268fc78b3d14f55762eff","observation_id":"5339c8af-fe21-4e11-b91d-bfb4bec52064","resolution":{"observed_at":"2026-08-11T00:16:24.348606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.329022Z","title":"Multitask learning for object localization with deep reinforcement learning,","venue":null,"work_id":"74d0c730-a68a-4e02-922f-46eac79057f5","year":2019},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.893408Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:8c063e7a41dfbaee6c908686367765b200bd453cd0447a5d82d48ae0b0f02691","observation_id":"38a35f82-5f20-4d49-89a4-fe5136b40840","resolution":{"observed_at":"2026-08-11T00:16:24.333879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.314835Z","title":"Nonzero-sum game rein- forcement learning for performance optimization in large-scale industrial processes,","venue":null,"work_id":"de9fc1b4-1a87-4940-abce-84a488afa447","year":2020},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.897906Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:b6a65c4ca02bd4fec0216116e6d7a1c200d41eebd82fc3b4cf0225f528316cb5","observation_id":"aee59455-4580-4899-9bc9-b303bbb0aea3","resolution":{"observed_at":"2026-08-11T00:16:24.319281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.300995Z","title":"Neural Architecture Search with Reinforcement Learning,","venue":null,"work_id":"691a4f3e-fdc9-4967-90ec-7a9a4f991aee","year":2016},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.902603Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:e1c4fa88c456543b4f13ea167c81f981fca417f159722cb493fab926ad249faa","observation_id":"f9d4505e-ff9a-4a2f-b33b-b3833940fd93","resolution":{"observed_at":"2026-08-11T00:16:24.305262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.287066Z","title":null,"venue":null,"work_id":"4654c3bd-af87-422d-87e8-366795819468","year":1989},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.907878Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:24287049fbceaaacf46e13f411da54ec3d3020a076121464792de5cab00aa2c9","observation_id":"98a6976b-4d6f-402b-b7b4-c5f14421a943","resolution":{"observed_at":"2026-08-11T00:16:24.291627Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.690360Z","title":"Spirtes, C","venue":null,"work_id":"affc353d-c042-485d-b7da-10168b2734aa","year":2000},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.912515Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:4c2b1c0d3177d5539ae6fb566042bdcb30a7400085ed9d57a9be59e0daaddbef","observation_id":"a76beb80-dfa6-4983-8d2f-702bdaa43b3d","resolution":{"observed_at":"2026-08-11T00:16:24.694556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.272152Z","title":"A linear non-gaussian acyclic model for causal discovery,","venue":null,"work_id":"fa82712b-abb0-44ae-bbbb-145df784eab4","year":2003},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.917531Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:32eaabc57c97bfb97ce28169f0be90ede1093263a963d286ed83acaee3dd9c82","observation_id":"13e7c7cf-7f9d-41bd-b1b5-e513c31f0021","resolution":{"observed_at":"2026-08-11T00:16:24.276812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.257922Z","title":"On the Prop- erties of Neural Machine Translation: Encoder-Decoder Approaches,","venue":null,"work_id":"7ae72f66-4746-4c41-aae1-d3f7b5c87c8b","year":2014},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.922413Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:e7160d9e3605617f60b2a1c20dc6d09c492872cc408267abb736b7d97f2bd01b","observation_id":"5d600eda-9ff7-4f28-b96d-24d767b2cd0e","resolution":{"observed_at":"2026-08-11T00:16:24.262464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.243531Z","title":"Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyond,","venue":null,"work_id":"8e923387-4163-42d2-85b0-1c200e936a12","year":2016},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.927112Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:70fbc2e8c21d6d485f1e10e9bce4c5392068e124c6d2ffd856ff285e0824cf2f","observation_id":"98d03a7e-f24b-4d1a-87ae-58060d2c65ff","resolution":{"observed_at":"2026-08-11T00:16:24.248028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.228467Z","title":"Function optimization using connectionist reinforcement learning algorithms,","venue":null,"work_id":"8625b156-1365-4955-a289-378234944e60","year":1991},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.931745Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:bc3caebe351c89068d249647c30e64529bbbb6ea41002355d8b66e1f6e54e35e","observation_id":"de8ac5a4-6dd7-4a42-b845-f7f3a4f9eb4f","resolution":{"observed_at":"2026-08-11T00:16:24.233241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.212211Z","title":"Prioritized Experience Replay,","venue":null,"work_id":"e40ad45d-99a6-4b52-8c36-897f31815fa3","year":2015},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.935842Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:b008e893f1eaf0731078b49a849e3134f9eb58320a28db7e0a063004aab63d73","observation_id":"d7a64fa6-b5cb-4c63-8a72-3d9c215496fd","resolution":{"observed_at":"2026-08-11T00:16:24.217630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1811.02553","last_updated":"2020-05-25T16:24:26Z","snapshot_observed_at":"2026-08-11T02:16:51.471401Z","submitted_at":"2018-11-06T18:54:21Z","title":"A Closer Look at Deep Policy Gradients","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.02553","snapshot_observed_at":"2026-08-11T00:16:23.939980Z","title":"Are deep policy gradient algorithms truly policy gradient algorithms?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.939980Z"},"links":{"cited_paper":"/paper/1811.02553","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:30bf154da2642c2b63c1063127e1b3aaeb4cc428ff33252d277d88dab714a9e1","observation_id":"02c310d8-ef51-42ea-8c21-7bb9d3055930","resolution":{"observed_at":"2026-08-11T00:16:23.939980Z","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-11T00:16:24.195355Z","title":"Ramsey, M","venue":null,"work_id":"f441d2c8-18c7-4821-86b8-52f13f5bb952","year":2017},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.944847Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:0e733ee4afef30687f1c952173580bf2a0189fa607aec26127695f49f2ac0f5c","observation_id":"b2eb6b1b-3ba7-47a6-9d6d-2b4ae0450792","resolution":{"observed_at":"2026-08-11T00:16:24.200418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1310.1533","last_updated":"2014-12-01T12:31:45Z","snapshot_observed_at":"2026-08-05T01:55:03.450710Z","submitted_at":"2013-10-06T03:12:34Z","title":"CAM: Causal additive models, high-dimensional order search and penalized regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.1533","snapshot_observed_at":"2026-08-11T00:16:23.949439Z","title":"CAM: causal additive models, high-dimensional order search and penalized regression,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.949439Z"},"links":{"cited_paper":"/paper/1310.1533","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:ac34de56eedbba7bf91efd5bb392ddc7845e5f273a17cf80ab4ccd6fce7b54f4","observation_id":"5ebf8539-b350-4a29-965e-01deff009540","resolution":{"observed_at":"2026-08-11T00:16:23.949439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.02226","last_updated":"2020-02-18T14:49:33Z","snapshot_observed_at":"2026-08-07T11:29:29.522039Z","submitted_at":"2019-06-05T18:09:55Z","title":"Gradient-Based Neural DAG Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.02226","snapshot_observed_at":"2026-08-11T00:16:23.954516Z","title":"Gradient- based neural DAG learning,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.954516Z"},"links":{"cited_paper":"/paper/1906.02226","citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:67961b059f546102aaba3075c5e686271d7ec5d28e77aa5e13755764a71e944f","observation_id":"97fad022-e43c-4b5c-8b24-1cbe66d64b81","resolution":{"observed_at":"2026-08-11T00:16:23.954516Z","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-11T00:16:24.179352Z","title":"Causal Protein-Signaling Networks Derived from Multiparam- eter Single-Cell Data,","venue":null,"work_id":"e180f379-5246-4766-a46e-beda5dcbb96b","year":2005},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.959228Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:a83c2fe991c1e77b252ef3842eacf8a8880d3ab622de942e1da2b513e9d79c08","observation_id":"8b2f416f-b4b3-42a9-861f-8425f32f40f5","resolution":{"observed_at":"2026-08-11T00:16:24.184311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.163542Z","title":"Syntren: a generator of synthetic gene expression data for design and analysis of structure learning algorithms,","venue":null,"work_id":"34ae2896-9da0-4941-8897-c3dd3be94a49","year":2006},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.963624Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:441636a1be9d242642f30fd98c5f8e925a8593c8b4faaff5c60d4c62044e0901","observation_id":"0f88161c-039b-4e44-aea1-4696ba564556","resolution":{"observed_at":"2026-08-11T00:16:24.168558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.147507Z","title":"Truly proximal policy optimization,","venue":null,"work_id":"1b7ac4fc-1bef-4126-bbba-bb716d288ea9","year":2019},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.967896Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:66f14ca3bd35a043f53e4470e24c50388e11e9546e14bcd20e6d6e48bdf107ae","observation_id":"24123bbd-aeaa-45af-9ae8-15a5b36f1df0","resolution":{"observed_at":"2026-08-11T00:16:24.153034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:24.129600Z","title":"A hybrid method for nonlinear equations,","venue":null,"work_id":"32314805-d031-4cc9-8f9a-000b780f3cae","year":1970},"citing_paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:23.971894Z"},"links":{"citing_paper":"/paper/2412.19578"},"observation_digest":"sha256:8bc3c238bbe6ab46e6a3a352684e34b86392d51bc17a17c8c52253464c965393","observation_id":"5991fe42-5bed-484d-80b2-56666ca8adec","resolution":{"observed_at":"2026-08-11T00:16:24.136319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2412.19578","last_updated":"2024-12-27T10:50:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T00:09:14.338012Z","submitted_at":"2024-12-27T10:50:43Z","title":"Graph-attention-based Casual Discovery with Trust Region-navigated Clipping Policy Optimization"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":48},"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 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2412.19578."}