{"as_of":"2026-08-09T17:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:127f9dce3e57659108b9f90e7d8005d4ae03ca8da77d5568e68ea66c3632e57e","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:43:41.146034Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.15195/citation-record","integrity":"/paper/2507.15195/integrity","json":"/paper/2507.15195/citation-record.json","paper":"/paper/2507.15195"},"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-06T15:43:48.177021Z","title":"Controllability of structural brain networks,","venue":null,"work_id":"c1b3aac8-434a-4518-8690-a072e48963f9","year":2015},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.036929Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:187a1ae3fff4dc0d5742f9769f451157ba4ed8d46b6f934a7c408eb9c71573d7","observation_id":"017355c9-2464-4dc1-b2b7-4bf7bce8f86a","resolution":{"observed_at":"2026-08-06T15:43:48.237370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:47.921552Z","title":"Friedland, Control system design: an introduction to state-space methods","venue":null,"work_id":"2b8bbc7a-1696-4092-bd7d-05aa55b91922","year":2012},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.116326Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:05907e1815d65c844658b69a5f8fc03b9ff52ff621b42ed7f11236a913769963","observation_id":"022729a8-21ab-420b-a85f-6df4fe5995e7","resolution":{"observed_at":"2026-08-06T15:43:48.041730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:47.732790Z","title":"Controllability metrics, limitations and algorithms for complex net- works,","venue":null,"work_id":"1f700329-744b-48ad-b5b3-3caae902537d","year":2014},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.195292Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:e09be7336bca84622907c37103d4cf33685179ad2d84feec49a4fdab11f4d7b6","observation_id":"f89d2517-f949-4b35-b5de-4a0c318076a9","resolution":{"observed_at":"2026-08-06T15:43:47.800301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:47.629548Z","title":null,"venue":null,"work_id":"d37ecf32-ae83-47fd-bf92-a7a8a67766be","year":2020},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.256401Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:829938148f74380d35176076116a93a16e18339024dbe91978a6b7bc06f8645c","observation_id":"e7da472b-7c47-460d-a3ea-a828f1658c72","resolution":{"observed_at":"2026-08-06T15:43:47.651105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:38.336533Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.336533Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:5548b7c356dc0ea588cbcb75ff440fcb1a0ebcef13e6ae3ff958586f25136887","observation_id":"a8a29f7b-014b-4e97-8d29-13a4fba433b9","resolution":{"observed_at":"2026-08-06T15:43:38.336533Z","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-06T15:43:38.385024Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.385024Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:250af64f6822cdebb14e0abd854ea9a9e64953c2a759705e32db357f59a1a1d1","observation_id":"826df278-1c43-449e-9a8b-e499ea13b828","resolution":{"observed_at":"2026-08-06T15:43:38.385024Z","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-06T15:43:47.385558Z","title":"How powerful are graph neural networks?","venue":null,"work_id":"c0437ee0-989d-483e-9d2b-d02c6b657c05","year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.431181Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:c9b3ea4ef4f02d47dd1b3ce41fed2ad0331c91de8aec8092a2173bbd2cb580fc","observation_id":"71bcb869-af50-48c7-8415-31ee8782dc44","resolution":{"observed_at":"2026-08-06T15:43:47.486460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:47.174270Z","title":"Contributions to the theory of optimal control,","venue":null,"work_id":"2f1b5047-9503-46b9-b52c-df471500f0e7","year":1960},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.503146Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:9fa1c56694632ced67535339a755262af1d95d1d6d3e57daf3a5f7829a74ba54","observation_id":"d8f48e11-6599-40a2-9b5e-2a1b1f740232","resolution":{"observed_at":"2026-08-06T15:43:47.245213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:46.935963Z","title":"Diffusion improves graph learning,","venue":null,"work_id":"151ac1d0-ccbe-4130-a8de-62a528fe97cd","year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.580275Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:884389c5c61dd38f95b61d0276427062e75729b1223969694e408a9674faea1f","observation_id":"740b7c8d-e81f-433b-9166-22a55ffadfcc","resolution":{"observed_at":"2026-08-06T15:43:47.029380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:46.737710Z","title":"Centrality in social networks: Conceptual clarification,","venue":null,"work_id":"0dda9600-dd43-4c9a-bda1-338903f30c17","year":2002},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.638122Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:db325327d10af255b3e009c1d297735e489ddb8b1f5c883c124aad8394d6c1ef","observation_id":"e7ff547f-0dd0-4973-a1f0-4e8c5e9f2b15","resolution":{"observed_at":"2026-08-06T15:43:46.825756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:46.522913Z","title":"Network controllability in transmodal cortex predicts positive psychosis spectrum symptoms,","venue":null,"work_id":"ba0afeea-edc8-4017-8da5-f03d4c387404","year":2021},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.716332Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:0a2ce3a0523e79e9a77a295715c13c334ba6440dc5f5c5141b99356d856e421f","observation_id":"0892778f-e412-4ea7-af8c-4095804a2982","resolution":{"observed_at":"2026-08-06T15:43:46.607274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:46.345287Z","title":"Improving graph machine learning perfor- mance through feature augmentation based on network control theory,","venue":null,"work_id":"e7a93645-4d74-4b99-a9d6-ee1360488696","year":2024},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.780637Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:71e2cbd5238338fbb7c5939c50116b23a72f008e85b1a4c50b6856061127d50a","observation_id":"599fa0fe-e69d-4c22-bf4c-cc5a6450d41a","resolution":{"observed_at":"2026-08-06T15:43:46.436395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:46.154214Z","title":"Network controllability perspectives on graph representation,","venue":null,"work_id":"ca29f257-1167-430b-a03c-f29cc7063118","year":2023},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:38.907571Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:c5561fae1ac8c905e673564422d5be3cf9ddef84c17bf8a142d462835621be28","observation_id":"cc857a7f-93e0-40fe-ba37-3df00f444580","resolution":{"observed_at":"2026-08-06T15:43:46.267109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:45.953905Z","title":"Using network control theory to study the dynamics of the structural connectome,","venue":null,"work_id":"ad2b9968-6e49-4950-9820-3334f71b491d","year":2023},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.037344Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:7c02e751f74c60f5bf49f2e17cc388638415a4edddece70c1b27401e615e9be1","observation_id":"1ac67e6e-9fb6-430b-be0f-efe14a3ac429","resolution":{"observed_at":"2026-08-06T15:43:46.024938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:45.731650Z","title":"Linear dynamics and control of brain networks,","venue":null,"work_id":"a5563c6d-2f28-4b6b-9575-9150c7765396","year":2020},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.138989Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:958308fa2f81271addc7f285ade6d34d7db2e71a2ae1db9dbb400735625e913c","observation_id":"66615ebb-f914-4286-9d27-39c9c86c49e1","resolution":{"observed_at":"2026-08-06T15:43:45.847369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09708","last_updated":"2025-04-17T09:27:02Z","snapshot_observed_at":"2026-07-06T19:32:28.772012Z","submitted_at":"2024-10-13T03:34:19Z","title":"Control the GNN: Utilizing Neural Controller with Lyapunov Stability for Test-Time Feature Reconstruction","version":2},"cited_work":{"arxiv_id":"2410.09708","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.09708","snapshot_observed_at":"2026-08-06T15:43:41.374732Z","title":"Control the GNN: Utilizing Neural Controller with Lyapunov Stability for Test-Time Feature Reconstruction","venue":"cs.LG","work_id":"c89580db-f823-451d-bf36-45d85fa54223","year":2024},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.250994Z"},"links":{"cited_paper":"/paper/2410.09708","citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:c8b65ede730265f869f19b0607d38913b1beaf7967adb218911d5bb094b1b7d2","observation_id":"8113f451-3553-4647-a393-7e9ed3ba477c","resolution":{"observed_at":"2026-08-06T15:43:41.474538Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:45.567249Z","title":"A survey on graph kernels,","venue":null,"work_id":"158b9513-600d-4e31-8bd8-dff9dc5bd2bf","year":2020},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.353284Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:1eb334d35a1beb925d23c05541f701464d547fdbb51b592cac54e6d3662df64a","observation_id":"c5e13e97-ddf2-4f33-9797-1241e08ce75f","resolution":{"observed_at":"2026-08-06T15:43:45.627228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:45.366321Z","title":"Wasserstein weisfeiler-lehman graph kernels,","venue":null,"work_id":"1b4576bd-4ab8-4e9c-a100-0b39882a2493","year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.448851Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:4e5a5c5fb298901476302e8f0c971a7ec65d85a40e855df049d4a193929fb735","observation_id":"988b2520-eefe-4141-bb8e-acfea5be827d","resolution":{"observed_at":"2026-08-06T15:43:45.461568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:45.178892Z","title":"The multiscale laplacian graph kernel,","venue":null,"work_id":"e3631b97-39d0-4457-8795-1af580aea36f","year":2016},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.586940Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:618716ebefca7f98e61f5366890fa89211ae863e4a69d82af2721c392a473699","observation_id":"434f565b-4f66-4061-aadf-e288f395473b","resolution":{"observed_at":"2026-08-06T15:43:45.240177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:44.977891Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering,","venue":null,"work_id":"6b1bdb39-3237-4219-be4d-fb8cb2004382","year":2016},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.754663Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:403aa09779846e99fcb0f8b60973e3f6cebb4c5045c5707beb7533f6eff10662","observation_id":"c9167eb4-6914-4d05-a407-1854dd332b44","resolution":{"observed_at":"2026-08-06T15:43:45.073882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:44.766423Z","title":"Spectral networks and locally connected networks on graphs,","venue":null,"work_id":"8bee854b-7d32-49c4-a65e-fa3387e6aeed","year":2014},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.846882Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:7f0871eaea0ec08dc268142ed593e2794c81a99ca592ce9a9b8bc7e74902580d","observation_id":"7c9eba34-48a6-4d28-a1c9-d99834ae8ef0","resolution":{"observed_at":"2026-08-06T15:43:44.851613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.07553","last_updated":"2018-04-24T08:19:32Z","snapshot_observed_at":"2026-08-09T01:06:08.452911Z","submitted_at":"2017-11-20T21:28:40Z","title":"Residual Gated Graph ConvNets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-06T15:43:39.918665Z","title":"Residual gated graph convnets,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.918665Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:4f5d7a33addcbb5cc30d7914c7218a86dd1b47cb27ea11b4608d32df098053c5","observation_id":"4d567ec1-df01-48d8-9ccc-4da735b3ae45","resolution":{"observed_at":"2026-08-06T15:43:39.918665Z","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-06T15:43:44.554676Z","title":"Graph attention networks,","venue":null,"work_id":"c7ed90f0-a64a-48fb-a682-fe3e6c6d666a","year":2018},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.981552Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:e562df90793891ddae12ce0475ff81e59eddae6a0ec120ab067a555258881a99","observation_id":"b3d706e8-e4cb-434f-8168-cc9e33829344","resolution":{"observed_at":"2026-08-06T15:43:44.646509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:40.046716Z","title":"Weisfeiler and leman go neural: Higher-order graph neural networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.046716Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:b6749aafce82447e1ff7b45a1cb5a13bc3e40b9d2921060883f9cc88fbdc3e62","observation_id":"10693b33-7e36-455d-8ddd-561bffad2fac","resolution":{"observed_at":"2026-08-06T15:43:40.046716Z","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-06T15:43:40.111096Z","title":"Graph transformer networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.111096Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:33b4c682088c8dbec002d38d5880745c419ff89db42447314aa2e4c509e5bc46","observation_id":"800195ff-c282-405c-ad58-b69ab56f4b81","resolution":{"observed_at":"2026-08-06T15:43:40.111096Z","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-06T15:43:44.304592Z","title":"Hierarchical graph representation learning with differentiable pooling,","venue":null,"work_id":"39bb70bf-770b-414f-b453-756d2592713b","year":2018},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.176017Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:1edd654b54c2ae83063b6649e5deb27a5595ea9db15167ac5484bf826ecb2f66","observation_id":"d64b13cb-22f6-43eb-a69d-70945a5db4c1","resolution":{"observed_at":"2026-08-06T15:43:44.414249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:44.098296Z","title":"Edge contraction pooling for graph neural networks,","venue":null,"work_id":"22055c02-a6fc-4210-a9ba-ef2a22e08ae4","year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.251228Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:4e914d648a0269b6676a725922cbf48a2aac7206d7154a5a786dec77cd27a2c0","observation_id":"fa298d5a-7e81-467e-b177-56d2f235ccd2","resolution":{"observed_at":"2026-08-06T15:43:44.184824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:43.849295Z","title":"A comprehensive survey on graph neural networks,","venue":null,"work_id":"05ee803b-4455-4f65-812c-fd55d7356d17","year":2020},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.341480Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:7527e6da09b90ab7523d2c906dea1752b1f47ff9725385e2671fdbdb3f265bdc","observation_id":"29c92829-bbf2-4b8a-9a8e-51a86c193db7","resolution":{"observed_at":"2026-08-06T15:43:43.998361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-09T14:08:49.737311Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-08-06T15:43:40.385675Z","title":"A simple yet effective baseline for non-attributed graph classification,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.385675Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:9b4fea763b2218042539dcafe92efd21dd74b7e280da1963c66b13ff6a82b18c","observation_id":"13727764-0883-44b5-9cf8-9ef139f37eca","resolution":{"observed_at":"2026-08-06T15:43:40.385675Z","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-06T15:43:43.643921Z","title":"Attention models in graphs: A survey,","venue":null,"work_id":"583ba381-5071-41b2-b914-78285eb9926d","year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.456939Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:8699d9a87d16ac7aab3bee51a739c09b19051ce3c1e97ccd2c03d4f901ebc693","observation_id":"40a8eb8b-0f9e-45de-a8bc-b5f2c881f7d4","resolution":{"observed_at":"2026-08-06T15:43:43.734870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:40.503338Z","title":"Laplacian eigenmaps for dimensionality reduction and data representation,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.503338Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:ed9b843e7041ffe8cad372ff2304cb319a7b0fc996fec69f6c68079dc22f96de","observation_id":"83a9321c-c4b6-4833-b0b7-e41044322e89","resolution":{"observed_at":"2026-08-06T15:43:40.503338Z","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-06T15:43:43.480557Z","title":"Benchmarking graph neural networks,","venue":null,"work_id":"28d7855d-91c6-4b6e-87bc-ffbca2185bb3","year":2023},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.558384Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:5adcf76794500c6dd26ccc6ee190ce3ad0bce25c19a874562c7559e2144794f5","observation_id":"eba0ee09-d4e0-46be-bd8c-3a65feab6ff7","resolution":{"observed_at":"2026-08-06T15:43:43.544468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:43.266966Z","title":"struc2vec: Learning node representations from structural identity,","venue":null,"work_id":"5f632d68-df00-449e-bac7-28cd5bd8177d","year":2017},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.622234Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:55e312f1b2576802cea71e4da65dd1ed24b4c891eba223e5e4ef045de680407b","observation_id":"5de4c936-a1a4-48b9-aea7-fed8a9dfd771","resolution":{"observed_at":"2026-08-06T15:43:43.354325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:40.683380Z","title":"role2vec: Role-based network embeddings,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.683380Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:1600a035cf4326c5f441227f4ba2034d4aa64dbfddaec6e382d0e5f001ccd13d","observation_id":"073358b1-8af7-4197-9416-54148a8c8814","resolution":{"observed_at":"2026-08-06T15:43:40.683380Z","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-06T15:43:43.058737Z","title":"Learning structural node embeddings via diffusion wavelets,","venue":null,"work_id":"f9617e50-6269-41f1-93b2-f3644cbe9233","year":2018},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.738461Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:dd9022617cf91eb177000949d1286bab13aae0f0e98811c17e02bab2c04b68f6","observation_id":"dd4bd52f-01c0-4b72-a488-db7bda048007","resolution":{"observed_at":"2026-08-06T15:43:43.143095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:42.860688Z","title":"A unified view on graph neural networks as graph signal denoising,","venue":null,"work_id":"4e974668-850e-431d-b2dd-2f1878908cce","year":2021},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.807665Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:ea4cf860a38a49938519a7bdf934f4747ad610dbf8075c30a8920769541411f4","observation_id":"80b55cba-8147-4210-b8d2-15aa451a81fc","resolution":{"observed_at":"2026-08-06T15:43:42.961088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:42.712418Z","title":"Control-based graph embeddings with data augmentation for contrastive learning,","venue":null,"work_id":"b4822eb8-d0e8-4b58-bd0f-c5553a9a0128","year":2024},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.899359Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:0d5f3499f5664b55a360fae4dd3e0dd325e88c1fcbb0b42fc144b10223c38fc5","observation_id":"4558c9dc-7a02-4c8e-81b2-2c177e757385","resolution":{"observed_at":"2026-08-06T15:43:42.794775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:42.436590Z","title":"Social network analysis: Methods and applications,","venue":null,"work_id":"83daf96e-a726-477d-8253-2af8eca07abf","year":1994},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.983095Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:da0f44982aed5936b7a93ec003df9c60425a97753f8873a3a40c714015649380","observation_id":"0193dfe5-0c2a-44fb-b7db-73cda9d49bfa","resolution":{"observed_at":"2026-08-06T15:43:42.589795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:42.199249Z","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs,","venue":null,"work_id":"21ecb6fa-51ba-49de-8e93-2c4776617093","year":2020},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:41.063103Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:3b19e8f4b03d264a1e9ab1f1db01a3dd14299a8d97f4209f358c8c57c5395023","observation_id":"ceb1c0fc-851f-4908-b859-26cd18034e74","resolution":{"observed_at":"2026-08-06T15:43:42.312590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:41.849062Z","title":"Masked label prediction: Unified message passing model for semi-supervised classification,","venue":null,"work_id":"545b930e-1468-40b6-9c03-d5b0b0dcb47c","year":2021},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:41.085175Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:c85e8a7befab57c18decc4ed803d5d463cf23a71541f42147cb97dac3aeeaecf","observation_id":"3190c2db-034e-49c7-82a2-02011a8f6dfb","resolution":{"observed_at":"2026-08-06T15:43:42.054029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:43:41.625464Z","title":"An end-to-end deep learning architecture for graph classification,","venue":null,"work_id":"66baf0c9-e3fe-48e5-b0f9-935457e8f59c","year":2018},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:41.146034Z"},"links":{"citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:b89af8fa2864339cbeac813efe55b15b52e03296209124fcf24434c53f3d460e","observation_id":"2376c2d0-feae-4714-9cc1-f1aad96f9557","resolution":{"observed_at":"2026-08-06T15:43:41.743202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":31},"total_outbound_references":41},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2507.15195."}