{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TUMG62DCCG4IIWZST6QN7ERL6H","short_pith_number":"pith:TUMG62DC","canonical_record":{"source":{"id":"1905.00067","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T19:18:43Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f9d8b6bfed9ca1d7dbc883273246465284505d1d107447f1caaf725d3855b1c6","abstract_canon_sha256":"b9f523f0efb6ddab0b81ca98ec0c580c416eadbd225008791193557d4432222b"},"schema_version":"1.0"},"canonical_sha256":"9d186f686211b8845b329fa0df922bf1c21bb99d38aa7a7e1ee0b9acb0bc35c4","source":{"kind":"arxiv","id":"1905.00067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00067","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00067v3","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00067","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"TUMG62DCCG4I","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TUMG62DCCG4IIWZS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TUMG62DC","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TUMG62DCCG4IIWZST6QN7ERL6H","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00067","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T19:18:43Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f9d8b6bfed9ca1d7dbc883273246465284505d1d107447f1caaf725d3855b1c6","abstract_canon_sha256":"b9f523f0efb6ddab0b81ca98ec0c580c416eadbd225008791193557d4432222b"},"schema_version":"1.0"},"canonical_sha256":"9d186f686211b8845b329fa0df922bf1c21bb99d38aa7a7e1ee0b9acb0bc35c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:58.241039Z","signature_b64":"mcXdtMYNkc5KDFcGM7pxWMkqzoC/82xy73BsxN3LcQ5++fMYwRd4MvIS3boVmUytXrjlilK5Gej9XGFEExg2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d186f686211b8845b329fa0df922bf1c21bb99d38aa7a7e1ee0b9acb0bc35c4","last_reissued_at":"2026-05-17T23:42:58.240523Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:58.240523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00067","source_version":3,"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:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z615jxPCXDuGFk9WoVqVHQ0PBAiu4HTdKY1WWvJOcaxZY2OACzhIDoaBYXHcVsEpWcKnD1DcF8N+Ch/L9hwqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:24:40.821797Z"},"content_sha256":"ea5e75d7afa2784f730dba66bc196bf03b76081a8414dd1d9ed9445ac2703b18","schema_version":"1.0","event_id":"sha256:ea5e75d7afa2784f730dba66bc196bf03b76081a8414dd1d9ed9445ac2703b18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TUMG62DCCG4IIWZST6QN7ERL6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amol Kapoor, Aram Galstyan, Bryan Perozzi, Greg Ver Steeg, Hrayr Harutyunyan, Kristina Lerman, Nazanin Alipourfard, Sami Abu-el-haija","submitted_at":"2019-04-30T19:18:43Z","abstract_excerpt":"Existing popular methods for semi-supervised learning with Graph Neural Networks (such as the Graph Convolutional Network) provably cannot learn a general class of neighborhood mixing relationships. To address this weakness, we propose a new model, MixHop, that can learn these relationships, including difference operators, by repeatedly mixing feature representations of neighbors at various distances. Mixhop requires no additional memory or computational complexity, and outperforms on challenging baselines. In addition, we propose sparsity regularization that allows us to visualize how the net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00067","kind":"arxiv","version":3},"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:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5s5INzt29lGZMZLnW9fts7TpwBrBcgRWGsPT+IGRGiQuW2SYkYvvs5pAM5lD35DVYvklQHR7FLP7sHIO7jHWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:24:40.822239Z"},"content_sha256":"50a3aebdd2643c0b98df5b2797475f83841ba51eaf04ae4f44891b355d452a95","schema_version":"1.0","event_id":"sha256:50a3aebdd2643c0b98df5b2797475f83841ba51eaf04ae4f44891b355d452a95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUMG62DCCG4IIWZST6QN7ERL6H/bundle.json","state_url":"https://pith.science/pith/TUMG62DCCG4IIWZST6QN7ERL6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUMG62DCCG4IIWZST6QN7ERL6H/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-05-25T18:24:40Z","links":{"resolver":"https://pith.science/pith/TUMG62DCCG4IIWZST6QN7ERL6H","bundle":"https://pith.science/pith/TUMG62DCCG4IIWZST6QN7ERL6H/bundle.json","state":"https://pith.science/pith/TUMG62DCCG4IIWZST6QN7ERL6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUMG62DCCG4IIWZST6QN7ERL6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TUMG62DCCG4IIWZST6QN7ERL6H","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":"b9f523f0efb6ddab0b81ca98ec0c580c416eadbd225008791193557d4432222b","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T19:18:43Z","title_canon_sha256":"f9d8b6bfed9ca1d7dbc883273246465284505d1d107447f1caaf725d3855b1c6"},"schema_version":"1.0","source":{"id":"1905.00067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00067","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00067v3","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00067","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"TUMG62DCCG4I","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TUMG62DCCG4IIWZS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TUMG62DC","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:50a3aebdd2643c0b98df5b2797475f83841ba51eaf04ae4f44891b355d452a95","target":"graph","created_at":"2026-05-17T23:42:58Z","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":"Existing popular methods for semi-supervised learning with Graph Neural Networks (such as the Graph Convolutional Network) provably cannot learn a general class of neighborhood mixing relationships. To address this weakness, we propose a new model, MixHop, that can learn these relationships, including difference operators, by repeatedly mixing feature representations of neighbors at various distances. Mixhop requires no additional memory or computational complexity, and outperforms on challenging baselines. In addition, we propose sparsity regularization that allows us to visualize how the net","authors_text":"Amol Kapoor, Aram Galstyan, Bryan Perozzi, Greg Ver Steeg, Hrayr Harutyunyan, Kristina Lerman, Nazanin Alipourfard, Sami Abu-el-haija","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T19:18:43Z","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00067","kind":"arxiv","version":3},"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:ea5e75d7afa2784f730dba66bc196bf03b76081a8414dd1d9ed9445ac2703b18","target":"record","created_at":"2026-05-17T23:42:58Z","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":"b9f523f0efb6ddab0b81ca98ec0c580c416eadbd225008791193557d4432222b","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-30T19:18:43Z","title_canon_sha256":"f9d8b6bfed9ca1d7dbc883273246465284505d1d107447f1caaf725d3855b1c6"},"schema_version":"1.0","source":{"id":"1905.00067","kind":"arxiv","version":3}},"canonical_sha256":"9d186f686211b8845b329fa0df922bf1c21bb99d38aa7a7e1ee0b9acb0bc35c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d186f686211b8845b329fa0df922bf1c21bb99d38aa7a7e1ee0b9acb0bc35c4","first_computed_at":"2026-05-17T23:42:58.240523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:58.240523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mcXdtMYNkc5KDFcGM7pxWMkqzoC/82xy73BsxN3LcQ5++fMYwRd4MvIS3boVmUytXrjlilK5Gej9XGFEExg2Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:58.241039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea5e75d7afa2784f730dba66bc196bf03b76081a8414dd1d9ed9445ac2703b18","sha256:50a3aebdd2643c0b98df5b2797475f83841ba51eaf04ae4f44891b355d452a95"],"state_sha256":"61559c1819a510987cc9884a858632218108c84233647e06e1db9b491f82c25d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdHcs+iTAj3wBVjsrf3j5+Tj3NvRBSqkmz/A/3AfrZS8p46vCzkE86ATS3Labxj/Fr11rchYzelVlPPuH6KiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:24:40.824746Z","bundle_sha256":"fe2f8d8ceb7d57a9938f9ea346f5eb72127ab6ef657145a492ea9400cce8a93f"}}