{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:76K2UOKMEXZI2AIXQRTHIA2BVO","short_pith_number":"pith:76K2UOKM","canonical_record":{"source":{"id":"1807.08447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-23T06:47:57Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"3872312720a83364ef20254e37304fa406d84835b16d586638a725b1ff8bcc5e","abstract_canon_sha256":"5390683e2c11e51b26a5e324171f27a22063d9f238f6675d359386c07cebe52d"},"schema_version":"1.0"},"canonical_sha256":"ff95aa394c25f28d01178466740341abbb258efb2f5ebb72ca4caf96bd3f1922","source":{"kind":"arxiv","id":"1807.08447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08447","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08447v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08447","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"76K2UOKMEXZI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"76K2UOKMEXZI2AIX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"76K2UOKM","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:76K2UOKMEXZI2AIXQRTHIA2BVO","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-23T06:47:57Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"3872312720a83364ef20254e37304fa406d84835b16d586638a725b1ff8bcc5e","abstract_canon_sha256":"5390683e2c11e51b26a5e324171f27a22063d9f238f6675d359386c07cebe52d"},"schema_version":"1.0"},"canonical_sha256":"ff95aa394c25f28d01178466740341abbb258efb2f5ebb72ca4caf96bd3f1922","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.006573Z","signature_b64":"VVrKPP9ASWtryohQF4LR/otSZAJu1u8d8whrmXQ83WF+sGcAb+z0bkVjPJ3jW9PuS091IePTDtpYAmfKnB+QBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff95aa394c25f28d01178466740341abbb258efb2f5ebb72ca4caf96bd3f1922","last_reissued_at":"2026-05-18T00:10:08.005868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.005868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08447","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:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDPXwb3g2ujiinKZbgpXbgOw62VDqOkNUVPzJ2yfRsCgOyLg/xdX3WUVJn8LkiXihz+S8GkJ97F+DiWMHA9SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:02:54.502219Z"},"content_sha256":"e68127771aa957e63d399b168bdb37f580455c108fbb42318c29aa927206ae82","schema_version":"1.0","event_id":"sha256:e68127771aa957e63d399b168bdb37f580455c108fbb42318c29aa927206ae82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:76K2UOKMEXZI2AIXQRTHIA2BVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LinkNBed: Multi-Graph Representation Learning with Entity Linkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bunyamin Sisman, Christos Faloutsos, Hongyuan Zha, Jun Ma, Rakshit Trivedi, Xin Luna Dong","submitted_at":"2018-07-23T06:47:57Z","abstract_excerpt":"Knowledge graphs have emerged as an important model for studying complex multi-relational data. This has given rise to the construction of numerous large scale but incomplete knowledge graphs encoding information extracted from various resources. An effective and scalable approach to jointly learn over multiple graphs and eventually construct a unified graph is a crucial next step for the success of knowledge-based inference for many downstream applications. To this end, we propose LinkNBed, a deep relational learning framework that learns entity and relationship representations across multipl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08447","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:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdB9xfYS4XOQQGYI6MM//TCa8MNKzCH5iQI/hGa8+UacqJJI2oi2L1slt76M3RNQogI3WxTWo+2RwEzLAir/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:02:54.502588Z"},"content_sha256":"0cbd89a90f93993ba7ac4867e19b620ee3227a2d279a267b9034af9e45cdc074","schema_version":"1.0","event_id":"sha256:0cbd89a90f93993ba7ac4867e19b620ee3227a2d279a267b9034af9e45cdc074"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76K2UOKMEXZI2AIXQRTHIA2BVO/bundle.json","state_url":"https://pith.science/pith/76K2UOKMEXZI2AIXQRTHIA2BVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76K2UOKMEXZI2AIXQRTHIA2BVO/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-06T15:02:54Z","links":{"resolver":"https://pith.science/pith/76K2UOKMEXZI2AIXQRTHIA2BVO","bundle":"https://pith.science/pith/76K2UOKMEXZI2AIXQRTHIA2BVO/bundle.json","state":"https://pith.science/pith/76K2UOKMEXZI2AIXQRTHIA2BVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76K2UOKMEXZI2AIXQRTHIA2BVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:76K2UOKMEXZI2AIXQRTHIA2BVO","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":"5390683e2c11e51b26a5e324171f27a22063d9f238f6675d359386c07cebe52d","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-23T06:47:57Z","title_canon_sha256":"3872312720a83364ef20254e37304fa406d84835b16d586638a725b1ff8bcc5e"},"schema_version":"1.0","source":{"id":"1807.08447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08447","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08447v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08447","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"76K2UOKMEXZI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"76K2UOKMEXZI2AIX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"76K2UOKM","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:0cbd89a90f93993ba7ac4867e19b620ee3227a2d279a267b9034af9e45cdc074","target":"graph","created_at":"2026-05-18T00:10:08Z","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":"Knowledge graphs have emerged as an important model for studying complex multi-relational data. This has given rise to the construction of numerous large scale but incomplete knowledge graphs encoding information extracted from various resources. An effective and scalable approach to jointly learn over multiple graphs and eventually construct a unified graph is a crucial next step for the success of knowledge-based inference for many downstream applications. To this end, we propose LinkNBed, a deep relational learning framework that learns entity and relationship representations across multipl","authors_text":"Bunyamin Sisman, Christos Faloutsos, Hongyuan Zha, Jun Ma, Rakshit Trivedi, Xin Luna Dong","cross_cats":["cs.AI","cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-23T06:47:57Z","title":"LinkNBed: Multi-Graph Representation Learning with Entity Linkage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08447","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:e68127771aa957e63d399b168bdb37f580455c108fbb42318c29aa927206ae82","target":"record","created_at":"2026-05-18T00:10:08Z","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":"5390683e2c11e51b26a5e324171f27a22063d9f238f6675d359386c07cebe52d","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-23T06:47:57Z","title_canon_sha256":"3872312720a83364ef20254e37304fa406d84835b16d586638a725b1ff8bcc5e"},"schema_version":"1.0","source":{"id":"1807.08447","kind":"arxiv","version":1}},"canonical_sha256":"ff95aa394c25f28d01178466740341abbb258efb2f5ebb72ca4caf96bd3f1922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff95aa394c25f28d01178466740341abbb258efb2f5ebb72ca4caf96bd3f1922","first_computed_at":"2026-05-18T00:10:08.005868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:08.005868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VVrKPP9ASWtryohQF4LR/otSZAJu1u8d8whrmXQ83WF+sGcAb+z0bkVjPJ3jW9PuS091IePTDtpYAmfKnB+QBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:08.006573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e68127771aa957e63d399b168bdb37f580455c108fbb42318c29aa927206ae82","sha256:0cbd89a90f93993ba7ac4867e19b620ee3227a2d279a267b9034af9e45cdc074"],"state_sha256":"bf9c8f4f38a8bbdda366b39c0691024814ba93b64855dfa2c4297667504e1551"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TnJJIocyRpgz2WhYGwFp4Bu7mUUO1lgfbhLioKh41oX7WF74edwN8SnBhmMXIgrt1LoUHbIe9ROCpBapijtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:02:54.504940Z","bundle_sha256":"fbd3ff0d804e660e617ab53e1d614883634cd422a390d06d4b9b539f938edb7d"}}