{"as_of":"2026-08-13T00:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdb4b30a5a1a92bb4a53d532781eee875cc36fab8d04d99d8a85e755cf5d940e","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:41:10.269668Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.17062/citation-record","integrity":"/paper/2411.17062/integrity","json":"/paper/2411.17062/citation-record.json","paper":"/paper/2411.17062"},"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-12T12:41:10.716522Z","title":"Forward and reverse gradient-based hyperparameter optimization","venue":null,"work_id":"799a8df8-4aaa-477f-8ffd-9617dffc6936","year":2017},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.154838Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:f6f12e828a4746a9ab0f993f543efc67d73aa874008bcd03f9f527b8bb89f881","observation_id":"c7075ba5-f017-4eb8-82db-2e8d989209c9","resolution":{"observed_at":"2026-08-12T12:41:10.720878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.678929Z","title":"Semi-supervised learning with graph learning-convolutional networks","venue":null,"work_id":"3eb93dc1-0486-46c0-b903-f4a9cf4b11f7","year":2019},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.167535Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:0134143590b6635b9309c990fd8fd2e9a9db7afc4ded858139905c1eedca1d9f","observation_id":"0c757b18-ba20-4091-a716-279675ba8bec","resolution":{"observed_at":"2026-08-12T12:41:10.683134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.172240Z","title":"A survey of graph neural net- works in real world: Imbalance, noise, privacy and ood challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.172240Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:e1e52ed2308794aec441c2356294b0c2a124d1a251fc757f2f8c2e8cea2fef54","observation_id":"e8ab9a4b-d7de-442b-8ee3-86b6f430c1c5","resolution":{"observed_at":"2026-08-12T12:41:10.172240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-12T12:41:10.180398Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.180398Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:6f0e519469c00f0dc5301a4f0edf70004f4df441ac7318ab2b0787ae94e1c6cc","observation_id":"211fde89-31b3-41f8-b58b-c5347ce23a7a","resolution":{"observed_at":"2026-08-12T12:41:10.180398Z","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-12T12:41:10.645505Z","title":"Understanding attention and gen- eralization in graph neural networks","venue":null,"work_id":"a7edd39f-1ce6-4dde-a349-b6c281315fbe","year":2019},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.188844Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:2c97f3a1f51ac08cc1123076b86d417db4338800d9341504f24fab3d4efee532","observation_id":"809355e4-ddc3-4e26-862d-8f17aef9d5c2","resolution":{"observed_at":"2026-08-12T12:41:10.649709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.632912Z","title":"Adaptive graph convolutional neural net- works","venue":null,"work_id":"93c576d5-b9db-44fc-8ad7-3ccab6e338d5","year":2018},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.192813Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:b6647f9cb2eed35025f043b8d7f470aeddcbbc33933bbd43db86e427a19a876f","observation_id":"13303b79-3151-4d8f-b3f1-7e752583861d","resolution":{"observed_at":"2026-08-12T12:41:10.637211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.599674Z","title":"McPherson, L","venue":null,"work_id":"c437c4e6-01fe-4299-9bba-b15df8722fdf","year":2001},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.204989Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:1781ef85c31b762ec2829ad7dcf67869146ff140faae748dcde65969466a83e1","observation_id":"b52a4411-c2c0-47fc-a2e8-86c92d4d3ff6","resolution":{"observed_at":"2026-08-12T12:41:10.603666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.551492Z","title":"The graph neural network model","venue":null,"work_id":"470af609-8cab-4d80-b407-09b94b703d9a","year":2009},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.220655Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:9290cd3d0d5281294e2401747dee742c2d7f9dd9f3418defd9ff200b3de464eb","observation_id":"cb7e24c8-4e7d-4228-91cc-1bd16090e624","resolution":{"observed_at":"2026-08-12T12:41:10.555679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.539022Z","title":"Graph Attention Networks","venue":null,"work_id":"7e63e7dc-569f-4110-b580-d14665af65ad","year":2018},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.228976Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:30686ce8725a3bada9622a665c9d887440e7f2af804eb008f96a8e32ba27eb60","observation_id":"d3062b9e-d057-49d9-b2e4-a339812bb315","resolution":{"observed_at":"2026-08-12T12:41:10.543112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.526936Z","title":"Learn- ing node representations from noisy graph structures","venue":null,"work_id":"d731ce7c-3d99-49d6-86fa-b70c9a6ad9c3","year":2020},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.232945Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:fc870cd5a9a5a9c555ba2f94d50ada7cb167e928d843157d0f289781b8b45826","observation_id":"a6371a88-527b-4b2d-8f17-d90a2ba6dda9","resolution":{"observed_at":"2026-08-12T12:41:10.531114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.514524Z","title":"Multi-hop attention graph neu- ral network","venue":null,"work_id":"7166128e-0ed8-4286-94ec-edc883312a14","year":2021},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.236921Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:8ddcee41abee84839b985f78d6cf545c21847d0227be074a947c8f3ef3542347","observation_id":"a3f01030-6afb-4863-a7b8-3d7a0dcef8ae","resolution":{"observed_at":"2026-08-12T12:41:10.518752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.502347Z","title":"Demo- net: Degree-specific graph neural networks for node and graph classification","venue":null,"work_id":"f542f1da-f276-423c-8a29-d26f1a47b86d","year":2019},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.240913Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:db5cf5ee7099b48be9d023b9af36752a90a4185c49948b44d1150e1c707f4423","observation_id":"563ca29c-0255-4d8f-8947-a853ab3849dd","resolution":{"observed_at":"2026-08-12T12:41:10.506499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.489045Z","title":"Graph information bottleneck","venue":null,"work_id":"de84ebef-5189-4504-99bd-f7d924cef7b1","year":2020},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.244955Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:0eab17391ef5345d93147efee7f580b100c55d4572b3e306cb4b8f66cd3019d3","observation_id":"4b85a48a-4200-457f-9f3f-8fc67fed3a96","resolution":{"observed_at":"2026-08-12T12:41:10.493484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.475684Z","title":"Representation learning on graphs with jumping knowledge networks","venue":null,"work_id":"d5cfaff6-f373-4483-8eab-05f74f7b3c45","year":2018},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.248817Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:da7ed82638912b87b4f329f8f96bdf6608ad456bdcea76b621254eb941eb8c1c","observation_id":"634db40e-d52b-4c1c-b066-4ff04a660f2b","resolution":{"observed_at":"2026-08-12T12:41:10.479903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.463031Z","title":"Sport: A subgraph perspective on graph classification with label noise","venue":null,"work_id":"eac6637e-947a-4883-926a-c403e13585b8","year":2022},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.252661Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:b69f5b6902ffaeba1561e6422ad78be29029536f7e6eb9a5d9407e34a9eee0e6","observation_id":"756713a4-1615-46c5-a296-d0480bf1f584","resolution":{"observed_at":"2026-08-12T12:41:10.467143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01897","last_updated":"2025-07-12T04:43:52Z","snapshot_observed_at":"2026-08-10T06:47:36.928767Z","submitted_at":"2024-04-02T12:36:40Z","title":"Continuous Spiking Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01897","snapshot_observed_at":"2026-08-12T12:41:10.256927Z","title":"Continuous spiking graph neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.256927Z"},"links":{"cited_paper":"/paper/2404.01897","citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:eab88254469127770146af3e8246feb4e83e21df54801b16aabc939fe07e1c5f","observation_id":"6ca3b4b2-de62-4f38-8ad9-0d076f5e3aee","resolution":{"observed_at":"2026-08-12T12:41:10.256927Z","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-12T12:41:10.450328Z","title":"Bayesian graph con- volutional neural networks for semi-supervised classifica- tion","venue":null,"work_id":"f1cd821d-7f8f-4dee-a54b-31418c6bc390","year":2019},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.261834Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:9273b4f8f3efd933883b30fe209981a6ee0c076342457ed5d64683cb42123976","observation_id":"e6dc5237-98a6-409f-b9b7-f82b752ada95","resolution":{"observed_at":"2026-08-12T12:41:10.454331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.437244Z","title":"Sen, and L","venue":null,"work_id":"3a2b1e44-7c6f-4015-8b57-8ba49cdb9e8a","year":2006},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.265735Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:298799eafdb91abeecb7ff532e0d88ab8fae9e47f91adeef7730c025112844ab","observation_id":"9e59baf3-30a5-4690-a45c-8ea94266e4a7","resolution":{"observed_at":"2026-08-12T12:41:10.441400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.421874Z","title":"Robust graph representation learning via neural sparsification","venue":null,"work_id":"97a317c3-46d1-49c3-bef8-5e88a46af4ac","year":2020},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.269668Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:631de4a7d5daca8920cbc599441a3446b7b202e17b2def1b9b73be7b72c209be","observation_id":"b938cf75-643a-4b61-9db3-695b71fc5b6a","resolution":{"observed_at":"2026-08-12T12:41:10.427802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.587771Z","title":"Faloutsos","venue":null,"work_id":"f5a3f780-1819-453e-845e-de22e3ab88e8","year":2007},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.208879Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:b31afbd39d10d9e3ebedb55fecf204b07a545502f732bed0efeb168e37f38d51","observation_id":"51bfe43d-786f-4e20-9f11-7c36e1729690","resolution":{"observed_at":"2026-08-12T12:41:10.591596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.575924Z","title":"Sa-gda: Spectral augmen- tation for graph domain adaptation","venue":null,"work_id":"35cf299f-6cda-446f-92d0-bb39caa65039","year":2023},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.212694Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:d9e8ab96af51c0949f991d1c642d811b0f7959af3b638ca4fcb53c71e20218c8","observation_id":"63ac1c5b-67fb-427f-b4e2-eed2a526534a","resolution":{"observed_at":"2026-08-12T12:41:10.579863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16778","last_updated":"2024-08-31T12:49:43Z","snapshot_observed_at":"2026-08-04T09:49:25.468739Z","submitted_at":"2023-12-28T01:57:26Z","title":"Adversarial Representation with Intra-Modal and Inter-Modal Graph Contrastive Learning for Multimodal Emotion Recognition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16778","snapshot_observed_at":"2026-08-12T12:41:10.224616Z","title":"Adversarial representation with intra-modal and inter-modal graph contrastive learning for multimodal emotion recognition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.224616Z"},"links":{"cited_paper":"/paper/2312.16778","citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:03d234df4ba2f20c1a3b2d18391d51658c9dd9d4633663a2aa57694c686c728e","observation_id":"d97ee46e-1d80-4443-b7ed-4157a006389f","resolution":{"observed_at":"2026-08-12T12:41:10.224616Z","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-12T12:41:10.732438Z","title":"Variational inference for graph convolutional networks in the absence of graph data and adversarial set- tings","venue":null,"work_id":"5bb34505-e03e-4d2a-a81b-dcb2b9955905","year":2020},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.150597Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:f742a48dd73ff64f03ca456da3897fa41108cd65bfa0dc68711578928812e569","observation_id":"e8e40245-5fdc-4784-8c95-8e93c20659e5","resolution":{"observed_at":"2026-08-12T12:41:10.737130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.184797Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.184797Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:d053daa05a1acf989616b44d7023a8c2cdee083c12d82dc2c02bc4349c6117c4","observation_id":"f866baba-31c1-47d6-8289-944735b2b5e3","resolution":{"observed_at":"2026-08-12T12:41:10.184797Z","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-12T12:41:10.704083Z","title":"Learning discrete structures for graph neural networks","venue":null,"work_id":"1581b96f-3142-4a52-b31f-a3b68624a03c","year":2019},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.158852Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:d0d3b3dc97783b0ac4edf094116c173fbf719da648937c123cfd1a6c7ec2b63c","observation_id":"daf2fbe5-0367-49e4-8913-b00c63e5fa47","resolution":{"observed_at":"2026-08-12T12:41:10.708209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.196803Z","title":"Learning to drop: Robust graph neural network via topological denoising","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.196803Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:7e20d0f540a94698c4845cfc8c4423897c65bb8973ddb1c28f5092ebe3f08c96","observation_id":"bbd03db9-037b-462a-b51b-06f7bfffe399","resolution":{"observed_at":"2026-08-12T12:41:10.196803Z","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-12T12:41:10.691576Z","title":"Hamilton, Rex Ying, and Jure Leskovec","venue":null,"work_id":"b6e889fb-544e-42c7-8e5c-a446e844ff21","year":2017},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.163087Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:e956dcb81bc72dd9987d7602f18f9dfbb94d47ef8023bef1f2f853664510ebdd","observation_id":"9c7b5be9-3681-496a-954a-d4046f5181dd","resolution":{"observed_at":"2026-08-12T12:41:10.695662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.745726Z","title":"Generic methods for optimization-based modeling","venue":null,"work_id":"1053871e-1dc3-42f3-813a-1758945da0d5","year":2012},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.145720Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:73ed815758014261af980188b62a4193f29a70afd81f1c1a162e1db93bbd43ab","observation_id":"2e7df6a1-85bf-47e8-b0ce-d615a3617e12","resolution":{"observed_at":"2026-08-12T12:41:10.749924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.611939Z","title":"Gradient-based hyperparameter optimization through reversible learning","venue":null,"work_id":"3132a378-db3a-4378-b61e-a5c20842fe79","year":2015},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.200707Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:9654b09f791313acde6e8c18bfd33d0fed7f2698df346d5b38d0e3c4b3da56e2","observation_id":"bd0e07d0-6201-4de8-b535-6b9727038081","resolution":{"observed_at":"2026-08-12T12:41:10.616262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.563975Z","title":"Dropedge: Towards deep graph con- volutional networks on node classification","venue":null,"work_id":"cc8c1650-1f64-407e-864b-3c5dbf1919a0","year":2020},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.216708Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:dc240148e235b081fe8773b7899efb4f30ac99c165b82135db2f7eb71f6da3c5","observation_id":"39736f03-31c0-422f-90ce-59d9d13516af","resolution":{"observed_at":"2026-08-12T12:41:10.568072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:41:10.665965Z","title":"Differentiable graph module (dgm) for graph convolutional networks,","venue":null,"work_id":"2d1532c0-5986-4a85-a2b6-559c1b0c3832","year":2020},"citing_paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T12:41:10.176236Z"},"links":{"citing_paper":"/paper/2411.17062"},"observation_digest":"sha256:0b1f0135f242cce5ee3ff622532d665010514bb5116d28722cdbfd0822a82247","observation_id":"54a7e5d8-b3af-41d8-829a-4644d87672ef","resolution":{"observed_at":"2026-08-12T12:41:10.670289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.17062","last_updated":"2024-11-26T03:00:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T22:46:21.413629Z","submitted_at":"2024-11-26T03:00:30Z","title":"Graph Structure Learning with Bi-level Optimization"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":31},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2411.17062."}