{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JGMFWTXFLYZ474OJTTYC7PW3ED","short_pith_number":"pith:JGMFWTXF","canonical_record":{"source":{"id":"1908.09152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-24T15:19:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"073f5a7fd877346380732b23869f0fe67ecf5b94c5537bef2c13294e0b58ddb1","abstract_canon_sha256":"caa00e6787b01546f81b885fc8b9ef0ad5b466429937631148ff0a50aa4d5ef5"},"schema_version":"1.0"},"canonical_sha256":"49985b4ee55e33cff1c99cf02fbedb20d03202ce2035ed47d1955ed4d2e927dc","source":{"kind":"arxiv","id":"1908.09152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09152","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09152v2","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09152","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"JGMFWTXFLYZ4","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"pith_short_16","alias_value":"JGMFWTXFLYZ474OJ","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"pith_short_8","alias_value":"JGMFWTXF","created_at":"2026-07-05T00:13:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JGMFWTXFLYZ474OJTTYC7PW3ED","target":"record","payload":{"canonical_record":{"source":{"id":"1908.09152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-24T15:19:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"073f5a7fd877346380732b23869f0fe67ecf5b94c5537bef2c13294e0b58ddb1","abstract_canon_sha256":"caa00e6787b01546f81b885fc8b9ef0ad5b466429937631148ff0a50aa4d5ef5"},"schema_version":"1.0"},"canonical_sha256":"49985b4ee55e33cff1c99cf02fbedb20d03202ce2035ed47d1955ed4d2e927dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:53.738625Z","signature_b64":"Hh0EtfUIn/XpDW7tOUo3ymCiIh2CrzUk5LbjYS2wNPvrNzMF7B6VgyavyDSugIiki9zPPkUtqFK0CpPVaN2vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49985b4ee55e33cff1c99cf02fbedb20d03202ce2035ed47d1955ed4d2e927dc","last_reissued_at":"2026-07-05T00:13:53.738238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:53.738238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.09152","source_version":2,"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:13:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lf/Aso5Emy00Gsrfj/d2jl9bKgnfUrAyp3iAbRMqr9/POCSAhj3qn7q9zAokKVcVAmzbVgl5fSYapxUh6w2MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:08:13.910403Z"},"content_sha256":"38803256b74f4136d70a4aeb8066f79b717c2207cd4b9b7e26888f6776a84c19","schema_version":"1.0","event_id":"sha256:38803256b74f4136d70a4aeb8066f79b717c2207cd4b9b7e26888f6776a84c19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JGMFWTXFLYZ474OJTTYC7PW3ED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hyper-Path-Based Representation Learning for Hyper-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jie Huang, Xin Liu, Yangqiu Song","submitted_at":"2019-08-24T15:19:29Z","abstract_excerpt":"Network representation learning has aroused widespread interests in recent years. While most of the existing methods deal with edges as pairwise relationships, only a few studies have been proposed for hyper-networks to capture more complicated tuplewise relationships among multiple nodes. A hyper-network is a network where each edge, called hyperedge, connects an arbitrary number of nodes. Different from conventional networks, hyper-networks have certain degrees of indecomposability such that the nodes in a subset of a hyperedge may not possess a strong relationship. That is the main reason w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09152","kind":"arxiv","version":2},"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/1908.09152/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:13:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpZb59OMXH83xesjPQJs04HxgxcnAMf4FjoWG2jVjqw1j0vpaQ2FvE1TKdAfn+njSWc+Pr9IVAovLGwYPptyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:08:13.911348Z"},"content_sha256":"074e6fb6cf53bd7e3b0f9621c773cf988b1bdffefb997e5e6f1c589b41d8bd87","schema_version":"1.0","event_id":"sha256:074e6fb6cf53bd7e3b0f9621c773cf988b1bdffefb997e5e6f1c589b41d8bd87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/bundle.json","state_url":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/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-16T07:08:13Z","links":{"resolver":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED","bundle":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/bundle.json","state":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JGMFWTXFLYZ474OJTTYC7PW3ED","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":"caa00e6787b01546f81b885fc8b9ef0ad5b466429937631148ff0a50aa4d5ef5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-24T15:19:29Z","title_canon_sha256":"073f5a7fd877346380732b23869f0fe67ecf5b94c5537bef2c13294e0b58ddb1"},"schema_version":"1.0","source":{"id":"1908.09152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09152","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09152v2","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09152","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"JGMFWTXFLYZ4","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"pith_short_16","alias_value":"JGMFWTXFLYZ474OJ","created_at":"2026-07-05T00:13:53Z"},{"alias_kind":"pith_short_8","alias_value":"JGMFWTXF","created_at":"2026-07-05T00:13:53Z"}],"graph_snapshots":[{"event_id":"sha256:074e6fb6cf53bd7e3b0f9621c773cf988b1bdffefb997e5e6f1c589b41d8bd87","target":"graph","created_at":"2026-07-05T00:13:53Z","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/1908.09152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network representation learning has aroused widespread interests in recent years. While most of the existing methods deal with edges as pairwise relationships, only a few studies have been proposed for hyper-networks to capture more complicated tuplewise relationships among multiple nodes. A hyper-network is a network where each edge, called hyperedge, connects an arbitrary number of nodes. Different from conventional networks, hyper-networks have certain degrees of indecomposability such that the nodes in a subset of a hyperedge may not possess a strong relationship. That is the main reason w","authors_text":"Jie Huang, Xin Liu, Yangqiu Song","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-24T15:19:29Z","title":"Hyper-Path-Based Representation Learning for Hyper-Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09152","kind":"arxiv","version":2},"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:38803256b74f4136d70a4aeb8066f79b717c2207cd4b9b7e26888f6776a84c19","target":"record","created_at":"2026-07-05T00:13:53Z","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":"caa00e6787b01546f81b885fc8b9ef0ad5b466429937631148ff0a50aa4d5ef5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-24T15:19:29Z","title_canon_sha256":"073f5a7fd877346380732b23869f0fe67ecf5b94c5537bef2c13294e0b58ddb1"},"schema_version":"1.0","source":{"id":"1908.09152","kind":"arxiv","version":2}},"canonical_sha256":"49985b4ee55e33cff1c99cf02fbedb20d03202ce2035ed47d1955ed4d2e927dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49985b4ee55e33cff1c99cf02fbedb20d03202ce2035ed47d1955ed4d2e927dc","first_computed_at":"2026-07-05T00:13:53.738238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:13:53.738238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hh0EtfUIn/XpDW7tOUo3ymCiIh2CrzUk5LbjYS2wNPvrNzMF7B6VgyavyDSugIiki9zPPkUtqFK0CpPVaN2vBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:13:53.738625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38803256b74f4136d70a4aeb8066f79b717c2207cd4b9b7e26888f6776a84c19","sha256:074e6fb6cf53bd7e3b0f9621c773cf988b1bdffefb997e5e6f1c589b41d8bd87"],"state_sha256":"5c50e2742b7540672007aa8a19ffc78f11f5961b0479e1cf6942d23c35fe34ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbdAkqX71ePLEl1cFXXKIR+2E+CrdKGXqhbAyDOZjXWS8J4x3bgJfURgGmd+BcLX6uRFbBsQyK+HuA/G8piFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T07:08:13.916873Z","bundle_sha256":"30f3426bfee0be9d3375a261efd048debe8b79a370f8469b012409ff54f77967"}}