{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3VERHFJN7ECOUKDO7E6CX3QMLJ","short_pith_number":"pith:3VERHFJN","schema_version":"1.0","canonical_sha256":"dd4913952df904ea286ef93c2bee0c5a7dcfef4c137eed2bf8c9d2bfbeb85875","source":{"kind":"arxiv","id":"2103.09660","version":5},"attestation_state":"computed","paper":{"title":"Scalable Hypergraph Embedding System","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Dennis P. Wall, Donya Saless, Keshav Pingali, Sepideh Maleki","submitted_at":"2021-03-09T18:06:56Z","abstract_excerpt":"Many problems such as node classification and link prediction in network data can be solved using graph embeddings. However, it is difficult to use graphs to capture non-binary relations such as communities of nodes. These kinds of complex relations are expressed more naturally as hypergraphs. While hypergraphs are a generalization of graphs, state-of-the-art graph embedding techniques are not adequate for solving prediction and classification tasks on large hypergraphs accurately in reasonable time. In this paper, we introduce HyperNetVec, a novel hierarchical framework for scalable unsupervi"},"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":"2103.09660","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2021-03-09T18:06:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"09f51874164a3a8f954f96794afdb0ae1832abcb3d95841d775750d13891b9b3","abstract_canon_sha256":"b6e6242f022adae8dfbbe482661436da6fc4e61bec9d697e4665e50c22088c89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:42.688587Z","signature_b64":"OHadZS1ce9s+jWV/QUELw3FbHwMFlKwxPSeQw5z4QKpEjwjJTPsS5k4Ll3YO2EL3Xl5/Fs4zjBz0seVJqSLLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd4913952df904ea286ef93c2bee0c5a7dcfef4c137eed2bf8c9d2bfbeb85875","last_reissued_at":"2026-07-05T03:51:42.688090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:42.688090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Hypergraph Embedding System","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Dennis P. Wall, Donya Saless, Keshav Pingali, Sepideh Maleki","submitted_at":"2021-03-09T18:06:56Z","abstract_excerpt":"Many problems such as node classification and link prediction in network data can be solved using graph embeddings. However, it is difficult to use graphs to capture non-binary relations such as communities of nodes. These kinds of complex relations are expressed more naturally as hypergraphs. While hypergraphs are a generalization of graphs, state-of-the-art graph embedding techniques are not adequate for solving prediction and classification tasks on large hypergraphs accurately in reasonable time. In this paper, we introduce HyperNetVec, a novel hierarchical framework for scalable unsupervi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09660","kind":"arxiv","version":5},"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/2103.09660/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":"2103.09660","created_at":"2026-07-05T03:51:42.688156+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.09660v5","created_at":"2026-07-05T03:51:42.688156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09660","created_at":"2026-07-05T03:51:42.688156+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VERHFJN7ECO","created_at":"2026-07-05T03:51:42.688156+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VERHFJN7ECOUKDO","created_at":"2026-07-05T03:51:42.688156+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VERHFJN","created_at":"2026-07-05T03:51:42.688156+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/3VERHFJN7ECOUKDO7E6CX3QMLJ","json":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ.json","graph_json":"https://pith.science/api/pith-number/3VERHFJN7ECOUKDO7E6CX3QMLJ/graph.json","events_json":"https://pith.science/api/pith-number/3VERHFJN7ECOUKDO7E6CX3QMLJ/events.json","paper":"https://pith.science/paper/3VERHFJN"},"agent_actions":{"view_html":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ","download_json":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ.json","view_paper":"https://pith.science/paper/3VERHFJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.09660&json=true","fetch_graph":"https://pith.science/api/pith-number/3VERHFJN7ECOUKDO7E6CX3QMLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3VERHFJN7ECOUKDO7E6CX3QMLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/action/storage_attestation","attest_author":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/action/author_attestation","sign_citation":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/action/citation_signature","submit_replication":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/action/replication_record"}},"created_at":"2026-07-05T03:51:42.688156+00:00","updated_at":"2026-07-05T03:51:42.688156+00:00"}