{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:R253S3XQL4KNQ5PFLZC5PBQHCI","short_pith_number":"pith:R253S3XQ","canonical_record":{"source":{"id":"1911.02613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-06T20:10:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"60acef62c17e6c006d9f477ed00960f26b2133694628f0dce025822e4b77c5de","abstract_canon_sha256":"5a06fe74aaab1b56e14cd4cb821e8f80fdaa490669963358dcef8548c131d5ba"},"schema_version":"1.0"},"canonical_sha256":"8ebbb96ef05f14d875e55e45d78607123ba294ef3e507423489ea54ed4211472","source":{"kind":"arxiv","id":"1911.02613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.02613","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"arxiv_version","alias_value":"1911.02613v1","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.02613","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_12","alias_value":"R253S3XQL4KN","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_16","alias_value":"R253S3XQL4KNQ5PF","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_8","alias_value":"R253S3XQ","created_at":"2026-07-05T00:17:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:R253S3XQL4KNQ5PFLZC5PBQHCI","target":"record","payload":{"canonical_record":{"source":{"id":"1911.02613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-06T20:10:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"60acef62c17e6c006d9f477ed00960f26b2133694628f0dce025822e4b77c5de","abstract_canon_sha256":"5a06fe74aaab1b56e14cd4cb821e8f80fdaa490669963358dcef8548c131d5ba"},"schema_version":"1.0"},"canonical_sha256":"8ebbb96ef05f14d875e55e45d78607123ba294ef3e507423489ea54ed4211472","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:39.719363Z","signature_b64":"bffg7a7H5EZC+RJXxBfPMnPKvz77IzlijOjTfl8F1peZBqjbTMlBgcMApy1cD3OpCrOl1U3l6Gl/B4nMWEawDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ebbb96ef05f14d875e55e45d78607123ba294ef3e507423489ea54ed4211472","last_reissued_at":"2026-07-05T00:17:39.718914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:39.718914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.02613","source_version":1,"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-05T00:17:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ua+WnNEN9BA5SRDzLWwgAeiAzumxEgbJ/a0fiDas8+b/qXp5vXqY4VKjEOjDgRCyyxZHOxdnT61UEr8o3ymZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:41:47.762265Z"},"content_sha256":"af8edf4b3ec6c6a91350fa782e7070569a05599ba91775ec7a9c759136041790","schema_version":"1.0","event_id":"sha256:af8edf4b3ec6c6a91350fa782e7070569a05599ba91775ec7a9c759136041790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:R253S3XQL4KNQ5PFLZC5PBQHCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Ma, Ruochi Zhang, Yuesong Zou","submitted_at":"2019-11-06T20:10:24Z","abstract_excerpt":"Graph representation learning for hypergraphs can be used to extract patterns among higher-order interactions that are critically important in many real world problems. Current approaches designed for hypergraphs, however, are unable to handle different types of hypergraphs and are typically not generic for various learning tasks. Indeed, models that can predict variable-sized heterogeneous hyperedges have not been available. Here we develop a new self-attention based graph neural network called Hyper-SAGNN applicable to homogeneous and heterogeneous hypergraphs with variable hyperedge sizes. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.02613","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/1911.02613/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-05T00:17:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvH579PiO1jCizGTGafEOoYpNETVBb0VaFs9tHddg3hmG43sF4DhXq6boF6np6OLJdV2UMgGhjf/KYf0CxjnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:41:47.762797Z"},"content_sha256":"542b21caac6a8fee335ce86502bc60f49cbdb6e72bd605fd577269f6735c695e","schema_version":"1.0","event_id":"sha256:542b21caac6a8fee335ce86502bc60f49cbdb6e72bd605fd577269f6735c695e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R253S3XQL4KNQ5PFLZC5PBQHCI/bundle.json","state_url":"https://pith.science/pith/R253S3XQL4KNQ5PFLZC5PBQHCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R253S3XQL4KNQ5PFLZC5PBQHCI/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-08-06T16:41:47Z","links":{"resolver":"https://pith.science/pith/R253S3XQL4KNQ5PFLZC5PBQHCI","bundle":"https://pith.science/pith/R253S3XQL4KNQ5PFLZC5PBQHCI/bundle.json","state":"https://pith.science/pith/R253S3XQL4KNQ5PFLZC5PBQHCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R253S3XQL4KNQ5PFLZC5PBQHCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:R253S3XQL4KNQ5PFLZC5PBQHCI","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":"5a06fe74aaab1b56e14cd4cb821e8f80fdaa490669963358dcef8548c131d5ba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-06T20:10:24Z","title_canon_sha256":"60acef62c17e6c006d9f477ed00960f26b2133694628f0dce025822e4b77c5de"},"schema_version":"1.0","source":{"id":"1911.02613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.02613","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"arxiv_version","alias_value":"1911.02613v1","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.02613","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_12","alias_value":"R253S3XQL4KN","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_16","alias_value":"R253S3XQL4KNQ5PF","created_at":"2026-07-05T00:17:39Z"},{"alias_kind":"pith_short_8","alias_value":"R253S3XQ","created_at":"2026-07-05T00:17:39Z"}],"graph_snapshots":[{"event_id":"sha256:542b21caac6a8fee335ce86502bc60f49cbdb6e72bd605fd577269f6735c695e","target":"graph","created_at":"2026-07-05T00:17:39Z","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/1911.02613/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph representation learning for hypergraphs can be used to extract patterns among higher-order interactions that are critically important in many real world problems. Current approaches designed for hypergraphs, however, are unable to handle different types of hypergraphs and are typically not generic for various learning tasks. Indeed, models that can predict variable-sized heterogeneous hyperedges have not been available. Here we develop a new self-attention based graph neural network called Hyper-SAGNN applicable to homogeneous and heterogeneous hypergraphs with variable hyperedge sizes. ","authors_text":"Jian Ma, Ruochi Zhang, Yuesong Zou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-06T20:10:24Z","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.02613","kind":"arxiv","version":1},"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:af8edf4b3ec6c6a91350fa782e7070569a05599ba91775ec7a9c759136041790","target":"record","created_at":"2026-07-05T00:17:39Z","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":"5a06fe74aaab1b56e14cd4cb821e8f80fdaa490669963358dcef8548c131d5ba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-06T20:10:24Z","title_canon_sha256":"60acef62c17e6c006d9f477ed00960f26b2133694628f0dce025822e4b77c5de"},"schema_version":"1.0","source":{"id":"1911.02613","kind":"arxiv","version":1}},"canonical_sha256":"8ebbb96ef05f14d875e55e45d78607123ba294ef3e507423489ea54ed4211472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ebbb96ef05f14d875e55e45d78607123ba294ef3e507423489ea54ed4211472","first_computed_at":"2026-07-05T00:17:39.718914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:17:39.718914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bffg7a7H5EZC+RJXxBfPMnPKvz77IzlijOjTfl8F1peZBqjbTMlBgcMApy1cD3OpCrOl1U3l6Gl/B4nMWEawDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:17:39.719363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.02613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af8edf4b3ec6c6a91350fa782e7070569a05599ba91775ec7a9c759136041790","sha256:542b21caac6a8fee335ce86502bc60f49cbdb6e72bd605fd577269f6735c695e"],"state_sha256":"9c336036b98fa20912686feb6aa2ec6766f4a55e1a4cb6ec7c58c2232dc9db63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFR5uHQfYi9ocxkL1jZHGIyYXRsJCZghOIdlnZ2DJ9OfSMFRlKvExoSwIyJt3H2hYFy6WN1UBI9DPzbeQZOtBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:41:47.767972Z","bundle_sha256":"0ab78f409750ce212f52373bcd6d7544a7ea1edca2b02ecdfdf4ca9c05079aab"}}