{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OWPCVVMCJ3T56WSN7SMFJWCYBT","short_pith_number":"pith:OWPCVVMC","schema_version":"1.0","canonical_sha256":"759e2ad5824ee7df5a4dfc9854d8580ce1a08164a9fa24d5b4e6aae397e4800c","source":{"kind":"arxiv","id":"2010.04558","version":1},"attestation_state":"computed","paper":{"title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Deepak K. Gupta, Devanshu Arya, Marcel Worring, Stevan Rudinac","submitted_at":"2020-10-09T13:28:06Z","abstract_excerpt":"Graphs are the most ubiquitous form of structured data representation used in machine learning. They model, however, only pairwise relations between nodes and are not designed for encoding the higher-order relations found in many real-world datasets. To model such complex relations, hypergraphs have proven to be a natural representation. Learning the node representations in a hypergraph is more complex than in a graph as it involves information propagation at two levels: within every hyperedge and across the hyperedges. Most current approaches first transform a hypergraph structure to a graph "},"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":"2010.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-09T13:28:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f73e03f948d3203a1892b5cc9f0e386bb9cd4580ace2c683426e3fc103d20b44","abstract_canon_sha256":"b05e9cf833b460e787833e4b9883f8cace3f92369fe638a750950990caa34ea5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:39.559347Z","signature_b64":"BsXCBLg3QA27yzD8Kptfg6ExXpyXSSXf0Q6lzctNtvDILF11GAkHI4HzESJ9y9wTMpmODO5yuqIw4qzM0zcZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"759e2ad5824ee7df5a4dfc9854d8580ce1a08164a9fa24d5b4e6aae397e4800c","last_reissued_at":"2026-07-05T01:41:39.558844Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:39.558844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Deepak K. Gupta, Devanshu Arya, Marcel Worring, Stevan Rudinac","submitted_at":"2020-10-09T13:28:06Z","abstract_excerpt":"Graphs are the most ubiquitous form of structured data representation used in machine learning. They model, however, only pairwise relations between nodes and are not designed for encoding the higher-order relations found in many real-world datasets. To model such complex relations, hypergraphs have proven to be a natural representation. Learning the node representations in a hypergraph is more complex than in a graph as it involves information propagation at two levels: within every hyperedge and across the hyperedges. Most current approaches first transform a hypergraph structure to a graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04558","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/2010.04558/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":"2010.04558","created_at":"2026-07-05T01:41:39.558904+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.04558v1","created_at":"2026-07-05T01:41:39.558904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04558","created_at":"2026-07-05T01:41:39.558904+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWPCVVMCJ3T5","created_at":"2026-07-05T01:41:39.558904+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWPCVVMCJ3T56WSN","created_at":"2026-07-05T01:41:39.558904+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWPCVVMC","created_at":"2026-07-05T01:41:39.558904+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13690","citing_title":"The WidthWall: A Strict Expressivity Hierarchy for Hypergraph Neural Networks","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10091","citing_title":"TopoU-Net: a U-Net architecture for topological domains","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10955","citing_title":"Hypergraph Neural Diffusion: A PDE-Inspired Framework for Hypergraph Message Passing","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT","json":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT.json","graph_json":"https://pith.science/api/pith-number/OWPCVVMCJ3T56WSN7SMFJWCYBT/graph.json","events_json":"https://pith.science/api/pith-number/OWPCVVMCJ3T56WSN7SMFJWCYBT/events.json","paper":"https://pith.science/paper/OWPCVVMC"},"agent_actions":{"view_html":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT","download_json":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT.json","view_paper":"https://pith.science/paper/OWPCVVMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.04558&json=true","fetch_graph":"https://pith.science/api/pith-number/OWPCVVMCJ3T56WSN7SMFJWCYBT/graph.json","fetch_events":"https://pith.science/api/pith-number/OWPCVVMCJ3T56WSN7SMFJWCYBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/action/storage_attestation","attest_author":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/action/author_attestation","sign_citation":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/action/citation_signature","submit_replication":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/action/replication_record"}},"created_at":"2026-07-05T01:41:39.558904+00:00","updated_at":"2026-07-05T01:41:39.558904+00:00"}