{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MMFOG322HZFSVPZS4RJXPDLUA6","short_pith_number":"pith:MMFOG322","canonical_record":{"source":{"id":"1701.05291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-19T04:00:46Z","cross_cats_sorted":[],"title_canon_sha256":"0062bb1bf0501191d80795cb807ea0654ec340884433ca8ec2ced465ef43faaf","abstract_canon_sha256":"995cc5c9603eb0f6233d3e90c8a5c179ac77e50cb40f13a84f01ff0cc3e85409"},"schema_version":"1.0"},"canonical_sha256":"630ae36f5a3e4b2abf32e453778d7407b2bf1afdd32b36585552492d33ed8a49","source":{"kind":"arxiv","id":"1701.05291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05291","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05291v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05291","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"MMFOG322HZFS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MMFOG322HZFSVPZS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MMFOG322","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MMFOG322HZFSVPZS4RJXPDLUA6","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-19T04:00:46Z","cross_cats_sorted":[],"title_canon_sha256":"0062bb1bf0501191d80795cb807ea0654ec340884433ca8ec2ced465ef43faaf","abstract_canon_sha256":"995cc5c9603eb0f6233d3e90c8a5c179ac77e50cb40f13a84f01ff0cc3e85409"},"schema_version":"1.0"},"canonical_sha256":"630ae36f5a3e4b2abf32e453778d7407b2bf1afdd32b36585552492d33ed8a49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.328714Z","signature_b64":"/7xLAMPsOl6RJ/StyE/BzRsImZytZavFEDeWKGxFp8m+WWD5WYGHhgj5SYW4CtJ1vp26SSboMtaQRPgPnvv5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630ae36f5a3e4b2abf32e453778d7407b2bf1afdd32b36585552492d33ed8a49","last_reissued_at":"2026-05-18T00:52:30.328060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.328060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05291","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-05-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WqWX7aBuZMqExNsBIP3D+EF1cD2sNRlmWBRo3hBdSfDv2g1zBMZHHcheDG62w7ku3SaTZBPmjeG2Y31G9PRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:30:51.390986Z"},"content_sha256":"5c1a5d907e22bebf0ecedce8e8e3dc39a89d99cb9af16d2def0483245df03894","schema_version":"1.0","event_id":"sha256:5c1a5d907e22bebf0ecedce8e8e3dc39a89d99cb9af16d2def0483245df03894"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MMFOG322HZFSVPZS4RJXPDLUA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heterogeneous Information Network Embedding for Meta Path based Proximity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nikos Mamoulis, Zhipeng Huang","submitted_at":"2017-01-19T04:00:46Z","abstract_excerpt":"A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way, typical search and mining methods can be applied in the embedded space with the help of off-the-shelf multidimensional indexing approaches. Existing network embedding techniques focus on homogeneous networks, where all vertices are considered to belong to a single class."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05291","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":""},"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:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YaLioPyAtNJQW16HqHpzhrkBMKO+C7teH/fzWhG1oIXfnzbsmDjNKYqiGbo3XyzdEtg1syq2jGL1ptabswnLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:30:51.391347Z"},"content_sha256":"9d969417b3333ddb18193fc978c78631fd9972d19c73543cc40283f75f2da6f2","schema_version":"1.0","event_id":"sha256:9d969417b3333ddb18193fc978c78631fd9972d19c73543cc40283f75f2da6f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMFOG322HZFSVPZS4RJXPDLUA6/bundle.json","state_url":"https://pith.science/pith/MMFOG322HZFSVPZS4RJXPDLUA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMFOG322HZFSVPZS4RJXPDLUA6/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-06-03T07:30:51Z","links":{"resolver":"https://pith.science/pith/MMFOG322HZFSVPZS4RJXPDLUA6","bundle":"https://pith.science/pith/MMFOG322HZFSVPZS4RJXPDLUA6/bundle.json","state":"https://pith.science/pith/MMFOG322HZFSVPZS4RJXPDLUA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMFOG322HZFSVPZS4RJXPDLUA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MMFOG322HZFSVPZS4RJXPDLUA6","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":"995cc5c9603eb0f6233d3e90c8a5c179ac77e50cb40f13a84f01ff0cc3e85409","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-19T04:00:46Z","title_canon_sha256":"0062bb1bf0501191d80795cb807ea0654ec340884433ca8ec2ced465ef43faaf"},"schema_version":"1.0","source":{"id":"1701.05291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05291","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05291v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05291","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"MMFOG322HZFS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MMFOG322HZFSVPZS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MMFOG322","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:9d969417b3333ddb18193fc978c78631fd9972d19c73543cc40283f75f2da6f2","target":"graph","created_at":"2026-05-18T00:52:30Z","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":"A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way, typical search and mining methods can be applied in the embedded space with the help of off-the-shelf multidimensional indexing approaches. Existing network embedding techniques focus on homogeneous networks, where all vertices are considered to belong to a single class.","authors_text":"Nikos Mamoulis, Zhipeng Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-19T04:00:46Z","title":"Heterogeneous Information Network Embedding for Meta Path based Proximity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05291","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:5c1a5d907e22bebf0ecedce8e8e3dc39a89d99cb9af16d2def0483245df03894","target":"record","created_at":"2026-05-18T00:52:30Z","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":"995cc5c9603eb0f6233d3e90c8a5c179ac77e50cb40f13a84f01ff0cc3e85409","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-19T04:00:46Z","title_canon_sha256":"0062bb1bf0501191d80795cb807ea0654ec340884433ca8ec2ced465ef43faaf"},"schema_version":"1.0","source":{"id":"1701.05291","kind":"arxiv","version":1}},"canonical_sha256":"630ae36f5a3e4b2abf32e453778d7407b2bf1afdd32b36585552492d33ed8a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630ae36f5a3e4b2abf32e453778d7407b2bf1afdd32b36585552492d33ed8a49","first_computed_at":"2026-05-18T00:52:30.328060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:30.328060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/7xLAMPsOl6RJ/StyE/BzRsImZytZavFEDeWKGxFp8m+WWD5WYGHhgj5SYW4CtJ1vp26SSboMtaQRPgPnvv5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:30.328714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c1a5d907e22bebf0ecedce8e8e3dc39a89d99cb9af16d2def0483245df03894","sha256:9d969417b3333ddb18193fc978c78631fd9972d19c73543cc40283f75f2da6f2"],"state_sha256":"7503c9d78a4325b32e0d69d790b4938d32e5910d2bf997aa4d61aa8b3715347a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIHqCgBNoqVv6CdP+W6S9KtwJuQw3GvyIr7dsVEqtOWSPGBjaAsEf2XIC3yqbR+TBWx5jRPBEBBNI7CQQqa1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:30:51.393487Z","bundle_sha256":"4ad196a40edce3bf5e406644119d53fa53a97743b95518bc3503fea53f062908"}}