{"as_of":"2026-08-18T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cce31027f79aa89745c34fef6a6763f4402ffffeb6633c79b12bcd40fef2b874","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:57:30.040648Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2502.01272/citation-record","integrity":"/paper/2502.01272/integrity","json":"/paper/2502.01272/citation-record.json","paper":"/paper/2502.01272"},"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-09T15:57:30.513633Z","title":"Outlier aware network embed- ding for attributed networks","venue":null,"work_id":"91d6535c-f821-4372-a4e8-2d24d702b246","year":2019},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.895478Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:e40ddc887856f30f04e6aabebfa4a4116e5081bedefe54b6d60245154658ac9b","observation_id":"9bb11ed7-3e07-4277-bc3a-1800331d73a2","resolution":{"observed_at":"2026-08-09T15:57:30.518154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:29.900517Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.900517Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:2b271b8ec123348d4b8c290557a5469736b195fe47c40eb42d32c7d99fc824aa","observation_id":"8284a48a-b780-4486-87bf-e67b8ab0e300","resolution":{"observed_at":"2026-08-09T15:57:29.900517Z","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-09T15:57:30.490951Z","title":"Generative adversarial attributed network anomaly detection","venue":null,"work_id":"677ebaeb-3325-4bee-9e2e-c078fd778739","year":1989},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.904902Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:4afaa68d795b1b09183b51b4dc8d1916ebf6e0d10c2d98cbb38dceced058d4c8","observation_id":"d6340717-15a8-45d5-8b3f-8abd80170815","resolution":{"observed_at":"2026-08-09T15:57:30.495896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:29.909469Z","title":"Unnoticeable backdoor attacks on graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.909469Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:3625a5d1069d880eda99335bce7434d02a8221d8d857634131eaba164965fd80","observation_id":"d7677fcb-c5c0-4c41-b0d6-a749c4cb4794","resolution":{"observed_at":"2026-08-09T15:57:29.909469Z","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-09T15:57:29.913944Z","title":"Deep anomaly detection on attributed networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.913944Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:838b589ecd009ef5fad4b160b00b048689225108facd1bf82aaf84e205420278","observation_id":"eb21aaa7-cdd9-4adf-9b34-1bcd491ce427","resolution":{"observed_at":"2026-08-09T15:57:29.913944Z","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-09T15:57:29.919325Z","title":"A density-based algorithm for discovering clusters in large spatial databases with noise","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.919325Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:da854fa1ddf9901f895cacf64ceb0a3f2ea111496a71aaa41eb855ee947ffa95","observation_id":"f3dd15bd-236f-495e-ba1f-19707c09d058","resolution":{"observed_at":"2026-08-09T15:57:29.919325Z","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-09T15:57:30.450442Z","title":"Graph neural networks for social recommendation","venue":null,"work_id":"767982ff-9b1d-428b-8d9d-86bcd126e8bb","year":2019},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.924276Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:c5082fe92cd6bcd336a0c3df568e95d07b36a1565bc2a27c3fd70165e9fc068e","observation_id":"bcd470f1-9d66-4661-9b07-d05efa70da63","resolution":{"observed_at":"2026-08-09T15:57:30.455732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-09T15:57:29.929511Z","title":"Fast graph representation learning with pytorch geometric","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.929511Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:20c5af41fa0d8c785fb9afe5d78fa68aa4f471a7418fd8b0ef2a4192be16a185","observation_id":"10a50fc7-2edd-4873-86f3-12f18b193c74","resolution":{"observed_at":"2026-08-09T15:57:29.929511Z","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-09T15:57:29.934085Z","title":"Bootstrap your own latent-a new approach to self-supervised learning.Advances in neural information processing systems, 33:21271–21284, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.934085Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:a9baac74c570b8430da92053c05a7992f2bc99e9bdac1a67c826cf14d15b3c20","observation_id":"14292f64-831e-466f-bb14-a5a1da40f9ad","resolution":{"observed_at":"2026-08-09T15:57:29.934085Z","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-09T15:57:29.938616Z","title":"Inductive representation learning on large graphs.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.938616Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:f3b9039e54f2d3228469ea39fdc222e25750e792c5336f7d3fb31f0cc31165d9","observation_id":"51c9ed16-06c2-4eb1-bd1d-d1e90b529487","resolution":{"observed_at":"2026-08-09T15:57:29.938616Z","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-09T15:57:30.417990Z","title":"Algorithm as 136: A k-means clustering algorithm","venue":null,"work_id":"2ef5ff74-d355-43a9-a8fd-30ed7a8b329c","year":1979},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.943915Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:b7946078ef7592dc5ce82260d31e646bedfe4f3e3a7a00fb841686f86c1d3869","observation_id":"faeb95be-5035-4e3d-b62c-372a40e27aec","resolution":{"observed_at":"2026-08-09T15:57:30.422854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:29.948720Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.948720Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:aa9b80c92e7a5f6798f19efbd77645a2552e0205fa808a1ee2131ad17d67438b","observation_id":"2fb37c3d-c321-49a8-b14c-bff34743c30b","resolution":{"observed_at":"2026-08-09T15:57:29.948720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-09T15:57:29.953132Z","title":"Semi-supervised classification with graph convolutional networks.arXiv preprint arXiv:1609.02907, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.953132Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:edd1c91e81ffae8864bf886010d39cd953f654e8a6b504655bb43c54f6f6bd04","observation_id":"5a554e14-6a97-42b2-aaa0-4ade868225cb","resolution":{"observed_at":"2026-08-09T15:57:29.953132Z","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-09T15:57:30.395769Z","title":"Universal litmus patterns: Revealing backdoor attacks in cnns","venue":null,"work_id":"c2e1a2df-acc8-4aff-b582-f45f014f22ca","year":2020},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.958499Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:0f3aedb07fd27d8e290552c51ee53dc5e95e1f35130979ced31368d87bccef9c","observation_id":"a6e95907-40a8-4059-9e17-7fff28f92e92","resolution":{"observed_at":"2026-08-09T15:57:30.400027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:30.381949Z","title":"Anti-backdoor learning: Training clean models on poisoned data.Advances in Neural Information Processing Systems, 34:14900–14912, 2021","venue":null,"work_id":"d5883a71-a320-4058-916a-a4698a32955e","year":2021},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.962730Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:9c12588972a4b10f760fa107f0026ca77b57d6927478def6c976dca2fdd3cb07","observation_id":"1a036ffc-4b78-439d-addd-176ed2339702","resolution":{"observed_at":"2026-08-09T15:57:30.386357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:30.368119Z","title":"Are defenses for graph neural networks robust?Advances in Neural Information Processing Systems, 35:8954–8968, 2022","venue":null,"work_id":"e679a8dc-0f9d-4a69-879a-4d0e0db5138e","year":2022},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.966821Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:c6a57ee82dbbbc04462ba83d64b2aa26d224c793c6c0f31b13809d24f4016887","observation_id":"54aadd03-81db-4ca5-9984-cf8692b0a5c8","resolution":{"observed_at":"2026-08-09T15:57:30.372623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-08-14T18:53:38.574749Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-09T15:57:29.970977Z","title":"Representation learning with contrastive predictive coding.arXiv preprint arXiv:1807.03748, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.970977Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:f8111bdf4e04bcd455ff0ff708e1794c9e48948106782d901d132554d08fab73","observation_id":"d48709fb-7ad0-495c-ab50-288d4d98820c","resolution":{"observed_at":"2026-08-09T15:57:29.970977Z","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-09T15:57:30.354132Z","title":"Graph neural networks for intelligent transportation systems: A survey.IEEE Transactions on Intelligent Transportation Systems, 24(8):8846–8885, 2023","venue":null,"work_id":"74c33327-3f46-485c-aa9c-d27db73e0955","year":2023},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.975982Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:5e51ffd51bf3c058ca723130112892e7bb8a0564fd08d1cef351d984677ccacf","observation_id":"935bd4f1-b303-47cd-b5ef-d81e1c821a68","resolution":{"observed_at":"2026-08-09T15:57:30.358981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:29.980099Z","title":"Collective classification in network data.AI magazine, 29(3):93–93, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.980099Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:a0d9d616ef3adaeb2322a4eba1b03de5fdd0d06d57d5788d73d8121c62ea513a","observation_id":"4848404a-fbc6-4c13-bf3c-093534d7dcb6","resolution":{"observed_at":"2026-08-09T15:57:29.980099Z","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-09T15:57:30.331781Z","title":"An overview of microsoft academic service (mas) and applications","venue":null,"work_id":"0e72e406-1c1b-40af-a88a-e884584c7d02","year":2015},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.984560Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:23c099f6e1dfe9f90623bf3be8683bd16c000b6d4923d185ad031f63832e5caa","observation_id":"2896b1d2-b2af-4b4c-b43b-08ffa89fa1cc","resolution":{"observed_at":"2026-08-09T15:57:30.336205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:29.989454Z","title":"Graph attention networks.stat, 1050(20):10–48550, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.989454Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:823aa66d19fd235db1ae04e6d903b26773d2e89d0cd16e8276e4ada7914a557a","observation_id":"8795b833-6772-4698-aa83-bf412fd88c9b","resolution":{"observed_at":"2026-08-09T15:57:29.989454Z","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-09T15:57:29.993961Z","title":"Neural cleanse: Identifying and mitigating backdoor attacks in neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.993961Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:60a4f0807dca897b19c22a9bbde75e0d9da7805a2631607d2b430b48b2c9071a","observation_id":"5f66b4cf-8b1b-45ae-84f0-42e480248f2e","resolution":{"observed_at":"2026-08-09T15:57:29.993961Z","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-09T15:57:30.299739Z","title":"Rab: Provable robustness against backdoor attacks","venue":null,"work_id":"11e6109c-760a-430b-928e-346c206a0488","year":2023},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:29.998348Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:f73260d17a65b653021f6a9af6f4b79ce10b0c335e1cbf3dd67ada759dacce9d","observation_id":"9ac9c4f1-bc44-4583-bb40-7e575c044933","resolution":{"observed_at":"2026-08-09T15:57:30.304194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:30.002792Z","title":"Graph backdoor","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.002792Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:f896acc5046958e2ce4eebd330f478a8a92ed351818a9ffa6f1f8cf1f0d3deb8","observation_id":"38d839f4-f18a-44ce-a6df-4c3f3024a17e","resolution":{"observed_at":"2026-08-09T15:57:30.002792Z","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-09T15:57:30.007131Z","title":"Contrastive attributed network anomaly detection with data augmentation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.007131Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:8158ab12be2dfa5ac318c1e0d43c6eb37a0f4a0cdd894aba2c979a04b59fa14c","observation_id":"622e55e2-7726-4ea7-a072-1ed5b49abcf1","resolution":{"observed_at":"2026-08-09T15:57:30.007131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-09T15:57:30.011561Z","title":"Graphsaint: Graph sampling based inductive learning method.arXiv preprint arXiv:1907.04931, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.011561Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:8dd875f040796be73da587e9191db31b3d0eeb7b53e2bca3a879910ca994f87b","observation_id":"9c6db122-2660-4f01-8a39-4e89f8363819","resolution":{"observed_at":"2026-08-09T15:57:30.011561Z","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-09T15:57:30.268503Z","title":"Gnnguard: Defending graph neural networks against adversarial attacks.Advances in neural information processing systems, 33:9263–9275, 2020","venue":null,"work_id":"03b2fd48-df97-42a8-b149-ae6a94c73827","year":2020},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.016305Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:f0ebb6f383aa230a0454fd5dbfcd780b6690b9b0463d6e504f521c11383a2af6","observation_id":"a46fac2c-ac50-4a66-8bf4-4ca2ee172037","resolution":{"observed_at":"2026-08-09T15:57:30.273286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:30.254673Z","title":"Backdoor attacks to graph neural networks","venue":null,"work_id":"84546174-7ef6-428b-9150-f82021a53040","year":2021},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.021623Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:ea54ec034e6fb48937a41dfbd2183717d8bb0503de845772eed42ad73c1048ed","observation_id":"9c1061dd-6db3-4783-8447-179f00ef74a6","resolution":{"observed_at":"2026-08-09T15:57:30.259100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:30.240619Z","title":"Rethinking graph backdoor attacks: A distribution-preserving perspective","venue":null,"work_id":"66f06872-b74c-40e0-baf7-6c3ba440931a","year":2024},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.026037Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:94429150cd44c12256a17ca2f4ea0e8926c3f439089c83638c3809913b775fbd","observation_id":"f67d4fa6-84c7-4324-8a16-8342e3d7f602","resolution":{"observed_at":"2026-08-09T15:57:30.245093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09836","last_updated":"2025-03-12T02:55:02Z","snapshot_observed_at":"2026-08-16T13:43:02.882767Z","submitted_at":"2024-06-14T08:46:26Z","title":"Robustness Inspired Graph Backdoor Defense","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09836","snapshot_observed_at":"2026-08-09T15:57:30.030370Z","title":"Robustness-inspired defense against backdoor attacks on graph neural networks.arXiv preprint arXiv:2406.09836, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.030370Z"},"links":{"cited_paper":"/paper/2406.09836","citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:12e34f7f90571879c1de335cab4bbfc148c1b77558dfeacd9f2ac5f1198df95d","observation_id":"dcd5e8d2-fc32-43c9-a297-82707052d6e1","resolution":{"observed_at":"2026-08-09T15:57:30.030370Z","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-09T15:57:30.224501Z","title":"Robust graph convolutional networks against adversarial attacks","venue":null,"work_id":"552923f2-155f-4ea2-8a38-73c031bf302b","year":2019},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.035856Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:46990fc0f0c8cec2fb0e1f53aedc0a816a32c5079410f312a4ffd5f02ded2e2b","observation_id":"f7b2c2e7-2edc-4d12-a63e-bd89f33f6c1a","resolution":{"observed_at":"2026-08-09T15:57:30.230602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T15:57:30.040648Z","title":"successful defense","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.040648Z"},"links":{"citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:d407bc3be6a7f0d6f74282e6a63af5e7d8dbeb5823a2749e3d0384b5b47b51ca","observation_id":"baefaa19-c863-4d49-b554-8911075597b0","resolution":{"observed_at":"2026-08-09T15:57:30.040648Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":32},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2502.01272."}