{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VJPWXHUZV2DAIOZ4KHZQ4UXRRD","short_pith_number":"pith:VJPWXHUZ","schema_version":"1.0","canonical_sha256":"aa5f6b9e99ae86043b3c51f30e52f188c83a239478372e8e9197c1f4193964a9","source":{"kind":"arxiv","id":"1812.03813","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.03813","created_at":"2026-05-17T23:58:24.584200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03813v2","created_at":"2026-05-17T23:58:24.584200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03813","created_at":"2026-05-17T23:58:24.584200+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJPWXHUZV2DA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJPWXHUZV2DAIOZ4","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJPWXHUZ","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.08793","citing_title":"Hierarchical Community Detection in Bipartite Networks","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD","json":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD.json","graph_json":"https://pith.science/api/pith-number/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/graph.json","events_json":"https://pith.science/api/pith-number/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/events.json","paper":"https://pith.science/paper/VJPWXHUZ"},"agent_actions":{"view_html":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD","download_json":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD.json","view_paper":"https://pith.science/paper/VJPWXHUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03813&json=true","fetch_graph":"https://pith.science/api/pith-number/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/graph.json","fetch_events":"https://pith.science/api/pith-number/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/action/storage_attestation","attest_author":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/action/author_attestation","sign_citation":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/action/citation_signature","submit_replication":"https://pith.science/pith/VJPWXHUZV2DAIOZ4KHZQ4UXRRD/action/replication_record"}},"created_at":"2026-05-17T23:58:24.584200+00:00","updated_at":"2026-05-17T23:58:24.584200+00:00"}