{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:CVBU2K52B5HDIDBV74JQML3ET6","short_pith_number":"pith:CVBU2K52","canonical_record":{"source":{"id":"2106.06171","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T05:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"cc42322a9de5dbc88a8d2608e0609c44aefbfce6ee23dcc78c33c3adc822a5f6","abstract_canon_sha256":"53042038f8272a8f31a9ff2d9b3f624c0be0a0ada503b9736e24cd93c7c44e4e"},"schema_version":"1.0"},"canonical_sha256":"15434d2bba0f4e340c35ff13062f649fb3ec196239ad9713f80b03ac4b544929","source":{"kind":"arxiv","id":"2106.06171","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06171","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06171v3","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06171","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"CVBU2K52B5HD","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"pith_short_16","alias_value":"CVBU2K52B5HDIDBV","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"pith_short_8","alias_value":"CVBU2K52","created_at":"2026-07-05T03:14:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:CVBU2K52B5HDIDBV74JQML3ET6","target":"record","payload":{"canonical_record":{"source":{"id":"2106.06171","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T05:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"cc42322a9de5dbc88a8d2608e0609c44aefbfce6ee23dcc78c33c3adc822a5f6","abstract_canon_sha256":"53042038f8272a8f31a9ff2d9b3f624c0be0a0ada503b9736e24cd93c7c44e4e"},"schema_version":"1.0"},"canonical_sha256":"15434d2bba0f4e340c35ff13062f649fb3ec196239ad9713f80b03ac4b544929","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:19.643606Z","signature_b64":"cBtd3gW+6IuXcr7MmEYGpamzNDHY40p//8Ozta0rVt6RZ48G3NXfmwsf9TfiKJCMJNy1xyUPTOn6BUxcJN+fCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15434d2bba0f4e340c35ff13062f649fb3ec196239ad9713f80b03ac4b544929","last_reissued_at":"2026-07-05T03:14:19.643148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:19.643148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.06171","source_version":3,"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-05T03:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtNdZf2gCxmW4GpxQkKlUZCD/3TNIzgG/EJiHv3sP4aeue/DgDDZemwqmdBNKtm8L6iHKHYUg4OzORljCqOUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:47:50.130587Z"},"content_sha256":"00501622bc8b480082c2ce96f2d0d81b8b5024c1c927d416edcc1c234f9b64f9","schema_version":"1.0","event_id":"sha256:00501622bc8b480082c2ce96f2d0d81b8b5024c1c927d416edcc1c234f9b64f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:CVBU2K52B5HDIDBV74JQML3ET6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inter-domain Multi-relational Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arseny Tolmachev, Hisashi Kashima, Koh Takeuchi, Koji Maruhashi, Luu Huu Phuc, Seiji Okajima, Tomoyoshi Takebayashi","submitted_at":"2021-06-11T05:10:31Z","abstract_excerpt":"Multi-relational graph is a ubiquitous and important data structure, allowing flexible representation of multiple types of interactions and relations between entities. Similar to other graph-structured data, link prediction is one of the most important tasks on multi-relational graphs and is often used for knowledge completion. When related graphs coexist, it is of great benefit to build a larger graph via integrating the smaller ones. The integration requires predicting hidden relational connections between entities belonged to different graphs (inter-domain link prediction). However, this po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06171","kind":"arxiv","version":3},"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/2106.06171/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-05T03:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxzeRRo3amvbyx+V7R+IZWmaTO5agfe+Y75xGSjFQrcAvQO3kk/iSFG+HahmQzcH1pwyIp1ZfvhdOCzP0aSXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:47:50.130956Z"},"content_sha256":"3013de366699a0dfde199701304478840d572f65aef0a8b0f8d95ff17b2e829a","schema_version":"1.0","event_id":"sha256:3013de366699a0dfde199701304478840d572f65aef0a8b0f8d95ff17b2e829a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVBU2K52B5HDIDBV74JQML3ET6/bundle.json","state_url":"https://pith.science/pith/CVBU2K52B5HDIDBV74JQML3ET6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVBU2K52B5HDIDBV74JQML3ET6/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-07-06T17:47:50Z","links":{"resolver":"https://pith.science/pith/CVBU2K52B5HDIDBV74JQML3ET6","bundle":"https://pith.science/pith/CVBU2K52B5HDIDBV74JQML3ET6/bundle.json","state":"https://pith.science/pith/CVBU2K52B5HDIDBV74JQML3ET6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVBU2K52B5HDIDBV74JQML3ET6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:CVBU2K52B5HDIDBV74JQML3ET6","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":"53042038f8272a8f31a9ff2d9b3f624c0be0a0ada503b9736e24cd93c7c44e4e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T05:10:31Z","title_canon_sha256":"cc42322a9de5dbc88a8d2608e0609c44aefbfce6ee23dcc78c33c3adc822a5f6"},"schema_version":"1.0","source":{"id":"2106.06171","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06171","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06171v3","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06171","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"CVBU2K52B5HD","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"pith_short_16","alias_value":"CVBU2K52B5HDIDBV","created_at":"2026-07-05T03:14:19Z"},{"alias_kind":"pith_short_8","alias_value":"CVBU2K52","created_at":"2026-07-05T03:14:19Z"}],"graph_snapshots":[{"event_id":"sha256:3013de366699a0dfde199701304478840d572f65aef0a8b0f8d95ff17b2e829a","target":"graph","created_at":"2026-07-05T03:14:19Z","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/2106.06171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-relational graph is a ubiquitous and important data structure, allowing flexible representation of multiple types of interactions and relations between entities. Similar to other graph-structured data, link prediction is one of the most important tasks on multi-relational graphs and is often used for knowledge completion. When related graphs coexist, it is of great benefit to build a larger graph via integrating the smaller ones. The integration requires predicting hidden relational connections between entities belonged to different graphs (inter-domain link prediction). However, this po","authors_text":"Arseny Tolmachev, Hisashi Kashima, Koh Takeuchi, Koji Maruhashi, Luu Huu Phuc, Seiji Okajima, Tomoyoshi Takebayashi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T05:10:31Z","title":"Inter-domain Multi-relational Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06171","kind":"arxiv","version":3},"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:00501622bc8b480082c2ce96f2d0d81b8b5024c1c927d416edcc1c234f9b64f9","target":"record","created_at":"2026-07-05T03:14:19Z","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":"53042038f8272a8f31a9ff2d9b3f624c0be0a0ada503b9736e24cd93c7c44e4e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T05:10:31Z","title_canon_sha256":"cc42322a9de5dbc88a8d2608e0609c44aefbfce6ee23dcc78c33c3adc822a5f6"},"schema_version":"1.0","source":{"id":"2106.06171","kind":"arxiv","version":3}},"canonical_sha256":"15434d2bba0f4e340c35ff13062f649fb3ec196239ad9713f80b03ac4b544929","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15434d2bba0f4e340c35ff13062f649fb3ec196239ad9713f80b03ac4b544929","first_computed_at":"2026-07-05T03:14:19.643148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:14:19.643148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cBtd3gW+6IuXcr7MmEYGpamzNDHY40p//8Ozta0rVt6RZ48G3NXfmwsf9TfiKJCMJNy1xyUPTOn6BUxcJN+fCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:14:19.643606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.06171","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00501622bc8b480082c2ce96f2d0d81b8b5024c1c927d416edcc1c234f9b64f9","sha256:3013de366699a0dfde199701304478840d572f65aef0a8b0f8d95ff17b2e829a"],"state_sha256":"9c50cf8996109490d6335f424922be1fb1834f7a0530cb617d4a09db38fd18e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpjSKIF80sHOswosVE+nLfPKiXawfo//D41HTWOs0DKdPxwvKut8MGmvepT4WRc6E/XS84W+D4WL5754rK7GAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:47:50.133091Z","bundle_sha256":"f4b2f7045b9834cd37ddc6279ed202b053903d0b62877db655a10d1a04d75650"}}