{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SIM73HZZUR2BXRYJVXXJ6SPT3E","short_pith_number":"pith:SIM73HZZ","schema_version":"1.0","canonical_sha256":"9219fd9f39a4741bc709adee9f49f3d920baedb715ed588aaaf43f86f3206f29","source":{"kind":"arxiv","id":"1809.02589","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.02589","created_at":"2026-05-17T23:45:22.490558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02589v4","created_at":"2026-05-17T23:45:22.490558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02589","created_at":"2026-05-17T23:45:22.490558+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIM73HZZUR2B","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIM73HZZUR2BXRYJ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIM73HZZ","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E","json":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E.json","graph_json":"https://pith.science/api/pith-number/SIM73HZZUR2BXRYJVXXJ6SPT3E/graph.json","events_json":"https://pith.science/api/pith-number/SIM73HZZUR2BXRYJVXXJ6SPT3E/events.json","paper":"https://pith.science/paper/SIM73HZZ"},"agent_actions":{"view_html":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E","download_json":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E.json","view_paper":"https://pith.science/paper/SIM73HZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02589&json=true","fetch_graph":"https://pith.science/api/pith-number/SIM73HZZUR2BXRYJVXXJ6SPT3E/graph.json","fetch_events":"https://pith.science/api/pith-number/SIM73HZZUR2BXRYJVXXJ6SPT3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/action/storage_attestation","attest_author":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/action/author_attestation","sign_citation":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/action/citation_signature","submit_replication":"https://pith.science/pith/SIM73HZZUR2BXRYJVXXJ6SPT3E/action/replication_record"}},"created_at":"2026-05-17T23:45:22.490558+00:00","updated_at":"2026-05-17T23:45:22.490558+00:00"}