{"as_of":"2026-08-18T12:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:57c06b700ceaf01881564ea89babc4c7ecb5a48f30ddebafd4987bb0eeaf06d4","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:24:22.718332Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.06600/citation-record","integrity":"/paper/2509.06600/integrity","json":"/paper/2509.06600/citation-record.json","paper":"/paper/2509.06600"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:24:23.222196Z","title":"Generalization bounds for mixing processes via delayed online-to-PAC conversions","venue":null,"work_id":"3e427db7-9840-4962-8ad8-5967981b869b","year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.551679Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:a9e4bf0060818e757a4e5688efce6cbd4ee7c59c34ca871cb5e18c1d0b124821","observation_id":"87748665-e716-4b0e-891a-adab8897c124","resolution":{"observed_at":"2026-08-15T16:24:23.225480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.213673Z","title":"User-friendly introduction to PAC-Bayes bounds","venue":null,"work_id":"be59e7ab-3e4d-4e3c-adbe-e9439a8bfd73","year":2024},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.555661Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:d4ba553b2972eebb422e499bb372374cd6ded1073ce1d8b7b97883cbed974f93","observation_id":"c15d0b58-a7fd-49bb-83bb-a58cae4b80cb","resolution":{"observed_at":"2026-08-15T16:24:23.216860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.205189Z","title":"Simpler PAC-Bayesian bounds for hostile data","venue":null,"work_id":"1addd5a4-5064-452d-8a11-46d78b2eec13","year":2018},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.558754Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:444df28a27483eab6b55e069977e1feb77bdd8d9547c87e5a422fca9c33d011e","observation_id":"d36a7a0d-9dc5-4fef-bbc5-ffc018c95684","resolution":{"observed_at":"2026-08-15T16:24:23.208356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.196904Z","title":"Robust bounds on risk-sensitive functionals via R \\' e nyi divergence","venue":null,"work_id":"51c1d548-8397-4d00-bac7-8c5f733a8c15","year":2015},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.562271Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:4d365bcc7b108f742f9f9e8903ae40a5d3c052d56e5c74c04985cf0d36e3c73c","observation_id":"574aeb1b-0d6a-4ad8-bbb0-13905936bf99","resolution":{"observed_at":"2026-08-15T16:24:23.200058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.188285Z","title":"PAC-Bayesian bounds based on the R \\' e nyi divergence","venue":null,"work_id":"7b3a686b-cf82-4b4a-824b-57e9e97df59e","year":2016},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.565486Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:15dba511c3925849753e2a998f9fb8d8cfdfa5675f0b33b0584f262823ef17a0","observation_id":"a1a4f49f-ad87-4e46-ae1b-8887e1a39fed","resolution":{"observed_at":"2026-08-15T16:24:23.191513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.180412Z","title":"Graph neural networks with convolutional arma filters","venue":null,"work_id":"af846ce5-e95b-42bd-8d10-635bed4e8ece","year":2022},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.568576Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:ecf6c5cbdc74dab69dabdc73ae22cd5a4d0dfc055cfa5d695b5ad649540d777e","observation_id":"d9496305-829f-4b92-8661-9a3ab269b6e1","resolution":{"observed_at":"2026-08-15T16:24:23.183206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.172230Z","title":"Zheng, Hongyun Cai, Kevin Chen-Chuan Chang, and Erik Cambria","venue":null,"work_id":"41cb8edc-d068-49b5-a825-b0e5469487cf","year":2017},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.571817Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:59662a8ad2abc0386d4f312ce9b9ce4514a78b35e04d81af850244ee211235f7","observation_id":"221edfe8-43d3-4460-a562-900f57892e84","resolution":{"observed_at":"2026-08-15T16:24:23.175308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.163618Z","title":"Simple and deep graph convolutional networks","venue":null,"work_id":"d3a2369b-1968-42f0-9ca2-c76f2a0ff1e1","year":2020},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.574953Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:5f90351916bace52354c817b36a7f96ead35004ed789f4258f72c3f350cd6943","observation_id":"d85a492d-b162-483c-993a-302951ae7175","resolution":{"observed_at":"2026-08-15T16:24:23.166753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.155254Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"9e4836f6-d456-4343-b3a2-d5333659ee0b","year":2021},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.577893Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:fdafd154223d6f90cd9bd4fc6a8dccba0eaae33adcb2cdc2d5ae1c34913dc380","observation_id":"e514c534-5a6c-401e-baa9-fcc58636298e","resolution":{"observed_at":"2026-08-15T16:24:23.158246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.146974Z","title":"A unified recipe for deriving (time-uniform) PAC-Bayes bounds","venue":null,"work_id":"72be2ee4-e580-40ea-b808-357083946f05","year":2023},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.580834Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:020cdcde9cb49d50ade34eee94f41c1a73c1024ba8b1a6f4cf5605299cb5e15e","observation_id":"39397eed-03e7-426b-9f6e-85bc7e5b6945","resolution":{"observed_at":"2026-08-15T16:24:23.150089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.138495Z","title":"On provable benefits of depth in training graph convolutional networks","venue":null,"work_id":"00d26f45-63fc-4416-b20d-12304cc195f7","year":2021},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.583717Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:f4c142d11eae7c20f76ea695aa54da23d761259b04a4be30aed18462cf0524ae","observation_id":"21c72071-ecfa-4ab1-bc55-88bbe17ce729","resolution":{"observed_at":"2026-08-15T16:24:23.141560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.130004Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering","venue":null,"work_id":"af82d74d-6a94-4c81-9f1f-33cbb42a7657","year":2016},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.586860Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:d3d6d6a4cff7388913ab29fd46828c2cbfb185a865fe01c9033b7fe3c7bd089f","observation_id":"f52f7861-25e3-4a51-b53f-d03390c98e88","resolution":{"observed_at":"2026-08-15T16:24:23.133134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.121402Z","title":"Generalization error bounds via R \\' e nyi , f -divergences and maximal leakage","venue":null,"work_id":"325eb38d-b671-4fee-84f5-a6ad4a12ea7b","year":2021},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.590005Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:18dcc4acc846e64d835ffaa93c320cea058077d8c3d30b2b6950960f8f4ba6dd","observation_id":"bedddc0d-bf12-439b-bb82-696bc8917cf4","resolution":{"observed_at":"2026-08-15T16:24:23.124719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.112443Z","title":"Vankadara, and Debarghya Ghoshdastidar","venue":null,"work_id":"3f3e6761-8ed6-47a1-99ae-e6cff73d3aa7","year":2021},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.592772Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:bd9cb08b09d43c4d049a500b62723f13be0f88ede4e9251165ab4bdc868777e7","observation_id":"7870d87f-99f3-4c4d-a430-9d5ac520adc7","resolution":{"observed_at":"2026-08-15T16:24:23.115742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01302","last_updated":"2025-06-02T04:24:05Z","snapshot_observed_at":"2026-08-17T21:16:55.341887Z","submitted_at":"2025-06-02T04:24:05Z","title":"Recent Developments in GNNs for Drug Discovery","version":1},"cited_work":{"arxiv_id":"2506.01302","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.01302","snapshot_observed_at":"2026-08-15T16:24:22.780453Z","title":"Recent Developments in GNNs for Drug Discovery","venue":"cs.LG","work_id":"6c20bb05-8d1b-4857-826a-02df4e3725b2","year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.595626Z"},"links":{"cited_paper":"/paper/2506.01302","citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:9bc68c811ebeaafa068084e7a11b94c4493c9ed2778589ff4516ebfc57422cc7","observation_id":"c887a04d-9966-4d22-b9a7-05a9f5a82567","resolution":{"observed_at":"2026-08-15T16:24:22.785565Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00476","last_updated":"2024-05-01T12:23:16Z","snapshot_observed_at":"2026-08-16T13:56:18.732113Z","submitted_at":"2024-05-01T12:23:16Z","title":"A Comprehensive Survey of Dynamic Graph Neural Networks: Models, Frameworks, Benchmarks, Experiments and Challenges","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00476","snapshot_observed_at":"2026-08-15T16:24:22.598766Z","title":"A comprehensive survey of dynamic graph neural networks: Models, frameworks, benchmarks, experiments and challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.598766Z"},"links":{"cited_paper":"/paper/2405.00476","citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:aaadf9805eb0f380745379b23651403b63ee0d69739a79ca2a7c25e0dbef0cab","observation_id":"4ddc21cb-cb5f-4212-a46c-6a86742bcfb2","resolution":{"observed_at":"2026-08-15T16:24:22.598766Z","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-15T16:24:23.103218Z","title":"A survey of graph neural networks for recommender systems: Challenges, methods, and directions","venue":null,"work_id":"827c8024-0931-44fa-a2b7-4f8802a3da42","year":2023},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.601835Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:9e87a17e0fb4f1a5d2b437fb1598a9d1e3c401a9615ac1c23506eebacc28f5c4","observation_id":"ac40b268-7c81-4170-a2c7-f5454e0f2a20","resolution":{"observed_at":"2026-08-15T16:24:23.106555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.094309Z","title":"Generalization and representational limits of graph neural networks","venue":null,"work_id":"54bd6302-dbbe-40a7-b675-107776cafdfc","year":2020},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.604717Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:4d49542331f87d6078fc34dc4184d3803e57d95fcec30c77d7bba4287ed370cd","observation_id":"0f4336a1-00c2-4daf-84aa-dabc0beb1c14","resolution":{"observed_at":"2026-08-15T16:24:23.097416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.085902Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"10d50854-4dd6-4321-a06c-c497779ccd5b","year":2019},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.607528Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:18722a1806da57b7421ddc9efa1d7d3e08634ea83c301cd76f4a594fcf0f2409","observation_id":"afcc22df-a819-4894-b7e2-ce5b780dc5a5","resolution":{"observed_at":"2026-08-15T16:24:23.088877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.078085Z","title":"Schoenholz, Patrick F","venue":null,"work_id":"be2d70cd-87e9-4be5-97af-4d647072a343","year":2017},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.610717Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:76f404f111dc7ed89098dd616bcf5ff7b0d7472f5fd2dff8cab6123fd9f6f17a","observation_id":"d7d8ea80-3d2c-4368-844e-c9e1a6b6974e","resolution":{"observed_at":"2026-08-15T16:24:23.080714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.069778Z","title":"A new model for learning in graph domains","venue":null,"work_id":"9ee364af-5a4f-4991-85ef-10636268acc7","year":2005},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.613615Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:e185eedd8fd2ee7f3987bea0520f43407c8c98c2b8c8baf1725c8e8ee5e8cf7a","observation_id":"3be9cee3-e25d-445e-9ef0-5257d6d3b001","resolution":{"observed_at":"2026-08-15T16:24:23.072697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.616343Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.616343Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:5e12f542e1ff76be6b3c4ce9fe39cb366b1c35db92e12917c2835dab27ed180e","observation_id":"2984e5f5-d828-4454-92de-b86c43d863ae","resolution":{"observed_at":"2026-08-15T16:24:22.616343Z","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-15T16:24:23.055544Z","title":"Foundations of Deep Learning","venue":null,"work_id":"f7bbc2f4-28d3-4f08-b6c9-74be7a95bc90","year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.619156Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:4d68d86d27b46e4648800c50e25772afc68cf758f59d7a36d226f10b6d82aab9","observation_id":"8eeb2b1c-d972-48f0-9db6-d760b5c2a9d4","resolution":{"observed_at":"2026-08-15T16:24:23.059031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.046558Z","title":"Bernnet: Learning arbitrary graph spectral filters via bernstein approximation","venue":null,"work_id":"683d11e5-81d7-4bbe-bf25-7e289872ff98","year":2021},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.621955Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:387c819dfbe4401c03df71faf2e4d21b0b860224db2fcb92ffcf1f18edb02d58","observation_id":"70bfc3eb-5c80-4bc1-aff7-51762392d103","resolution":{"observed_at":"2026-08-15T16:24:23.049962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.037866Z","title":"Generalization bounds via information density and conditional information density","venue":null,"work_id":"16638b0a-81e8-45d4-8234-6cedc784ce54","year":2020},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.624720Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:c4f2cf4c27b018799b1af9bf5e82ce62efc6b583c6a0e3464fe4f6cedacc3ae5","observation_id":"e1926c5e-7b6d-48c1-b733-5017c970d3ce","resolution":{"observed_at":"2026-08-15T16:24:23.041146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.028825Z","title":"Generalization bounds: Perspectives from information theory and PAC-Bayes","venue":null,"work_id":"d6698b45-c9c4-4c2c-8842-774fb8f45fa7","year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.627629Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:0ed952da94440dff70677a44485f74dda03be92e33b4b3fe4677e2e1c481243d","observation_id":"b07c1a5c-b848-4e76-9549-ec89a1c9ee02","resolution":{"observed_at":"2026-08-15T16:24:23.031864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.020299Z","title":"Large deviations for sums of partly dependent random variables","venue":null,"work_id":"1e3268aa-f124-4e39-8dc1-c926158b0aa0","year":2004},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.630310Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:92e1f0a77f6bd87597973ec966287a1a2bf93da1ea569d8d433a0faaa0ef4dc2","observation_id":"fd3ac2c1-d470-47f2-9320-7f27bf979b71","resolution":{"observed_at":"2026-08-15T16:24:23.023472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:23.011794Z","title":"Kipf and Max Welling","venue":null,"work_id":"674f441d-f8b0-4dfa-90ba-66b7f70f9885","year":2016},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.633396Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:b5fb202ed929bdab9f307d5eb031a7bb8b7b3a335672404b0dfcc950b4b49937","observation_id":"c68fe452-3241-4fca-800f-914b72ac32ac","resolution":{"observed_at":"2026-08-15T16:24:23.014747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.636187Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.636187Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:fa1926940fed75b64fecec963e30c6442dd7475b79fa2223bda62fd9b4e9a65c","observation_id":"b03e23b8-7b56-4bd4-974b-efba1924130a","resolution":{"observed_at":"2026-08-15T16:24:22.636187Z","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-15T16:24:22.997777Z","title":"Concentration of measure without independence: A unified approach via the martingale method","venue":null,"work_id":"0d4a0913-dae3-43be-b05f-321ad9be578d","year":2017},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.638996Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:e56b6f12992c4fac80a78d3c140249cf07506ce7a442796fca67097a99c152fe","observation_id":"e00fd018-9742-4de0-8b55-b2b673068d23","resolution":{"observed_at":"2026-08-15T16:24:23.000865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.989424Z","title":"Concentration inequalities for dependent random variables via the martingale method","venue":null,"work_id":"f55fea88-ed07-4cf0-b3e1-99d709d9e330","year":2008},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.641725Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:4156da12ad11c583991439216178f4446e194e0705dc3d722b165ccf2af1c9df","observation_id":"e3665ca5-b805-45bf-ab69-ccb5ebea6b2f","resolution":{"observed_at":"2026-08-15T16:24:22.992696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.981282Z","title":"Learning theory and algorithms for forecasting non-stationary time series","venue":null,"work_id":"5fb9bf84-0b9c-4be6-9df6-2b4e088bf0f9","year":2015},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.644509Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:d75d7d758e92182bf84080ac4735ab6ad04ba317ec5210d31a1b7858009ee801","observation_id":"c5fc4beb-5175-47c7-b00c-3ea5be9b67ee","resolution":{"observed_at":"2026-08-15T16:24:22.984416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.972939Z","title":"Discrepancy-based theory and algorithms for forecasting non stationary time series","venue":null,"work_id":"2e9b89ca-7ba3-4e12-9c88-905270e32b1e","year":2020},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.647241Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:7da6a644a4d432d9ec506e523dd33688f078b058b4fefb4d0bfbc7b8950be9e1","observation_id":"9668e4c4-ce93-4362-85d4-8468d34112f9","resolution":{"observed_at":"2026-08-15T16:24:22.976101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.964755Z","title":null,"venue":null,"work_id":"4691a3b3-a188-4045-8d8c-c4d9c565b120","year":2016},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.650240Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:97adcec1a2b7732b005e17617857b9fcf0071b75208c16200eddf32748b2895a","observation_id":"7f6dc7cf-3994-4ea9-89a6-30f19a850d34","resolution":{"observed_at":"2026-08-15T16:24:22.967541Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.955749Z","title":"A PAC-Bayesian approach to generalization bounds for graph neural networks","venue":null,"work_id":"79e1b5fa-b8cc-47e0-af42-0b3b1784349f","year":2021},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.652942Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:466cba1e3410b639a16e44bbb2417ed61b1ed1e7ee6d31c6a49b77cfc3a7fdc9","observation_id":"7cf02651-beb0-426a-b584-be36a1988dd3","resolution":{"observed_at":"2026-08-15T16:24:22.958736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.947049Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"27fc42d7-4daf-4efe-a9b0-ec2c9da561e1","year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.656198Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:afe88ccb9d0b6c7dcc815beac8cf61c662544f440428b79309d211eb7e5d096e","observation_id":"409db8e4-17b9-4f4d-b760-1aa921c82ef0","resolution":{"observed_at":"2026-08-15T16:24:22.949969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.937938Z","title":"Position: Graph foundation models are already here","venue":null,"work_id":"bbbcbfd9-6243-4063-848d-f11c3fcef5be","year":2024},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.658964Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:8dba8f4f4941bf60d321ad35f328996555af5955b57b273046526b293d02b429","observation_id":"dee45d95-f71b-4a9c-af49-190457affae8","resolution":{"observed_at":"2026-08-15T16:24:22.941194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.929075Z","title":"Tweedie, and Peter W","venue":null,"work_id":"9dc8d354-7a6e-4f63-9247-b6e9f1006b68","year":2009},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.661691Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:3b460af6ff7c76c1d7f5a637f8db7f33b4486a9f9afc08b34368146466d09d17","observation_id":"ae77fe19-bd64-4312-9fe3-55470ca964e7","resolution":{"observed_at":"2026-08-15T16:24:22.932247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.920330Z","title":"Bronstein, Martin Grohe, and Stefanie Jegelka","venue":null,"work_id":"a345d3a0-db39-46e6-9a17-4dbf049a4a1c","year":2024},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.664492Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:a08a2fdd7ae46c76a190e7d864fc241e95f5e2c20f50755acbef6a748fe7b31e","observation_id":"4243a6de-db82-417d-ae12-d123d19f854d","resolution":{"observed_at":"2026-08-15T16:24:22.923592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.911648Z","title":"Optimization and generalization analysis of transduction through gradient boosting and application to multi-scale graph neural networks","venue":null,"work_id":"4eeaa2ce-9696-4c17-972b-882816afdf2a","year":2020},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.667432Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:065847ebe6fd6fa226e5ae64a0bbe34e27ca97c8f8ca4716c7f669f29764cbd3","observation_id":"dd2a6637-53cb-4adf-84d9-2ca10c6e13c8","resolution":{"observed_at":"2026-08-15T16:24:22.914892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.903027Z","title":"Graph neural networks for intelligent transportation systems: A survey","venue":null,"work_id":"7c215c0a-2b41-434e-9fbf-4b90fefb067f","year":2023},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.670351Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:0927dc87a0adb59f5ba729ec450e85ce8705a0dcd5aad45a53ccfbe8fe8e30d3","observation_id":"f9bb8a77-73ff-4384-810d-a76c014ca405","resolution":{"observed_at":"2026-08-15T16:24:22.906101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.894149Z","title":"Real and complex analysis","venue":null,"work_id":"3acbd3bc-a35b-44ed-b54b-82852c3da692","year":1987},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.673384Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:d95f9a84703c2d0b08fec6a839ffbc00883f5a5de8d52c2a965a71d2280ae06b","observation_id":"08b4b715-7401-41dd-aeaa-0b840b65533a","resolution":{"observed_at":"2026-08-15T16:24:22.897391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.676244Z","title":"The graph neural network model","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.676244Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:d7b869990918eece9c6968a7d4c84dbeb329e081dc79957939c27f37b2a8b144","observation_id":"286169f2-824f-46c6-ac53-07db8049ed82","resolution":{"observed_at":"2026-08-15T16:24:22.676244Z","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-15T16:24:22.880551Z","title":"Towards understanding generalization of graph neural networks","venue":null,"work_id":"c55f4cab-d72c-4d7c-ae62-a67e04b69f50","year":2023},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.679385Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:1a285cd9d458d2a5cb594b5c6f6f55615a58c1f280462b784dd3184298bf74c9","observation_id":"862ddc61-ea45-4eb3-a44a-80797b0dac4c","resolution":{"observed_at":"2026-08-15T16:24:22.883556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.871835Z","title":"R \\' e nyi Divergence and Kullback-Leibler Divergence","venue":null,"work_id":"ab27d431-efe8-4993-89af-a3da484abeb3","year":2014},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.682255Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:8783e51a52b6c1aa9604951e37d264b0e846d6dfbf05ed3bd2787dbff860bb68","observation_id":"1da7a8ef-34dd-486e-bb62-1ee87ab06d80","resolution":{"observed_at":"2026-08-15T16:24:22.874888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.863388Z","title":null,"venue":null,"work_id":"92346f51-a7d0-4490-9c31-21ff1644cc1b","year":1982},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.685078Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:8ee164eeb5762e9863fc0eac10a0dbf27dc4506d790153e839552c84377cc5f5","observation_id":"3d6f912f-7eda-45ed-8029-2d3d30d785dc","resolution":{"observed_at":"2026-08-15T16:24:22.866283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.854954Z","title":null,"venue":null,"work_id":"a4b5f285-33fd-4254-a603-7203263cab17","year":1998},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.688086Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:e6cc7acb4a1a3ab0a5f63a558c65afeeabbe7f099c0a63017c86d60a50caa61f","observation_id":"b19c8bd2-e2e9-4878-83b2-f4ed71527789","resolution":{"observed_at":"2026-08-15T16:24:22.857973Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15650","last_updated":"2025-03-19T19:04:24Z","snapshot_observed_at":"2026-08-16T12:48:28.853818Z","submitted_at":"2025-03-19T19:04:24Z","title":"Survey on Generalization Theory for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15650","snapshot_observed_at":"2026-08-15T16:24:22.690912Z","title":"Survey on generalization theory for graph neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.690912Z"},"links":{"cited_paper":"/paper/2503.15650","citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:aa1260df65c9948949413b9bf5711f6c3c06318fa726f0be1f4128031852152c","observation_id":"eae1c168-3ae2-457c-ad5b-4beeb3990cc6","resolution":{"observed_at":"2026-08-15T16:24:22.690912Z","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-15T16:24:22.846280Z","title":"Graph attention networks","venue":null,"work_id":"1e42c367-8e01-4d64-b44b-aba774ef70cc","year":2018},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.694412Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:76a3a814a087d145ffa82af6589a8394548f1f5c4e45c4b258528a6ba44cd044","observation_id":"ada0bb35-6144-44a5-add6-43d73b16204a","resolution":{"observed_at":"2026-08-15T16:24:22.849482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.697268Z","title":"Wainwright","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.697268Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:e79fd2a3dea3bd608ac347906612719011b6fd84062f349406e564c67ebf7569","observation_id":"533036ce-8794-46fa-a4a4-09125ef4909f","resolution":{"observed_at":"2026-08-15T16:24:22.697268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.15367","last_updated":"2022-04-26T17:59:28Z","snapshot_observed_at":"2026-08-16T17:39:00.666524Z","submitted_at":"2021-11-27T02:52:10Z","title":"A Review on Graph Neural Network Methods in Financial Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.15367","snapshot_observed_at":"2026-08-15T16:24:22.700197Z","title":"A review on graph neural network methods in financial applications","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.700197Z"},"links":{"cited_paper":"/paper/2111.15367","citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:664ba533d06ec7e3e7fe3d3ae2523eeff0e0670d1e9dc8835925b51c9bc03734","observation_id":"6a3d1dcf-c629-43d9-a3f5-6986a3f4ef26","resolution":{"observed_at":"2026-08-15T16:24:22.700197Z","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-15T16:24:22.831184Z","title":"A compact review of molecular property prediction with graph neural networks","venue":null,"work_id":"1e119b01-b023-408d-90b6-2d7593613e5e","year":2020},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.703731Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:41a69cbce3ad4fc03643e2ee426dc23fbb5ff6d5824961eafcfc340896aa3a53","observation_id":"e4d686e3-21aa-4547-bb26-95e81bd468f6","resolution":{"observed_at":"2026-08-15T16:24:22.834651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.822294Z","title":"Representation learning on graphs with jumping knowledge networks","venue":null,"work_id":"86877c2e-0380-4102-aca9-93ced42e3f45","year":2018},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.706441Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:29647c269f2589f2bbfbef550fb11ca1c4b5b1b9368809c38fcec36a3b0d1441","observation_id":"025e7449-ec8f-4031-b3e2-3840c58953ad","resolution":{"observed_at":"2026-08-15T16:24:22.825428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16533","last_updated":"2026-07-27T08:24:42Z","snapshot_observed_at":"2026-08-17T16:31:34.905832Z","submitted_at":"2025-02-23T10:55:19Z","title":"A Survey of Graph Transformers: Architectures, Theories and Applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16533","snapshot_observed_at":"2026-08-15T16:24:22.709385Z","title":"A survey of graph transformers: Architectures, theories and applications","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.709385Z"},"links":{"cited_paper":"/paper/2502.16533","citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:e84ba42c27315209e28839b95cec949922c5d53da2a1f257b0fb58f9736b37ac","observation_id":"835dd978-0c31-40d9-a5f8-f8ad66910529","resolution":{"observed_at":"2026-08-15T16:24:22.709385Z","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-15T16:24:22.813250Z","title":"The expressive power of graph neural networks: A survey","venue":null,"work_id":"72bb8746-a7e8-45e6-ab61-0276f903df4f","year":2025},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.712565Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:15af6e892b49d2fbf77333ed589eb7e147ace5044aaae1ef17a4f1fbd7831e95","observation_id":"5f0186d4-733e-46be-b495-365e03d014b0","resolution":{"observed_at":"2026-08-15T16:24:22.816653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.803262Z","title":"Mcdiarmid-type inequalities for graph-dependent variables and stability bounds","venue":null,"work_id":"fc88f358-707f-4e82-9be4-6e88445af6b2","year":2019},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.715502Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:64baf1ea30b0b7ca76bf922f5203ad67e83f13753a64aa5199a01794e8a31b37","observation_id":"be24428e-9d76-4a7d-8691-f31e7df157b3","resolution":{"observed_at":"2026-08-15T16:24:22.806725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:24:22.793374Z","title":"Interpreting and unifying graph neural networks with an optimization framework","venue":null,"work_id":"b88351f5-924d-453b-8921-fc70fda382d1","year":2021},"citing_paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:22.718332Z"},"links":{"citing_paper":"/paper/2509.06600"},"observation_digest":"sha256:4c44f21d95c737e342bf7f4dbabf81d5c38cb1f43d00e44951af068b43e80c8a","observation_id":"ade79cbb-bdbb-4a70-ae9e-51cfaae67394","resolution":{"observed_at":"2026-08-15T16:24:22.796820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.06600","last_updated":"2025-09-08T12:10:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T16:32:33.459912Z","submitted_at":"2025-09-08T12:10:54Z","title":"PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":45},"total_outbound_references":57},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2509.06600."}