{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SSSSURFOPMS4DR5S6LBIHTFENO","short_pith_number":"pith:SSSSURFO","schema_version":"1.0","canonical_sha256":"94a52a44ae7b25c1c7b2f2c283cca46bbf421a1b8c8694e1655e75f6cc184130","source":{"kind":"arxiv","id":"1908.06955","version":5},"attestation_state":"computed","paper":{"title":"Dynamic Graph Message Passing Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Anurag Arnab, Dan Xu, Li Zhang, Philip H.S. Torr","submitted_at":"2019-08-19T17:46:34Z","abstract_excerpt":"Modelling long-range dependencies is critical for scene understanding tasks in computer vision. Although CNNs have excelled in many vision tasks, they are still limited in capturing long-range structured relationships as they typically consist of layers of local kernels. A fully-connected graph is beneficial for such modelling, however, its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity compared to related works modelling a fully-connected graph. This is achieved by adaptively sampling nodes in "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.06955","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-08-19T17:46:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2c81e21fad40cf4821c8779f81838992ca92c9971975548865b449e4710909bb","abstract_canon_sha256":"db81496b5cb71e584fde9a30e7fd755e02e1d626ee43f5dc86b05370addcd9ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:57:40.980123Z","signature_b64":"ZfB9+veZJlHRr0kXq+WGO2qmP+FgeHZqMGwrsImY+DL/CULhdyMiOw1OGxKhPMGOgg8PiPQlppWKZiY6wyxiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a52a44ae7b25c1c7b2f2c283cca46bbf421a1b8c8694e1655e75f6cc184130","last_reissued_at":"2026-07-05T04:57:40.979736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:57:40.979736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Graph Message Passing Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Anurag Arnab, Dan Xu, Li Zhang, Philip H.S. Torr","submitted_at":"2019-08-19T17:46:34Z","abstract_excerpt":"Modelling long-range dependencies is critical for scene understanding tasks in computer vision. Although CNNs have excelled in many vision tasks, they are still limited in capturing long-range structured relationships as they typically consist of layers of local kernels. A fully-connected graph is beneficial for such modelling, however, its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity compared to related works modelling a fully-connected graph. This is achieved by adaptively sampling nodes in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06955","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06955/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.06955","created_at":"2026-07-05T04:57:40.979791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06955v5","created_at":"2026-07-05T04:57:40.979791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06955","created_at":"2026-07-05T04:57:40.979791+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSSSURFOPMS4","created_at":"2026-07-05T04:57:40.979791+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSSSURFOPMS4DR5S","created_at":"2026-07-05T04:57:40.979791+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSSSURFO","created_at":"2026-07-05T04:57:40.979791+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO","json":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO.json","graph_json":"https://pith.science/api/pith-number/SSSSURFOPMS4DR5S6LBIHTFENO/graph.json","events_json":"https://pith.science/api/pith-number/SSSSURFOPMS4DR5S6LBIHTFENO/events.json","paper":"https://pith.science/paper/SSSSURFO"},"agent_actions":{"view_html":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO","download_json":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO.json","view_paper":"https://pith.science/paper/SSSSURFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06955&json=true","fetch_graph":"https://pith.science/api/pith-number/SSSSURFOPMS4DR5S6LBIHTFENO/graph.json","fetch_events":"https://pith.science/api/pith-number/SSSSURFOPMS4DR5S6LBIHTFENO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO/action/storage_attestation","attest_author":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO/action/author_attestation","sign_citation":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO/action/citation_signature","submit_replication":"https://pith.science/pith/SSSSURFOPMS4DR5S6LBIHTFENO/action/replication_record"}},"created_at":"2026-07-05T04:57:40.979791+00:00","updated_at":"2026-07-05T04:57:40.979791+00:00"}