{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:77OBT2D6YZEKCLDEIX6KEX4HKO","short_pith_number":"pith:77OBT2D6","schema_version":"1.0","canonical_sha256":"ffdc19e87ec648a12c6445fca25f87539314a0bf36eb59e07a3243f7283c006f","source":{"kind":"arxiv","id":"2311.16670","version":1},"attestation_state":"computed","paper":{"title":"PyTorch Geometric High Order: A Unified Library for High Order Graph Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Muhan Zhang, Xiyuan Wang","submitted_at":"2023-11-28T10:34:48Z","abstract_excerpt":"We introduce PyTorch Geometric High Order (PyGHO), a library for High Order Graph Neural Networks (HOGNNs) that extends PyTorch Geometric (PyG). Unlike ordinary Message Passing Neural Networks (MPNNs) that exchange messages between nodes, HOGNNs, encompassing subgraph GNNs and k-WL GNNs, encode node tuples, a method previously lacking a standardized framework and often requiring complex coding. PyGHO's main objective is to provide an unified and user-friendly interface for various HOGNNs. It accomplishes this through streamlined data structures for node tuples, comprehensive data processing ut"},"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":"2311.16670","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-28T10:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"e9a689be601b4f2fc99ac999e60e423e328d3f1becd8492bfd13488a6af641e0","abstract_canon_sha256":"01becc0222dc73c7d393f9c69d53077851c67cda7f00bd06e22e5c78144069ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:44.649852Z","signature_b64":"pjg8UagfE9abndUR7WrkXHxDkG2asW3m8PCpB+1RIblGOLxePkrapYE7HD7ImgpiBbPeQHbmqEU/UZPBqjf7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdc19e87ec648a12c6445fca25f87539314a0bf36eb59e07a3243f7283c006f","last_reissued_at":"2026-07-05T07:17:44.649327Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:44.649327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PyTorch Geometric High Order: A Unified Library for High Order Graph Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Muhan Zhang, Xiyuan Wang","submitted_at":"2023-11-28T10:34:48Z","abstract_excerpt":"We introduce PyTorch Geometric High Order (PyGHO), a library for High Order Graph Neural Networks (HOGNNs) that extends PyTorch Geometric (PyG). Unlike ordinary Message Passing Neural Networks (MPNNs) that exchange messages between nodes, HOGNNs, encompassing subgraph GNNs and k-WL GNNs, encode node tuples, a method previously lacking a standardized framework and often requiring complex coding. PyGHO's main objective is to provide an unified and user-friendly interface for various HOGNNs. It accomplishes this through streamlined data structures for node tuples, comprehensive data processing ut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16670","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/2311.16670/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.16670","created_at":"2026-07-05T07:17:44.649405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.16670v1","created_at":"2026-07-05T07:17:44.649405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16670","created_at":"2026-07-05T07:17:44.649405+00:00"},{"alias_kind":"pith_short_12","alias_value":"77OBT2D6YZEK","created_at":"2026-07-05T07:17:44.649405+00:00"},{"alias_kind":"pith_short_16","alias_value":"77OBT2D6YZEKCLDE","created_at":"2026-07-05T07:17:44.649405+00:00"},{"alias_kind":"pith_short_8","alias_value":"77OBT2D6","created_at":"2026-07-05T07:17:44.649405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02479","citing_title":"Using Random Noise Equivariantly to Boost Graph Neural Networks Universally","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO","json":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO.json","graph_json":"https://pith.science/api/pith-number/77OBT2D6YZEKCLDEIX6KEX4HKO/graph.json","events_json":"https://pith.science/api/pith-number/77OBT2D6YZEKCLDEIX6KEX4HKO/events.json","paper":"https://pith.science/paper/77OBT2D6"},"agent_actions":{"view_html":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO","download_json":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO.json","view_paper":"https://pith.science/paper/77OBT2D6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.16670&json=true","fetch_graph":"https://pith.science/api/pith-number/77OBT2D6YZEKCLDEIX6KEX4HKO/graph.json","fetch_events":"https://pith.science/api/pith-number/77OBT2D6YZEKCLDEIX6KEX4HKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO/action/storage_attestation","attest_author":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO/action/author_attestation","sign_citation":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO/action/citation_signature","submit_replication":"https://pith.science/pith/77OBT2D6YZEKCLDEIX6KEX4HKO/action/replication_record"}},"created_at":"2026-07-05T07:17:44.649405+00:00","updated_at":"2026-07-05T07:17:44.649405+00:00"}