{"as_of":"2026-08-09T07:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aca6cf9fa23dad05b395fbecda1993b56777efd4966c5e97c4dfac2d5ee86766","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T01:18:46.622883Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.27455/citation-record","integrity":"/paper/2606.27455/integrity","json":"/paper/2606.27455/citation-record.json","paper":"/paper/2606.27455"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T01:18:46.622883Z","title":"Directed network topology inference via graph filter identification,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:b28d0051d5d76afc78c693f487b9620086c5f3b18f41aa17309cfe29874a358c","observation_id":"092f01aa-3d0e-4cb7-a874-789ef2c977ef","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Graph signal processing: Overview, challenges, and ap- plications,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:9b48562cbdbadd5dedff68c148b36f9bfc3530714edd4e268d618e38858e5444","observation_id":"c662ce61-56e2-477f-9292-dc7c8154f5c1","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Graphs, convolutions, and neural networks: From graph filters to graph neural networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:34042288a0e2ea3684ea01331fa802d79d5deeb6c36b1c38b4f5268a9f638462","observation_id":"00aae48e-e603-4a18-a209-66f66999111f","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Discrete signal processing on graphs,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:f921aaeddc4587b10eb9f51e8efd1eabff30dc0d0318495bf7607b282d2b0907","observation_id":"520af26c-4ea8-4b46-a082-c8361a875e32","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Signal processing on directed graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:a29fabfd95f319d6ca2dd05f22c215a74f46e870d24c4a4250b5fe7536463d28","observation_id":"f8b63d0d-359c-40ea-aad6-1a6cc84b288d","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Peters, D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:53f3a910af745631854eeb98e4cda102dff6f76cf7f6b5f88d3e54cba707ee1e","observation_id":"d087194f-9e58-4867-b6f6-40d303350e5e","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Stationary graph processes and spectral estimation,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:e8e63e09b42f0a1c1c4f986c27ddab41126e3fc4c0a6dba3780eb9c521cfdf63","observation_id":"4ac49bcd-189c-45b0-952a-128edf4c3009","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Identifying the topology of undirected networks from diffused non-stationary graph signals,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:3c3ae458bee312d84fb145b1a1b7c76ef1100b65c4f1e6c02110fcd0379eb122","observation_id":"aceb238b-9dc6-4bc9-8d43-c28ca52a7f40","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Boumal,An Introduction to Optimization on Smooth Manifolds","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:7e8b2de83f8836ab91ba04b8fa7ed8d587c02604d150d4abb85dc29d94367d50","observation_id":"2a18127d-5f5e-46ef-a879-bac93a56d28d","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Topology identi- fication and learning over graphs: Accounting for nonlinearities and dynamics,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:b43aa9e18e543567cde6532c7a488f401ec6a5fa24a6e8e0284aefd4edbb4454","observation_id":"8280b2c0-9613-4f00-a0d8-8fac313eefad","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Connecting the dots: Identifying network structure via graph signal processing,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:4cbaac3ee7221d43933a570f30f938f2e0e03c7e6f86b89d1fe4c42470fba60a","observation_id":"8460b943-dcab-4228-96db-29bf9a61ff9d","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Disentangling neurodegeneration with brain age gap prediction models: A graph signal processing perspective,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:25afa458e983d36626b7a9e3c78be9ff14c728785b80c63f1a6cb66c854e7fe8","observation_id":"6e906aaf-c488-4c4c-9efd-61767c50278a","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:f1f0b39547280d7e2656719265f27cabc9b16f265e02f2d2c3dda25f76927a79","observation_id":"b4a4db87-061d-4058-b155-a65246fae9fe","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Sparse inverse covariance estimation with the graphical lasso,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:2ec504de4575939aa09213bf8516d678f1fd63f9a78bf0419119d5a3c7bd0977","observation_id":"31758768-5ae0-4213-92b5-a328a71672cc","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Proximal-gradient algorithms for tracking cascades over social networks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:7614d7d330d85413cddca1c94bbba76020011b9b7d69c399e803c1adb9764b9e","observation_id":"b6929ddc-7e23-4f1e-be00-69b92e74b5de","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Tensor decompositions for identifying directed graph topologies and tracking dynamic networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:fface4d9d1dac4c01c7ec548c0565520ffe726a24f295f63b175b73e85f7c316","observation_id":"cb2bfc11-a53f-41de-83aa-6fcd13ed96e2","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Topology identification of directed graphs via joint diagonalization of correlation matrices,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:f80ad02d3001661df14e7a08e983b11f4eaf3c5d436f7cf0ec8bbcc9e457e3ad","observation_id":"f92d40bc-b5d8-4790-b23b-0fad261f9fad","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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":"2601.15999","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T18:55:59.340191Z","title":"A covariance matching approach to graph topology identification,","venue":null,"work_id":"723cb75e-7dd1-47eb-89d7-7febc741e6e4","year":2026},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:ba1394495f687fb1f7ca5baab18c2c6af2a0b1f2f240dbb10e348810e35e08ed","observation_id":"f041946b-cf72-46a8-af6b-9b80d735d5fe","resolution":{"observed_at":"2026-07-01T18:55:59.341690Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-29T01:18:46.622883Z","title":"DAGs with NO TEARS: Continuous optimization for structure learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:696204af701972a4fff1b1cd4111f93d7059b1f16032e8db6a7853c4bf250801","observation_id":"3a18a1c9-0929-4b29-bb09-cff4a7fa4cd2","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"CoLiDE: Concomitant linear DAG estimation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:5f5758ace36acee7dd1cc441878fbd863f57e62f2705040ed508d0b01d48cd9e","observation_id":"d74fa74f-a200-4644-a3e8-32d5d63756cd","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Beta oscillations in a large-scale sensorimotor cortical net- work: Directional influences revealed by Granger causality,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:2a938861b2171a6d2f98d46badb750310dff22983629c1abd4894e01899fcf07","observation_id":"849fea85-6039-4bac-a9cf-cc57c1db82cb","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Learning Laplacian matrix in smooth graph signal representations,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:11832f49fa30691294aa00fb5be34821b450d9f7fbbb5e85047142ed18879829","observation_id":"b32e4ddd-95ab-40bf-bab2-3a9b8deb5e27","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Signal processing on graphs: Causal modeling of unstructured data,","venue":null,"work_id":null,"year":2077},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:2957c191b30af0b0c6ae8fcccc6f8fc2cf45b208453205bc20d58a470b34ceb8","observation_id":"7581735d-852b-43f9-be37-37b1a905b9d8","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"How to learn a graph from smooth signals,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:751a15d432d618c1ba741be3e870f3b6b20c2c030e97d42e51792440f528da2f","observation_id":"84134b7a-c22f-4b48-81a6-7b2cb428aa45","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Network topology inference from spectral templates,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:01bf652cffec2d1bbb1ff07ff9d0046bf3cf0f82b0c8d3436311d36b6c21b6a5","observation_id":"99ed1628-16ce-438d-8e88-d959dda4f679","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Characterization and inference of graph diffusion processes from ob- servations of stationary signals,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:c1166ff633cdcd3e1ca5a23d3c260fe0cac4744539225e34c69055a91bd6effb","observation_id":"15cd413d-40da-4580-ac74-811afd251743","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Learning heat diffusion graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:b31e2b72213dea670a1df0af274d19e7e737ff63b7c45ef6190dc98793020b88","observation_id":"c48f432b-7b9e-421f-802d-5947bd6a7d62","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Learning graphs from data: A signal representation perspective,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:192f44cec1b42d2bfd86058f803f4b6628b3298ac0ea78cf8392dd5cff9165da","observation_id":"410e6e0d-1aaa-4572-a6c9-bc9bc8b3a31d","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Learning graphs from smooth and graph-stationary signals with hidden variables,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:00bb4c0cf95da01f3db1c846033c10ee29f7758044a1529a02c75e8398ba578b","observation_id":"fa957ca9-8ef0-41b3-9202-a3b8da4e9b2f","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Online discriminative graph learning from multi-class smooth signals,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:5517bdcbc566ebdeea3a1e2e7d996f2fc27b27504da70d3117c520a6eecaf1a5","observation_id":"cca80c7f-2235-4fa3-9495-603b03d2d200","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Accelerated graph learning from smooth signals,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:2b51dbeceb0457358521aea4e18b91dbff08faa8a95e09db23dc505ec4383073","observation_id":"f43e79cb-978a-4b5d-bf20-caa69a520808","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Inferring directed network topologies via tensor factorization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:cf5abd885628ac733418094af32c009e980e855b3cbcd5f2f17bb8489af9c62c","observation_id":"229f22d8-f7fb-457a-acc1-762ed8993108","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Network topology inference from non-stationary graph signals,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:0f38b5122bf01759fac00e4156eeb610852c42a785411cde9b18f62ac871f486","observation_id":"1372ae08-ec5c-4633-a124-05ab039a850f","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14744","last_updated":"2023-10-12T04:37:56Z","snapshot_observed_at":"2026-07-06T15:32:14.701994Z","submitted_at":"2023-05-24T05:32:49Z","title":"Block Coordinate Descent on Smooth Manifolds: Convergence Theory and Twenty-One Examples","version":3},"cited_work":{"arxiv_id":"2305.14744","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.14744","snapshot_observed_at":"2026-07-01T18:55:59.342809Z","title":"Block coordinate descent on smooth mani- folds: Convergence theory and twenty-one examples,","venue":null,"work_id":"f9590816-3dad-4ee8-8415-2906ff672c82","year":2023},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"cited_paper":"/paper/2305.14744","citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:0282f20ad1e2e143d356118c88879663a5dc4a5313f9a0306cd94e080dcece63","observation_id":"f93d7d42-c137-4af9-9ede-3250fcb2a834","resolution":{"observed_at":"2026-07-01T18:55:59.344350Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-29T01:18:46.622883Z","title":"Robust graph filter identification and graph denoising from signal observations,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:c25196cc8305b1eb9234b9fab9e987ecbead8cfef3c6cebc9c81e5bd77ffd7fb","observation_id":"8a4bf73a-0dfd-429b-a7e1-0c826c6ce9b6","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Online topology inference from streaming stationary graph signals with partial connectivity information,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:976b27eb85e4828ce76a58a58bac00359279752812ce6668af272bd274a4b821","observation_id":"3f608e96-4401-4db8-bd92-097361601894","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Joint inference of multiple graphs from matrix polynomials,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:9ebcc159cb25387286c57e9cec428031314c64d9d33d74b81a73f7d62aeb2c96","observation_id":"78d1d863-4f1c-4ceb-b2d1-4717035c19b8","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Logspect: Feasible graph learning model from stationary signals with recovery guarantees,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:534b1f53234b61298c2753b02e2e90ae058d21a8501be711f3f976d910548fc8","observation_id":"c365aaec-d984-4b74-8e1c-055d2376aed7","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1101.6081","last_updated":"2011-02-10T02:53:50Z","snapshot_observed_at":"2026-07-06T02:22:49.108398Z","submitted_at":"2011-01-31T20:59:45Z","title":"Projection Onto A Simplex","version":2},"cited_work":{"arxiv_id":"1101.6081","doi":null,"metadata_source":"pith","pith_arxiv_id":"1101.6081","snapshot_observed_at":"2026-07-03T13:18:12.216310Z","title":"Projection Onto A Simplex","venue":"math.OC","work_id":"7d471094-9159-47c9-970b-1e1ae9a57900","year":2011},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"cited_paper":"/paper/1101.6081","citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:c14bc4108dd60f37b4dc0eceed60cc23e95d629e5e1d9e83c9376eca73175418","observation_id":"de1931f8-beb3-464e-b265-29fb5875866b","resolution":{"observed_at":"2026-07-01T18:55:59.342925Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-29T01:18:46.622883Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:50ad2517b708f4f1406b112d42ac26b66f59ab5e2597f430affb81750f0a82b5","observation_id":"5809d8e0-82ad-4e24-961a-6850f3ecd738","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:e77e6733775ef85011c8e7fc596f9904d02405e02bd5a464c89da2c69c5266b8","observation_id":"42606544-2c1e-4ec4-bbe6-bc85c65de4ef","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"On Kruskal’s uniqueness condi- tion for the CAMDECOMP/PARAFAC decomposition,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:1ca01fd628c58b33268a90fa8e1814e5a4a85ecbfaa7cf9776bfcc8ea7f6e2c2","observation_id":"7089054c-aabc-4364-9c5b-dd3ddce6127f","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Global rates of convergence for nonconvex optimization on manifolds,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:c6468bd4eb7d5105d070a2a2cc63802a449b9cedacb035ad34fdc8849e38781d","observation_id":"7a6c3580-480b-4f06-8b2b-6209d8cb0089","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","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-06-29T01:18:46.622883Z","title":"Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T01:18:46.622883Z"},"links":{"citing_paper":"/paper/2606.27455"},"observation_digest":"sha256:d47345095b42ff9b9876df2a608af1303a2d07eed57f68e45505267fc402e6e8","observation_id":"ad6dabb0-4c7c-4e96-a1b9-bb5e54b06abc","resolution":{"observed_at":"2026-06-29T01:18:46.622883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27455","last_updated":"2026-06-25T18:25:57Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-08T06:38:18.530531Z","submitted_at":"2026-06-25T18:25:57Z","title":"Directed Graph Topology Inference via Graph Filter Identification"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":44},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2606.27455."}