{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2E7VKBHGJNYUTXAVZKEAOGHYPT","short_pith_number":"pith:2E7VKBHG","canonical_record":{"source":{"id":"2010.07565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-15T07:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"571d18cf94a091b5465d8671bbefe9c5fd1542d07bc61705db99e702711fbfa4","abstract_canon_sha256":"ff78ca330a42d0248ec79d4bb0d2678b8839d4ed837345b5a7d75006b0d7545d"},"schema_version":"1.0"},"canonical_sha256":"d13f5504e64b7149dc15ca880718f87cdaaafabb00438b41490271373c5acf33","source":{"kind":"arxiv","id":"2010.07565","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.07565","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"2010.07565v2","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.07565","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"2E7VKBHGJNYU","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"pith_short_16","alias_value":"2E7VKBHGJNYUTXAV","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"pith_short_8","alias_value":"2E7VKBHG","created_at":"2026-07-05T03:56:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2E7VKBHGJNYUTXAVZKEAOGHYPT","target":"record","payload":{"canonical_record":{"source":{"id":"2010.07565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-15T07:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"571d18cf94a091b5465d8671bbefe9c5fd1542d07bc61705db99e702711fbfa4","abstract_canon_sha256":"ff78ca330a42d0248ec79d4bb0d2678b8839d4ed837345b5a7d75006b0d7545d"},"schema_version":"1.0"},"canonical_sha256":"d13f5504e64b7149dc15ca880718f87cdaaafabb00438b41490271373c5acf33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:27.669294Z","signature_b64":"sDefo8YDB6BbpX2HCSJa3snqBUdW/8PJ/hQWIygJPnJWeAxnkQ23TXgpkJoVbUO1F+wHBgNh8qtqpqi5POVJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d13f5504e64b7149dc15ca880718f87cdaaafabb00438b41490271373c5acf33","last_reissued_at":"2026-07-05T03:56:27.668894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:27.668894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.07565","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-05T03:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"We9SgtvxEJbPLyPGECR4s2uoqWZSg8mr9mVou7PuR2Ud7dHwwz7xfaJHA0DmHn1opzA3X68CBI5R527wGtIQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:45:59.057509Z"},"content_sha256":"6e57fc0b7abf58daa93b178eac05f089725622412522cc80c5c8cee12abb4e45","schema_version":"1.0","event_id":"sha256:6e57fc0b7abf58daa93b178eac05f089725622412522cc80c5c8cee12abb4e45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2E7VKBHGJNYUTXAVZKEAOGHYPT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bi-GCN: Binary Graph Convolutional Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junfu Wang, Liang Yang, Yuanfang Guo, Yunhong Wang, Zhen Yang","submitted_at":"2020-10-15T07:26:23Z","abstract_excerpt":"Graph Neural Networks (GNNs) have achieved tremendous success in graph representation learning. Unfortunately, current GNNs usually rely on loading the entire attributed graph into network for processing. This implicit assumption may not be satisfied with limited memory resources, especially when the attributed graph is large. In this paper, we pioneer to propose a Binary Graph Convolutional Network (Bi-GCN), which binarizes both the network parameters and input node features. Besides, the original matrix multiplications are revised to binary operations for accelerations. According to the theo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.07565","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/2010.07565/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-05T03:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YppECh1zgwsoSmRJFlRGeKbLxd4fK37VGS2yclzNmF9vYHbhjpVacfLlpIGyxGaRy07JraNtw/7Qro9+cAqGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:45:59.058027Z"},"content_sha256":"55b5acff5add758949e78a9c966cdb74e901364cdd0f429964f455a174a981e3","schema_version":"1.0","event_id":"sha256:55b5acff5add758949e78a9c966cdb74e901364cdd0f429964f455a174a981e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2E7VKBHGJNYUTXAVZKEAOGHYPT/bundle.json","state_url":"https://pith.science/pith/2E7VKBHGJNYUTXAVZKEAOGHYPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2E7VKBHGJNYUTXAVZKEAOGHYPT/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-03T15:45:59Z","links":{"resolver":"https://pith.science/pith/2E7VKBHGJNYUTXAVZKEAOGHYPT","bundle":"https://pith.science/pith/2E7VKBHGJNYUTXAVZKEAOGHYPT/bundle.json","state":"https://pith.science/pith/2E7VKBHGJNYUTXAVZKEAOGHYPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2E7VKBHGJNYUTXAVZKEAOGHYPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2E7VKBHGJNYUTXAVZKEAOGHYPT","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":"ff78ca330a42d0248ec79d4bb0d2678b8839d4ed837345b5a7d75006b0d7545d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-15T07:26:23Z","title_canon_sha256":"571d18cf94a091b5465d8671bbefe9c5fd1542d07bc61705db99e702711fbfa4"},"schema_version":"1.0","source":{"id":"2010.07565","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.07565","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"2010.07565v2","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.07565","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"2E7VKBHGJNYU","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"pith_short_16","alias_value":"2E7VKBHGJNYUTXAV","created_at":"2026-07-05T03:56:27Z"},{"alias_kind":"pith_short_8","alias_value":"2E7VKBHG","created_at":"2026-07-05T03:56:27Z"}],"graph_snapshots":[{"event_id":"sha256:55b5acff5add758949e78a9c966cdb74e901364cdd0f429964f455a174a981e3","target":"graph","created_at":"2026-07-05T03:56:27Z","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/2010.07565/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) have achieved tremendous success in graph representation learning. Unfortunately, current GNNs usually rely on loading the entire attributed graph into network for processing. This implicit assumption may not be satisfied with limited memory resources, especially when the attributed graph is large. In this paper, we pioneer to propose a Binary Graph Convolutional Network (Bi-GCN), which binarizes both the network parameters and input node features. Besides, the original matrix multiplications are revised to binary operations for accelerations. According to the theo","authors_text":"Junfu Wang, Liang Yang, Yuanfang Guo, Yunhong Wang, Zhen Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-15T07:26:23Z","title":"Bi-GCN: Binary Graph Convolutional Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.07565","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:6e57fc0b7abf58daa93b178eac05f089725622412522cc80c5c8cee12abb4e45","target":"record","created_at":"2026-07-05T03:56:27Z","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":"ff78ca330a42d0248ec79d4bb0d2678b8839d4ed837345b5a7d75006b0d7545d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-15T07:26:23Z","title_canon_sha256":"571d18cf94a091b5465d8671bbefe9c5fd1542d07bc61705db99e702711fbfa4"},"schema_version":"1.0","source":{"id":"2010.07565","kind":"arxiv","version":2}},"canonical_sha256":"d13f5504e64b7149dc15ca880718f87cdaaafabb00438b41490271373c5acf33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d13f5504e64b7149dc15ca880718f87cdaaafabb00438b41490271373c5acf33","first_computed_at":"2026-07-05T03:56:27.668894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:27.668894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sDefo8YDB6BbpX2HCSJa3snqBUdW/8PJ/hQWIygJPnJWeAxnkQ23TXgpkJoVbUO1F+wHBgNh8qtqpqi5POVJDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:27.669294Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.07565","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e57fc0b7abf58daa93b178eac05f089725622412522cc80c5c8cee12abb4e45","sha256:55b5acff5add758949e78a9c966cdb74e901364cdd0f429964f455a174a981e3"],"state_sha256":"b1b83f8f1895b062835c121846dde70c1f9eea9ccd1cedf31a50b7657a65b821"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgBfQfYS3Z0lAiV68gSoObOpPYjlnQlnnwUX3pHTrofbB+T8J2b3GQF7H+juNPbX4Jq8wYvIvxmuJebwdOgLAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:45:59.061902Z","bundle_sha256":"d4a7bc90fba46985ebead897cc8d3498f11e57dda08dd8a319bf32616e6ac0fe"}}