{"as_of":"2026-08-08T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:585e7f687db623070e80b1c4432c473843f855e15527364828fa1f022e133b5d","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T12:14:51.003347Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2606.06908/citation-record","integrity":"/paper/2606.06908/integrity","json":"/paper/2606.06908/citation-record.json","paper":"/paper/2606.06908"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:14:45.992282Z","title":"and Dobbs, I","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:45.992282Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:35aa005a54ee10a515f8b5f5d732ca37705da799b3e661b2b77d8ef0354939a4","observation_id":"88d8a26f-7d32-48c5-80a2-3269f00c9777","resolution":{"observed_at":"2026-08-02T12:14:45.992282Z","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-02T12:14:46.087201Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.087201Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:fab59badeb32df3b34f5c20ac44fc34730497816b19b15e2113e60cb5fa13a61","observation_id":"b0ee1eb3-9da7-44ea-9132-89a76bc023d1","resolution":{"observed_at":"2026-08-02T12:14:46.087201Z","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-02T12:14:46.258121Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.258121Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:2f683f404bcefbb5e18958b1acf5ff77b73be32ea128f147131e131fec434f4e","observation_id":"b93576e0-a1f5-41f2-b839-f9dbc73df9ee","resolution":{"observed_at":"2026-08-02T12:14:46.258121Z","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-02T12:14:46.485402Z","title":"and Vandenberghe, L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.485402Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:fc55d203b456a43b7757f83c39a920c33aea2247a55796d780c0fc84ce49b559","observation_id":"2098fbc2-53c7-46e5-98fa-f5fba7d3512a","resolution":{"observed_at":"2026-08-02T12:14:46.485402Z","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-02T12:14:46.646568Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.646568Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:329764c33c82ba1a684ed11bd0d5b170545adaaa564310bd08e644c4adbe1b17","observation_id":"57f48a4d-0dd3-4b9d-be1f-f10ea6391ec8","resolution":{"observed_at":"2026-08-02T12:14:46.646568Z","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-02T12:14:46.732730Z","title":"C., Walker, I., and Glocker, B","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.732730Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:5c2ddbe52a61d64033daa43e15e9e85486223738c76c99bf86070cbd7df3bcfe","observation_id":"2ec40811-aca3-4b64-a457-a36db1659999","resolution":{"observed_at":"2026-08-02T12:14:46.732730Z","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-02T12:14:46.867207Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.867207Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:5934ef6ee6dd3ac5cb01dd7c4cb231de3ed7fb1abf8ef79101472082a7f4234f","observation_id":"cf7cfe79-d245-4444-9dce-595861c7f7cc","resolution":{"observed_at":"2026-08-02T12:14:46.867207Z","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-02T12:14:46.934238Z","title":"and Varadhan, S","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.934238Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:5c41a5864d9bf448ccd3457e91e7a741f3d3ee59a667b069af541a1bbc41f21b","observation_id":"a039d0c7-2103-4940-bf56-6c66a39aeadf","resolution":{"observed_at":"2026-08-02T12:14:46.934238Z","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-02T12:14:46.976951Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:46.976951Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:7d3a38d5bacac45972c23649e7c2cfc214db2138a769f7974e224cb958ccfc4f","observation_id":"9dad21f7-0748-46e0-9117-7912a4aff92b","resolution":{"observed_at":"2026-08-02T12:14:46.976951Z","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-02T12:14:47.038231Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.038231Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:c31026565516addccc2068ef6a47ff071f2e45fa3e324e919af3ef75c9ca78ad","observation_id":"7ef9b854-0447-4683-ae39-41502f8f8d48","resolution":{"observed_at":"2026-08-02T12:14:47.038231Z","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-02T12:14:47.141480Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.141480Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:659f1307b20d35ac18ef6bf02b52ab7dc2f564390b9bffaa9b3aa53cbfd05baf","observation_id":"851e0ff8-f0ea-485a-9f76-593f28d9bcce","resolution":{"observed_at":"2026-08-02T12:14:47.141480Z","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-02T12:14:47.264671Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.264671Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:e30a594b41bf25aa1a8c00af12721a53bf05b634b52129a7d4eefff664f95e34","observation_id":"c2ba2f33-cc95-4d47-af90-6f5feb3506af","resolution":{"observed_at":"2026-08-02T12:14:47.264671Z","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-02T12:14:47.359057Z","title":"and Glowinski, R","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.359057Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:893360241798c99cffa6c97a16d8d48a3c499a7da57460428b0560fc03c3f535","observation_id":"bd0d8b05-691a-4c3c-ad24-3661f71b766d","resolution":{"observed_at":"2026-08-02T12:14:47.359057Z","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-02T12:14:47.450805Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.450805Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:0109ba3d1c88cfaa1be247ba7da40de30844a6fbdf21cd4561c96d22266b83c4","observation_id":"734a3404-4dd4-4e1b-9511-62ba12fc7e4d","resolution":{"observed_at":"2026-08-02T12:14:47.450805Z","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-02T12:14:47.500959Z","title":"Z., and Cartwright, D","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.500959Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:ae71af95227b38cac793f66ecd05219ffd3ce64dd88b9e0ecf3bc2037dcf6ab6","observation_id":"5a9ed1d4-ff6d-4c1b-92fd-6d1061c25902","resolution":{"observed_at":"2026-08-02T12:14:47.500959Z","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-02T12:14:47.555161Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.555161Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:a8360b6bad845d36433a71c9a347c5a2bbc497f401378f913449168418b8cad3","observation_id":"abb1b424-8dad-4a49-9b95-84952da71c74","resolution":{"observed_at":"2026-08-02T12:14:47.555161Z","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-02T12:14:47.618301Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.618301Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:9c6afed4c8a0a6dcda6cb85cab9bd1372b14fe1b5b85a7aa3c33981911d009e2","observation_id":"fb8e638a-b16b-49db-a480-ff49e3aa9dff","resolution":{"observed_at":"2026-08-02T12:14:47.618301Z","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-02T12:14:47.688173Z","title":"M., Peters, J., and Sch \\\"o lkopf, B","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.688173Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:f942f468ad4b808b31eb5d4e807e2d3b0ea24e60217611a945d5b151bbec17d6","observation_id":"dad63ea2-9e97-4ee7-9f2f-abc231dd369c","resolution":{"observed_at":"2026-08-02T12:14:47.688173Z","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-02T12:14:47.748119Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.748119Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:dde182abbe2e38cbb4e2eac3814c96d7f103db1789e140f4fdf36d9c84ac1ed3","observation_id":"de48d16d-2a96-43af-88af-c25b9eb05f4a","resolution":{"observed_at":"2026-08-02T12:14:47.748119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-02T12:14:47.802538Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.802538Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:ee5cae38fd3fb7c271e4b1faab85bf046b5ca3226bb9ab5ffe9b03d8f4c17669","observation_id":"f20dd683-84e3-4643-a802-86f937167c68","resolution":{"observed_at":"2026-08-02T12:14:47.802538Z","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-02T12:14:47.873317Z","title":"and Friedman, N","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.873317Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:fb4f589aa62c4d22da88bab36ae1b2bc854396860ec3aeab4d8d087817730406","observation_id":"d9cd5735-3ad8-4a0c-b8b3-021e845c08af","resolution":{"observed_at":"2026-08-02T12:14:47.873317Z","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-02T12:14:47.941531Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:47.941531Z"},"links":{"cited_paper":"/paper/1906.02226","citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:dde95a3c83bb000a1c680374d135b5d5b3010a2a4bc5720e69550823bfccff60","observation_id":"40638959-91ef-4ad7-99d9-f1d340f0c6b9","resolution":{"observed_at":"2026-08-02T12:14:47.941531Z","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-02T12:14:48.017710Z","title":"D., Hoang, T., Li, J., Liu, L., Liu, H., and Hu, S","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.017710Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:130b70f832ce2cdaade3b6a222ed94f541ed7546040cfc568244ceb3f1228638","observation_id":"07e4c8ea-d254-4d1c-bb37-ac1e02e29015","resolution":{"observed_at":"2026-08-02T12:14:48.017710Z","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-02T12:14:48.086801Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.086801Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:dd6f1f3bcd31710e0b12b2277f86fdc68d858aa5d1f267ecb6f505b7d5860cd4","observation_id":"450e80f2-1cca-4ce7-94bb-f1d643af000e","resolution":{"observed_at":"2026-08-02T12:14:48.086801Z","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-02T12:14:48.141057Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.141057Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:34a00c746496b7af9e032fe1050459dfec7f15450ab6f2fed857b24d1bfaf264","observation_id":"6b026788-1ddd-41cf-9e50-6753d77eb8a5","resolution":{"observed_at":"2026-08-02T12:14:48.141057Z","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-02T12:14:48.243016Z","title":"K., and Regev, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.243016Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:300cb1d33969e795a3cb87028ecc932775f02f2e544d4adf86ad609f4fe77413","observation_id":"3b3c8731-859b-4ece-9763-6800c0b73e06","resolution":{"observed_at":"2026-08-02T12:14:48.243016Z","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-02T12:14:48.308743Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.308743Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:514d99644571376861009ed495cbaeaba9861196bda3f87d850397dd9991eac4","observation_id":"a9b230c7-b51b-4846-a7e0-24a9d4beb448","resolution":{"observed_at":"2026-08-02T12:14:48.308743Z","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-02T12:14:48.381279Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.381279Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:4fa81d0cbf5ec1e6e9bcd5b1bed53646f6263ec2907fc7337747cc6f9ab94b31","observation_id":"32b8124a-7d36-4940-a282-4cdefb9f7477","resolution":{"observed_at":"2026-08-02T12:14:48.381279Z","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-02T12:14:48.475242Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.475242Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:a0b017fc432af029fde84ce19a05b920afd21aecb3a1f5be57540eb0ce3b2ff2","observation_id":"fdc8c0fe-db71-47e0-a829-1369abaa87fa","resolution":{"observed_at":"2026-08-02T12:14:48.475242Z","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-02T12:14:48.549203Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.549203Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:a0ef7776e1daca6ba07c7b74b7fdfcbd1484efb0e171f533d7afe299e4292828","observation_id":"cae525fa-f8ec-40cd-b54d-951958437f96","resolution":{"observed_at":"2026-08-02T12:14:48.549203Z","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-02T12:14:48.610370Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.610370Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:7814c523b5b17c08e2f54ab08fb9e59cdc015df12e6614fbff8a98c95e3258df","observation_id":"dd7e6abd-49b4-4233-afc9-85b37b7e0d01","resolution":{"observed_at":"2026-08-02T12:14:48.610370Z","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-02T12:14:48.677711Z","title":"and B \\\"u hlmann, P","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.677711Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:fb2716149a422e2fda5f3a8e865e166a5004a07d14685a21d777db57e887307a","observation_id":"bdd0e79f-624c-47d3-ae12-47c09bda195b","resolution":{"observed_at":"2026-08-02T12:14:48.677711Z","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-02T12:14:48.773179Z","title":"M., Janzing, D., and Sch \\\"o lkopf, B","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.773179Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:fad83fb0c0b3ba8a64fda5f81bf5bf63f4449d55fddfa7d3f5ecf50bad5be94e","observation_id":"7c4195c2-d12e-4ebe-a217-bd59a7b6accb","resolution":{"observed_at":"2026-08-02T12:14:48.773179Z","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-02T12:14:48.909202Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:48.909202Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:82b89989d265580507597a882000346d0ef12c0d36759d0ae71c045c438cf6d2","observation_id":"c5345fcf-9f83-41a3-9122-6b20240e1a12","resolution":{"observed_at":"2026-08-02T12:14:48.909202Z","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-02T12:14:49.014283Z","title":"G., Seiler, C., and Weichwald, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.014283Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:c1be4199e41e01e2e08cb94f459266f4288eecf34961aa7c8ae6e122536d7ee6","observation_id":"c7927317-c055-4ecb-9763-11ab1efc9d35","resolution":{"observed_at":"2026-08-02T12:14:49.014283Z","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-02T12:14:49.083899Z","title":"A., and Nolan, G","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.083899Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:5d5ab8befa4c5ffba145444a3c74f31039bb8c6e1ee13ecb881126e8e39feb54","observation_id":"020190f9-0b93-483b-9eca-a289bdef26b9","resolution":{"observed_at":"2026-08-02T12:14:49.083899Z","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-02T12:14:49.150551Z","title":"R., Kalchbrenner, N., Goyal, A., and Bengio, Y","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.150551Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:f4a19b2f47699859ffcbd759bfdcf8e8472d09e0b4398758a53a38f39f7872c5","observation_id":"ef4406f3-ea33-4597-a1aa-e1d55def7237","resolution":{"observed_at":"2026-08-02T12:14:49.150551Z","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-02T12:14:49.230853Z","title":"O., Hyv \\\"a rinen, A., Kerminen, A., and Jordan, M","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.230853Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:8fe32325c1fdb00bd31e0bcc13a3955f0c2ef0e32d5da5d742880e9083946e0a","observation_id":"d85d7fbf-d2c9-403d-84f6-9bfce6f74208","resolution":{"observed_at":"2026-08-02T12:14:49.230853Z","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-02T12:14:49.299409Z","title":"N., and Scheines, R","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.299409Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:7ba9de9c57d231bf80087ddfe8b59eaf6ecba8ebfb09216e2a487d2359730922","observation_id":"61989844-5dac-4317-bd61-fad5e7730dfe","resolution":{"observed_at":"2026-08-02T12:14:49.299409Z","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-02T12:14:49.363953Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.363953Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:91d98428b61ea7a23b626f015ff8fe7c1e0161b06a1aec24147d4b6e4b98b1f3","observation_id":"5fc2dd71-f02e-410f-a653-729b392e890a","resolution":{"observed_at":"2026-08-02T12:14:49.363953Z","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-02T12:14:49.433680Z","title":"E., and Aliferis, C","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.433680Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:9440791752626642d7d60c1d6d080709d5c3d102171176c73766e1c5389e70b6","observation_id":"67847df9-247c-4116-ab0d-28c33d234494","resolution":{"observed_at":"2026-08-02T12:14:49.433680Z","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-02T12:14:49.527832Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.527832Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:f7097de3e01b7e364ef53c0424bf397555bed8a30430c1280411f3efe3e2a493","observation_id":"fc910548-5e42-48aa-a573-6a5472355c3c","resolution":{"observed_at":"2026-08-02T12:14:49.527832Z","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-02T12:14:49.734048Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.734048Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:b159047aecef4384767fd111142a2d2552eb1bfa26114731015e37ba72d655c1","observation_id":"0b45dd2e-d19d-4be1-9498-7cf9be5a7648","resolution":{"observed_at":"2026-08-02T12:14:49.734048Z","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-02T12:14:49.862636Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.862636Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:fcf8a932ef0e94e1b25c3eb832dc03492b866f9312eca8fd609a47d2bb3871b8","observation_id":"7957c068-a7bf-4d74-b650-abbee4035ceb","resolution":{"observed_at":"2026-08-02T12:14:49.862636Z","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-02T12:14:49.942741Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:49.942741Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:704f32c03170b4b51c2ac6a57039693b874446211b7488f4f523c7d95658e500","observation_id":"1f93cc71-532d-409f-9369-2c431d01a28b","resolution":{"observed_at":"2026-08-02T12:14:49.942741Z","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-02T12:14:50.111958Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:50.111958Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:3dc253b42f0053a9d20a3cdfc3d19ddd051687b9737e6d12f0f55dbd46e5d8cf","observation_id":"9a661f36-2ba5-40e5-88aa-f3405e66088e","resolution":{"observed_at":"2026-08-02T12:14:50.111958Z","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-02T12:14:50.306168Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:50.306168Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:6dc0ca042405d22998ba41947008a0ae1faf59dfb674fe2fa2fea3c21b1deb92","observation_id":"c1c502ba-8643-4503-834b-7f6ec4638d9e","resolution":{"observed_at":"2026-08-02T12:14:50.306168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.11555","last_updated":"2021-12-21T22:38:35Z","snapshot_observed_at":"2026-07-06T12:21:17.359422Z","submitted_at":"2021-12-21T22:38:35Z","title":"Optical helicity of unpolarized light","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.11555","snapshot_observed_at":"2026-08-02T12:14:50.416528Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:50.416528Z"},"links":{"cited_paper":"/paper/2112.11555","citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:e0ba3baa5c7d8fad84eb6663ccf6e7c8cc5b55b0eec686ce69a5a75ad2e92b45","observation_id":"9f34e729-05e2-4a23-9363-7520e6e1dbf9","resolution":{"observed_at":"2026-08-02T12:14:50.416528Z","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-02T12:14:50.536898Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:50.536898Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:9b8070ff6cc7504a5cfdc292d7d4989ee5a1ce3ccec2f8cc072716bf2fce357d","observation_id":"12cf26d0-6b32-44de-b801-1ef8880e66ec","resolution":{"observed_at":"2026-08-02T12:14:50.536898Z","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-02T12:14:50.677318Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:50.677318Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:efb9a04962bec39e715333d7370f82f7d35535ada23f3fcf640777e9e7c8f7f0","observation_id":"6c341c49-d2eb-46ba-a96d-673e79a20c6d","resolution":{"observed_at":"2026-08-02T12:14:50.677318Z","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-02T12:14:50.895225Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:50.895225Z"},"links":{"citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:e4edc73340fec535875f4838eeeb45aa499427a60395b23202f25de8e69be8b2","observation_id":"097021ff-7c9b-476d-8b98-17692c8f91d5","resolution":{"observed_at":"2026-08-02T12:14:50.895225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.04477","last_updated":"2020-06-08T14:48:29Z","snapshot_observed_at":"2026-08-04T19:57:56.825201Z","submitted_at":"2019-06-11T10:09:35Z","title":"Causal Discovery with Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.04477","snapshot_observed_at":"2026-08-02T12:14:51.003347Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-02T12:14:51.003347Z"},"links":{"cited_paper":"/paper/1906.04477","citing_paper":"/paper/2606.06908"},"observation_digest":"sha256:aa1b3dc1655211e384e4b30ab436b622fccf859d44a98dee11c8d9107af8d4ff","observation_id":"9f1c8a32-76fa-4acd-bfe7-28bfcbcdf62c","resolution":{"observed_at":"2026-08-02T12:14:51.003347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.06908","last_updated":"2026-07-28T04:17:51Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-02T12:14:44.532484Z","submitted_at":"2026-06-05T05:03:12Z","title":"polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":52},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2606.06908."}