{"as_of":"2026-08-19T16:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:482c91000e80ac6a612a62b24b8969089af491b126d315f9075c5e2dd7fd9908","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-14T12:30:17.666729Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:19:05.522728Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T12:19:06.092166Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"1908.07110","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.07110","snapshot_observed_at":"2026-08-14T12:19:06.092166Z","title":"Feature Interaction-aware Graph Neural Networks","venue":"cs.LG","work_id":"7900d1fc-1a40-4e3c-9c82-48ba8c4b5231","year":2019},"citing_paper":{"arxiv_id":"1908.07558","last_updated":"2020-02-26T17:00:28Z","snapshot_observed_at":"2026-08-18T19:14:32.057186Z","submitted_at":"2019-08-20T18:24:32Z","title":"Transferring Robustness for Graph Neural Network Against Poisoning Attacks","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:05.522728Z"},"links":{"cited_paper":"/paper/1908.07110","citing_paper":"/paper/1908.07558"},"observation_digest":"sha256:6520f50c6ca8f267994dfb9f6f70d08112044de3bd67946e9a33a8dc4f7b5c0c","observation_id":"76d18fad-1459-41f5-9d2c-98d9304b6995","resolution":{"observed_at":"2026-08-14T12:19:06.097587Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.07110/citation-record","integrity":"/paper/1908.07110/integrity","json":"/paper/1908.07110/citation-record.json","paper":"/paper/1908.07110"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.01261","last_updated":"2018-10-17T17:51:36Z","snapshot_observed_at":"2026-08-17T23:08:02.689731Z","submitted_at":"2018-06-04T17:58:18Z","title":"Relational inductive biases, deep learning, and graph networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01261","snapshot_observed_at":"2026-08-14T12:30:17.568248Z","title":"Relational inductive biases, deep learning, and graph networks.arXiv preprint arXiv:1806.01261,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.568248Z"},"links":{"cited_paper":"/paper/1806.01261","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:2323461b46e6ee1cb531f54f99593766b658443a572660b92c3ec869466a1745","observation_id":"b143fa18-a095-42b4-a720-6f4b0960d085","resolution":{"observed_at":"2026-08-14T12:30:17.568248Z","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-14T12:30:17.948411Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":"5b664361-f2f2-4476-883c-6a13f34613b6","year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.587122Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:cc9289a03915d31a0e0e1e29b4166b97a42dff822ca190181735a7ce7ff3c275","observation_id":"247b16ce-96cd-478a-9647-528e9c74a79e","resolution":{"observed_at":"2026-08-14T12:30:17.951921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.04247","last_updated":"2017-03-13T04:55:19Z","snapshot_observed_at":"2026-08-14T23:30:22.779192Z","submitted_at":"2017-03-13T04:55:19Z","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.04247","snapshot_observed_at":"2026-08-14T12:30:17.594064Z","title":"Deepfm: a factorization-machine based neural network for ctr predic- tion","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.594064Z"},"links":{"cited_paper":"/paper/1703.04247","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:1ebbdc5c034444fc2c493bbe8a1fc20579bd62384a66762e052553aef899946c","observation_id":"f8913aa4-0009-4bfc-9cbc-6099534da22c","resolution":{"observed_at":"2026-08-14T12:30:17.594064Z","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-14T12:30:17.929188Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"cf3c6728-dd9a-4571-a31d-7f988d0f9e76","year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.597720Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:d0a1d00f573c3d4ce9b5d9394d2ffce669d4de3dffa23fc03d82afbac1bfd19e","observation_id":"11f66857-1384-4d3f-96f5-68f08ba2fbf3","resolution":{"observed_at":"2026-08-14T12:30:17.932772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.917283Z","title":"Neu- ral factorization machines for sparse predictive analytics","venue":null,"work_id":"ce24c750-4a7f-48de-b18f-e57d519347be","year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.601087Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:5e91cb3783babccc9891c28ce08757d7956fd89448a13aacc41c268d5129b988","observation_id":"3553a55a-e8fc-4337-959c-1adadc1ccb8a","resolution":{"observed_at":"2026-08-14T12:30:17.921682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","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-14T12:30:17.604393Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.604393Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:0f3869803b8ae7455fbcb1701b228d0d3f86020b09e4d6ecf2b781ff151c84df","observation_id":"87ae2b7d-baba-42ed-9730-7d9864b33da4","resolution":{"observed_at":"2026-08-14T12:30:17.604393Z","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-14T12:30:17.907432Z","title":"Unsupervised streaming feature selection in social media","venue":null,"work_id":"8e36581f-0323-43b1-afe0-b68d868498b0","year":2015},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.612228Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:86c2f95e343ea558dcbf223acdc78bee9833b996dbf80c9e13edf8df653a6bdc","observation_id":"a644f684-3aa4-4a4c-be15-43897961f59a","resolution":{"observed_at":"2026-08-14T12:30:17.911186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.883862Z","title":"Feature selection: A data perspective","venue":null,"work_id":"46288865-844a-4b06-b09c-ab9dedda6e3f","year":2018},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.618942Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:a31244ac8bc8b6c5710be1df4abc2e65400adeceefd9c85cccc925f7bf4f8193","observation_id":"54b86225-248d-4b9f-abfe-21a68ab7b8d6","resolution":{"observed_at":"2026-08-14T12:30:17.888026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.874048Z","title":"Visualizing data using t-sne","venue":null,"work_id":"1fe95ebe-9da4-426d-b5fd-e6a287d2e23a","year":2008},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.622269Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:980092ea88da6e9f286052ddc14d3e859869aa22f36460efeb619821f97452d6","observation_id":"6506dcae-14db-4e7d-9eb0-1eb629ca561a","resolution":{"observed_at":"2026-08-14T12:30:17.877457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.858189Z","title":"Deepwalk: Online learning of social rep- resentations","venue":null,"work_id":"ad78b47e-b5f6-459d-a05d-472c92ca4941","year":2014},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.628794Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:d70c0c4973086430c55b9a114a6ab6ba0ebb9ceeb61ec2e574c6bcd78a484ec1","observation_id":"c6ab7edc-0d06-435e-9e70-086551b78420","resolution":{"observed_at":"2026-08-14T12:30:17.861711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.848224Z","title":"Factorization machines","venue":null,"work_id":"76136d9c-785c-4218-842d-b4f636eae4c4","year":2010},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.632170Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:13bfbe4c86685d133890db706ef7494bda806a64cc3b2054049fc9487fe20e3b","observation_id":"05211944-16a6-4544-a9b4-dca4d510c9e9","resolution":{"observed_at":"2026-08-14T12:30:17.851481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.827497Z","title":"Learning with kernels: support vector machines, regularization, optimization, and beyond","venue":null,"work_id":"24666c0c-7b35-4ef5-a909-6b8678cf3766","year":2001},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.638725Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:56dd8d3726467c9a1892224f859edd8f5a1614c34c9277516f539a1e0ac6e6d7","observation_id":"90573ddf-0095-4779-92a7-1faaad69b7cd","resolution":{"observed_at":"2026-08-14T12:30:17.831316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.806564Z","title":"Social identity and intergroup relations, volume","venue":null,"work_id":"8f22e2b7-cbd0-4e3b-a544-29bd43ebc78a","year":2010},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.645187Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:94477620267d212fb33211f6bfa57122cb5258bf1c437c422d22a2690629f0b1","observation_id":"066fd851-a018-4838-9d72-45b4cc353b3a","resolution":{"observed_at":"2026-08-14T12:30:17.810000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.795829Z","title":"Arnetminer: extraction and mining of academic social networks","venue":null,"work_id":"b64a2a3b-d192-4b59-ac38-e755cc211980","year":2008},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.649070Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:c2b6849a890e101db0608f0aea505f57e5d2b9b6fcb00446ab98b2247689f97e","observation_id":"41456f39-e9ed-4566-b207-9baefec2451f","resolution":{"observed_at":"2026-08-14T12:30:17.799502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-14T12:30:17.652290Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.652290Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:1282abd374eb8a00b934264e3e5ea2c856f99eea23bd29e35e57e30b0c535bcb","observation_id":"513905a6-0335-44ca-b694-03dede4b2ef9","resolution":{"observed_at":"2026-08-14T12:30:17.652290Z","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-14T12:30:17.786000Z","title":"Deep & cross network for ad click predic- tions","venue":null,"work_id":"6cdeffae-9eaa-42b0-ab62-05e2050cdc62","year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.655658Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:d8ae885a88184a891dd3fd140b3803f01bc16c0ed33a1c8eba945961667113ee","observation_id":"008b9d00-e45d-4796-bfa7-3026f9bbedce","resolution":{"observed_at":"2026-08-14T12:30:17.789588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.04617","last_updated":"2017-08-15T05:17:08Z","snapshot_observed_at":"2026-08-14T20:41:22.282132Z","submitted_at":"2017-08-15T05:17:08Z","title":"Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.04617","snapshot_observed_at":"2026-08-14T12:30:17.658797Z","title":"Atten- tional factorization machines: Learning the weight of fea- ture interactions via attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.658797Z"},"links":{"cited_paper":"/paper/1708.04617","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:bdaaab856be406a07216928c9939fb5936daf582f79f405d21fa1a8536a50fe2","observation_id":"72cac123-43fc-4422-857b-5d23fa823cd1","resolution":{"observed_at":"2026-08-14T12:30:17.658797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","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-14T12:30:17.662516Z","title":"How powerful are graph neural net- works? arXiv preprint arXiv:1810.00826,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.662516Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:d94cf2b7eea3065167ccc19f7642caa411d5e2a1cccee53d1b58194c7f67a59f","observation_id":"62c3e502-2a1f-4d88-b24a-719d8812edaa","resolution":{"observed_at":"2026-08-14T12:30:17.662516Z","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-14T12:30:17.775848Z","title":"Understanding bag-of-words model: a statistical framework","venue":null,"work_id":"11c068cf-8e2e-4247-a06c-ac1c32a58cf0","year":2010},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.666729Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:712ddd5fe58897f72902b67f42c663d0b5b66621e77d5ba3f9fa51ba78399a7d","observation_id":"b772ee6d-1677-4e4b-8202-72424b721f5f","resolution":{"observed_at":"2026-08-14T12:30:17.779256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.817313Z","title":"Deep crossing: Web- scale modeling without manually crafted combinatorial features","venue":null,"work_id":"870a71fd-58bd-4964-aa48-881d6f7a9bef","year":2016},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.641934Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:55de76a088899c0e88b86fb1f5fbbc8270e083223673fbd64ce3c2c17bd05002","observation_id":"db8750f5-bfe0-45fc-994a-678b23bb4d4b","resolution":{"observed_at":"2026-08-14T12:30:17.820950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.625627Z","title":"Automatic differentiation in pytorch","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.625627Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:871e146e2f3eefc4e2a20918c9f9c87acd51b7a9d6916d68f7097757f4fa4b8c","observation_id":"c9dbfcf9-8dff-4f8a-ad89-ea7f6ab0826f","resolution":{"observed_at":"2026-08-14T12:30:17.625627Z","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-14T12:30:17.837758Z","title":"The graph neural network model","venue":null,"work_id":"379be42c-6f53-4d36-90a1-d19c09509121","year":2008},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.635439Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:06c7189930c8e30df3628bde2ef048b0d1669aeae5795e03b172c255709b4b57","observation_id":"4de054c9-1928-40f2-a045-057fb2b7d989","resolution":{"observed_at":"2026-08-14T12:30:17.841420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.968251Z","title":"Bayesian personalized feature in- teraction selection for factorization machines","venue":null,"work_id":"05c99931-7dc5-40be-a7f1-d51a2d7b5edf","year":2019},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.580190Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:c58d80e62549423c23a403a492a6dda4982992695599ae7d6572f20b50f25cd9","observation_id":"24b23521-c117-49af-aa7a-bf71c19a0410","resolution":{"observed_at":"2026-08-14T12:30:17.971678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-14T12:30:17.608613Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.608613Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:4de929d3fba09ee7eda20bf6edd27520b085e2db6df06c02df530cf15beea02b","observation_id":"7b441419-635f-49a5-9fbb-d4d2dab95862","resolution":{"observed_at":"2026-08-14T12:30:17.608613Z","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-14T12:30:17.895993Z","title":"Attributed network em- bedding for learning in a dynamic environment","venue":null,"work_id":"c9d7eacc-74aa-443e-91dc-5662a6f1420e","year":2017},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.615780Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:99fe49c5bffbb4b667c44dde14d7269e9a297c1e14ffd9c38491c01317f8d86b","observation_id":"a5a7f9bc-0c85-4c5a-a8a4-845b6e0906f9","resolution":{"observed_at":"2026-08-14T12:30:17.899885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6203","last_updated":"2014-05-21T16:27:09Z","snapshot_observed_at":"2026-08-14T23:50:42.645895Z","submitted_at":"2013-12-21T04:25:53Z","title":"Spectral Networks and Locally Connected Networks on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6203","snapshot_observed_at":"2026-08-14T12:30:17.576166Z","title":"Spectral networks and lo- cally connected networks on graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.576166Z"},"links":{"cited_paper":"/paper/1312.6203","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:6c2387a4136ac005cafde15be46ba30b10fd86a516c6dc56bbb8d890b2d5c5d3","observation_id":"fdcff001-e1f3-48ea-a9de-b5a72f20fdb6","resolution":{"observed_at":"2026-08-14T12:30:17.576166Z","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-14T12:30:17.938987Z","title":"node2vec: Scalable feature learning for networks","venue":null,"work_id":"739f8e61-e317-41e7-a933-b2839a07ad4f","year":2016},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.590908Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:f946c43df4c1fde72f4abd3e3f81050caadf51b229a8f5dd6b3675a9ecb108e9","observation_id":"94a865fa-1f35-435d-bcda-3f9a93897986","resolution":{"observed_at":"2026-08-14T12:30:17.942375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.08810","last_updated":"2016-07-29T13:54:51Z","snapshot_observed_at":"2026-08-14T21:46:15.606147Z","submitted_at":"2016-07-29T13:54:51Z","title":"Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms","version":1},"cited_work":{"arxiv_id":"1607.08810","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.08810","snapshot_observed_at":"2026-08-14T12:30:17.754014Z","title":"Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms","venue":"stat.ML","work_id":"64ebef5e-8d93-4d15-a79d-1aaee1ca5b44","year":2016},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.572452Z"},"links":{"cited_paper":"/paper/1607.08810","citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:f1c13bad669de38e675186d93e777a0d2c067cdd992dcc44623a4f5149faa433","observation_id":"83d8c8bd-3b26-476c-b327-7b56f0813023","resolution":{"observed_at":"2026-08-14T12:30:17.759618Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T12:30:17.958913Z","title":"Convolutional neural net- works on graphs with fast localized spectral filtering","venue":null,"work_id":"02421e93-6d81-4104-83f6-8e09b147412a","year":2016},"citing_paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T12:30:17.583694Z"},"links":{"citing_paper":"/paper/1908.07110"},"observation_digest":"sha256:91daf811082cc7bd87388b9161463f4b8a252ff21ed8e74860708bcd0f7ac92f","observation_id":"836123ac-5777-4db4-9b29-ccc4cc2d4e57","resolution":{"observed_at":"2026-08-14T12:30:17.962335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07110","last_updated":"2020-01-22T22:13:07Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T03:20:55.469887Z","submitted_at":"2019-08-19T23:54:28Z","title":"Feature Interaction-aware Graph Neural Networks"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":19},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:1908.07110."}