{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WV67OSLRUEHPXNTFU4N3OUVAXZ","short_pith_number":"pith:WV67OSLR","schema_version":"1.0","canonical_sha256":"b57df74971a10efbb665a71bb752a0be5e722de82c14e9a2352838cbcbd40be1","source":{"kind":"arxiv","id":"2209.08769","version":2},"attestation_state":"computed","paper":{"title":"Walk-and-Relate: A Random-Walk-based Algorithm for Representation Learning on Sparse Knowledge Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR","cs.SI"],"primary_cat":"cs.LG","authors_text":"Saurav Manchanda","submitted_at":"2022-09-19T05:35:23Z","abstract_excerpt":"Knowledge graph (KG) embedding techniques use structured relationships between entities to learn low-dimensional representations of entities and relations. The traditional KG embedding techniques (such as TransE and DistMult) estimate these embeddings via simple models developed over observed KG triplets. These approaches differ in their triplet scoring loss functions. As these models only use the observed triplets to estimate the embeddings, they are prone to suffer through data sparsity that usually occurs in the real-world knowledge graphs, i.e., the lack of enough triplets per entity. To s"},"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":"2209.08769","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-19T05:35:23Z","cross_cats_sorted":["cs.AI","cs.IR","cs.SI"],"title_canon_sha256":"87cc34535c2e0a3892748ed31f90924f094f50fda1736a2f4419f3a4e0f42628","abstract_canon_sha256":"9ef541849107fe994ca38f2f12082fe18d91cfeda6fb4b7f498918baf303f48c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:34.059707Z","signature_b64":"RCsD77KqBEgX32aSA+CsYroZUgMxP7PiFX49IWMW4Tmtg1lrTo6nsJ37J2qeGuEqzUssc3/OsXhZyyiVU+ygDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b57df74971a10efbb665a71bb752a0be5e722de82c14e9a2352838cbcbd40be1","last_reissued_at":"2026-07-05T05:06:34.059184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:34.059184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walk-and-Relate: A Random-Walk-based Algorithm for Representation Learning on Sparse Knowledge Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR","cs.SI"],"primary_cat":"cs.LG","authors_text":"Saurav Manchanda","submitted_at":"2022-09-19T05:35:23Z","abstract_excerpt":"Knowledge graph (KG) embedding techniques use structured relationships between entities to learn low-dimensional representations of entities and relations. The traditional KG embedding techniques (such as TransE and DistMult) estimate these embeddings via simple models developed over observed KG triplets. These approaches differ in their triplet scoring loss functions. As these models only use the observed triplets to estimate the embeddings, they are prone to suffer through data sparsity that usually occurs in the real-world knowledge graphs, i.e., the lack of enough triplets per entity. To s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08769","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/2209.08769/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":"2209.08769","created_at":"2026-07-05T05:06:34.059244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.08769v2","created_at":"2026-07-05T05:06:34.059244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08769","created_at":"2026-07-05T05:06:34.059244+00:00"},{"alias_kind":"pith_short_12","alias_value":"WV67OSLRUEHP","created_at":"2026-07-05T05:06:34.059244+00:00"},{"alias_kind":"pith_short_16","alias_value":"WV67OSLRUEHPXNTF","created_at":"2026-07-05T05:06:34.059244+00:00"},{"alias_kind":"pith_short_8","alias_value":"WV67OSLR","created_at":"2026-07-05T05:06:34.059244+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/WV67OSLRUEHPXNTFU4N3OUVAXZ","json":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ.json","graph_json":"https://pith.science/api/pith-number/WV67OSLRUEHPXNTFU4N3OUVAXZ/graph.json","events_json":"https://pith.science/api/pith-number/WV67OSLRUEHPXNTFU4N3OUVAXZ/events.json","paper":"https://pith.science/paper/WV67OSLR"},"agent_actions":{"view_html":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ","download_json":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ.json","view_paper":"https://pith.science/paper/WV67OSLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.08769&json=true","fetch_graph":"https://pith.science/api/pith-number/WV67OSLRUEHPXNTFU4N3OUVAXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WV67OSLRUEHPXNTFU4N3OUVAXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ/action/storage_attestation","attest_author":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ/action/author_attestation","sign_citation":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ/action/citation_signature","submit_replication":"https://pith.science/pith/WV67OSLRUEHPXNTFU4N3OUVAXZ/action/replication_record"}},"created_at":"2026-07-05T05:06:34.059244+00:00","updated_at":"2026-07-05T05:06:34.059244+00:00"}