{"as_of":"2026-08-18T01:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:004fbdd862a0cacbc175b68bde81a2c7d4a78ba251958e08c50b44e7c678b4b9","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-17T06:30:58.91139+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-17T22:17:18.284406Z","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:cce74ac5e8d5b453aee7aa365e98d2181f08fc2dee9dbc570d7e859a8fd33185","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:0156a79d31d0f2022554a7aea2bada5fa489ff9417e98a4e5a642c0f4cc2cb0f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:5dc9823804355c8b25569fe31a10bbf393776539b2b28ed807ee79f639142d82","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:24:04.806758Z","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-17T22:17:18.284406Z","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:899ad84e51b44a6d885e3b53895dfd1080b8dbed4dbbd3f34b1a987c854cd2e4","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-17T22:17:18.284406Z","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:573ab80688c3d4f09b4fceb65a7d8f6617c47c9a93175ccf653800cbc0720ab5","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:06e85311ccb8411a997922499813728753a5cc13e453e013173288307ecfdb25","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:df2f53eb76e7e34341a7d89448d9f05094aafbcc77702607e527f252c70a6825","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-13T22:52:47.376469Z","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-17T22:17:18.284406Z","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:fe2c2b2eb2bb514ae3946cd6b95004eae447837b7feb7d17625d5d8067d46cf8","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-17T22:17:18.284406Z","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:2b6289eb6f13c7db8c87407162c454d3a769211bf8c7855dd6531ff18ad0591d","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-17T22:17:18.284406Z","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:509a263c57204ed848737fb35d947fd02bc51895dd759d422b1cb90cadcfd37a","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-17T22:17:18.284406Z","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:a9c285151a4978e50ac81419fbfa121f8e5074d103958f4909271974c49a9f9e","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-17T22:17:18.284406Z","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:97db9401ed56a82bc46c0a4722a6a73aa11f1d451b2cbd30cdb303d35005bff5","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:8552ccd07bd16716ce189fe8e9f18da757970b7df0f5925a932166068b11c8a0","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:e033cdd637d19355fe8e367002cf9054c0ea299ef74172d096d5b79a240c6dc3","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:31fc4d290db4ee674c948357f12a4ab90dd8478ef8132ce5442837b7f65d3015","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:544789ae566d1c00fa4ca6633b10ed701609f39c28ab259f0b721dc142350d73","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:233eb308d3430644bfbfdf5e2d6a6a38fa08f98f787813d3b918a8ec193f64eb","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:0068d6126438f10c9d146b7fd35491671eb357e035da8693730ec6a0b81f2688","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:d5023ff4d7ba65c9f9e4991e763b1fee27c5902f7305d2eafbe2763cc68e192f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:130ffbbd81dc26a8f4dadd5c9fab28d394e959d8495274d3b299c58ba9fb4f4f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:6e7666b42041c7c191c1f407ea3e818d90db376930e7b186742676838b020c71","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:b0f487a973c8bf76c6838d58e20acae8c2afabbad376277c434034145486464e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:809e3707c15aeb260f62c0c1259e9d1ce8c16e9457d5b003a4cc8ac1ab41ca4e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:a47e6b3962dddfbd9b7fee51046bf16f066d60e4a041b520afba8c2fa7e49b91","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:dac337680719c3abc50d1ec5d8412c5548ab1f1989326ce76633c1b5cd4f593a","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-09T07:12:13.529182Z","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-17T22:17:18.284406Z","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:38e78ec8e3ef1786e78789f067d6f725a5421cb6746d24c9ea575f25589fb74e","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-16T17:58:25.845387Z","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-17T22:17:18.284406Z","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:44e36ec9291b9466e18fe300a00c53bfb456cd497dc668aaee2d135c80e4d87a","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-17T22:17:18.284406Z","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:0087d539f566999cc2133ff84883c6150edace822fe002f28d6b768ae2602901","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-17T22:17:18.284406Z","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:0d46c195668275236a169fc88728d05ae94d0ff74d91148ca361a4667d5d4c5a","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:22a62f2557853f820ee4adadd4112b5fc04c1c8eaf6c60babe3cd2a131da314a","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-17T22:17:18.284406Z","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:db71195c8889d9652c70ab7b8949e075d4257d46b3f98fda28b1e39ed95424da","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:410d922723736179a06f8ddc341c769d11ae07d5ae97c8dac22387c42872037b","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T22:17:18.284406Z","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:184882160296a44e484f825bce1891a7159f5c2a2307cbec265d1f43a417bfcb","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-17T22:17:18.284406Z","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:f3f690ef81a7094309de019cec3beae7d3208879f294010465290b58b470af09","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-17T22:17:18.284406Z","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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2505.00983."}