{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GAK2DIYK6MIZECA77QF66OUDFA","short_pith_number":"pith:GAK2DIYK","canonical_record":{"source":{"id":"1711.10146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-28T06:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"0fdc8ca012bb37e7b9df410d124ff22daef09832f4d5f2d5050d2659c9ec1990","abstract_canon_sha256":"67dcd5f8e0b98da4a999f5de4a1ab0a02220285ede208f489b0b777aa80abbcc"},"schema_version":"1.0"},"canonical_sha256":"3015a1a30af31192081ffc0bef3a83281fafec3d39e7ce929e02616a40b88356","source":{"kind":"arxiv","id":"1711.10146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10146","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10146v2","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10146","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"GAK2DIYK6MIZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GAK2DIYK6MIZECA7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GAK2DIYK","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GAK2DIYK6MIZECA77QF66OUDFA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-28T06:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"0fdc8ca012bb37e7b9df410d124ff22daef09832f4d5f2d5050d2659c9ec1990","abstract_canon_sha256":"67dcd5f8e0b98da4a999f5de4a1ab0a02220285ede208f489b0b777aa80abbcc"},"schema_version":"1.0"},"canonical_sha256":"3015a1a30af31192081ffc0bef3a83281fafec3d39e7ce929e02616a40b88356","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:41.932407Z","signature_b64":"7bk6dgdBQ/zgo+CVdKBnJQVdZPRK/HJAllDGnftIYX0Op9Hko8ZvMoo+Om9loI+IILpB6B3t+Hfz2gUKkFbTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3015a1a30af31192081ffc0bef3a83281fafec3d39e7ce929e02616a40b88356","last_reissued_at":"2026-05-18T00:24:41.931785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:41.931785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10146","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-05-18T00:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFhbfB8UhIh31k+OHgngl4u/CUorGcsj8aZVTu7loeHhtq3T8oTHogIkhM7BqXHXRWuE4SiD7M+Hcgu3hUR+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:48:23.873778Z"},"content_sha256":"b3c054063384ed9c77cfc967a01dcceb1a27d881d05acee0ec524f40c18c66f9","schema_version":"1.0","event_id":"sha256:b3c054063384ed9c77cfc967a01dcceb1a27d881d05acee0ec524f40c18c66f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GAK2DIYK6MIZECA77QF66OUDFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Deep Embedding for Hyper-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Fei Wang, Ke Tu, Peng Cui, Wenwu Zhu, Xiao Wang","submitted_at":"2017-11-28T06:42:54Z","abstract_excerpt":"Network embedding has recently attracted lots of attentions in data mining. Existing network embedding methods mainly focus on networks with pairwise relationships. In real world, however, the relationships among data points could go beyond pairwise, i.e., three or more objects are involved in each relationship represented by a hyperedge, thus forming hyper-networks. These hyper-networks pose great challenges to existing network embedding methods when the hyperedges are indecomposable, that is to say, any subset of nodes in a hyperedge cannot form another hyperedge. These indecomposable hypere"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10146","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":""},"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-05-18T00:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVA4FMMaP5a/3U2c68PCJaYtPMx7UUpYfrbkNd+6Z60xEJcVzx0dRpXHPmFg3ON4n2vej5ZfiSFHAbviejKsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:48:23.874127Z"},"content_sha256":"393b7da17e113bee514f97eba31a527375d600e086ab579f0efc73080aebeb4b","schema_version":"1.0","event_id":"sha256:393b7da17e113bee514f97eba31a527375d600e086ab579f0efc73080aebeb4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAK2DIYK6MIZECA77QF66OUDFA/bundle.json","state_url":"https://pith.science/pith/GAK2DIYK6MIZECA77QF66OUDFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAK2DIYK6MIZECA77QF66OUDFA/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-05-28T10:48:23Z","links":{"resolver":"https://pith.science/pith/GAK2DIYK6MIZECA77QF66OUDFA","bundle":"https://pith.science/pith/GAK2DIYK6MIZECA77QF66OUDFA/bundle.json","state":"https://pith.science/pith/GAK2DIYK6MIZECA77QF66OUDFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAK2DIYK6MIZECA77QF66OUDFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GAK2DIYK6MIZECA77QF66OUDFA","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":"67dcd5f8e0b98da4a999f5de4a1ab0a02220285ede208f489b0b777aa80abbcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-28T06:42:54Z","title_canon_sha256":"0fdc8ca012bb37e7b9df410d124ff22daef09832f4d5f2d5050d2659c9ec1990"},"schema_version":"1.0","source":{"id":"1711.10146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10146","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10146v2","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10146","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"GAK2DIYK6MIZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GAK2DIYK6MIZECA7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GAK2DIYK","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:393b7da17e113bee514f97eba31a527375d600e086ab579f0efc73080aebeb4b","target":"graph","created_at":"2026-05-18T00:24:41Z","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"},"paper":{"abstract_excerpt":"Network embedding has recently attracted lots of attentions in data mining. Existing network embedding methods mainly focus on networks with pairwise relationships. In real world, however, the relationships among data points could go beyond pairwise, i.e., three or more objects are involved in each relationship represented by a hyperedge, thus forming hyper-networks. These hyper-networks pose great challenges to existing network embedding methods when the hyperedges are indecomposable, that is to say, any subset of nodes in a hyperedge cannot form another hyperedge. These indecomposable hypere","authors_text":"Fei Wang, Ke Tu, Peng Cui, Wenwu Zhu, Xiao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-28T06:42:54Z","title":"Structural Deep Embedding for Hyper-Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10146","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:b3c054063384ed9c77cfc967a01dcceb1a27d881d05acee0ec524f40c18c66f9","target":"record","created_at":"2026-05-18T00:24:41Z","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":"67dcd5f8e0b98da4a999f5de4a1ab0a02220285ede208f489b0b777aa80abbcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-28T06:42:54Z","title_canon_sha256":"0fdc8ca012bb37e7b9df410d124ff22daef09832f4d5f2d5050d2659c9ec1990"},"schema_version":"1.0","source":{"id":"1711.10146","kind":"arxiv","version":2}},"canonical_sha256":"3015a1a30af31192081ffc0bef3a83281fafec3d39e7ce929e02616a40b88356","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3015a1a30af31192081ffc0bef3a83281fafec3d39e7ce929e02616a40b88356","first_computed_at":"2026-05-18T00:24:41.931785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:41.931785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7bk6dgdBQ/zgo+CVdKBnJQVdZPRK/HJAllDGnftIYX0Op9Hko8ZvMoo+Om9loI+IILpB6B3t+Hfz2gUKkFbTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:41.932407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3c054063384ed9c77cfc967a01dcceb1a27d881d05acee0ec524f40c18c66f9","sha256:393b7da17e113bee514f97eba31a527375d600e086ab579f0efc73080aebeb4b"],"state_sha256":"f419a4a2a5672cd3ec236cd5f724adb87653a043641c8ff271ceee5b701cebd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJMdWrusOZ24HzcwJy4ky2Vu+So3ax3iakvXgtHUtdQad+PFGM9laMEuCXMvg6G8X0CnlWUgyn+x87xQt4phDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:48:23.876088Z","bundle_sha256":"16a959d07fc1ae3069a8bd2487953708e072df341dcad006da4591e86f7aa6fc"}}