{"as_of":"2026-08-10T06:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb9c306420a0be09ca8ff7a2f94d03bdacfb4c9b8152c355b6a87cefbe84f528","coverage":[{"denominator":124,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T00:21:37.878543Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"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/2608.00836/citation-record","integrity":"/paper/2608.00836/integrity","json":"/paper/2608.00836/citation-record.json","paper":"/paper/2608.00836"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:37.451674Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.451674Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:65a2a6b435230a33da1ab3382293543d942adda8da1b45e008a9d786e95ecaa4","observation_id":"c532715a-1bd7-48da-8ee7-40663e492cb7","resolution":{"observed_at":"2026-08-05T00:21:37.451674Z","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-05T00:21:37.458893Z","title":"Computer Science","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.458893Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:313a52c33a59a5eee8af848c64313be375603abd5f8f1b447ae4680751e0f719","observation_id":"a614d37e-2185-4fe4-8a99-ad9bc6741248","resolution":{"observed_at":"2026-08-05T00:21:37.458893Z","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-05T00:21:37.463894Z","title":"Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.463894Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:8ad6af2c1873008f6196f688a4e4d854f7ce75f5b771fa2c06bdfb356f69ac49","observation_id":"8b5e13a6-d330-45b0-9a00-8109d560eade","resolution":{"observed_at":"2026-08-05T00:21:37.463894Z","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-05T00:21:37.468507Z","title":"2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , year=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.468507Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:9844ea8de100398373542b83651c769180220164f63033ced45f7730dadd4bcc","observation_id":"1f786847-a765-4139-b526-81c810e1a9c6","resolution":{"observed_at":"2026-08-05T00:21:37.468507Z","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-05T00:21:37.473638Z","title":"Proceedings of the 2015 IEEE International Conference on Data Mining Workshop (ICDMW) , pages=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.473638Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:cee810d48e1dba8d182015cc39de358de6d238e533740b160c7dde9dbf0f1db1","observation_id":"e4bf4dd2-8296-4b90-a3ca-93c0988495e1","resolution":{"observed_at":"2026-08-05T00:21:37.473638Z","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-05T00:21:37.478435Z","title":"Proceedings of the 52nd IEEE Conference on Decision and Control (CDC) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.478435Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:09734d2f7fb6b9c4cfa2ebd50e3627a340baee54ba5aef3d1d2a431501a485b0","observation_id":"d018cee2-fa63-4d69-8bbe-911f3965a07f","resolution":{"observed_at":"2026-08-05T00:21:37.478435Z","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-05T00:21:37.483039Z","title":"Proceedings of the European Conference on Computer Vision (ECCV) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.483039Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:ff7077b497687804f00edb405ce84b4c23968d957cb3edb81144f277bf517b9b","observation_id":"9e11d782-df74-4287-92c5-722e1dcf225a","resolution":{"observed_at":"2026-08-05T00:21:37.483039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.15956","last_updated":"2022-11-10T08:22:24Z","snapshot_observed_at":"2026-07-06T14:11:36.289601Z","submitted_at":"2022-10-28T07:21:57Z","title":"Generalized Laplacian Positional Encoding for Graph Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.15956","snapshot_observed_at":"2026-08-05T00:21:37.487973Z","title":"Generalized","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.487973Z"},"links":{"cited_paper":"/paper/2210.15956","citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:0ce7544aef4f373ae4315e7e62fa5805f8f48072b87d053addab04fe59fe6808","observation_id":"4ea0be20-65ad-432b-8754-f4f5fdebeaef","resolution":{"observed_at":"2026-08-05T00:21:37.487973Z","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-05T00:21:37.492813Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.492813Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:befb5e8805a6520d856decea4f70f0c730b4e9367f825653cd6040054e503953","observation_id":"5b5b3b80-b0e7-4829-a359-11821ebc3621","resolution":{"observed_at":"2026-08-05T00:21:37.492813Z","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-05T00:21:37.497826Z","title":"Proceedings of the 1st Workshop on NLP for Positive Impact , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.497826Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:3d9a4c979e4764a78e11d2386be2506e9a02333ef939a0661acb5a2195e26ee2","observation_id":"09e4801e-2e07-4f5f-9a0e-acf8fffd162c","resolution":{"observed_at":"2026-08-05T00:21:37.497826Z","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-05T00:21:37.502108Z","title":"Learning on Graphs Conference , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.502108Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:ad2fc0e20eae9f366abb42aa477d9c72fb9702f2d5ec20f16e58867eb83ab26c","observation_id":"870356bd-1bb9-42ea-a40a-f05bafd54f2a","resolution":{"observed_at":"2026-08-05T00:21:37.502108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.06673","last_updated":"2019-02-10T15:21:45Z","snapshot_observed_at":"2026-08-07T20:20:09.340389Z","submitted_at":"2019-02-10T15:21:45Z","title":"Fake News Detection on Social Media using Geometric Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.06673","snapshot_observed_at":"2026-08-05T00:21:37.506543Z","title":"arXiv 2019 , author=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.506543Z"},"links":{"cited_paper":"/paper/1902.06673","citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:b32081d0e3df439afb2c71b7467a9e03d6e92af21a50cd9f007b537be55c6e83","observation_id":"78ef7e96-42c5-460d-8c7b-77a7e1a0f1a6","resolution":{"observed_at":"2026-08-05T00:21:37.506543Z","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-05T00:21:37.511578Z","title":"Msgnn: A spectral graph neural network based on a novel magnetic signed","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.511578Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:96ad02db2ec85cbb18da4486c32442c47210555211f1e2b81ae87f10e6fff7fa","observation_id":"9604c229-3139-4061-b000-5f1864f66294","resolution":{"observed_at":"2026-08-05T00:21:37.511578Z","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-05T00:21:37.516540Z","title":"Information Sciences , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.516540Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:d3b18bf8ab4e96551d2f3e79d85e2e971b423a1eb4509cc42e1d00024501e66b","observation_id":"b1c4eb65-bf4b-4df5-9727-3c5e5aa747d2","resolution":{"observed_at":"2026-08-05T00:21:37.516540Z","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-05T00:21:37.522001Z","title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.522001Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:97440e0babf4fa2fe86decdd58d4209d54e6570de93c170a9ba51e85eba8f0fe","observation_id":"281b7c5e-24ce-4b56-8753-20becfe3e7f1","resolution":{"observed_at":"2026-08-05T00:21:37.522001Z","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-05T00:21:37.526067Z","title":"Bioinformatics , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.526067Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:ff45268faa455a6ab25a0dbb7210f26ff128ecbc4577c03f83b0223c04b6b08c","observation_id":"e0a7af32-7868-4f83-92fc-d2452f9721c1","resolution":{"observed_at":"2026-08-05T00:21:37.526067Z","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-05T00:21:37.530146Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.530146Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:e911e4fa19468834aed1a44647d64c98de4db1c9820f0a095e1ca9c1de4de458","observation_id":"9d1dcb49-d7ba-4384-871a-90feb6738500","resolution":{"observed_at":"2026-08-05T00:21:37.530146Z","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-05T00:21:37.534199Z","title":"Scientific Reports , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.534199Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:7787e23c14deccc9fc208ae0da2584b3a1e82d12ea2785d94a211f549a31a29c","observation_id":"08209fca-253c-433a-8a1b-b211e25e4534","resolution":{"observed_at":"2026-08-05T00:21:37.534199Z","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-05T00:21:37.538439Z","title":"Nature Methods , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.538439Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:243e52ef35c65806943e100f13303c704718e363a610c86f99cc1983e4d431ab","observation_id":"4fac660f-2e3b-42c4-b509-9fab73a5a936","resolution":{"observed_at":"2026-08-05T00:21:37.538439Z","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-05T00:21:37.542647Z","title":"International Conference on Machine Learning (ICML) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.542647Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:89956158f9a7d4eb7542e7860983a655377dada85328c375371eeefc9d4e8024","observation_id":"6529fa4b-3abf-41a1-a2c4-34c248c17dc6","resolution":{"observed_at":"2026-08-05T00:21:37.542647Z","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-05T00:21:37.547108Z","title":"Learning on Graphs Conference , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.547108Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:4daffc19cc1431575ea134a736d9c8ccb3f9293e55f2ba7ab6aa7cda6e40fd05","observation_id":"bb3779ba-09f5-497e-a0b0-b7d56837f2fc","resolution":{"observed_at":"2026-08-05T00:21:37.547108Z","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-05T00:21:37.551670Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.551670Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:46ddc53a7295cb75e6b3785a7a7c636b6a8d8f7b1f814eb111783c66527b8c48","observation_id":"f1d71d65-ddff-4bb3-97fd-66ad78f2c191","resolution":{"observed_at":"2026-08-05T00:21:37.551670Z","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-05T00:21:37.556302Z","title":"Sigmanet: One","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.556302Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:23ab6ac66f75fa4e76a81467feb182baaeffe8de8e0c1528a4ff6a5d1e914eab","observation_id":"1c7ad443-a2cd-4403-90e7-1a22cd74459c","resolution":{"observed_at":"2026-08-05T00:21:37.556302Z","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-05T00:21:37.560531Z","title":"Proceedings of the 28th International Conference on Artificial Neural Networks (ICANN) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.560531Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:80ab431af2bfa4e675b561b228b641890df44baa2be58a321cbe991c4d8004ed","observation_id":"9c1a39f1-b7dd-4822-a87e-6bdb54304cf3","resolution":{"observed_at":"2026-08-05T00:21:37.560531Z","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-05T00:21:37.564855Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.564855Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:6ed646b7e3ee540a091a6a0167f357d6a9d57e66117ecb8058483e5cb03151ff","observation_id":"475e6625-ae0f-43b9-b5bf-3e8c0ccaead7","resolution":{"observed_at":"2026-08-05T00:21:37.564855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07323","last_updated":"2022-08-15T16:42:18Z","snapshot_observed_at":"2026-07-06T13:42:01.051477Z","submitted_at":"2022-08-15T16:42:18Z","title":"Signed Graph Neural Networks: A Frequency Perspective","version":1},"cited_work":{"arxiv_id":"2208.07323","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.07323","snapshot_observed_at":"2026-08-05T00:21:38.057882Z","title":"Signed Graph Neural Networks: A Frequency Perspective","venue":"cs.LG","work_id":"cafdf33f-3f7e-4517-86e1-aca4852c62ff","year":2022},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.569303Z"},"links":{"cited_paper":"/paper/2208.07323","citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:6437fb0a5eb69d05c0b274682b1e746c367d926f32f6cee6b57144f6d9ea92ce","observation_id":"82dd9fca-c43b-44e6-b9db-fd37b0a86a06","resolution":{"observed_at":"2026-08-05T00:21:38.065172Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-08-10T00:58:20.700967Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-05T00:21:37.574219Z","title":"arXiv preprint arXiv:1911.03082 , year=","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.574219Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:22e5fbd8c0c3830e985df4abf1d0601458bd1c939f2444af56ebbfe0e9ce6ca7","observation_id":"db2e48ff-b90a-46a1-a2af-c5cc154c2f05","resolution":{"observed_at":"2026-08-05T00:21:37.574219Z","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-05T00:21:37.578933Z","title":"Proceedings of the SIGCHI conference on human factors in computing systems , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.578933Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:b9c5f94c1057e6b2e9ef4dbc4bed99b9ec0ee396b7d0151917c53aafcdb9f523","observation_id":"8bc155f7-b66b-4297-a045-c147afca6370","resolution":{"observed_at":"2026-08-05T00:21:37.578933Z","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-05T00:21:37.582768Z","title":"Proceedings of the AAAI conference on Artificial Intelligence (AAAI) , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.582768Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:d21913bbc0eb431311bd2e9da6e94ebffa5dabac10da0f406407b0d7b26f8720","observation_id":"cbb5db16-0f4d-41a0-8786-775e93ea2d52","resolution":{"observed_at":"2026-08-05T00:21:37.582768Z","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-05T00:21:37.586990Z","title":"Proceedings of the 15th Extended Semantic Web Conference (ESWC) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.586990Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:3b6577215d36807030f5d2ec2c26e5b9e69b6afb3d00f7db594cd983106b2d55","observation_id":"ff1a63a7-896b-4cfc-b04a-32683399de95","resolution":{"observed_at":"2026-08-05T00:21:37.586990Z","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-05T00:21:37.590889Z","title":", author=","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.590889Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:051afba37f8af9979a8fc512dce5cb88cb117ac4b44cfef942edb1096d7b3882","observation_id":"0dd4750b-c42d-4d9c-b4a3-c53e74e60280","resolution":{"observed_at":"2026-08-05T00:21:37.590889Z","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-05T00:21:37.595583Z","title":"Proceedings of the 2018 IEEE International Conference on Data Mining (ICDM) , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.595583Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:7d4583e479456cfa33fd460460242a49d97c7957cdcb616a820175419c8d07c8","observation_id":"08115528-594b-495a-aef8-3223ce328cd9","resolution":{"observed_at":"2026-08-05T00:21:37.595583Z","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-05T00:21:37.599861Z","title":"Proceedings of the 2022 SIAM International Conference on Data Mining (SDM) , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.599861Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:22b5c36d66e0dc2885d76488205e848705d5b36e6b688d918b589c33c8c548b8","observation_id":"ef3dca38-5375-4a6c-8b96-9e92a305cf7f","resolution":{"observed_at":"2026-08-05T00:21:37.599861Z","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-05T00:21:37.604234Z","title":"Proceedings of the AAAI conference on Artificial Intelligence (AAAI) , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.604234Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:330138be62052da9a837b94765c3ade643e3a80d69f668830467a41e0690a183","observation_id":"74496e7b-7aa7-44f1-91c0-99d6bcf54bc3","resolution":{"observed_at":"2026-08-05T00:21:37.604234Z","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-05T00:21:37.608168Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.608168Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:c5bf29312b8d7d058f86dde90a1949daeaa150766c2df0763f5614fffb3828db","observation_id":"dcbf5b69-3a8a-4401-abba-21e700e96be3","resolution":{"observed_at":"2026-08-05T00:21:37.608168Z","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-05T00:21:37.612099Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.612099Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:1169c6b89ca1a67e7ce54657e892deadc57dd17325dbe310b9b4a1141e87c087","observation_id":"74844dee-73e3-4823-9f02-ec6153563239","resolution":{"observed_at":"2026-08-05T00:21:37.612099Z","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-05T00:21:37.616425Z","title":"Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.616425Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:b230ad0923cc281ad6d606073bebfb74337805204bc586c3d61cf69580578d26","observation_id":"fcd244bb-8f53-4008-946c-0d3c36611d7f","resolution":{"observed_at":"2026-08-05T00:21:37.616425Z","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-05T00:21:37.620330Z","title":"Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.620330Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:fd16284519891fbaf0143cfdd6302aabc900461e12f3c9f6f37fb15794267450","observation_id":"64d954b4-fd56-4a6c-a350-47a02af19120","resolution":{"observed_at":"2026-08-05T00:21:37.620330Z","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-05T00:21:37.624327Z","title":"Neural Computation , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.624327Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:9528be8aa2c9e671338d745ed1b0924f61f075cddf7d21fb4d782b52d06c83bf","observation_id":"f2dfe1c8-04e6-4d3f-8009-a8d6b495f4a9","resolution":{"observed_at":"2026-08-05T00:21:37.624327Z","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-05T00:21:37.628045Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.628045Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:125b84a70bab2800ae97be7d59f5827ab8c43ced1b9b4339f8cb0ba8aeddaf09","observation_id":"74b00bd1-5b0f-45f1-b188-f292fc62b8ac","resolution":{"observed_at":"2026-08-05T00:21:37.628045Z","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-05T00:21:37.632072Z","title":"International Conference on Machine Learning (ICML) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.632072Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:cee016c6e1c4fdc1dd897fb39a19300fe92f6126d115e1056f7091aca846a97d","observation_id":"a0c9f23f-1a88-4f47-94a5-1525493fe578","resolution":{"observed_at":"2026-08-05T00:21:37.632072Z","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-05T00:21:37.636920Z","title":"IEEE Transactions on Neural Networks , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.636920Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:fbeafcc28a79d0733fcf4f20b49935875fdf8c18c733eb58789f1be8b2e9ddbf","observation_id":"47196d67-61bd-4060-9760-ee80cedc3018","resolution":{"observed_at":"2026-08-05T00:21:37.636920Z","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-05T00:21:37.640828Z","title":"International Conference on Learning Representations (ICLR) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.640828Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:7893ee6d9755b950931102371ff9429622a89f75ba6e580fca35f987ce21cf54","observation_id":"934fc248-1d65-4511-baa0-e84dbe3b1fb1","resolution":{"observed_at":"2026-08-05T00:21:37.640828Z","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-05T00:21:37.644806Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.644806Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:6394b925d20fc228356dc6b1d709fbda7b12ecaa657387226c1d74b50d3b468c","observation_id":"7d3bce58-f20f-4c4e-825c-6ca19439743b","resolution":{"observed_at":"2026-08-05T00:21:37.644806Z","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-05T00:21:37.648849Z","title":"Neural computation , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.648849Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:897b454d6586fa7b1171e98b627740f6a8e1ef30ad9a149488f2774496108bee","observation_id":"7598f86b-06cc-4027-b545-a4ca3410dec9","resolution":{"observed_at":"2026-08-05T00:21:37.648849Z","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-05T00:21:37.652739Z","title":"Science , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.652739Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:22445c0f5daa1f40ddbac0ece2e161eb0b045351895563d5b589c2f9cf171846","observation_id":"839a5657-9ddd-4c00-81c2-8d950bdbafb4","resolution":{"observed_at":"2026-08-05T00:21:37.652739Z","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-05T00:21:37.657423Z","title":"ICLR Workshop on Representation Learning on Graphs and Manifolds , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.657423Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:fa964bd27196a6b11ffd02529706431cf499529003272db02d616d8360aea0a5","observation_id":"4226e39d-8122-44e5-903e-730e3e9668d0","resolution":{"observed_at":"2026-08-05T00:21:37.657423Z","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-05T00:21:37.662605Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.662605Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:bcda98586e98d1e85fde9f1b49f6c3e27f611f23ca02a530098be88a8edb460f","observation_id":"3442a6fa-c8d7-40f0-9881-ee29bbda5474","resolution":{"observed_at":"2026-08-05T00:21:37.662605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.136817Z","title":"International Conference on Learning Representations (ICLR) , year =","venue":null,"work_id":"7cf00245-3c93-4608-83ea-7167b7a7b646","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.666700Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:1add869fdd78a93cb8d39bcd4c23c58a6de8efd3fb32c5d9d360bdd23ebae9e6","observation_id":"75552b86-4cfd-4ebc-8bcb-02f4dbb88062","resolution":{"observed_at":"2026-08-05T00:21:39.141835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.123502Z","title":"Annals of Combinatorics , volume =","venue":null,"work_id":"21381e15-9e61-4ebc-b445-bcffa0c8a4ef","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.670978Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:3cc547cdc6259238ee6880daf6bf3d2b914341101600412f08cac2786a379acc","observation_id":"ef3b7c4f-3faa-4cef-8351-31f6e98d00e0","resolution":{"observed_at":"2026-08-05T00:21:39.127748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.109427Z","title":"International Workshop on Algorithms and Models for the Web-Graph , pages =","venue":null,"work_id":"367062da-69d0-47fe-8032-18747567bc03","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.675456Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:6b8a69d1db994ea067a6bd69281dfd51132c590413451f2de3d9febc9b6d08c6","observation_id":"00ec5736-b4e6-4631-9e44-27f7cf320379","resolution":{"observed_at":"2026-08-05T00:21:39.114285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.095559Z","title":null,"venue":null,"work_id":"7e48fb58-fe57-4818-9ccc-bedb1e4747a3","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.679306Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:d786d32c7bafe321a87d668928412565179e3f109f8e464ab977e8130e13c3ae","observation_id":"e0f7c812-1ed1-479d-8b31-e2614139958e","resolution":{"observed_at":"2026-08-05T00:21:39.100517Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.082302Z","title":"Applied and Computational Harmonic Analysis , volume =","venue":null,"work_id":"2cebd815-001e-4a64-b6eb-67a11f208420","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.683517Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:34b0be4ac55f8b2f078c70a91f3a06f0c14af031647211a0153c00ce9c947866","observation_id":"5d4be5ee-5341-4bb8-8349-51e5a1c689f6","resolution":{"observed_at":"2026-08-05T00:21:39.086821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.068255Z","title":"Nonlinear","venue":null,"work_id":"203172e5-8fe2-4348-8afc-891578ffb455","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.687413Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:8eb326c8c5469265bb58e5ed66f7d951f8039a8ab735cebffe84a1242965e7d0","observation_id":"bcec2231-2093-489d-9a57-3ad61685997a","resolution":{"observed_at":"2026-08-05T00:21:39.072849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.052469Z","title":"Applied and computational harmonic analysis , volume =","venue":null,"work_id":"caf51b68-d907-47d7-aa73-620b7f268516","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.691238Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:a2c93b84d6a745524fe96a6e30274e01d8d04397a4b4a6d4a29989495f4a1249","observation_id":"c1174b61-054f-4d95-af13-6e4d836c5643","resolution":{"observed_at":"2026-08-05T00:21:39.057529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.038910Z","title":"International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":"a41d616d-47f5-437d-bb21-d7d66db52cfe","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.695170Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:bc313dd36cb259cc9d891958237d8c6e2706777f9aa7a8e1784f9ca2651d1ca0","observation_id":"43475f17-0fe7-4528-9836-e849ce452d90","resolution":{"observed_at":"2026-08-05T00:21:39.043497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.025484Z","title":"Advances in Neural Information Processing Systems , pages =","venue":null,"work_id":"5890c75a-d4bd-4a10-b5de-f218b56cccd1","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.699058Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:0918e9dae4aab16a0d30b12ddcba90ef3870079278fea92795c8cbe52ef4e3ee","observation_id":"2f777c7b-c954-40a7-8d87-f0a9500eee95","resolution":{"observed_at":"2026-08-05T00:21:39.029977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:39.011464Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"6af7fa94-15b8-4b3d-96e9-c3276a87b6ae","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.703028Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:9642f1673de33b735adec11a0c0c6f973dbafd9c3573bfba9e2958e819072310","observation_id":"cfcd3e6a-a8c5-4cf4-b63c-5ce684d21e41","resolution":{"observed_at":"2026-08-05T00:21:39.016091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.997848Z","title":"and da F","venue":null,"work_id":"94c2647d-c5c6-4218-ab33-8b3aaf3f228c","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.706980Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:e6da3e929e1c49b9bcf13924df47fe1bbd89adc1d1ff7f77b2e045f1655e50e6","observation_id":"d8671a25-1ac7-4724-b56e-1875f3ff1b31","resolution":{"observed_at":"2026-08-05T00:21:39.002365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.982714Z","title":"Physical Review E , volume =","venue":null,"work_id":"0a399e41-1f49-43aa-8f8f-929202503893","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.711413Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:e8df7027b17044f99cc1d4a5c87730695631652411aced6cbb85b00aa048adf3","observation_id":"c9378fb7-3372-4b96-99c3-58b5c42d80c0","resolution":{"observed_at":"2026-08-05T00:21:38.988321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.966784Z","title":"ArXiv , year=","venue":null,"work_id":"5ca39de5-5222-4ace-87cb-b964f87ba954","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.715406Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:bd0f98e52153dee215615e9f6ed01bc74a80fcf3627fd2598fe50f9c714268c4","observation_id":"7a6bba7a-5972-42f2-bc9d-a4cbf7615c40","resolution":{"observed_at":"2026-08-05T00:21:38.972696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.951569Z","title":"Machine Learning and Knowledge Discovery in Databases , pages =","venue":null,"work_id":"3abec66b-8da1-4ee8-bc95-68d1920f19d8","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.719113Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:10770c667335d63287fa5114cbd190b826509ce0a7a5eb88bf54cd16b7578674","observation_id":"17664d4e-4d83-4bed-ab0d-1034c129a901","resolution":{"observed_at":"2026-08-05T00:21:38.955981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.937008Z","title":"Journal of Graph Theory , volume =","venue":null,"work_id":"d0f7df96-15aa-4e8e-ab82-3f8be91cebec","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.722908Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:d9666284b8c52afb9a5e277dfbc5062e11026c6e47ad6fdc69d4fb933a96af09","observation_id":"4ad18e1e-b806-4297-8b68-cca038b93646","resolution":{"observed_at":"2026-08-05T00:21:38.941859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.921896Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":"911a8a87-49cc-4c04-8830-ad33c58c8e5c","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.726834Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:41bec50941b9fa19f18556034984c767c2a91d6d403e01987c780d4faa34c033","observation_id":"1a3bf25d-6042-4e45-9d92-4b8ea7ebfd72","resolution":{"observed_at":"2026-08-05T00:21:38.927367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.906606Z","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed","venue":null,"work_id":"3612f16a-df3f-43af-ad47-7bdcd8b6c976","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.730943Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:ee9d4f55fa3cb9a690a5e6821b266fe231e237bd41816f3f951e285b42dcf556","observation_id":"8fb6206a-74f7-420e-9fd9-3d65b21a069f","resolution":{"observed_at":"2026-08-05T00:21:38.911462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.891032Z","title":"and Ying, Rex and Leskovec, Jure , title =","venue":null,"work_id":"1e6258d3-9251-47c6-b5f9-1d37fd2c3d8e","year":2017},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.735158Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:d604ff45458a091baf55cb9401ab3506c2388091d13b2645b7591df3c3826438","observation_id":"5399600c-d952-451f-ace4-bcb23f4bb94f","resolution":{"observed_at":"2026-08-05T00:21:38.895479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.874997Z","title":"Applied and Computational Harmonic Analysis , volume =","venue":null,"work_id":"14cdd8fd-67b7-4a38-ad38-2f996bd6fdda","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.739315Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:5a47c7a976b35ee6bc84937a21b97420fe85ce718a74d9f65a7af54ad45fcebb","observation_id":"e1a58a08-32f6-4a10-a919-333b75ea825f","resolution":{"observed_at":"2026-08-05T00:21:38.880532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.859566Z","title":"ArXiv , year=","venue":null,"work_id":"57b757aa-542d-4ad3-b265-b90fd53be48a","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.744973Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:1a86085b9915ffd6d9dfc93df3b75dada9159b0994deee1f6eaf549d50df9989","observation_id":"e602ab77-95fa-418b-b718-334fcf5a769c","resolution":{"observed_at":"2026-08-05T00:21:38.864557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.844210Z","title":null,"venue":null,"work_id":"af76e5d3-ac98-4caa-92ce-b51e52b9793f","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.749433Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:c14f7bf5a4d04e89b240c5a5d57d7a928ff9892df7118960b4fae74d586e8db4","observation_id":"9738d811-d922-4c5f-b4e1-068567933daf","resolution":{"observed_at":"2026-08-05T00:21:38.848959Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.829526Z","title":"Proceedings of the 47th Annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":"7639f5ea-12fa-470f-870a-2e522dd6de1f","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.753573Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:b588208cd40f3f65f2da489d6a45fc033237863f87d8eebf248e22cfbc7b97e5","observation_id":"51d1313b-d166-462d-aaf2-2ceea1cc5a79","resolution":{"observed_at":"2026-08-05T00:21:38.834369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-05T00:21:37.757473Z","title":"and Welling, Max , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.757473Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:4eb53c5251710a91a6cd4346d38c60c31f1db157a5430b69233a52b832a56c4b","observation_id":"e884400f-42b8-4097-b863-d1b85d29663b","resolution":{"observed_at":"2026-08-05T00:21:37.757473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.805892Z","title":"International Conference on Learning Representations (ICLR) , year =","venue":null,"work_id":"99586303-e99e-4eb6-80a0-51c0ab7e0fd9","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.761581Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:4a045e5a24bb55d61f31494783e6f66396cbb9356e36ecbbe019cd073966a30c","observation_id":"266b6ba2-9830-472c-b145-e6e805cb5eaa","resolution":{"observed_at":"2026-08-05T00:21:38.810484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.790531Z","title":null,"venue":null,"work_id":"8bc0585e-2391-4e55-b7c1-f8202f2797b0","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.766287Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:727f282a8a796dda96fbdbcdba4daa11f48a74f816acd86827bcbe45d2c46b49","observation_id":"75776974-2e9c-4e77-bd49-9549a39cc949","resolution":{"observed_at":"2026-08-05T00:21:38.795219Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.775409Z","title":"Statistical Mechanics , pages =","venue":null,"work_id":"b213753a-9ccc-48e4-9c16-1428e4119f40","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.771599Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:d5a85b153164087d1b4a4ac0683ac309867e872f1592e839ca7a70a39e428a08","observation_id":"5e9737f1-ecc9-4810-a546-0ff44af8c157","resolution":{"observed_at":"2026-08-05T00:21:38.780172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.760553Z","title":null,"venue":null,"work_id":"a62f0009-9bcc-411a-a663-7d80f5dd1f3a","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.776546Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:dfa72b607f0ce587b7fe47f2acf5cf7f34196e3dde51497bdbf0081b1c58214a","observation_id":"e7e71680-5eac-4279-8ed0-d55cec9bca9e","resolution":{"observed_at":"2026-08-05T00:21:38.765115Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.745844Z","title":"IEEE Signal Processing Magazine , volume =","venue":null,"work_id":"022338e7-49dd-44a3-b1e1-778164b9b760","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.780658Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:6c57f6d920ea359016da94f8e399301c129f8bb93bc89ffdd4c4a0811e9d452b","observation_id":"731f01cc-1803-4d5c-b69d-8cb3d780f476","resolution":{"observed_at":"2026-08-05T00:21:38.750934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.731620Z","title":null,"venue":null,"work_id":"9563adf1-627b-4610-824f-65cde183bef2","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.784770Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:62cf52e999ed735fcea473aa1d973e7ac2b6d21f55676fc05b8759c48c9362ed","observation_id":"60c90311-7537-44e6-a93c-49dad3e7e69e","resolution":{"observed_at":"2026-08-05T00:21:38.735995Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.718419Z","title":"Linear Algebra and its Applications , volume =","venue":null,"work_id":"88720037-ead1-4408-8dfb-b56cfb4acc1d","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.789020Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:35f6b317450740e908237dec697eae660b18d3bc4b5704f3e658a4d2fcc9c562","observation_id":"e8f2fec0-85fc-441f-ae44-83cd584a7628","resolution":{"observed_at":"2026-08-05T00:21:38.722652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.703916Z","title":", title =","venue":null,"work_id":"72961686-7bb6-4687-bb84-49bc00e99268","year":2018},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.793055Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:19efc3c789b3ac7fffe468fac80e4936a7208a8fd09f15c37f41b450395b2221","observation_id":"e3342dad-11e1-40e5-b5e7-6d163ebe8ded","resolution":{"observed_at":"2026-08-05T00:21:38.709116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.690369Z","title":"Proceedings of the IEEE , volume =","venue":null,"work_id":"d59698de-8d05-4d38-bad3-2906b0533bd2","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.797141Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:43dd3f8383de239ccb266a57df61cafc5debd2d78f67e0afe6eff7d3d4813d46","observation_id":"72642970-670d-449a-9907-d76545a9ae2a","resolution":{"observed_at":"2026-08-05T00:21:38.694761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.675376Z","title":"Econometrics: Mathematical Methods & Programming eJournal , year=","venue":null,"work_id":"7bb3e7fa-6378-465c-b7a0-73fcf599ec9d","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.800917Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:04d3c00bef1262951fcc8bda80b091bb8ca56d0292dbc76e10c9ba020d173f3a","observation_id":"61dd11c5-6ece-4cce-983b-823b39b888d6","resolution":{"observed_at":"2026-08-05T00:21:38.680695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.661724Z","title":"2019 IEEE/CVF International Conference on Computer Vision (ICCV) , year=","venue":null,"work_id":"ce09e2dc-5600-4189-adf9-a3b4b9a61a52","year":2019},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.805215Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:7e263c358353134f7404eb4e95fed4630af1aec8127faa60a2451c8325ccd784","observation_id":"0c79bab5-2b0b-48fc-bad2-78dbd147b04d","resolution":{"observed_at":"2026-08-05T00:21:38.666275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.647294Z","title":"Ecological networks: linking structure to dynamics in food webs , pages=","venue":null,"work_id":"b1038d71-36b9-4951-b482-b9c5d262ecad","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.809145Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:099c7f60087883bd10e4841d6509577ee01c82387d0f33df3198e6df060a7f76","observation_id":"cf55efc9-f20e-47dd-9479-e999365315f6","resolution":{"observed_at":"2026-08-05T00:21:38.652360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.633895Z","title":null,"venue":null,"work_id":"6d225f89-b6ab-44b6-bc20-0bb160e49eb7","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.812946Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:f079150319420c069f11dbf75977a9880d68392ed7c2ec607a7f317177c9db3b","observation_id":"eb2ceed3-7e7b-4833-9d76-6defc5372195","resolution":{"observed_at":"2026-08-05T00:21:38.638226Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.619872Z","title":"Proceedings of the 2017 ACM on Web Science Conference , pages=","venue":null,"work_id":"d24f835c-cb30-47f5-85ae-62e2e694d971","year":2017},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.817226Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:4cd23befee1a17939364e44f92a10cf7d122da8724ef4acfe3ffafb06e084370","observation_id":"4eb743ab-77b2-4a1d-a584-fc15eeb46faa","resolution":{"observed_at":"2026-08-05T00:21:38.624611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.606672Z","title":"2016 IEEE 16th International Conference on Data Mining (ICDM) , year=","venue":null,"work_id":"3bd0643d-55ec-4e9d-a82f-fbad1abc54e8","year":2016},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.820926Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:251af2b0990ca22e3b1a2e60b053c5ccc2f0e165425f52282c3477efee8584d2","observation_id":"0d1bdcee-7094-4937-b268-bf2926c2c7bc","resolution":{"observed_at":"2026-08-05T00:21:38.611224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.592901Z","title":"NPJ systems biology and applications , volume=","venue":null,"work_id":"0526ad12-e752-4101-ac25-4f269ea95991","year":2020},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.824652Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:3402d15f666b5557e7ca8a0d86f9e317a0b1e14cb4683967af850511e903980f","observation_id":"259ee45b-7305-4f70-8f91-1a270633078a","resolution":{"observed_at":"2026-08-05T00:21:38.597879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.578715Z","title":null,"venue":null,"work_id":"b63e8e01-1c2d-4579-b617-dda4044fc363","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.828509Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:e0102a0cc0cf0733afaf845ecd7bdb7c1365d5753e4f0b5e5d364fa4ae5b0f84","observation_id":"d32315ae-8fd8-4d55-b109-177df792ca33","resolution":{"observed_at":"2026-08-05T00:21:38.583950Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.564882Z","title":"Proceedings of IEEE computer society conference on computer vision and pattern recognition , pages =","venue":null,"work_id":"21b65f8f-5ef7-4f24-a2f7-fad57a8d88e8","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.832233Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:dbec209250595fe299b7f0df292961acb288f551e4ff0fb1a76367636a00ff06","observation_id":"ff300201-d90f-457f-8777-b9ebeb95f956","resolution":{"observed_at":"2026-08-05T00:21:38.569317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.550948Z","title":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , pages =","venue":null,"work_id":"f6e02d0c-74fa-4c1d-bfbf-c63694a0720e","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.836212Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:604b9a028bd169b77953eeacb80ca7146189b85a4f44b84dfebb32e47f301520","observation_id":"69a456f6-0d0c-40a6-9ac7-9c3d74ddd070","resolution":{"observed_at":"2026-08-05T00:21:38.555256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.536528Z","title":"and Liang, Yuxuan and Sun, Changsheng and Li, Xinke and Rosenblum, David S","venue":null,"work_id":"6ff4d9ea-8265-469b-b9bb-d69ff33d7839","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.840169Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:25ebb5ae3245d9bb249f4daa57d7f8693dc0e0d204aac40089118a943a8523f5","observation_id":"95f92d99-aaae-4457-81b9-a05dd6d45f44","resolution":{"observed_at":"2026-08-05T00:21:38.541106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.523013Z","title":"and Lim, Andrew , title =","venue":null,"work_id":"c92dd793-0305-4eea-9d0f-9acfc7ac1e15","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.844821Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:8cb046e6f23006ea6520605d39061706299e96e07e1b743cbca06071be1c1aba","observation_id":"cab8ad6a-5479-4ae4-b06d-f059aa1dcd32","resolution":{"observed_at":"2026-08-05T00:21:38.527184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.509322Z","title":"and Zheng, T","venue":null,"work_id":"176945dc-a423-4918-8d2c-79abc6076c32","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.849141Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:32ab61a74516721753307933b1448846b07ccaaf1093d5d9f842f66429683918","observation_id":"e9491a03-0918-4ced-8a1e-05f9e5d1bce6","resolution":{"observed_at":"2026-08-05T00:21:38.513781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.495463Z","title":", title =","venue":null,"work_id":"d43fef74-8941-495f-9563-b0d27bfdc5f6","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.852947Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:506ce8cdbf011d3cb57d581c032de22efcc7664a8dd0dcca567cfc8f02cfe05b","observation_id":"13f07f0c-959b-46bf-b39c-d3bda24ccc9b","resolution":{"observed_at":"2026-08-05T00:21:38.499814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.482031Z","title":null,"venue":null,"work_id":"e0237052-321c-4c44-b266-9f73e8d2dcc2","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.857350Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:d5986305164bcafd63c2d435d2c40d690457c132b240d8ef4aad158fc6957cdb","observation_id":"3519e0de-0394-4a97-986d-b59b5ffd8b0f","resolution":{"observed_at":"2026-08-05T00:21:38.486607Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.468347Z","title":null,"venue":null,"work_id":"b8e7e0ea-a907-4b77-beb4-7f364f2a371a","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.861528Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:db562cb58f93133068808427ab20ad8a302cd92f082fa487676c4c74f7a3cd82","observation_id":"46b65176-a750-4703-b83c-699da1f6d1b4","resolution":{"observed_at":"2026-08-05T00:21:38.472902Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.453920Z","title":"ArXiv , year=","venue":null,"work_id":"fe207055-49f8-4e34-97c5-c4dd154cf189","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.865321Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:31063f13b269222aad8de4c8c1970191ba7528bb4e92722e229464580db4e59f","observation_id":"9d9496c9-a151-46a9-8c3a-a3af1c819345","resolution":{"observed_at":"2026-08-05T00:21:38.458610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.439693Z","title":"Proceedings of the Web Conference (WWW) , year=","venue":null,"work_id":"d60e9998-03b5-46cf-9329-5a18bd156145","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.869805Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:e6dba990949cfa777c644a01bb8b56d8bb8e96b3397b3114f84915094571dc9b","observation_id":"4fbb2649-a696-49c8-9519-172dfef2fd6f","resolution":{"observed_at":"2026-08-05T00:21:38.444152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.425381Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , year=","venue":null,"work_id":"dced8356-83d8-4c69-83e2-b2385044fa0f","year":null},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.873801Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:61054be6d9563f0e7b0109450826d4c785559831c1e33daa9ca8797184b089c8","observation_id":"c591b3dc-621b-47fb-a302-26f68b3c4641","resolution":{"observed_at":"2026-08-05T00:21:38.430352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:21:38.411689Z","title":null,"venue":null,"work_id":"6006a2ac-ad36-4e99-9a69-e43810483d28","year":2018},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.878543Z"},"links":{"citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:8cb52019e572d7b9f43faed4ba05e26e2adb22df785d8389f23dcfe7edac837f","observation_id":"1c746d7c-a278-4387-bfa0-b90b7fd517b5","resolution":{"observed_at":"2026-08-05T00:21:38.416199Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":58,"verified_exact":0,"verified_fuzzy":41},"total_outbound_references":124},"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 10 August 2026, this Paper Citation Record lists 100 of 124 outbound references and 0 inbound Pith citation observations for arXiv:2608.00836."}