{"as_of":"2026-08-19T14:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88707de56005e58752b2643daced1084caef0c0826ace0dfe3c6e715c02387a4","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:38:36.111447Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2505.00983/citation-record","integrity":"/paper/2505.00983/integrity","json":"/paper/2505.00983/citation-record.json","paper":"/paper/2505.00983"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:38:37.086927Z","title":null,"venue":null,"work_id":"bdb47365-11ca-4bd4-8115-9129142721df","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.670107Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:d29371b43842cb9182d3f44457988b6b15b0070807897658f578eea3c2117406","observation_id":"11aef215-6567-4d6d-9ca1-af2c77c99543","resolution":{"observed_at":"2026-08-16T04:38:37.092341Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.471763Z","title":"We default to using AUC and AP in the evaluation of the link prediction tasks, and ACC to evaluate the predictive performance of node-level tasks","venue":null,"work_id":"0254798a-9ab2-4b7b-8cc6-ae3d72a4b4f7","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:36.094023Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:ba09d35635b0eab4ba4ac1a0f3d907f72fe6fca275ad3c541dfcf960c059e9dc","observation_id":"7b3bfa74-4342-44ec-8423-2309128babd8","resolution":{"observed_at":"2026-08-16T04:38:36.510707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:37.104380Z","title":"The circle represents a special topology where a node can walk back to itself, and its existence will alleviate walk interruption","venue":null,"work_id":"79a30b4f-d630-47af-9fae-8850fa723f2a","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.664738Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:905d266c3a7e8fdcdaf17c371c62e87942ccb4dce4dea540c0e780a542cdd9aa","observation_id":"0bf01b89-dfdd-43eb-bf20-c99006020416","resolution":{"observed_at":"2026-08-16T04:38:37.160538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08274","last_updated":"2023-12-06T06:38:01Z","snapshot_observed_at":"2026-08-18T19:44:41.571978Z","submitted_at":"2023-06-14T06:24:58Z","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.08274","snapshot_observed_at":"2026-08-16T04:38:35.433422Z","title":"Why using either aggregated features or adjacency lists in directed or undi- rected graph? empirical study and simple classification method","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.433422Z"},"links":{"cited_paper":"/paper/2306.08274","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:70d3dec58231628245970e3b953aa090d419c715f2fe3c396ade647a4ec3712b","observation_id":"aa4c761a-6e50-448c-b07a-25c1ad7154ad","resolution":{"observed_at":"2026-08-16T04:38:35.433422Z","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-16T04:38:36.453830Z","title":null,"venue":null,"work_id":"d89ed358-04ac-47cf-b2ec-5603c321f2f2","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:36.099258Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:5186fa148ca4fbbd41a5e625267d8f8410c73de07071762a0911e213240d7670","observation_id":"e32e87d1-4523-4a24-9bd0-291ce7b60e78","resolution":{"observed_at":"2026-08-16T04:38:36.459016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:37.253240Z","title":"On evaluating the donsker-varadhan i-function","venue":null,"work_id":"0acec4b9-38ef-4582-8516-ee9e0c27fd1a","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.534308Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:56050f8110d4fd3a7d670ac45eca6f052dff738b60a5fb7911aef5c10ed9ddcd","observation_id":"5c623f6e-82e8-450a-a503-c6fed877aeb3","resolution":{"observed_at":"2026-08-16T04:38:37.350739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.374202Z","title":null,"venue":null,"work_id":"e48d8c7e-e6b8-4282-8792-724aaac78c02","year":1979},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:36.111447Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:a612d522279bf1d5f8fb63c2491ff48db650c72497ea7b2dbd1d498335b6145c","observation_id":"1e30c03d-7ff3-4c6d-9a26-81fe4e1f8aab","resolution":{"observed_at":"2026-08-16T04:38:36.419932Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13970","last_updated":"2020-04-29T06:19:10Z","snapshot_observed_at":"2026-08-18T19:34:16.922748Z","submitted_at":"2020-04-29T06:19:10Z","title":"Directed Graph Convolutional Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13970","snapshot_observed_at":"2026-08-16T04:38:35.545594Z","title":"Digraph inception convolutional networks","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.545594Z"},"links":{"cited_paper":"/paper/2004.13970","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:961f781dde49de8b99c60679d09b779c86085eb6c7e455950ef1f065583347b6","observation_id":"ba476ac0-3b79-42e1-b70a-f90506f2db70","resolution":{"observed_at":"2026-08-16T04:38:35.545594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04987","last_updated":"2024-11-21T15:44:38Z","snapshot_observed_at":"2026-08-16T14:54:09.889474Z","submitted_at":"2023-10-08T03:17:22Z","title":"Data-centric Graph Learning: A Survey","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04987","snapshot_observed_at":"2026-08-16T04:38:35.551019Z","title":"Data-centric graph learning: A survey","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.551019Z"},"links":{"cited_paper":"/paper/2310.04987","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:7913d49509d85301a3b360ffd90fd3880a65b72b18f0473f20ce83f2e4034652","observation_id":"4c3cd711-f5c1-4e9b-984d-6a34fd6ab5a5","resolution":{"observed_at":"2026-08-16T04:38:35.551019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07082","last_updated":"2026-04-18T08:18:16Z","snapshot_observed_at":"2026-08-02T07:00:41.767213Z","submitted_at":"2022-02-14T23:07:47Z","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07082","snapshot_observed_at":"2026-08-16T04:38:35.648073Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.648073Z"},"links":{"cited_paper":"/paper/2202.07082","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:d3d05aead4476d04126393b86d3ce696bbcc7680546ea8626cab5f539e55a27c","observation_id":"6f45c8fb-c7ea-46c9-930a-4b30835591d5","resolution":{"observed_at":"2026-08-16T04:38:35.648073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10979","last_updated":"2023-09-20T00:40:13Z","snapshot_observed_at":"2026-08-17T22:15:40.122056Z","submitted_at":"2023-09-20T00:40:13Z","title":"Towards Data-centric Graph Machine Learning: Review and Outlook","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10979","snapshot_observed_at":"2026-08-16T04:38:35.653423Z","title":"W.-C., and Pan, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.653423Z"},"links":{"cited_paper":"/paper/2309.10979","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:387d8f6fb0e07be690770b4ae119e10fbc5d632012a9b471e47a6dbf2618f63b","observation_id":"eb699482-0a3f-4fc5-93db-3489e627c79f","resolution":{"observed_at":"2026-08-16T04:38:35.653423Z","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-16T04:38:37.226619Z","title":"Outline The appendix is organized as follows: A.1 HKT Construction and Hierarchical Graph Clustering","venue":null,"work_id":"5eb69b20-6dea-4d61-b0da-586fb79ecd92","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.658458Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:06fb0fdc55b96465a5a5866f1dcec0b98a1b9b270ae4599b7d0aa07460463d0b","observation_id":"9510e75a-4304-44b2-a035-6c2e0e8e47fe","resolution":{"observed_at":"2026-08-16T04:38:37.232882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.960509Z","title":"The chosen activation function isσ(·) =− log(1 + exp(·))","venue":null,"work_id":"908dec3e-a46e-482c-84bd-ad17e3481a5d","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.680299Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:ad7a712f2a2f620c380c4fe9b0c4460cdb7397882800e89f953a556a4fabbf15","observation_id":"4629f36a-f774-4c7d-8ef7-25fb7c20cd93","resolution":{"observed_at":"2026-08-16T04:38:36.990858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.944054Z","title":null,"venue":null,"work_id":"76dd178f-7d7c-4071-9c19-c50ad2aa3c97","year":2005},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.756199Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:2d231e216e1239bae850e345bfe769d5ae2e81ef434fd943bcb637072fe9de55","observation_id":"6eeaf591-668b-41f5-b41a-31b5f2ecf1f7","resolution":{"observed_at":"2026-08-16T04:38:36.949286Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.853274Z","title":"Nodes correspond to tolokers (workers) who have engaged in at least one of the 13 selected projects","venue":null,"work_id":"1ea1b54b-5e39-413e-a6ab-94b054f80bf1","year":2023},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.918129Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:16216098c2c5d7b3abd750f2759f26afe372307848f5d6e3850a7938ce2626e6","observation_id":"24c3ccaa-17af-4771-8be4-74356086956f","resolution":{"observed_at":"2026-08-16T04:38:36.883659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.807969Z","title":"Nodes are connected by an edge if the words either follow each other in the text or are linked in the sentence’s dependency tree","venue":null,"work_id":"f9f0a00a-2847-4908-a5e9-cde44aefabca","year":2021},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.924916Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:748995bceb7bad09b6cb1f264380da5b21a373ffb4037cd1ca047867a174d683","observation_id":"2656bbb5-c567-4b26-9b6b-5eee3fe1b058","resolution":{"observed_at":"2026-08-16T04:38:36.813519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.789377Z","title":"Nodes represent various products, and edges connect items frequently bought together","venue":null,"work_id":"3a6b45e1-6c05-4032-b7f1-c18b25e76425","year":2014},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.930175Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:4a1016e6d1f441038f78f2bf737b7e0bd0688ce9c237e7ef3a483fa326ccd739","observation_id":"f25e4a79-3186-4e95-844d-31bb3194f27c","resolution":{"observed_at":"2026-08-16T04:38:36.794876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.772494Z","title":"Each paper comes with a 128- dimensional feature vector obtained by averaging the embeddings of words in its title and abstract","venue":null,"work_id":"2b0499a3-8470-4b08-ad16-9dad2643bc66","year":2020},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.935271Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:b105d2eda53eae36938e4998f0c79c31ebc65d09c3d8b7739c190e9b7b0755d3","observation_id":"c5fa52d2-ffdd-4eec-a85d-dd53de46bbef","resolution":{"observed_at":"2026-08-16T04:38:36.777493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.755074Z","title":null,"venue":null,"work_id":"71eac2f6-a5e3-4773-b267-1fc055515d19","year":2022},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.940453Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:4307389fa9fe56bbd9cfb21a92fafc5e013be9dab004c63148504eb9c38fd3a3","observation_id":"584cc6c6-6626-4752-adab-0338056e6201","resolution":{"observed_at":"2026-08-16T04:38:36.760748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.636081Z","title":"The descriptions of them can be found later in this section","venue":null,"work_id":"e0c2d1c3-fe12-4316-98d3-cd3f2d6e1731","year":2023},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.945520Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:4469caa1c8f881f2df4a1d8f282856dbea99b967fbb1f8356135264687603483","observation_id":"0b363412-16da-4bb1-a515-59dade157d8a","resolution":{"observed_at":"2026-08-16T04:38:36.685545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.617762Z","title":"This strategy provides better node representation capabilities and enhanced robustness when dealing with graph noise","venue":null,"work_id":"875872f1-4108-4bf7-863d-258e175dbda0","year":2023},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.950531Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:8dbed1610fe4d93acb76ecdc800ecf2c357096854423a6530611e525a9be3227","observation_id":"4b2e08a9-5a43-43a6-b7d0-887159014d8f","resolution":{"observed_at":"2026-08-16T04:38:36.624516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.598566Z","title":null,"venue":null,"work_id":"572fe458-8df1-4dae-95c7-7ae7c86bd6af","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:36.008084Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:6b51de57ab714b99f897c94a1476bb6cab8d6e00ba9e1ed0e197a9481a3baddf","observation_id":"a6ab5241-8594-44f1-8dc3-edce998f89f0","resolution":{"observed_at":"2026-08-16T04:38:36.604553Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.549798Z","title":"𝑝!\" 𝑝!\" 𝑝!","venue":null,"work_id":"7e04a8df-1c7d-4f54-935b-52d649e1837d","year":2019},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:36.088142Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:54e00f003863f349a4696fdf51b425bf1de0b8823f4c09cfe5b80a0a5a3414a0","observation_id":"db38fffe-5c06-41a0-9321-fcba6a24a8ce","resolution":{"observed_at":"2026-08-16T04:38:36.585889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:36.434298Z","title":null,"venue":null,"work_id":"b589400f-06fa-4735-83b1-06cbc20b1c62","year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:36.105573Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:148eecde3d7b64d1af17b7edb813f031cfa11ec95cea3960a5f3571a437f643b","observation_id":"a0b375a0-d595-44e4-8033-7a2fb0f8567e","resolution":{"observed_at":"2026-08-16T04:38:36.440749Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-16T04:38:35.539241Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":1948,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.539241Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:361d81d2e237eb73438651b3600b2200ed69efcf2381560633cd4e98a8c0889b","observation_id":"b265e227-6eef-4110-af4b-a3f3e2b44f4e","resolution":{"observed_at":"2026-08-16T04:38:35.539241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-08-18T19:43:02.506089Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-16T04:38:35.497921Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.497921Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:e0334d3cb284e035707cd81ba714130d645ecbcdccc849e8af3c32b977b6fc3e","observation_id":"646e9eee-239d-4f13-bfe0-e4fddd6c586b","resolution":{"observed_at":"2026-08-16T04:38:35.497921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.02846","last_updated":"2021-09-07T03:59:22Z","snapshot_observed_at":"2026-08-19T12:58:52.894545Z","submitted_at":"2021-09-07T03:59:22Z","title":"Datasets: A Community Library for Natural Language Processing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.02846","snapshot_observed_at":"2026-08-16T04:38:35.349681Z","title":"V ., Jernite, Y ., Thakur, A., von Platen, P., Patil, S., Chaumond, J., Drame, M., Plu, J., Tunstall, L., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.349681Z"},"links":{"cited_paper":"/paper/2109.02846","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:3f5ee714b5cf243803ecec2fe50cb163e09d3eca1cc29a23177a6018839278f0","observation_id":"918e8620-4b0e-4d41-9263-0fe7a337a9b8","resolution":{"observed_at":"2026-08-16T04:38:35.349681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.06893","last_updated":"2018-03-28T18:00:30Z","snapshot_observed_at":"2026-08-14T19:44:21.730838Z","submitted_at":"2018-02-19T22:32:47Z","title":"Learning Word Vectors for 157 Languages","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.06893","snapshot_observed_at":"2026-08-16T04:38:35.266610Z","title":"Learning word vectors for 157 languages","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.266610Z"},"links":{"cited_paper":"/paper/1802.06893","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:0dfaf50ef597c4c75e386c971a6cc25ce20f5149930626d0caaccfffe29b8feb","observation_id":"0a5dbcf6-0e7d-4603-b577-90e75fb9d656","resolution":{"observed_at":"2026-08-16T04:38:35.266610Z","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-16T04:38:37.049933Z","title":"Here, we use F (·,·) to compute the dependency","venue":null,"work_id":"5540a345-9096-4603-bace-0e0ba515ad83","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.675136Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:e83d74d3ccbaa49e44bd60c8f45768a00232adfdd8154208b220115adf26129c","observation_id":"3ceb5bd3-7fb6-40c4-8b6b-a3cf0167d3f6","resolution":{"observed_at":"2026-08-16T04:38:37.072913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02232","last_updated":"2023-11-10T15:34:22Z","snapshot_observed_at":"2026-08-16T14:55:24.371322Z","submitted_at":"2023-10-03T17:42:09Z","title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02232","snapshot_observed_at":"2026-08-16T04:38:35.279243Z","title":"and Cremers, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.279243Z"},"links":{"cited_paper":"/paper/2310.02232","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:12e917c6fe0831ac54548e08410dcd27017d3a99227c66bbb4ec5e3b67e184a0","observation_id":"1e480345-0914-46cc-bd01-099ad372ad4e","resolution":{"observed_at":"2026-08-16T04:38:35.279243Z","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-16T04:38:36.925774Z","title":"The dataset consists of nodes corresponding to computer science articles, with edges based on hyperlinks and 10 classes representing different branches of the field","venue":null,"work_id":"9a8e45f9-d664-4834-98fa-b67d15457fb3","year":2014},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.851397Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:5b7c02118bce6f0c991138a9c4e8436116d13f4a3740a45a6b158a84a0c345b5","observation_id":"a42f2dc5-bc61-4086-968c-4d78e5737f06","resolution":{"observed_at":"2026-08-16T04:38:36.932455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T04:38:37.364910Z","title":null,"venue":null,"work_id":"5a0de89b-10b6-4490-81b5-91a8da92efdd","year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.273684Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:344e72c72d9432f2752535f4ea7f7acf2f3dbfecaa6de1e3d0e8d6a9937124bf","observation_id":"dc3526b3-6ab0-49e2-9a45-83f58a836ca6","resolution":{"observed_at":"2026-08-16T04:38:37.370604Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05954","last_updated":"2019-12-25T15:09:28Z","snapshot_observed_at":"2026-08-03T14:19:33.322839Z","submitted_at":"2019-11-14T05:55:17Z","title":"Hierarchical Graph Pooling with Structure Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05954","snapshot_observed_at":"2026-08-16T04:38:35.557025Z","title":"Magnet: A neural network for directed graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.557025Z"},"links":{"cited_paper":"/paper/1911.05954","citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:faa6a4ee93c89d63c1522e1cce4d0ffef0af91cd7049b73fbfa705f034189f5f","observation_id":"d99a13a6-5f4e-4bf9-850c-9188645b902e","resolution":{"observed_at":"2026-08-16T04:38:35.557025Z","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-16T04:38:35.426711Z","title":"URL https://github","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T04:38:35.426711Z"},"links":{"citing_paper":"/paper/2505.00983"},"observation_digest":"sha256:4759e936f55878a95120584e8cdd280e6c6e70fa049aed3c2b9559f3d97d9d97","observation_id":"2f71c064-cb35-487e-9a57-13a84be783b2","resolution":{"observed_at":"2026-08-16T04:38:35.426711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.00983","last_updated":"2025-05-02T04:06:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T19:40:43.897510Z","submitted_at":"2025-05-02T04:06:00Z","title":"Toward Data-centric Directed Graph Learning: An Entropy-driven Approach"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":34},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2505.00983."}