{"as_of":"2026-08-16T09:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d6e774ca2269e0f18c54366163c06563d464b4c7f4d9145484636235a6f564a","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:35:52.341950Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.06955/citation-record","integrity":"/paper/1908.06955/integrity","json":"/paper/1908.06955/citation-record.json","paper":"/paper/1908.06955"},"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-14T12:35:53.368498Z","title":"Higher order conditional random fields in deep neural networks","venue":null,"work_id":"4800b8ce-4524-495d-9c13-45f5d39e03d7","year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:51.981687Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:00788781bf6d9d99f19b2222697bd9dfdf61c1040a16b4d777bcd892edcb50c6","observation_id":"21f0af4c-5a98-4fc4-8474-8f425acba16b","resolution":{"observed_at":"2026-08-14T12:35:53.372937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.354753Z","title":"Conditional random fields meet deep neural networks for semantic segmentation: Combining probabilistic graphical models with deep learning for structured prediction","venue":null,"work_id":"23b9face-db4a-4da4-90a6-0f450940c1b7","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:51.986740Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:87b117a1594d4757cbcf09f1c8485c4f3282852dbf978f38db4f5fa7b8bc057c","observation_id":"626f1b15-9f18-432c-84a8-933b57be8e83","resolution":{"observed_at":"2026-08-14T12:35:53.359900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.342481Z","title":"Geodesic matting: A frame- work for fast interactive image and video segmentation and matting","venue":null,"work_id":"0bb2b5df-f4ed-4393-bbe7-9c1d50d15e41","year":2009},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:51.992126Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:5a691761807d33838066b44078aef9744b396cedee6a44c17e452df8bc011275","observation_id":"2b9dc712-1184-4df2-86a6-a201ca13ccc1","resolution":{"observed_at":"2026-08-14T12:35:53.346591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.329761Z","title":"Gcnet: Non-local networks meet squeeze-excitation networks and beyond","venue":null,"work_id":"285b36a4-d99d-49f2-a4cc-881d5d7fd7ed","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:51.997600Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:c21536f68e46e9a814849499a6b9343cac60b591d3114232b9cd97416b83a3f5","observation_id":"d673bee7-7ade-497d-b2fe-160e24897600","resolution":{"observed_at":"2026-08-14T12:35:53.334141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.317417Z","title":null,"venue":null,"work_id":"45120a76-d978-4acf-a8ca-51772872dcc0","year":2015},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.002895Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:e645335a88c2ceee20a3e40785ac25c37fd91f645284928dcf30e72ecf39180a","observation_id":"d35d649d-7b71-464f-bc8b-2bd4a545e5cf","resolution":{"observed_at":"2026-08-14T12:35:53.321856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.302813Z","title":"Rethinking atrous convolution for semantic image segmentation","venue":null,"work_id":"0b938280-cb24-4be8-bf15-750523b764b6","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.008814Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:55b2df7068d65c9396b114f7c76c87832652ee0029f3f54af9450bc2ff93a312","observation_id":"7430f2a8-082b-4f67-871e-130eec3d74c4","resolution":{"observed_at":"2026-08-14T12:35:53.308150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.287799Z","title":"Encoder-decoder with atrous separable convolution for semantic image segmentation","venue":null,"work_id":"fde15b77-d619-4c06-89ab-14bf46bf2977","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.014303Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:d4e7ebcd78422d8f070e52e025931db5938617444117cf432ee9bf79f816a6c7","observation_id":"49f14da5-1048-4a2a-a03d-4a96511b45e8","resolution":{"observed_at":"2026-08-14T12:35:53.292978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.273238Z","title":"Graph-based global reasoning networks","venue":null,"work_id":"b81b1e89-3ba3-43bb-aaa9-e88c34637c3b","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.019860Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:0d575f1c629c646287a228c9aa4c024bf42a444dcd592354da1769f266020be0","observation_id":"426c6399-2661-4ae4-b3d8-458d8f8a2af8","resolution":{"observed_at":"2026-08-14T12:35:53.276919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.260166Z","title":"Xception: Deep learning with depthwise separable convolutions","venue":null,"work_id":"7ff59cae-c13c-43b2-bb70-d01e6fac62d6","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.025065Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:84381e469c43678c9affc67620d90386250a82a26dd3fea8234bd344cb13166f","observation_id":"a09bfd07-0618-4e69-8095-175137e60203","resolution":{"observed_at":"2026-08-14T12:35:53.264689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.246949Z","title":"The cityscapes dataset for semantic urban scene understanding","venue":null,"work_id":"e906c8e3-1218-4e56-b62c-2bf90964dc4a","year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.031295Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:f9259b990238d8cd6ba56d4e8d1a67d6defef5acb662f159b1480d296a335b0a","observation_id":"4c050332-fdef-4bad-be63-ca5413816b3d","resolution":{"observed_at":"2026-08-14T12:35:53.251037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.233190Z","title":"Boxsup: Exploit- ing bounding boxes to supervise convolutional networks for semantic segmentation","venue":null,"work_id":"c238ccee-db3e-42ee-9f5a-2cf239e15022","year":2015},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.037638Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:854ad5ac220f3c16683f4dc3d6bc3ce47b6caed641dcff17fb6f9438ba6099c6","observation_id":"565c79d6-2ec8-4b15-afa5-b8c1b96e41f9","resolution":{"observed_at":"2026-08-14T12:35:53.238126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.217858Z","title":"R-fcn: Object detection via region-based fully convolutional networks","venue":null,"work_id":"cd124175-1cce-4110-9e49-b8c6b9a49b74","year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.042191Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:6d1549d17b848d033f404db5022c57d3b7a6a1bd87341d4ef9ba77ce6144c702","observation_id":"40b6a3e4-1a79-47a9-a80e-595319d69e74","resolution":{"observed_at":"2026-08-14T12:35:53.222365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.202225Z","title":"Deformable convolutional networks","venue":null,"work_id":"37a76e07-4b55-436c-8754-261a92bbbc67","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.046846Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:0b16a139879e639e4425cf44c348cec84c5107513fa92e762282249181b6cb8a","observation_id":"387f870c-a833-416a-8f64-7da599276977","resolution":{"observed_at":"2026-08-14T12:35:53.208543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.189439Z","title":"Dssd: Deconvolutional single shot detector","venue":null,"work_id":"dad655d2-97cb-40b5-a945-3299e0922dd5","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.053306Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:73b66d4f8b2b55540e249a733906a593791ee3fff70f70c4dd34e3c23e2f787c","observation_id":"df435838-e3a6-4a23-a421-2a2d7db5e087","resolution":{"observed_at":"2026-08-14T12:35:53.193704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.173920Z","title":"Dual attention network for scene segmentation","venue":null,"work_id":"f947a7e4-77d2-4f98-817f-022c4afb8c81","year":null},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.058736Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:bca3f7ca2a82505b14f97c3f5155c6f54ba66a8b333365e62bac396b196a1dbe","observation_id":"30ec0082-cbdc-4cc3-898b-18af44261a98","resolution":{"observed_at":"2026-08-14T12:35:53.178877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.159663Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":"e668c206-5a51-4099-be56-1ef8371fc780","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.064228Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:e521eccb9d019fac8fd824249ba748ce65bbb1b9843f69402b759fcb0548f5ef","observation_id":"1964a974-f077-4be3-b7b1-52a123ab95be","resolution":{"observed_at":"2026-08-14T12:35:53.163802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.142369Z","title":"Accurate, large minibatch sgd: Training imagenet in 1 hour","venue":null,"work_id":"328fbe4d-2215-45ad-9143-859e30fa21be","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.072619Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:7583dba7101fac722b665251f6759cc49bb25a41295ceb28c836aa891b6d9840","observation_id":"08769c02-b43e-40c9-9673-2d28a49655b2","resolution":{"observed_at":"2026-08-14T12:35:53.147901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.116645Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"ef5dda65-48c6-463d-9bec-ee621d82f294","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.077070Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:b265180a50ea82885b74729cd38a6ba5c4f8ecddc1c2601bc1372b5e8d377b44","observation_id":"a91a89f8-2a15-4c30-be0b-5ac52847304d","resolution":{"observed_at":"2026-08-14T12:35:53.124146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.089453Z","title":"Mask r-cnn","venue":null,"work_id":"2c84dd96-35b5-4129-ab6f-cf64ff744304","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.082621Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:797129027f9188e840025f5449710e22c2afe3321dd218245e65bf21c727cabf","observation_id":"98b27014-7130-4ec7-a70b-865ac4b93635","resolution":{"observed_at":"2026-08-14T12:35:53.094970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.071679Z","title":"Deep residual learning for image recognition","venue":null,"work_id":"062b7457-060b-476e-81fa-71726cd8245f","year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.087503Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:3f55e8968856acf47c8dfabe4e9b25bd0c212f2cc06d15d93d530c5633cfd31a","observation_id":"31164432-89a6-4227-a3db-360144a728bd","resolution":{"observed_at":"2026-08-14T12:35:53.076137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.054951Z","title":"Strip pooling: Rethinking spatial pooling for scene parsing","venue":null,"work_id":"59f99bfb-8c1c-4143-aed5-233887dcb1d3","year":2020},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.094014Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:e4b1d8db07ddd95e1734cbd994b715aa2beae19c95fe74db0af9d80fc00d93c5","observation_id":"b16c5b38-f71a-497f-a4e1-520b7e184603","resolution":{"observed_at":"2026-08-14T12:35:53.060561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.039583Z","title":"Ccnet: Criss-cross attention for semantic segmentation","venue":null,"work_id":"1da8b81d-a880-47b9-b1b0-bda815d50208","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.099700Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:7fd36479a3c6a191121d9e1826067f6147ffa93d4e1e1f2716687d128b9f1995","observation_id":"f5e78bbe-9fab-4c8a-a3ba-8f8bea1e9dce","resolution":{"observed_at":"2026-08-14T12:35:53.044442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:53.016036Z","title":"Spatial transformer networks","venue":null,"work_id":"ca9066f5-b7c5-40d5-a4da-11ba691eee3e","year":null},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.105773Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:5b6f6043a2544ae7b0becaf132245097dfd3306a0c4b9e89b90ce220168b8756","observation_id":"36ed41fe-c8fd-4804-b575-bf3d90ba86ba","resolution":{"observed_at":"2026-08-14T12:35:53.028880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.111849Z","title":"Dynamic filter networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.111849Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:3f608f833a18dde8e30133b3765ac23949b53f0c56cba8b7b33ac1019b03e573","observation_id":"52c3478c-f92c-4f5f-b2b3-de466184411b","resolution":{"observed_at":"2026-08-14T12:35:52.111849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.987822Z","title":"Semi-supervised classifi- cation with graph convolutional networks","venue":null,"work_id":"e70892ce-6316-4e72-bf61-0b9427ec9d03","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.127598Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:370d9ce0752b3f1fcf69456ad699fbfbab17c2b805bc64e9a9f1ac951598b6db","observation_id":"8b0f0574-1d99-48be-a649-d91a3482a33d","resolution":{"observed_at":"2026-08-14T12:35:52.991747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.973690Z","title":null,"venue":null,"work_id":"008915ff-be38-4c53-b420-f78abe8da0e8","year":2012},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.132637Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:69806a0c429893a1d4e0952db0260c0ea6c97a7e4def350f1254790d574e6061","observation_id":"6b5c4224-9c59-420e-835b-56fbe6797bfd","resolution":{"observed_at":"2026-08-14T12:35:52.978754Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.957657Z","title":"Efficient inference in fully connected crfs with gaussian edge potentials","venue":null,"work_id":"8d3261b8-4b98-4f32-b0bc-2fd20400efa8","year":null},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.137571Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:232ed52bcec8f09206ecb64f40de2232c6f01d428712d9b4630b3aecfe32da93","observation_id":"19d6ab59-707f-4806-98bd-0b8a9bb352ba","resolution":{"observed_at":"2026-08-14T12:35:52.963203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.943082Z","title":"Cornernet: Detecting objects as paired keypoints","venue":null,"work_id":"664bbf12-bde0-4b64-8d47-eb1e683be5d6","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.143796Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:093a064beebf449aaa2062a46ef978912d27f8a2f9838e007ad976612b2d4021","observation_id":"fb6641b4-1051-4e1f-9a39-016a89d6ecb2","resolution":{"observed_at":"2026-08-14T12:35:52.948239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.927815Z","title":"Sampling from large graphs","venue":null,"work_id":"c60e616e-e556-4798-8300-8106553e43f6","year":2006},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.149142Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:3580c371131fd2b9b4259af337a2bc1e271933c35ba6fde273d84bb6587585b1","observation_id":"c9fddb6b-6055-4cfc-9678-e784560ff80e","resolution":{"observed_at":"2026-08-14T12:35:52.933108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.911915Z","title":"Holistic, instance-level human parsing","venue":null,"work_id":"7931fef1-9e6d-493c-91dc-898b6ce9ec86","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.154500Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:51d07c355b2413faafd7dbec61bec35ec75cc903c5ade80a6df1b1beb6d2d444","observation_id":"74d5d45b-d70b-4ade-8676-cc7998c59194","resolution":{"observed_at":"2026-08-14T12:35:52.916524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.898272Z","title":"Global aggregation then local dis- tribution in fully convolutional networks","venue":null,"work_id":"79aaccae-8bcc-4039-8805-c1a932dfe7d0","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.161064Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:0fdc10c67daeec2373ec419b9b0a9687c891471eb79923e9c14c9d7e4a1371ab","observation_id":"16ab6992-6f41-4dee-a5f6-b5abacc1ee4b","resolution":{"observed_at":"2026-08-14T12:35:52.903057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.883145Z","title":"Gated graph sequence neural networks","venue":null,"work_id":"4901e109-0c72-4cb5-9276-d93b9dead6a7","year":null},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.165674Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:b6a3ea66c0f9d677ee7b0c3afe899791d45ca0f99bb02d51bf36c539c23ac60f","observation_id":"6e357284-6b22-4b7d-9dbd-e65553c0299d","resolution":{"observed_at":"2026-08-14T12:35:52.887668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.866942Z","title":"Deeply learning the messages in message passing inference","venue":null,"work_id":"ffd1be95-158a-477d-95b6-6b1fe5c1ac1f","year":2015},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.170122Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:f686d72137de545edacd439ef0b72057588b58199257dd79b617753c939d5a8c","observation_id":"eb3c3850-e826-4a3c-aa02-9cb6b5e08cc0","resolution":{"observed_at":"2026-08-14T12:35:52.872316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.852775Z","title":"Girshick, Kaiming He, Bharath Hariharan, and Serge J","venue":null,"work_id":"dde33a34-7569-4a02-a257-a1306e62984d","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.178755Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:3e04587b4619721448c143956fe49bf906190fb65bb1b66a9619b0f107743cab","observation_id":"dd951b77-001b-4f9c-b7d1-d65d7a120acd","resolution":{"observed_at":"2026-08-14T12:35:52.857814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.185039Z","title":"Focal loss for dense object detection","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.185039Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:e164c1f139d72ab8bbb64c608d72a17a6b81d0ff58302e0749bd6f6286e33528","observation_id":"7c6a8b38-873e-473b-a2a9-c8204aba2ed6","resolution":{"observed_at":"2026-08-14T12:35:52.185039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.829064Z","title":"Microsoft coco: Common objects in context","venue":null,"work_id":"4bee16ed-4bc5-426e-b4b3-dd1b40f1c9a0","year":2014},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.192336Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:997db9c0c0a777c76c86cb62cb46bdf549d118877812430fd37b9d83f8f2c372","observation_id":"bdd3d209-2f95-46ba-860c-ed047607b8c9","resolution":{"observed_at":"2026-08-14T12:35:52.834247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.813718Z","title":"Microsoft coco: Common objects in context","venue":null,"work_id":"af65dd7a-85a8-4ddb-857a-71092b24222b","year":2014},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.201375Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:8d7159068f805808d5eb2b9548eb8ad333a633f2ac0283eabbe479991dd72af3","observation_id":"0cb154ec-7e9b-49f4-b3b6-333ff6eafcf7","resolution":{"observed_at":"2026-08-14T12:35:52.818775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.795638Z","title":"Ssd: Single shot multibox detector","venue":null,"work_id":"fd7107b9-7337-42fb-bf08-2ec8b6e8c536","year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.206124Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:357841bb262de53f5b836489f879fbb2f0a8045e9686aee3ab2453a30abe9aad","observation_id":"8143ad34-11e7-4ff7-86fc-a0c6284aba6c","resolution":{"observed_at":"2026-08-14T12:35:52.801141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.779274Z","title":"maskrcnn-benchmark: Fast, modular reference implementation of Instance Seg- mentation and Object Detection algorithms in PyTorch","venue":null,"work_id":"bf747b8f-19da-4462-9e02-ca3d79e90751","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.214961Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:fb8c9573760c452fc1c9b72476afd9e3d2d9ff71d14965eb08ce8b83da4bc577","observation_id":"80500e34-58d4-409f-91e9-e047790baeda","resolution":{"observed_at":"2026-08-14T12:35:52.783861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.760807Z","title":"The role of context in object recognition","venue":null,"work_id":"95aab0e8-7785-4556-b8fe-4a24c241f500","year":2007},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.221747Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:ee4cb481cae003c5cba3e4aa9e4696ac38fed3fbad42dc9bf5c3111ff4615a2e","observation_id":"53bc379f-70ef-4b01-b4ae-f76efd853c78","resolution":{"observed_at":"2026-08-14T12:35:52.765964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.743712Z","title":"Libra r-cnn: Towards balanced learning for object detection","venue":null,"work_id":"2ebd499e-9fc0-41a2-aef0-002ff7bcc89d","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.227321Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:878975cc64fb7be96b4c9ef055faa4a38800fcdf892f4ddf9cbd8d164ebe5b4e","observation_id":"349c5978-e0bf-44e8-ac52-06127350d247","resolution":{"observed_at":"2026-08-14T12:35:52.750401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.726565Z","title":"Full-resolution residual networks for semantic segmentation in street scenes","venue":null,"work_id":"555997de-8b00-4a6e-ac69-4784d48f8ba5","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.231933Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:5ff356f971136c985827f4e333dddef199498b4137561a80220ea87b74bc2943","observation_id":"aef63ceb-9483-41c5-80bf-4200142061fc","resolution":{"observed_at":"2026-08-14T12:35:52.731217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.713653Z","title":"Objects in context","venue":null,"work_id":"b08ce537-ad2f-4b58-b01c-d91bdac067cf","year":2007},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.236916Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:652a83d9ee130112cd6d7895d5bc34d60facb3b89547fd05b3eeeee37b3fdb15","observation_id":"442dd5a6-b607-478f-9220-8cdb11eace77","resolution":{"observed_at":"2026-08-14T12:35:52.717459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.699185Z","title":"Yolov3: An incremental improvement","venue":null,"work_id":"4257d10b-f758-4313-b7d8-db6d6f0ebbd5","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.245721Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:3483b4fb742c3d36ffb09bee51d4333744f69efa1c58634a1874143c8c6b08bb","observation_id":"d6fadbbb-e2e5-4e4f-8dee-df4dccfc53ae","resolution":{"observed_at":"2026-08-14T12:35:52.704625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.682376Z","title":"In-place activated batchnorm for memory-optimized training of dnns","venue":null,"work_id":"f3ae4aad-4be6-472b-8b97-511f6fdca06e","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.250710Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:84625c0383cf73542eedaef06ce0b7a1b2aee3e4b32ece57516c810eb1a699b6","observation_id":"37b7d79c-bcd4-4e35-b9b4-6c4cf95fac79","resolution":{"observed_at":"2026-08-14T12:35:52.688610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.665185Z","title":"Training region-based object detectors with online hard ex- ample mining","venue":null,"work_id":"3538e51c-6984-41e5-850b-3d42422b75f2","year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.256151Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:3df78971a14c632a02fb3f3b941c5d36aea7add28553f0903b6a16e040c197d8","observation_id":"54d51745-d1ae-4bf1-8ca9-0229a70eeeba","resolution":{"observed_at":"2026-08-14T12:35:52.671776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.261015Z","title":"Very deep convolu- tional networks for large-scale image recognition","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.261015Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:33518e502db45cee0bfcb024f17e5b5a2e0e622e1f858a85afe5a33607ba3d3a","observation_id":"144bf887-3d21-4563-8450-fb74650ba1dc","resolution":{"observed_at":"2026-08-14T12:35:52.261015Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.268865Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.268865Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:62b41ee42b7ee0135328a964fd71ec50897f9a3990756df2c486ea196ac2a204","observation_id":"4937dd4c-a1be-4319-a329-4632c524214c","resolution":{"observed_at":"2026-08-14T12:35:52.268865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.619945Z","title":"Graph attention networks","venue":null,"work_id":"202ac9b2-a4e7-443e-b430-2f5a78018dcd","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.273886Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:98fc2a0d66bc3a8fa696cc89c200fe4864c67865add9e3d89e9660f39b6c2309","observation_id":"a29411b1-41c5-4052-a412-eb48356d6921","resolution":{"observed_at":"2026-08-14T12:35:52.624420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.604833Z","title":"Understanding convolu- tion for semantic segmentation","venue":null,"work_id":"d4959f18-7542-4024-a5f2-e8812ed41c4c","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.279253Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:bb246570f42c3f8c701e7a595402fc8b8ae2b368238c4d9a499c7f54f694d945","observation_id":"bae2db8d-8156-4baf-a5a4-efbf8985aed7","resolution":{"observed_at":"2026-08-14T12:35:52.609432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.588713Z","title":"Non-local neural networks","venue":null,"work_id":"944cb266-50dd-468b-9280-606bf26274bb","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.283578Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:a01147099f739669ce2bc3b0bebe06ffc27dc0eaef7cc9d716dc388d8a6e95fc","observation_id":"b5c1e88a-08cb-425c-baee-877d2f145c70","resolution":{"observed_at":"2026-08-14T12:35:52.593788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.573449Z","title":"Pay less attention with lightweight and dynamic convolutions","venue":null,"work_id":"28f34d3b-93f1-40fe-9043-c01a738aa054","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.292022Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:95770c2ef7e635668061d7aab33aa80b4f0890d9824457e002c6aca7250d4912","observation_id":"c36afff9-d4e1-4288-badd-bf8f497c02fa","resolution":{"observed_at":"2026-08-14T12:35:52.578525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.559051Z","title":"Aggregated residual transformations for deep neural networks","venue":null,"work_id":"e73d73ba-fd26-4336-a819-842ce3b8c52e","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.299887Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:6ddf2e31c56152d04efdbadc9cdeb32ca9196196d8856da810ce0e52dda082f1","observation_id":"00535288-82f9-4340-8c06-824141a77340","resolution":{"observed_at":"2026-08-14T12:35:52.563750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.545538Z","title":"Learning deep structured multi-scale features using attention-gated crfs for contour prediction","venue":null,"work_id":"03601bc7-7e1f-4858-b09c-fb8d1020c8fc","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.304232Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:19fa400e09a79b6f0f2dda820377f1204abdbeb8a3ac90e95d45a55d2d357c4e","observation_id":"ba217a3c-28b3-454a-9621-2c8e3a047c87","resolution":{"observed_at":"2026-08-14T12:35:52.549406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.532145Z","title":"Denseaspp for semantic segmentation in street scenes","venue":null,"work_id":"8eecd16e-9995-4dbb-bf71-f97638f918fc","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.309399Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:824e716c7e773f29d5ab340a2080e910666460ee9451e595722904e749b9b87f","observation_id":"277ec891-c9e9-4c23-b07a-114c484fe548","resolution":{"observed_at":"2026-08-14T12:35:52.536449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.516695Z","title":"Bisenet: Bilateral segmentation network for real-time semantic segmentation","venue":null,"work_id":"d2540978-2a48-46cb-b553-c9d6510d75bb","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.313161Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:46ee1ac89deed20785c6a88adafd48558cbd1a1b1076956dec2cd231ba68eb74","observation_id":"25fef9ee-817e-4cc7-9400-7441974bbb4e","resolution":{"observed_at":"2026-08-14T12:35:52.521463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.501142Z","title":"Multi-scale context aggrega- tion by dilated convolutions","venue":null,"work_id":"a17f50d2-a2fb-4aa2-8bdd-6698cda48454","year":2016},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.317672Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:81ad4175878e21fc91345dc48b001bce757a2edce9b801f7bea88adbd8a2ddf6","observation_id":"019092b2-c6d3-4594-b4b4-95aa79715248","resolution":{"observed_at":"2026-08-14T12:35:52.505429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.482124Z","title":"Ocnet: Object context network for scene parsing","venue":null,"work_id":"4f935bee-4a14-461f-8d32-7448719d10d6","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.321141Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:012b5b374c8a5d8fbba8c260793b11a21cd3fefcf2498d8302077440b523a0d4","observation_id":"3df83839-978f-4580-aea3-e50e2983e7b9","resolution":{"observed_at":"2026-08-14T12:35:52.487763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.463177Z","title":"Dual graph convolutional network for semantic segmentation","venue":null,"work_id":"ff34466a-83c4-4995-a60c-3a1ceb605615","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.324563Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:3cc6940b0d5b88e7740ea64a09052433f21cb4efc89971518332724c02c8f3d2","observation_id":"505eb6ca-c228-4ee1-bde9-389a0b4ba86c","resolution":{"observed_at":"2026-08-14T12:35:52.467383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.447295Z","title":"Pyramid scene parsing network","venue":null,"work_id":"9d0733ac-e51e-48bc-93e7-eb9a42e3b8df","year":2017},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.328545Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:463173a1fccaaf5e4aa7581c5005fdad6868c7fdfbd358c6e1dc70e9538004f2","observation_id":"29da8e33-0cfc-420f-ae02-06063ff52c38","resolution":{"observed_at":"2026-08-14T12:35:52.451847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.429346Z","title":"Psanet: Point-wise spatial attention network for scene parsing","venue":null,"work_id":"108b0341-b353-419d-81da-40de7d961ce5","year":2018},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.332771Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:2f2dee04754f54c47a74609fff00acb34e7bb90760f32de927402f1ca1d04474","observation_id":"9bb963e5-db95-4d58-9cc6-9ebb07cc59e3","resolution":{"observed_at":"2026-08-14T12:35:52.435087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.412059Z","title":null,"venue":null,"work_id":"2dcca9c4-d99f-4ae0-a937-f5b36e43366d","year":2015},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.337956Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:cf8defca30e1b3fa354218169684b4e43a87c542f2aeabb996c4bd1b1810ed28","observation_id":"05361c54-556a-46f5-afe6-f03ceb025ca5","resolution":{"observed_at":"2026-08-14T12:35:52.416800Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:52.384575Z","title":"De- formable convnets v2: More deformable, better results","venue":null,"work_id":"9bfa304e-4fe6-48f1-a1a1-42d9c14557a4","year":2019},"citing_paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks","version":5},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:52.341950Z"},"links":{"citing_paper":"/paper/1908.06955"},"observation_digest":"sha256:c1e5a391345649901ed416f446b4dad57f0bdc22a26824e9d729e74d0acfba43","observation_id":"5cd8ae6e-afd3-4397-954c-2ec558690896","resolution":{"observed_at":"2026-08-14T12:35:52.398236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06955","last_updated":"2022-09-15T03:42:47Z","latest_version":5,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T02:24:44.060882Z","submitted_at":"2019-08-19T17:46:34Z","title":"Dynamic Graph Message Passing Networks"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":56},"total_outbound_references":63},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:1908.06955."}