{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3VERHFJN7ECOUKDO7E6CX3QMLJ","short_pith_number":"pith:3VERHFJN","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"},"canonical_sha256":"dd4913952df904ea286ef93c2bee0c5a7dcfef4c137eed2bf8c9d2bfbeb85875","source":{"kind":"arxiv","id":"2103.09660","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09660","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09660v5","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09660","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"pith_short_12","alias_value":"3VERHFJN7ECO","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"pith_short_16","alias_value":"3VERHFJN7ECOUKDO","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"pith_short_8","alias_value":"3VERHFJN","created_at":"2026-07-05T03:51:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3VERHFJN7ECOUKDO7E6CX3QMLJ","target":"record","payload":{"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"},"canonical_sha256":"dd4913952df904ea286ef93c2bee0c5a7dcfef4c137eed2bf8c9d2bfbeb85875","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"},"source_kind":"arxiv","source_id":"2103.09660","source_version":5,"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-07-05T03:51:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0W79qgXD6o4+Ll2ev+N36jM806j7R7KE2xm0+8TfL/0yrflHGv8lcOV9Pfm9P3deTJjo84feFLgjrtxyuqNmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:10:26.636337Z"},"content_sha256":"def95407b6ce400cedc97e17789a52c01511468bac3d5a353480a6c887f6d3bb","schema_version":"1.0","event_id":"sha256:def95407b6ce400cedc97e17789a52c01511468bac3d5a353480a6c887f6d3bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3VERHFJN7ECOUKDO7E6CX3QMLJ","target":"graph","payload":{"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"},"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-07-05T03:51:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNAckXXnuIJXX85eCDiZOwA94U04ddtDom7bvESAJzCBaCDXBs8Oz7SWxtxFlln0tFAQgOKOJ/vqR4cfnnd8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:10:26.636707Z"},"content_sha256":"ff551ce628b475fd5605e4a2d33828f3dea64e532793df93cf215da633fed30f","schema_version":"1.0","event_id":"sha256:ff551ce628b475fd5605e4a2d33828f3dea64e532793df93cf215da633fed30f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/bundle.json","state_url":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/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-07-06T15:10:26Z","links":{"resolver":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ","bundle":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/bundle.json","state":"https://pith.science/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VERHFJN7ECOUKDO7E6CX3QMLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3VERHFJN7ECOUKDO7E6CX3QMLJ","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":"b6e6242f022adae8dfbbe482661436da6fc4e61bec9d697e4665e50c22088c89","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2021-03-09T18:06:56Z","title_canon_sha256":"09f51874164a3a8f954f96794afdb0ae1832abcb3d95841d775750d13891b9b3"},"schema_version":"1.0","source":{"id":"2103.09660","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09660","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09660v5","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09660","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"pith_short_12","alias_value":"3VERHFJN7ECO","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"pith_short_16","alias_value":"3VERHFJN7ECOUKDO","created_at":"2026-07-05T03:51:42Z"},{"alias_kind":"pith_short_8","alias_value":"3VERHFJN","created_at":"2026-07-05T03:51:42Z"}],"graph_snapshots":[{"event_id":"sha256:ff551ce628b475fd5605e4a2d33828f3dea64e532793df93cf215da633fed30f","target":"graph","created_at":"2026-07-05T03:51:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.09660/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dennis P. Wall, Donya Saless, Keshav Pingali, Sepideh Maleki","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2021-03-09T18:06:56Z","title":"Scalable Hypergraph Embedding System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09660","kind":"arxiv","version":5},"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:def95407b6ce400cedc97e17789a52c01511468bac3d5a353480a6c887f6d3bb","target":"record","created_at":"2026-07-05T03:51:42Z","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":"b6e6242f022adae8dfbbe482661436da6fc4e61bec9d697e4665e50c22088c89","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2021-03-09T18:06:56Z","title_canon_sha256":"09f51874164a3a8f954f96794afdb0ae1832abcb3d95841d775750d13891b9b3"},"schema_version":"1.0","source":{"id":"2103.09660","kind":"arxiv","version":5}},"canonical_sha256":"dd4913952df904ea286ef93c2bee0c5a7dcfef4c137eed2bf8c9d2bfbeb85875","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd4913952df904ea286ef93c2bee0c5a7dcfef4c137eed2bf8c9d2bfbeb85875","first_computed_at":"2026-07-05T03:51:42.688090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:51:42.688090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OHadZS1ce9s+jWV/QUELw3FbHwMFlKwxPSeQw5z4QKpEjwjJTPsS5k4Ll3YO2EL3Xl5/Fs4zjBz0seVJqSLLBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:51:42.688587Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.09660","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def95407b6ce400cedc97e17789a52c01511468bac3d5a353480a6c887f6d3bb","sha256:ff551ce628b475fd5605e4a2d33828f3dea64e532793df93cf215da633fed30f"],"state_sha256":"02fa279d4757939e683c533da2d219079aed1d160874ad55fc94685af056b23c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHHAIFkFllkpV+jkPUk7w5AX0Gyj1UJr3Oo+xJqLiHvu+8KmXL+YlZtLZBrCGF+zL6k9WGGkdBlhKYrwAMNnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:10:26.638650Z","bundle_sha256":"c2f7c9101cdb2afa1b9af261df70efea0ebba76d9203673a306b49715578452d"}}