{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QTR52ZTTJXMAB32CMJXMSCCYGO","short_pith_number":"pith:QTR52ZTT","schema_version":"1.0","canonical_sha256":"84e3dd66734dd800ef42626ec90858338717cfd4dfe0d1a1b0b265ddbd0d1c0a","source":{"kind":"arxiv","id":"1802.07379","version":2},"attestation_state":"computed","paper":{"title":"Scalable Label Propagation for Multi-relational Learning on the Tensor Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Sterling, George Karypis, Raphael Petegrosso, Rui Kuang, Shaden Smith, Zhuliu Li","submitted_at":"2018-02-20T23:58:08Z","abstract_excerpt":"Multi-relational learning on knowledge graphs infers high-order relations among the entities across the graphs. This learning task can be solved by label propagation on the tensor product of the knowledge graphs to learn the high-order relations as a tensor. In this paper, we generalize a widely used label propagation model to the normalized tensor product graph, and propose an optimization formulation and a scalable Low-rank Tensor-based Label Propagation algorithm (LowrankTLP) to infer multi-relations for two learning tasks, hyperlink prediction and multiple graph alignment. The optimization"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.07379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T23:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"37f1600cb90a412cb0e360072be5cfdc40ecde33d647c7fb1de1e45fdccc4bd9","abstract_canon_sha256":"d0b7f3f59fbe15dc97160e195e0f079ae3da2b7b4ea84a5e9dda113d19745046"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:17.333347Z","signature_b64":"N9IYNNf2FxFJm1LUeA/8Cl2OLkMsN9zaVO8YA8KpuF46CDNtzhejZ0y9hBWMzzaNTLPQ2jjfnpdD+ByXk/RRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84e3dd66734dd800ef42626ec90858338717cfd4dfe0d1a1b0b265ddbd0d1c0a","last_reissued_at":"2026-07-05T01:03:17.332866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:17.332866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Label Propagation for Multi-relational Learning on the Tensor Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Sterling, George Karypis, Raphael Petegrosso, Rui Kuang, Shaden Smith, Zhuliu Li","submitted_at":"2018-02-20T23:58:08Z","abstract_excerpt":"Multi-relational learning on knowledge graphs infers high-order relations among the entities across the graphs. This learning task can be solved by label propagation on the tensor product of the knowledge graphs to learn the high-order relations as a tensor. In this paper, we generalize a widely used label propagation model to the normalized tensor product graph, and propose an optimization formulation and a scalable Low-rank Tensor-based Label Propagation algorithm (LowrankTLP) to infer multi-relations for two learning tasks, hyperlink prediction and multiple graph alignment. The optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07379","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/1802.07379/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.07379","created_at":"2026-07-05T01:03:17.332925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07379v2","created_at":"2026-07-05T01:03:17.332925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07379","created_at":"2026-07-05T01:03:17.332925+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTR52ZTTJXMA","created_at":"2026-07-05T01:03:17.332925+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTR52ZTTJXMAB32C","created_at":"2026-07-05T01:03:17.332925+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTR52ZTT","created_at":"2026-07-05T01:03:17.332925+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO","json":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO.json","graph_json":"https://pith.science/api/pith-number/QTR52ZTTJXMAB32CMJXMSCCYGO/graph.json","events_json":"https://pith.science/api/pith-number/QTR52ZTTJXMAB32CMJXMSCCYGO/events.json","paper":"https://pith.science/paper/QTR52ZTT"},"agent_actions":{"view_html":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO","download_json":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO.json","view_paper":"https://pith.science/paper/QTR52ZTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07379&json=true","fetch_graph":"https://pith.science/api/pith-number/QTR52ZTTJXMAB32CMJXMSCCYGO/graph.json","fetch_events":"https://pith.science/api/pith-number/QTR52ZTTJXMAB32CMJXMSCCYGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO/action/storage_attestation","attest_author":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO/action/author_attestation","sign_citation":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO/action/citation_signature","submit_replication":"https://pith.science/pith/QTR52ZTTJXMAB32CMJXMSCCYGO/action/replication_record"}},"created_at":"2026-07-05T01:03:17.332925+00:00","updated_at":"2026-07-05T01:03:17.332925+00:00"}