{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SIM73HZZUR2BXRYJVXXJ6SPT3E","short_pith_number":"pith:SIM73HZZ","canonical_record":{"source":{"id":"1809.02589","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T17:27:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a78b4ec63aefd88016a2fc061801c10a0f800beaf7369b2538ff850bf5ea693e","abstract_canon_sha256":"7ef117b90ff3333e4e6635dc2b5513e8b13615c172686f5e49f2df623e84a2fe"},"schema_version":"1.0"},"canonical_sha256":"9219fd9f39a4741bc709adee9f49f3d920baedb715ed588aaaf43f86f3206f29","source":{"kind":"arxiv","id":"1809.02589","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02589","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02589v4","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02589","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"SIM73HZZUR2B","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SIM73HZZUR2BXRYJ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SIM73HZZ","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SIM73HZZUR2BXRYJVXXJ6SPT3E","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02589","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T17:27:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a78b4ec63aefd88016a2fc061801c10a0f800beaf7369b2538ff850bf5ea693e","abstract_canon_sha256":"7ef117b90ff3333e4e6635dc2b5513e8b13615c172686f5e49f2df623e84a2fe"},"schema_version":"1.0"},"canonical_sha256":"9219fd9f39a4741bc709adee9f49f3d920baedb715ed588aaaf43f86f3206f29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:22.491079Z","signature_b64":"sGdjlT9MHSHlgWN+SscynynutW9rVkBgHODD6A15sFKMp7K0FLExuD+bJHvrhgmQ4natwi327dBIvaloie9CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9219fd9f39a4741bc709adee9f49f3d920baedb715ed588aaaf43f86f3206f29","last_reissued_at":"2026-05-17T23:45:22.490475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:22.490475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02589","source_version":4,"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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIG3MKhmISllNx4wLGXGEMXgavZVBDo7T/If5xqlzxZ6IAYxW/4q6CjT8tJgXz7FD63BsxjW1knNe5fuzi5lBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:49:24.109291Z"},"content_sha256":"4f34c4da3a805e3c7c7d5487d9410570c3beff20b2c682cc34d40216e1e94611","schema_version":"1.0","event_id":"sha256:4f34c4da3a805e3c7c7d5487d9410570c3beff20b2c682cc34d40216e1e94611"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SIM73HZZUR2BXRYJVXXJ6SPT3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anand Louis, Madhav Nimishakavi, Naganand Yadati, Partha Talukdar, Prateek Yadav, Vikram Nitin","submitted_at":"2018-09-07T17:27:25Z","abstract_excerpt":"In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise. Hypergraphs provide a flexible and natural modeling tool to model such complex relationships. The obvious existence of such complex relationships in many real-world networks naturaly motivates the problem of learning with hypergraphs. A popular learning paradigm is hypergraph-based semi-supervised learning (SSL) where the goal is to assign labels to initially unlabeled vertices in a hypergraph. Motivated by the fact that a graph convolutional netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02589","kind":"arxiv","version":4},"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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bQ29YYmla6VaaWD3vUFZDktQJxOGRyf6sXNeIZpJOqtUpNa1jcgk/9gpHDT/EPamK5CxQ0lM/dB+y3hJ4Y4hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:49:24.109969Z"},"content_sha256":"97cadbe1e69536631033163bd2c782bb83fe71a0b9a65b32423e722aafde0b13","schema_version":"1.0","event_id":"sha256:97cadbe1e69536631033163bd2c782bb83fe71a0b9a65b32423e722aafde0b13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/bundle.json","state_url":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/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-24T17:49:24Z","links":{"resolver":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E","bundle":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/bundle.json","state":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SIM73HZZUR2BXRYJVXXJ6SPT3E","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":"7ef117b90ff3333e4e6635dc2b5513e8b13615c172686f5e49f2df623e84a2fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T17:27:25Z","title_canon_sha256":"a78b4ec63aefd88016a2fc061801c10a0f800beaf7369b2538ff850bf5ea693e"},"schema_version":"1.0","source":{"id":"1809.02589","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02589","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02589v4","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02589","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"SIM73HZZUR2B","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SIM73HZZUR2BXRYJ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SIM73HZZ","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:97cadbe1e69536631033163bd2c782bb83fe71a0b9a65b32423e722aafde0b13","target":"graph","created_at":"2026-05-17T23:45:22Z","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":"In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise. Hypergraphs provide a flexible and natural modeling tool to model such complex relationships. The obvious existence of such complex relationships in many real-world networks naturaly motivates the problem of learning with hypergraphs. A popular learning paradigm is hypergraph-based semi-supervised learning (SSL) where the goal is to assign labels to initially unlabeled vertices in a hypergraph. Motivated by the fact that a graph convolutional netw","authors_text":"Anand Louis, Madhav Nimishakavi, Naganand Yadati, Partha Talukdar, Prateek Yadav, Vikram Nitin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T17:27:25Z","title":"HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02589","kind":"arxiv","version":4},"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:4f34c4da3a805e3c7c7d5487d9410570c3beff20b2c682cc34d40216e1e94611","target":"record","created_at":"2026-05-17T23:45:22Z","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":"7ef117b90ff3333e4e6635dc2b5513e8b13615c172686f5e49f2df623e84a2fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T17:27:25Z","title_canon_sha256":"a78b4ec63aefd88016a2fc061801c10a0f800beaf7369b2538ff850bf5ea693e"},"schema_version":"1.0","source":{"id":"1809.02589","kind":"arxiv","version":4}},"canonical_sha256":"9219fd9f39a4741bc709adee9f49f3d920baedb715ed588aaaf43f86f3206f29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9219fd9f39a4741bc709adee9f49f3d920baedb715ed588aaaf43f86f3206f29","first_computed_at":"2026-05-17T23:45:22.490475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:22.490475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sGdjlT9MHSHlgWN+SscynynutW9rVkBgHODD6A15sFKMp7K0FLExuD+bJHvrhgmQ4natwi327dBIvaloie9CCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:22.491079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02589","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f34c4da3a805e3c7c7d5487d9410570c3beff20b2c682cc34d40216e1e94611","sha256:97cadbe1e69536631033163bd2c782bb83fe71a0b9a65b32423e722aafde0b13"],"state_sha256":"21a02963aa247d466b78be776cb998634b6c4735892477146adc4a49016a44d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"th9f7ys5msREI5CWw2LFJs3wCMeBIPmikNXm/mDoldCVswce+fG88+3EROly5T7Dpw3RVN2CeUHNwq2wfhV7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:49:24.112848Z","bundle_sha256":"33c71f8ead3c5d8f3494a3709c550ca604f8c051dc9e790467d8fba95edd3c78"}}