{"as_of":"2026-08-08T23:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8fe5db0c27207964c60b941bf3e65126adb55ba2cee5d37da1d28ae97684a9d4","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":20,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:17:16.797964Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T20:08:56.289279Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2503.17656","last_updated":"2026-05-08T07:03:28Z","snapshot_observed_at":"2026-07-06T20:57:02.587855Z","submitted_at":"2025-03-22T05:32:03Z","title":"Pretraining a Foundation Model for Small-Molecule Natural Products","version":4},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-22T23:33:56.769401Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2503.17656"},"observation_digest":"sha256:ff29b584c4d47bc595382975b00cd5d49ad8222eab3a0bc040cd69c3cef88eb9","observation_id":"53bfae05-aa51-45ea-bdd4-079b336a55d9","resolution":{"observed_at":"2026-05-22T23:35:13.393908Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-08-07T05:17:16.797964Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.08326","last_updated":"2025-06-10T01:27:19Z","snapshot_observed_at":"2026-08-08T14:16:05.275281Z","submitted_at":"2025-06-10T01:27:19Z","title":"Graph Prompting for Graph Learning Models: Recent Advances and Future Directions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:17:16.797964Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2506.08326"},"observation_digest":"sha256:a870c7279f5736455a88d0f926381aeafa773ce13826046601f4f563b91f6380","observation_id":"969ea932-fe5d-4edc-a647-5e563b5bedb6","resolution":{"observed_at":"2026-08-07T05:17:16.797964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-08-07T00:49:58.909465Z","title":"Qiang Huang, Xin Wang, Susie Xi Rao, Zhichao Han, Zitao Zhang, Yongjun He, Quan- qing Xu, Yang Zhao, Zhigao Zheng, and Jiawei Jiang","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.12588","last_updated":"2025-06-14T17:53:10Z","snapshot_observed_at":"2026-08-07T00:43:19.051831Z","submitted_at":"2025-06-14T17:53:10Z","title":"Are We Really Measuring Progress? Transferring Insights from Evaluating Recommender Systems to Temporal Link Prediction","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T00:49:58.909465Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2506.12588"},"observation_digest":"sha256:31d857ba3d0991e8016f87dcc9d8c62dfa0f567e6e49248c123cf1f8ca181498","observation_id":"4f2137dc-44f2-4be6-834c-977d2dbd385d","resolution":{"observed_at":"2026-08-07T00:49:58.909465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-08-06T21:57:40.414127Z","title":"Ogb-lsc: A large-scale challenge for machine learning on graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23008","last_updated":"2025-07-08T22:06:07Z","snapshot_observed_at":"2026-08-06T21:50:17.587651Z","submitted_at":"2025-06-28T20:45:27Z","title":"A Benchmark for Quantum Chemistry Relaxations via Machine Learning Interatomic Potentials","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T21:57:40.414127Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2506.23008"},"observation_digest":"sha256:c324ef4f49f3fe8e23a521fff78d2a06ca79cebd6196b176f84da315ac6a2ddc","observation_id":"cf4d4fdf-dd8e-46e6-ad55-c5337c34118b","resolution":{"observed_at":"2026-08-06T21:57:40.414127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-08-06T20:19:29.266556Z","title":"Ogb-lsc: A large-scale challenge for machine learning on graphs,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03283","last_updated":"2025-07-04T04:15:31Z","snapshot_observed_at":"2026-08-07T13:28:03.994128Z","submitted_at":"2025-07-04T04:15:31Z","title":"MolVision: Molecular Property Prediction with Vision Language Models","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T20:19:29.266556Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2507.03283"},"observation_digest":"sha256:d1faa2e2eba9709ee66e428ea772771fc9c430bff818a364808781aec6998e8a","observation_id":"f8c1e866-e03a-48a0-8e66-e27a4bb5c682","resolution":{"observed_at":"2026-08-06T20:19:29.266556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-08-06T19:50:18.119583Z","title":"Ogb-lsc: A large-scale challenge for machine learning on graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13364","last_updated":"2025-07-06T18:51:22Z","snapshot_observed_at":"2026-08-06T19:43:47.990764Z","submitted_at":"2025-07-06T18:51:22Z","title":"OmniVec2 -- A Novel Transformer based Network for Large Scale Multimodal and Multitask Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:50:18.119583Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2507.13364"},"observation_digest":"sha256:e09210b91aa591e8956523bdac34bfde14a7b9a0952b992ca12e27309cec6a78","observation_id":"84660675-7b4b-4f5c-82f4-da2d19e23c2c","resolution":{"observed_at":"2026-08-06T19:50:18.119583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-08-06T15:54:11.019454Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.14813","last_updated":"2025-07-20T04:02:24Z","snapshot_observed_at":"2026-08-07T16:11:46.465022Z","submitted_at":"2025-07-20T04:02:24Z","title":"Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:54:11.019454Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2507.14813"},"observation_digest":"sha256:780d663d2d129f3af503028e96e295e99e845619d3d928ed3c403abf0918d27f","observation_id":"2289f3dc-4327-4629-9c15-e5f5d7df9f68","resolution":{"observed_at":"2026-08-06T15:54:11.019454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2602.00656","last_updated":"2026-05-07T10:06:18Z","snapshot_observed_at":"2026-08-02T22:28:38.324728Z","submitted_at":"2026-01-31T11:05:35Z","title":"DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-16T09:04:27.194613Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2602.00656"},"observation_digest":"sha256:efdf4760fbb7889ccdee2164dc66c8c9f5787be1194174623664ab44cebb7dd7","observation_id":"d16b9fc7-9d0b-42b7-84fc-b3c6dec83aa0","resolution":{"observed_at":"2026-05-16T09:07:39.218162Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2602.17071","last_updated":"2026-04-11T12:06:12Z","snapshot_observed_at":"2026-08-01T04:28:59.324747Z","submitted_at":"2026-02-19T04:26:57Z","title":"AdvSynGNN: Structure-Adaptive Graph Neural Nets via Adversarial Synthesis and Self-Corrective Propagation","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-15T21:30:43.925179Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2602.17071"},"observation_digest":"sha256:3c97325f407a5faed4f2723259a2bb257db688de788b41e9086c435852fc645a","observation_id":"45ba559b-e4e0-4933-aeba-955d377c3ee7","resolution":{"observed_at":"2026-05-15T21:31:39.334412Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2604.03154","last_updated":"2026-04-03T16:23:59Z","snapshot_observed_at":"2026-08-02T16:57:40.164429Z","submitted_at":"2026-04-03T16:23:59Z","title":"DSBD: Dual-Aligned Structural Basis Distillation for Graph Domain Adaptation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T19:34:21.724329Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2604.03154"},"observation_digest":"sha256:d7cc52f9dc16c303238c836fc66874e01ea881de41bb83375031d06c2b63501d","observation_id":"02100fa2-e1b0-48c1-9707-76a92d547dd5","resolution":{"observed_at":"2026-05-13T19:38:10.575175Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2604.03361","last_updated":"2026-04-03T17:38:42Z","snapshot_observed_at":"2026-07-06T22:52:34.609783Z","submitted_at":"2026-04-03T17:38:42Z","title":"The limits of bio-molecular modeling with large language models : a cross-scale evaluation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-13T20:09:30.460861Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2604.03361"},"observation_digest":"sha256:8a4a77503f28ac537f500ba68c8a2e9977c79e43590145e0ee8bd66e3fb5e2e0","observation_id":"16492a57-cb39-4713-8ce6-791696d86da2","resolution":{"observed_at":"2026-05-13T20:13:13.928552Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2604.23758","last_updated":"2026-05-04T03:23:33Z","snapshot_observed_at":"2026-08-07T07:04:07.584178Z","submitted_at":"2026-04-26T15:14:38Z","title":"Agentic Fusion of Large Atomic and Language Models to Accelerate Superconductor Discovery","version":3},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-05-08T06:33:27.749540Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2604.23758"},"observation_digest":"sha256:d70004f135c23e7764bb7713f7acdd8f949bd276d8fb16b8711f586fd0855900","observation_id":"519f41a3-8783-44a0-84eb-f15a09f79486","resolution":{"observed_at":"2026-05-11T21:11:16.860435Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2605.12161","last_updated":"2026-05-12T14:11:25Z","snapshot_observed_at":"2026-08-03T23:00:31.165111Z","submitted_at":"2026-05-12T14:11:25Z","title":"Fused Gromov-Wasserstein Distance with Feature Selection","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-13T05:40:50.747744Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2605.12161"},"observation_digest":"sha256:4f61b5b96cab56d8c5062ea0db861a50cb26cc1172cae88013520e181c7d5aee","observation_id":"1992e74c-e9a9-4310-9850-a59dc915435d","resolution":{"observed_at":"2026-05-13T05:42:20.934836Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2605.18211","last_updated":"2026-05-18T10:56:14Z","snapshot_observed_at":"2026-08-03T10:14:56.025888Z","submitted_at":"2026-05-18T10:56:14Z","title":"Leveraging Graph Structure in Seq2Seq Models for Knowledge Graph Link Prediction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-20T10:43:58.622509Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2605.18211"},"observation_digest":"sha256:cb6ba47c42ce731668cbaa828e2f9ee567943ec774ccee635e8299475ffb2a42","observation_id":"d3948587-6392-4ac9-84a6-56939f017505","resolution":{"observed_at":"2026-05-20T10:48:13.026174Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2605.18387","last_updated":"2026-05-18T13:31:21Z","snapshot_observed_at":"2026-07-06T23:29:14.916114Z","submitted_at":"2026-05-18T13:31:21Z","title":"Graph Hierarchical Recurrence for Long-Range Generalization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-20T13:06:49.896124Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2605.18387"},"observation_digest":"sha256:47e2e8b355a114f8ce707bc726cb03114277e6eafe4447038595ae4d35b27460","observation_id":"0bdc422c-da31-4760-a9eb-ce5af8738856","resolution":{"observed_at":"2026-05-20T13:08:17.752903Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2606.00808","last_updated":"2026-05-30T16:47:21Z","snapshot_observed_at":"2026-08-07T00:53:08.126677Z","submitted_at":"2026-05-30T16:47:21Z","title":"Safe-Subspace Pseudo-Label Refinement for Source-Free Graph Domain Adaptation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-28T19:20:43.215270Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2606.00808"},"observation_digest":"sha256:e3a4f7a47cfbf9c48c581a542a480bfefbc04d3b71968402bf78496ae390f4f9","observation_id":"dd9901d4-859e-4e70-9249-7ab60f155ebf","resolution":{"observed_at":"2026-06-28T19:22:34.292402Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2606.03232","last_updated":"2026-06-02T06:48:34Z","snapshot_observed_at":"2026-08-08T00:12:22.049003Z","submitted_at":"2026-06-02T06:48:34Z","title":"GFFMERGE: Efficient Merging of Graph Neural Force Fields and Beyond","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-28T11:15:53.211895Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2606.03232"},"observation_digest":"sha256:9b7cc0ce0a6ad43a14a78e94ab2f5abc9ea3fff01598ffc026b1547ab6102a43","observation_id":"18807322-841a-4119-9043-f23448b98419","resolution":{"observed_at":"2026-07-02T02:06:26.655637Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2606.11898","last_updated":"2026-06-11T03:22:55Z","snapshot_observed_at":"2026-08-07T05:39:04.404942Z","submitted_at":"2026-06-10T10:25:59Z","title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T09:41:14.904868Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2606.11898"},"observation_digest":"sha256:4b26e76a7879362b785da8b9f55a325f73135c0e6fdd1bb9906097c9b85078de","observation_id":"ce6f685a-7801-4a9d-a932-b4d9ebeba6db","resolution":{"observed_at":"2026-07-03T11:08:03.224018Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":"2103.09430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-07-03T20:08:56.289279Z","title":"arXiv preprint arXiv:2103.09430 (2021)","venue":null,"work_id":"6008e42b-b495-48c1-a779-4b02cc0361b8","year":2021},"citing_paper":{"arxiv_id":"2606.17667","last_updated":"2026-06-16T08:29:34Z","snapshot_observed_at":"2026-08-03T03:23:46.290922Z","submitted_at":"2026-06-16T08:29:34Z","title":"Handling Feature Heterogeneity with Learnable Graph Patches","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T01:36:45.977332Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2606.17667"},"observation_digest":"sha256:bae995156fe519a65fcc9f983f051b75d2d4b1de250378335c2e66a7d4d9bcfe","observation_id":"4f846af2-dfb6-45c1-b32a-2860e0804772","resolution":{"observed_at":"2026-07-03T20:08:56.291862Z","resolver_source":"arxiv_id","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":"2103.09430","last_updated":"2021-10-20T22:40:40Z","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.09430","snapshot_observed_at":"2026-08-03T08:31:24.031275Z","title":"arXiv preprint arXiv:2103.09430 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29365","last_updated":"2026-07-31T12:52:10Z","snapshot_observed_at":"2026-08-07T19:39:07.552840Z","submitted_at":"2026-07-31T12:52:10Z","title":"Cross-Resolution Semantic Learning for Graph Domain Adaptation","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-03T08:31:24.031275Z"},"links":{"cited_paper":"/paper/2103.09430","citing_paper":"/paper/2607.29365"},"observation_digest":"sha256:73a31f16f9608e370b00a74fba045ef7efe968c9de3487ed9ae9ca4433dc7121","observation_id":"152dbf20-e656-4a9f-a78e-5b5619d9106e","resolution":{"observed_at":"2026-08-03T08:31:24.031275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.09430/citation-record","integrity":"/paper/2103.09430/integrity","json":"/paper/2103.09430/citation-record.json","paper":"/paper/2103.09430"},"outbound":[],"paper":{"arxiv_id":"2103.09430","last_updated":"2021-10-20T22:40:40Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T03:47:37.849087Z","submitted_at":"2021-03-17T04:08:03Z","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 20 inbound Pith citation observations for arXiv:2103.09430."}