{"as_of":"2026-08-08T15:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74b1ff7cef244c79dc39bda24f952a32abe167e0b29a9206db46a31dd03b639e","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:04:19.491683Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.09570/citation-record","integrity":"/paper/2502.09570/integrity","json":"/paper/2502.09570/citation-record.json","paper":"/paper/2502.09570"},"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-07T21:04:19.756769Z","title":null,"venue":null,"work_id":"9471bb2f-970e-4c9d-a92e-e210018b87bf","year":2006},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.461753Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:ee860d81ffc772d8e4a4620920b774f4550921ce7ce269c86ee50a68779be8e3","observation_id":"4c95e085-e40f-423e-823f-fef788944890","resolution":{"observed_at":"2026-08-07T21:04:19.760003Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.707354Z","title":null,"venue":null,"work_id":"6e00a4a5-a168-429d-9cf5-a5121cb56457","year":2000},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.479005Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:9f3fe7d9a9d0ad2111ad94030cc0a2462d03b3f8920db7a92184893bfffdee0b","observation_id":"0f1af8a8-3abb-4b48-98c9-5fe56b969720","resolution":{"observed_at":"2026-08-07T21:04:19.710909Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.687156Z","title":null,"venue":null,"work_id":"4045313f-a88d-4e8e-a534-43d5653cf5fd","year":2024},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.485073Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:7fddcfdfeb04175e1cc75521c34cbe4319cf94ed3bd7d567d25749311755a702","observation_id":"890ff1d0-3eef-4430-98ca-fb83b3db3fea","resolution":{"observed_at":"2026-08-07T21:04:19.690549Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.00956","last_updated":"2021-05-03T15:48:34Z","snapshot_observed_at":"2026-08-07T20:11:41.115546Z","submitted_at":"2021-05-03T15:48:34Z","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.00956","snapshot_observed_at":"2026-08-07T21:04:19.418322Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.418322Z"},"links":{"cited_paper":"/paper/2105.00956","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:233ec6b8a13353fab2ac50657220d36f3aea435e3548713285d73202acba7b28","observation_id":"9c7d7721-eac2-48d3-b0c3-c7a17a1e55cb","resolution":{"observed_at":"2026-08-07T21:04:19.418322Z","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-07-06T05:10:16.862707Z","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-07T21:04:19.421493Z","title":"Semi-supervised classification with graph convolutional net- works","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.421493Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:4e00f54c044159d2b9856b2ed728ba64d481d87cbca719443ac8c9a4e4e76fde","observation_id":"aaa93eeb-0cd9-489b-903e-264b43428680","resolution":{"observed_at":"2026-08-07T21:04:19.421493Z","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-07T21:04:19.793041Z","title":"Hypergraph transformer for semi-supervised classification","venue":null,"work_id":"654f686d-61f0-479b-ad9f-2b5aeeba7508","year":2024},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.425138Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:84a704975ff4f783c4a08042aa796a25be57180661fa2d4d78f689d0071089c2","observation_id":"a7de4f69-1d08-4725-956f-63572923f411","resolution":{"observed_at":"2026-08-07T21:04:19.795918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05490","last_updated":"2023-03-09T18:42:18Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:42:18Z","title":"On the Expressiveness and Generalization of Hypergraph Neural Networks","version":1},"cited_work":{"arxiv_id":"2303.05490","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.05490","snapshot_observed_at":"2026-08-07T21:04:19.575215Z","title":"On the Expressiveness and Generalization of Hypergraph Neural Networks","venue":"cs.LG","work_id":"2e82023f-cb9f-4c98-81a1-098d40ae3bfd","year":2023},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.428817Z"},"links":{"cited_paper":"/paper/2303.05490","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:1e626ea8e9dea37dddf01c569e3916ec107c271475b11211113a78901542a68e","observation_id":"96d82c44-a2c5-4079-ad39-14cb6982da7a","resolution":{"observed_at":"2026-08-07T21:04:19.579019Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.676710Z","title":null,"venue":null,"work_id":"34df91be-c472-4afc-9959-e4969f970174","year":1916},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.488393Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:db053f56cda50037c5e5b3defee983ddf0199005f73f6c11936543e50697ae44","observation_id":"5699cb44-d076-41e2-ad72-1aee971d2cb4","resolution":{"observed_at":"2026-08-07T21:04:19.680238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06642","last_updated":"2025-08-25T20:17:36Z","snapshot_observed_at":"2026-08-01T18:36:20.678589Z","submitted_at":"2024-06-09T18:31:19Z","title":"TopoBench: A Framework for Benchmarking Topological Deep Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06642","snapshot_observed_at":"2026-08-07T21:04:19.440016Z","title":"Petar Veliˇ ckovi´ c, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.440016Z"},"links":{"cited_paper":"/paper/2406.06642","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:f8059eae5bde2645302d4b182b2ce3dc416f8f28113c3510aece52f9ddd1e1d2","observation_id":"aa808313-f534-4901-aac5-5503d9bd21a9","resolution":{"observed_at":"2026-08-07T21:04:19.440016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.03753","last_updated":"2022-04-20T23:45:18Z","snapshot_observed_at":"2026-07-06T11:55:35.648043Z","submitted_at":"2021-10-07T19:08:08Z","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.03753","snapshot_observed_at":"2026-08-07T21:04:19.450862Z","title":"From stars to subgraphs: Uplifting any gnn with local structure awareness","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.450862Z"},"links":{"cited_paper":"/paper/2110.03753","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:b28a9db384daa02c3a1ae5942b9dc8082da3884fab45b4bb52988ce3337d39c1","observation_id":"166e390d-7b10-4d0c-a0fa-905970ce60d6","resolution":{"observed_at":"2026-08-07T21:04:19.450862Z","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-07T21:04:19.666650Z","title":"36 E.4 Additional Plots Figure 10: The pair 0 of the regular category in BREC","venue":null,"work_id":"f2c4d282-0b00-434b-a59d-df1c3e96d4eb","year":2021},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.491683Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:69a370595448a61be997023480fa9eeaa397e72135d15ba7e5740df4fced2cb1","observation_id":"11f2dc9b-021b-4bb4-9f0d-a8a33a7d118e","resolution":{"observed_at":"2026-08-07T21:04:19.670382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.766075Z","title":null,"venue":null,"work_id":"93f58908-8242-4028-bf4f-838b9f927f99","year":2023},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.458037Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:f5683da2aa0dfd63f070264bae03235446e97ad221a2310af06fee1786612102","observation_id":"5dfbc92e-dbac-4abe-9438-135404a376f2","resolution":{"observed_at":"2026-08-07T21:04:19.769178Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.737747Z","title":"The probability of a random walk transitioning from node i to j is given by −Lij = Aij di","venue":null,"work_id":"e7871be0-1d2d-40e0-bf23-ff037d214304","year":2022},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.468771Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:c5f298cdc875226bb69845e5cf775d97b72bff4701b8c98c70f082dab4e193af","observation_id":"1d95beb7-97c1-464b-9d7c-c9bb5c9810fc","resolution":{"observed_at":"2026-08-07T21:04:19.741323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.727482Z","title":"B.2.2 UniGIN UniGIN also follows the two-phase scheme (see Eq","venue":null,"work_id":"a4e40aa1-9770-435b-bc07-3a596ac22ab6","year":2021},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.472815Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:58c9b4c2f0d5ab441378952e73581350e53c99aabcc672dc3bc90be2ae91cab2","observation_id":"f207c777-355d-4583-b75f-fe9303d9f290","resolution":{"observed_at":"2026-08-07T21:04:19.731051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.697136Z","title":"We use the same pre-processed hypergraphs as in Yadati et al","venue":null,"work_id":"45464611-e152-46c3-8e7b-d616a0979b64","year":2019},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.481899Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:909afba173cfe79a7c77a17daf51bae71cf82c0d7caa41a2b5b74949f458fc9c","observation_id":"71053da8-11ef-4d1b-b17e-277510e4369a","resolution":{"observed_at":"2026-08-07T21:04:19.700616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-07T21:04:19.447195Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 ,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":1968,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.447195Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:3a8aa31c82b373ebb181655bb8b1477a0f2f5392ef9a84686cfe86505f145f45","observation_id":"65378c3e-ea7e-41b0-98e9-1c45c9a4ec6e","resolution":{"observed_at":"2026-08-07T21:04:19.447195Z","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-07T21:04:19.717959Z","title":"typhimurium TA98","venue":null,"work_id":"b99512cb-807d-44e2-b137-43680212dd0c","year":2005},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":1973,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.475976Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:6749d8f2a546abc1d86b21b68c49e14ac37e84a335cb216a66f36d90361cfe7a","observation_id":"205732f6-2fd8-478e-81d4-59078510f3e7","resolution":{"observed_at":"2026-08-07T21:04:19.721322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07875","last_updated":"2022-02-10T07:56:13Z","snapshot_observed_at":"2026-08-05T16:48:20.434377Z","submitted_at":"2021-10-15T05:59:15Z","title":"Graph Neural Networks with Learnable Structural and Positional Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07875","snapshot_observed_at":"2026-08-07T21:04:19.403666Z","title":"Graph neural networks with learnable structural and positional representations.arXiv preprint arXiv:2110.07875,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.403666Z"},"links":{"cited_paper":"/paper/2110.07875","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:c72f38192b848247e2bbc1255bd5a4f907952ed57e283a4e4ccfa50a6d5aba60","observation_id":"5aab17d2-b986-49d0-822d-8dc3c16fd87e","resolution":{"observed_at":"2026-08-07T21:04:19.403666Z","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-07T21:04:19.774769Z","title":"Here, we focus on clique expansion, which we empirically found to be the best performing expansion","venue":null,"work_id":"d3015511-a2ed-4b7d-9bc7-8e55b48f6b5d","year":2008},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.454382Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:062e259037845d0b9ce4d8cab0c9b5748d9882c90f2f92192f5473d938737fd4","observation_id":"b701a01d-e3da-48a2-94a0-97730238700a","resolution":{"observed_at":"2026-08-07T21:04:19.777820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.00606","last_updated":"2023-05-19T22:13:16Z","snapshot_observed_at":"2026-07-06T13:16:28.430109Z","submitted_at":"2022-06-01T16:21:28Z","title":"Topological Deep Learning: Going Beyond Graph Data","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.00606","snapshot_observed_at":"2026-08-07T21:04:19.414649Z","title":"Higher-order attention networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.414649Z"},"links":{"cited_paper":"/paper/2206.00606","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:48977f3c73e64f4bd455698f0dae25de03034328ef4d5bcacfc139035d8bae72","observation_id":"cafc9aed-8b0e-4e14-94c0-a93948c7d24b","resolution":{"observed_at":"2026-08-07T21:04:19.414649Z","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-07T21:04:19.801387Z","title":"A new model for learning in graph do- mains","venue":null,"work_id":"8bbae613-dff6-4646-aac8-9f7b1b594068","year":2005},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.411359Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:f65b2bafa64e1b8c9cbed1b49c191c2d52c6eb29cb99ecc4bf28d6528cbafe6b","observation_id":"82fb33b6-4b4c-455d-b474-920625ca47e0","resolution":{"observed_at":"2026-08-07T21:04:19.804379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:04:19.784364Z","title":"Forman’s ricci curvature-from networks to hypernetworks","venue":null,"work_id":"08dc26c0-b91a-4b4e-a2d6-7075a7d45025","year":2018},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.436515Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:a7561cb70e5fc8930ebd9aa0c92ae43c31098ba186ea49b98781d928f51a8050","observation_id":"18d3f76b-9455-43eb-a211-65e970622ede","resolution":{"observed_at":"2026-08-07T21:04:19.787460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07702","last_updated":"2024-06-01T08:37:02Z","snapshot_observed_at":"2026-07-06T15:16:09.957026Z","submitted_at":"2023-04-16T05:53:47Z","title":"An Empirical Study of Realized GNN Expressiveness","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.07702","snapshot_observed_at":"2026-08-07T21:04:19.443714Z","title":"Towards better evaluation of gnn expressiveness with brec dataset","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.443714Z"},"links":{"cited_paper":"/paper/2304.07702","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:cce38a695d54718e50f35bbbd305d2aea33453e8da518ce33be00e659bc57189","observation_id":"08e7011a-3561-4be6-bada-c2afdafec7f4","resolution":{"observed_at":"2026-08-07T21:04:19.443714Z","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-07T21:04:19.747475Z","title":"The Dirichlet energy E(f ) of a scalar function on a hypergraph is defined as E(f ) = 1 2 X e∈E X {u,v}⊆e 1 |e| f (u)p d(u) − f (v)p d(v) !2","venue":null,"work_id":"fd96ea57-52ad-42c5-a9d0-2d044fa4a834","year":2006},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.465451Z"},"links":{"citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:b147049d99930824171fe78f3cf8542c9fa343979b3c523d71ee0619f8763732","observation_id":"ef62a23f-54d2-4842-aaba-61b92e587454","resolution":{"observed_at":"2026-08-07T21:04:19.750801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12048","last_updated":"2023-04-06T16:54:48Z","snapshot_observed_at":"2026-07-06T14:08:45.786397Z","submitted_at":"2022-10-21T15:40:49Z","title":"Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12048","snapshot_observed_at":"2026-08-07T21:04:19.399795Z","title":"Ollivier-ricci curvature for hyper- graphs: A unified framework","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.399795Z"},"links":{"cited_paper":"/paper/2210.12048","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:015a83a36652fa954181de51f031df677c27cc3501612a85831573f107f68998","observation_id":"6855e94a-50f6-4e7a-905c-e300d8417f12","resolution":{"observed_at":"2026-08-07T21:04:19.399795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.05031","last_updated":"2021-03-08T19:40:16Z","snapshot_observed_at":"2026-07-06T10:48:00.988941Z","submitted_at":"2021-03-08T19:40:16Z","title":"Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data","version":1},"cited_work":{"arxiv_id":"2103.05031","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.05031","snapshot_observed_at":"2026-08-07T21:04:19.656311Z","title":"Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data","venue":"cs.SI","work_id":"5301bb76-71aa-456a-b1a3-07f252752690","year":2021},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.391945Z"},"links":{"cited_paper":"/paper/2103.05031","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:d65781e2f8793f700923f394b6ef816aff810e5419584c6b406e82ed0c3a65d7","observation_id":"1f8e073e-f5e0-48b2-9208-b9d7a9433c13","resolution":{"observed_at":"2026-08-07T21:04:19.660057Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-04T13:47:54.543306Z","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-07T21:04:19.395944Z","title":"A simple yet effective baseline for non-attributed graph classification","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.395944Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:127cb65930b424c4f1cdf61121889a978c1ba0e52b6b84869eefd59fba769d6b","observation_id":"8ad7d776-db9c-4312-b908-e3848e2d208a","resolution":{"observed_at":"2026-08-07T21:04:19.395944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11626","last_updated":"2023-10-17T23:24:11Z","snapshot_observed_at":"2026-07-06T16:34:46.644492Z","submitted_at":"2023-10-17T23:24:11Z","title":"HyperNetX: A Python package for modeling complex network data as hypergraphs","version":1},"cited_work":{"arxiv_id":"2310.11626","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.11626","snapshot_observed_at":"2026-08-07T21:04:19.559969Z","title":"HyperNetX: A Python package for modeling complex network data as hypergraphs","venue":"cs.MS","work_id":"70854a61-6b45-4716-a938-508c1c3830e6","year":2023},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.432821Z"},"links":{"cited_paper":"/paper/2310.11626","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:01c1a44ad4a9eda875b3194d5d494b2d85bd660dbafd4ef164a092182047435d","observation_id":"6045a8b6-d41a-46a5-b864-cb64a045a483","resolution":{"observed_at":"2026-08-07T21:04:19.565265Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.06351","last_updated":"2023-09-12T16:16:25Z","snapshot_observed_at":"2026-07-06T16:17:30.860449Z","submitted_at":"2023-09-12T16:16:25Z","title":"Chemically inspired Erd\\H{o}s-R\\'enyi oriented hypergraphs","version":1},"cited_work":{"arxiv_id":"2309.06351","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.06351","snapshot_observed_at":"2026-08-07T21:04:19.615467Z","title":"Chemically inspired Erd\\H{o}s-R\\'enyi oriented hypergraphs","venue":"cs.DM","work_id":"801f8a58-9d0d-461c-a619-26cfa23fbaca","year":2023},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.407357Z"},"links":{"cited_paper":"/paper/2309.06351","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:3b3c403a50be9cdf62915ec091c45bf248571205bc445e42cfdc5ab03121601c","observation_id":"b06f1287-8e75-4e46-9425-f599d9c7c4fa","resolution":{"observed_at":"2026-08-07T21:04:19.619073Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T20:56:00.270958Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":4,"verified_fuzzy":10},"total_outbound_references":29},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2502.09570."}