{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VJPWXHUZV2DAIOZ4KHZQ4UXRRD","short_pith_number":"pith:VJPWXHUZ","canonical_record":{"source":{"id":"1812.03813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-17T02:43:59Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"f2e27b82d53564a53b1d8f49a2ae31114cf1fea332f31e5d5cc72af7c251dd72","abstract_canon_sha256":"39c11dc2265bc866181b7aefd0ff3bcd9f27d6720474d54cdbc4da170ca385fa"},"schema_version":"1.0"},"canonical_sha256":"aa5f6b9e99ae86043b3c51f30e52f188c83a239478372e8e9197c1f4193964a9","source":{"kind":"arxiv","id":"1812.03813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03813","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03813v2","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03813","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"VJPWXHUZV2DA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VJPWXHUZV2DAIOZ4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VJPWXHUZ","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VJPWXHUZV2DAIOZ4KHZQ4UXRRD","target":"record","payload":{"canonical_record":{"source":{"id":"1812.03813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-17T02:43:59Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"f2e27b82d53564a53b1d8f49a2ae31114cf1fea332f31e5d5cc72af7c251dd72","abstract_canon_sha256":"39c11dc2265bc866181b7aefd0ff3bcd9f27d6720474d54cdbc4da170ca385fa"},"schema_version":"1.0"},"canonical_sha256":"aa5f6b9e99ae86043b3c51f30e52f188c83a239478372e8e9197c1f4193964a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:24.584668Z","signature_b64":"rzsV/gCclDBFBOtuoRaLhOMPsYnbfYxG9dCNc4brbM9xRwzPdZmVVuEmTULIQ3quFoxm5EuCZJzJzO2PEQGMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa5f6b9e99ae86043b3c51f30e52f188c83a239478372e8e9197c1f4193964a9","last_reissued_at":"2026-05-17T23:58:24.584109Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:24.584109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.03813","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-05-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFrZGnYK61JSmG/AXPWDl5X/DWxRRwGW9GOQdzTuWS74xhZY9jyK/nKYGR/jHRVSa1tpWj/ev3ErgBz8nZwqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:51:57.190237Z"},"content_sha256":"8392f2f0804f780cb9f45ca4b463f03a4ec58f18b5edcb17d122c7096a71535e","schema_version":"1.0","event_id":"sha256:8392f2f0804f780cb9f45ca4b463f03a4ec58f18b5edcb17d122c7096a71535e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VJPWXHUZV2DAIOZ4KHZQ4UXRRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Bipartite Graph Convolution Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Marcel Nassar","submitted_at":"2018-11-17T02:43:59Z","abstract_excerpt":"Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of graph neural network architectures remains highly fragmented impeding the development of optimized implementations similar to what is available for convolutional neural networks. In this work, we present BiGraphNet, a graph neural network architecture that generalizes many popular graph neural network models and enables new efficient operations similar to those supported by Co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03813","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":""},"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-05-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQ8R27H/PpJf2jG9tDLr9tGIWt5fPYtrC8L/KhVoOnqoa/bnF4xeGYkfOgyB09Sp37FpB0lgBqh1u66TJXDDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:51:57.190614Z"},"content_sha256":"2a79106a3f7ef59fd7378627f66b3e34129fdc20cb5ebd813c02091465aebe1e","schema_version":"1.0","event_id":"sha256:2a79106a3f7ef59fd7378627f66b3e34129fdc20cb5ebd813c02091465aebe1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/bundle.json","state_url":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/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-06-02T19:51:57Z","links":{"resolver":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD","bundle":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/bundle.json","state":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VJPWXHUZV2DAIOZ4KHZQ4UXRRD","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":"39c11dc2265bc866181b7aefd0ff3bcd9f27d6720474d54cdbc4da170ca385fa","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-17T02:43:59Z","title_canon_sha256":"f2e27b82d53564a53b1d8f49a2ae31114cf1fea332f31e5d5cc72af7c251dd72"},"schema_version":"1.0","source":{"id":"1812.03813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03813","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03813v2","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03813","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"VJPWXHUZV2DA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VJPWXHUZV2DAIOZ4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VJPWXHUZ","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:2a79106a3f7ef59fd7378627f66b3e34129fdc20cb5ebd813c02091465aebe1e","target":"graph","created_at":"2026-05-17T23:58:24Z","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"},"paper":{"abstract_excerpt":"Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of graph neural network architectures remains highly fragmented impeding the development of optimized implementations similar to what is available for convolutional neural networks. In this work, we present BiGraphNet, a graph neural network architecture that generalizes many popular graph neural network models and enables new efficient operations similar to those supported by Co","authors_text":"Marcel Nassar","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-17T02:43:59Z","title":"Hierarchical Bipartite Graph Convolution Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03813","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:8392f2f0804f780cb9f45ca4b463f03a4ec58f18b5edcb17d122c7096a71535e","target":"record","created_at":"2026-05-17T23:58:24Z","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":"39c11dc2265bc866181b7aefd0ff3bcd9f27d6720474d54cdbc4da170ca385fa","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-17T02:43:59Z","title_canon_sha256":"f2e27b82d53564a53b1d8f49a2ae31114cf1fea332f31e5d5cc72af7c251dd72"},"schema_version":"1.0","source":{"id":"1812.03813","kind":"arxiv","version":2}},"canonical_sha256":"aa5f6b9e99ae86043b3c51f30e52f188c83a239478372e8e9197c1f4193964a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa5f6b9e99ae86043b3c51f30e52f188c83a239478372e8e9197c1f4193964a9","first_computed_at":"2026-05-17T23:58:24.584109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:24.584109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rzsV/gCclDBFBOtuoRaLhOMPsYnbfYxG9dCNc4brbM9xRwzPdZmVVuEmTULIQ3quFoxm5EuCZJzJzO2PEQGMAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:24.584668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.03813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8392f2f0804f780cb9f45ca4b463f03a4ec58f18b5edcb17d122c7096a71535e","sha256:2a79106a3f7ef59fd7378627f66b3e34129fdc20cb5ebd813c02091465aebe1e"],"state_sha256":"74bcf0bb3fc77f40a941110e66923b93f962d3104ef34eb92da304ca5b9012d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYXLHyt5IqEdjiw2Qr1i+isHJeIQJoudbDMYmgkZ/pVdzZ5p2QNjWaGfDUcZDzcSoKnYnedEpxbTq4P5y4rhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:51:57.192515Z","bundle_sha256":"c5d331f404cb51b5893ce1a6bb5e80dedd5310a820a9501b12b647e2f945513b"}}