{"as_of":"2026-08-16T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de82a3af7246dcd53f5323196011997a67dd2f125abc1bb637ef738e37ff1f4a","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-16T06:30:59.297886+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-16T03:36:58.043303Z","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-15T14:18:27.289372Z","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:e8a74b3bc816fc827f8979de8a742eb1e1bd0b017cef4610350e316821873452","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T04:21:38.631648Z","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-16T03:36:58.043303Z","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:73919549fbebdf68b45731716a1e11c435b2a14ebfef896675d7060b665f1ae4","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-16T03:36:58.043303Z","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:6d7cbb15106e10c481673528e0ca6e4c7ddef2c443ba0f75de66b5ae6ff8f5e3","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:d5d3535f84f46b171414dd58b9a6121eeecc60a919ebe3bede0e302d3ba7c7c3","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-16T03:36:58.043303Z","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:7e67a9864e002c972fa48c5859a295d3c41b14b54f6d240b0ad6b118b3a46228","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:555b91afaad6feae2cb3a309b7b098cd9326a4075432de70a847bdee7346d5c4","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T18:51:16.666127Z","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-16T03:36:58.043303Z","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:a36ce5aedf396c9bc607bb7815de5d9ee05305395288164e894fc9b0f5dba96f","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-16T03:36:58.043303Z","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:8f745dabd445014f76b4f49ca1abbf6f8ccc13f27afcedb56b4ed501f6e2a2d1","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:18a669194153a459c39ab24339e7daa7d1c333a0de4790a877f8d2c58651f764","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:2cae03c1b9693f5fc7355a75582feaedcb291d918225a028fd87701b45cd95b7","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:a37367ff6d91d4a8ea0ef6393d408980943f233f5bebaa83974b74a0b8c56ad2","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:896df2bdd161ebb5503908800d881554a32eabcc0f554efc69f9f641dd03ae61","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:db8f5efa2f0c3173d928cadec7e0ff61897c7ae9b1331c8abc5b3bcbb6112879","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:3d573cb5306c0191d5c00ed6dbf2672a75c65e8fdfae0bd2048243e7e8e2d359","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:e2a03cbdf16c5461a48f8de87faf8b2fbfcdcd95781459f7cd9f3743f1aa5dce","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:81de1802ab4577c154e300662c9aca231b6b86c5ddac4c2fc2b056444b72bff9","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-16T03:36:58.043303Z","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:b9dca9dee7119acc8eb6b50b20bdaa883d6186c03fb012a53460cc185a56a188","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:3eb233befe7a6fe0e6fcf0b4677338b695fa5c1c63c617daa02fc131f31b99d7","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-16T03:36:58.043303Z","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:5f2cb502c9228c37a2acf2af73531e5b9c2c22e94757c2b6c7932c8252f90717","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-16T03:36:58.043303Z","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:6ed46a807b2195cfd9c6f4da3ed9ca7da10433e4d0a2a176dc33ef58b318c571","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:bc501443c446fddd5e21137e88da02c6fa21350c8e03a38b1c2a14419f851b32","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:a35ee148af3d08453b91b37f8faa9153b90781b7337574ac5aa7452dcb9591eb","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-16T03:36:58.043303Z","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:3775537dcf6f46933121bdbcd6c4e7766c82cf0bd5953e2f397539dbd3375b46","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:3db2f0e2135c58512bb9bdcd25bd82d160986132b17046f2828cd2c2ce8e370d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T11:38:10.906031Z","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-16T03:36:58.043303Z","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:4ceb0331536da947dd9c520878514cd4f1d928f71c5162bb9601e976cb054b52","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-16T03:36:58.043303Z","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:5216e174521fd0c9dce3a2a0279fb8de4bfe09748c492587e0c0bb052ac95194","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:843ab9b5d1a764e26d52d83801eb18163f5e5d35878fe310ef3223fb41054390","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-16T03:36:58.043303Z","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:c028c22fee5529aae206a2de202bd433e4e86d5a85b07ce29fe2030f5e06d016","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:d53bb346cd90bb335817e944a375715230caa90766dc8ab862e0e2941837e240","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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:19fdff05e3c21f77640c73e598bafc9d7f430d703f6f456f5681197c0eaa7bbd","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T03:36:58.043303Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:1908.07110."}