{"as_of":"2026-08-09T13:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ccdc7c6177a2272c4949507d7742d8a26bf722d50b19245425ae8bf09de4d7ad","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:04:19.395944Z","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-02T06:06:41.464296Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":"1811.03508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-07-02T06:06:41.464296Z","title":"A simple yet effective baseline for non-attributed graph classification","venue":null,"work_id":"15c4feaa-1606-4a16-bd88-7616e855ee6e","year":2018},"citing_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-13T20:01:23.649737Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/1903.02428"},"observation_digest":"sha256:7469a3e53b83c4bfef46bebc78e46e7f674bbc29ceec0c7084fbd1fc4423bfc9","observation_id":"b5186ab7-58b5-4361-9931-d6246d4b1b49","resolution":{"observed_at":"2026-05-13T20:01:23.684741Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-08-07T21:04:19.395944Z","title":"A simple yet effective baseline for non-attributed graph classification","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09570","last_updated":"2025-02-13T18:28:17Z","snapshot_observed_at":"2026-08-09T13:00:29.737226Z","submitted_at":"2025-02-13T18:28:17Z","title":"Enhancing the Utility of Higher-Order Information in Relational Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T21:04:19.395944Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2502.09570"},"observation_digest":"sha256:47ea60c462771e6cd34813443c665b67083481b35ddaeef60949b63dfc1c719a","observation_id":"8ad7d776-db9c-4312-b908-e3848e2d208a","resolution":{"observed_at":"2026-08-07T21:04:19.395944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-08-06T15:43:40.385675Z","title":"A simple yet effective baseline for non-attributed graph classification,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:40.385675Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:17e6aa83245320873a9cc445faf8a55669991ff186c26ce03f47c342ccfcded9","observation_id":"13727764-0883-44b5-9cf8-9ef139f37eca","resolution":{"observed_at":"2026-08-06T15:43:40.385675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-08-05T12:31:08.904576Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.01541","last_updated":"2025-09-01T15:16:28Z","snapshot_observed_at":"2026-08-07T12:32:09.646208Z","submitted_at":"2025-09-01T15:16:28Z","title":"Graph Contrastive Learning versus Untrained Baselines: The Role of Dataset Size","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T12:31:08.904576Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2509.01541"},"observation_digest":"sha256:83167bb83501270a112e9b410ecea9b1fa9a6cf0502b1bf857ee79f1fd4e01d7","observation_id":"fff4d1a7-04f0-46d2-b100-e13ef1d1ea78","resolution":{"observed_at":"2026-08-05T12:31:08.904576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":"1811.03508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-07-02T06:06:41.464296Z","title":"A simple yet effective baseline for non-attributed graph classification","venue":null,"work_id":"15c4feaa-1606-4a16-bd88-7616e855ee6e","year":2018},"citing_paper":{"arxiv_id":"2509.05288","last_updated":"2026-04-14T06:59:33Z","snapshot_observed_at":"2026-07-06T22:24:42.849960Z","submitted_at":"2025-09-05T17:55:22Z","title":"Learning to accelerate distributed ADMM using graph neural networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-18T18:46:36.084583Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2509.05288"},"observation_digest":"sha256:812425e8eb47c5bf84302f8cdc2407d56727d7a48b7936d4cffea088a1dab66b","observation_id":"c6dd5088-51a4-4d07-aff6-014322c3afd1","resolution":{"observed_at":"2026-05-18T18:46:45.083248Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":"1811.03508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-07-02T06:06:41.464296Z","title":"A simple yet effective baseline for non-attributed graph classification","venue":null,"work_id":"15c4feaa-1606-4a16-bd88-7616e855ee6e","year":2018},"citing_paper":{"arxiv_id":"2604.25275","last_updated":"2026-04-28T06:33:55Z","snapshot_observed_at":"2026-08-02T11:36:46.712626Z","submitted_at":"2026-04-28T06:33:55Z","title":"Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-07T16:51:24.821614Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2604.25275"},"observation_digest":"sha256:a529019b3b0e25aade0d68e0df072df94cc0320270ed990035ca04fdf0c5b275","observation_id":"1d966bf7-f60e-4c3e-bcb9-3ab5a1ee985c","resolution":{"observed_at":"2026-05-11T23:31:15.971687Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":"1811.03508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-07-02T06:06:41.464296Z","title":"A simple yet effective baseline for non-attributed graph classification","venue":null,"work_id":"15c4feaa-1606-4a16-bd88-7616e855ee6e","year":2018},"citing_paper":{"arxiv_id":"2606.05046","last_updated":"2026-06-03T16:07:24Z","snapshot_observed_at":"2026-07-06T23:45:02.342193Z","submitted_at":"2026-06-03T16:07:24Z","title":"Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning","version":1},"reference_index":145,"source":"arxiv_source","source_observed_at":"2026-06-28T07:37:20.073677Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2606.05046"},"observation_digest":"sha256:b3080e59ddd577e902c63dc232af68e2ebc2ff54fb9b124b88c1b66d69683a6e","observation_id":"3d70888e-2dd6-468d-962b-bdadaa567729","resolution":{"observed_at":"2026-07-02T06:06:41.465604Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03508","snapshot_observed_at":"2026-08-01T07:41:30.826937Z","title":"A simple yet effective baseline for non-attributed graph classification,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.21381","last_updated":"2026-07-23T14:44:51Z","snapshot_observed_at":"2026-08-04T09:43:41.500487Z","submitted_at":"2026-07-23T14:44:51Z","title":"Towards Faithful Graph Explanations with Synergistic Edge Effects via Granular Balls","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T07:41:30.826937Z"},"links":{"cited_paper":"/paper/1811.03508","citing_paper":"/paper/2607.21381"},"observation_digest":"sha256:8cd8f5962d9083d18cafb9c4e712c2266a9d63e6b5d7c1871ef6f10a9f587093","observation_id":"0a8e2d80-9a2e-48ed-9e68-4b832126ebfe","resolution":{"observed_at":"2026-08-01T07:41:30.826937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1811.03508/citation-record","integrity":"/paper/1811.03508/integrity","json":"/paper/1811.03508/citation-record.json","paper":"/paper/1811.03508"},"outbound":[],"paper":{"arxiv_id":"1811.03508","last_updated":"2022-05-18T04:51:26Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T13:47:54.543306Z","submitted_at":"2018-11-08T15:53:37Z","title":"A simple yet effective baseline for non-attributed graph classification"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:1811.03508."}