{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OTWAORHZME3LINCHFJP7E6IOCO","short_pith_number":"pith:OTWAORHZ","canonical_record":{"source":{"id":"2210.13149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-24T12:05:17Z","cross_cats_sorted":[],"title_canon_sha256":"9df67143e1a3b0cd4e9cb87defcb6aaa02f7e8e9ee257131da19a65965ede9fd","abstract_canon_sha256":"e6b1bf55ec41ec0a92d56c12ad33e2703a32b71b75197feb37192674c92f5ed8"},"schema_version":"1.0"},"canonical_sha256":"74ec0744f96136b434472a5ff2790e13a2289dafc567971d0630c54d6406115a","source":{"kind":"arxiv","id":"2210.13149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.13149","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"2210.13149v1","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.13149","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"OTWAORHZME3L","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTWAORHZME3LINCH","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTWAORHZ","created_at":"2026-07-05T05:09:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OTWAORHZME3LINCHFJP7E6IOCO","target":"record","payload":{"canonical_record":{"source":{"id":"2210.13149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-24T12:05:17Z","cross_cats_sorted":[],"title_canon_sha256":"9df67143e1a3b0cd4e9cb87defcb6aaa02f7e8e9ee257131da19a65965ede9fd","abstract_canon_sha256":"e6b1bf55ec41ec0a92d56c12ad33e2703a32b71b75197feb37192674c92f5ed8"},"schema_version":"1.0"},"canonical_sha256":"74ec0744f96136b434472a5ff2790e13a2289dafc567971d0630c54d6406115a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:36.656739Z","signature_b64":"F+hIK+STxdsvsVmYGTvEogj3L3yveWvyXLHS9xsTXuz4fKJ9WH5Ug97LJHe/Wnj2cPD1pIuSEhykoLSR2w0wCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ec0744f96136b434472a5ff2790e13a2289dafc567971d0630c54d6406115a","last_reissued_at":"2026-07-05T05:09:36.656061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:36.656061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.13149","source_version":1,"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-05T05:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"49tuiLvfZwWRl5mE/dQ6ZnlDgUoVQp7gb2KfM/LLCl97Q4zsyDikoJgb0cWug3/EXSGKRleMdJKWLTtJf0cuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-23T13:13:01.458875Z"},"content_sha256":"befcbf177cd9b307eec82b0aa37a74f69f653c9aeda26e72f286f50a8101c3fd","schema_version":"1.0","event_id":"sha256:befcbf177cd9b307eec82b0aa37a74f69f653c9aeda26e72f286f50a8101c3fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OTWAORHZME3LINCHFJP7E6IOCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Graph Convolutional Network with Capacity Exploration","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","submitted_at":"2022-10-24T12:05:17Z","abstract_excerpt":"The current success of Graph Neural Networks (GNNs) usually relies on loading the entire attributed graph for processing, which may not be satisfied with limited memory resources, especially when the attributed graph is large. This paper pioneers to propose a Binary Graph Convolutional Network (Bi-GCN), which binarizes both the network parameters and input node attributes and exploits binary operations instead of floating-point matrix multiplications for network compression and acceleration. Meanwhile, we also propose a new gradient approximation based back-propagation method to properly train"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.13149","kind":"arxiv","version":1},"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/2210.13149/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-05T05:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErhnDT18JVeUo4k9rnT32+lFxp8XDkW4waNbURXiDsedZRsh3DXpOCbLESekv9/iXUlPVR/1UXOGzLuRBGC5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-23T13:13:01.459243Z"},"content_sha256":"f18b40ecd21e89bd7041f2be76e975efb732d410f1e7e8dc025f7fe30b5e0d0a","schema_version":"1.0","event_id":"sha256:f18b40ecd21e89bd7041f2be76e975efb732d410f1e7e8dc025f7fe30b5e0d0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTWAORHZME3LINCHFJP7E6IOCO/bundle.json","state_url":"https://pith.science/pith/OTWAORHZME3LINCHFJP7E6IOCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTWAORHZME3LINCHFJP7E6IOCO/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-07-23T13:13:01Z","links":{"resolver":"https://pith.science/pith/OTWAORHZME3LINCHFJP7E6IOCO","bundle":"https://pith.science/pith/OTWAORHZME3LINCHFJP7E6IOCO/bundle.json","state":"https://pith.science/pith/OTWAORHZME3LINCHFJP7E6IOCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTWAORHZME3LINCHFJP7E6IOCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OTWAORHZME3LINCHFJP7E6IOCO","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":"e6b1bf55ec41ec0a92d56c12ad33e2703a32b71b75197feb37192674c92f5ed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-24T12:05:17Z","title_canon_sha256":"9df67143e1a3b0cd4e9cb87defcb6aaa02f7e8e9ee257131da19a65965ede9fd"},"schema_version":"1.0","source":{"id":"2210.13149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.13149","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"2210.13149v1","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.13149","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"OTWAORHZME3L","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTWAORHZME3LINCH","created_at":"2026-07-05T05:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTWAORHZ","created_at":"2026-07-05T05:09:36Z"}],"graph_snapshots":[{"event_id":"sha256:f18b40ecd21e89bd7041f2be76e975efb732d410f1e7e8dc025f7fe30b5e0d0a","target":"graph","created_at":"2026-07-05T05:09:36Z","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/2210.13149/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The current success of Graph Neural Networks (GNNs) usually relies on loading the entire attributed graph for processing, which may not be satisfied with limited memory resources, especially when the attributed graph is large. This paper pioneers to propose a Binary Graph Convolutional Network (Bi-GCN), which binarizes both the network parameters and input node attributes and exploits binary operations instead of floating-point matrix multiplications for network compression and acceleration. Meanwhile, we also propose a new gradient approximation based back-propagation method to properly train","authors_text":"Junfu Wang, Liang Yang, Yuanfang Guo, Yunhong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-24T12:05:17Z","title":"Binary Graph Convolutional Network with Capacity Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.13149","kind":"arxiv","version":1},"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:befcbf177cd9b307eec82b0aa37a74f69f653c9aeda26e72f286f50a8101c3fd","target":"record","created_at":"2026-07-05T05:09:36Z","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":"e6b1bf55ec41ec0a92d56c12ad33e2703a32b71b75197feb37192674c92f5ed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-24T12:05:17Z","title_canon_sha256":"9df67143e1a3b0cd4e9cb87defcb6aaa02f7e8e9ee257131da19a65965ede9fd"},"schema_version":"1.0","source":{"id":"2210.13149","kind":"arxiv","version":1}},"canonical_sha256":"74ec0744f96136b434472a5ff2790e13a2289dafc567971d0630c54d6406115a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74ec0744f96136b434472a5ff2790e13a2289dafc567971d0630c54d6406115a","first_computed_at":"2026-07-05T05:09:36.656061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:09:36.656061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F+hIK+STxdsvsVmYGTvEogj3L3yveWvyXLHS9xsTXuz4fKJ9WH5Ug97LJHe/Wnj2cPD1pIuSEhykoLSR2w0wCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:09:36.656739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.13149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:befcbf177cd9b307eec82b0aa37a74f69f653c9aeda26e72f286f50a8101c3fd","sha256:f18b40ecd21e89bd7041f2be76e975efb732d410f1e7e8dc025f7fe30b5e0d0a"],"state_sha256":"b3b9fd01494bd2aba5a38332643b8684b8821da05a0288e42041b7fb1a7de109"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GsBZmqLNQah2fiV4aM3P4ZzEI7/dBM0OWr8C9oXVtcAOEcLM4L+uOkJhM+7CpUFzyrR11KYkQBOaAwgQwqmpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-23T13:13:01.461814Z","bundle_sha256":"e2e98f54e6e65f3c66d148638b1bb8b7609e91834ae2a786c6c52bfd28688f6c"}}