{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VGBLEI2B2YLQFUG7UIGV7IULCN","short_pith_number":"pith:VGBLEI2B","canonical_record":{"source":{"id":"1910.01735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-04T02:59:13Z","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"title_canon_sha256":"0fa5072cbaad523511366bcf12e4a66d7182c6942f3f6ff51704748a2340f9a1","abstract_canon_sha256":"5afbd418048c09d78eda81634c6fba903e3f82867e1ba5db16edc851bec9f946"},"schema_version":"1.0"},"canonical_sha256":"a982b22341d61702d0dfa20d5fa28b13537bed32ba9289060dc5b482fa8b348b","source":{"kind":"arxiv","id":"1910.01735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.01735","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"1910.01735v2","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.01735","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"VGBLEI2B2YLQ","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"pith_short_16","alias_value":"VGBLEI2B2YLQFUG7","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"pith_short_8","alias_value":"VGBLEI2B","created_at":"2026-07-05T00:20:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VGBLEI2B2YLQFUG7UIGV7IULCN","target":"record","payload":{"canonical_record":{"source":{"id":"1910.01735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-04T02:59:13Z","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"title_canon_sha256":"0fa5072cbaad523511366bcf12e4a66d7182c6942f3f6ff51704748a2340f9a1","abstract_canon_sha256":"5afbd418048c09d78eda81634c6fba903e3f82867e1ba5db16edc851bec9f946"},"schema_version":"1.0"},"canonical_sha256":"a982b22341d61702d0dfa20d5fa28b13537bed32ba9289060dc5b482fa8b348b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:44.397733Z","signature_b64":"tGsCjW9i7hqB8FB24NZh9cooHJkcs7EOEon/Pj2vNyRcM/2re9XTWqQN8h0WXkxL2hmwbmOK8lgTUkC+IDVtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a982b22341d61702d0dfa20d5fa28b13537bed32ba9289060dc5b482fa8b348b","last_reissued_at":"2026-07-05T00:20:44.397255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:44.397255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.01735","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfqHQKwrS1gA66J8lQbN/eNW2//NHtC/mR7ltsSWVwQMcSIVxVcZy8Mm0UXiZxmLQt1KPmiAOsQ1EsW948/XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:39:57.107408Z"},"content_sha256":"157513ae5d2824fab7ac00ede13c7076987e9d837fa5189d376c5dfc1b7ceec8","schema_version":"1.0","event_id":"sha256:157513ae5d2824fab7ac00ede13c7076987e9d837fa5189d376c5dfc1b7ceec8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VGBLEI2B2YLQFUG7UIGV7IULCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GmCN: Graph Mask Convolutional Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","stat.ML"],"primary_cat":"cs.CV","authors_text":"Beibei Wang, Bin Luo, Bo Jiang, Jin Tang","submitted_at":"2019-09-04T02:59:13Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have shown very powerful for graph data representation and learning tasks. Existing GCNs usually conduct feature aggregation on a fixed neighborhood graph in which each node computes its representation by aggregating the feature representations of all its neighbors which is biased by its own representation. However, this fixed aggregation strategy is not guaranteed to be optimal for GCN based graph learning and also can be affected by some graph structure noises, such as incorrect or undesired edge connections. To address these issues, we propose a novel Gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.01735","kind":"arxiv","version":2},"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/1910.01735/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdqETaSlwe8zdmR6CwvffPnL43XzLsYcE/+ctorN0T1fIdg+IeLnZdREWHMSmWmAB81ER7sZvYwhNmNZsLJ/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:39:57.108291Z"},"content_sha256":"2921ac93862a4e2cb17e43b8ea38d9a6d132e43c9135395a17ddf1e129b989b0","schema_version":"1.0","event_id":"sha256:2921ac93862a4e2cb17e43b8ea38d9a6d132e43c9135395a17ddf1e129b989b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGBLEI2B2YLQFUG7UIGV7IULCN/bundle.json","state_url":"https://pith.science/pith/VGBLEI2B2YLQFUG7UIGV7IULCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGBLEI2B2YLQFUG7UIGV7IULCN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-17T09:39:57Z","links":{"resolver":"https://pith.science/pith/VGBLEI2B2YLQFUG7UIGV7IULCN","bundle":"https://pith.science/pith/VGBLEI2B2YLQFUG7UIGV7IULCN/bundle.json","state":"https://pith.science/pith/VGBLEI2B2YLQFUG7UIGV7IULCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGBLEI2B2YLQFUG7UIGV7IULCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VGBLEI2B2YLQFUG7UIGV7IULCN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5afbd418048c09d78eda81634c6fba903e3f82867e1ba5db16edc851bec9f946","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-04T02:59:13Z","title_canon_sha256":"0fa5072cbaad523511366bcf12e4a66d7182c6942f3f6ff51704748a2340f9a1"},"schema_version":"1.0","source":{"id":"1910.01735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.01735","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"1910.01735v2","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.01735","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"VGBLEI2B2YLQ","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"pith_short_16","alias_value":"VGBLEI2B2YLQFUG7","created_at":"2026-07-05T00:20:44Z"},{"alias_kind":"pith_short_8","alias_value":"VGBLEI2B","created_at":"2026-07-05T00:20:44Z"}],"graph_snapshots":[{"event_id":"sha256:2921ac93862a4e2cb17e43b8ea38d9a6d132e43c9135395a17ddf1e129b989b0","target":"graph","created_at":"2026-07-05T00:20:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.01735/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Convolutional Networks (GCNs) have shown very powerful for graph data representation and learning tasks. Existing GCNs usually conduct feature aggregation on a fixed neighborhood graph in which each node computes its representation by aggregating the feature representations of all its neighbors which is biased by its own representation. However, this fixed aggregation strategy is not guaranteed to be optimal for GCN based graph learning and also can be affected by some graph structure noises, such as incorrect or undesired edge connections. To address these issues, we propose a novel Gra","authors_text":"Beibei Wang, Bin Luo, Bo Jiang, Jin Tang","cross_cats":["cs.LG","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-04T02:59:13Z","title":"GmCN: Graph Mask Convolutional Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.01735","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:157513ae5d2824fab7ac00ede13c7076987e9d837fa5189d376c5dfc1b7ceec8","target":"record","created_at":"2026-07-05T00:20:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5afbd418048c09d78eda81634c6fba903e3f82867e1ba5db16edc851bec9f946","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-04T02:59:13Z","title_canon_sha256":"0fa5072cbaad523511366bcf12e4a66d7182c6942f3f6ff51704748a2340f9a1"},"schema_version":"1.0","source":{"id":"1910.01735","kind":"arxiv","version":2}},"canonical_sha256":"a982b22341d61702d0dfa20d5fa28b13537bed32ba9289060dc5b482fa8b348b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a982b22341d61702d0dfa20d5fa28b13537bed32ba9289060dc5b482fa8b348b","first_computed_at":"2026-07-05T00:20:44.397255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:44.397255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tGsCjW9i7hqB8FB24NZh9cooHJkcs7EOEon/Pj2vNyRcM/2re9XTWqQN8h0WXkxL2hmwbmOK8lgTUkC+IDVtCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:44.397733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.01735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:157513ae5d2824fab7ac00ede13c7076987e9d837fa5189d376c5dfc1b7ceec8","sha256:2921ac93862a4e2cb17e43b8ea38d9a6d132e43c9135395a17ddf1e129b989b0"],"state_sha256":"aaa128abb5b6ff07ceaad3ffe31c34e348827eeb94c74460bcbbe72f952c68b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6qMJlO4pAuZuZ6iaZ1X+9zOLmapQvCfNMtZ59zrQt8NQ8PInMkDqIu65ILQJfc3hTjUjc35M8aR2UsEX08TDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T09:39:57.116542Z","bundle_sha256":"d2d62fe57523f37e63fad79f9d1c973df3b00732e152cacd9334bcc43bb9d5d0"}}