{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z5EPUW7NXAR7FMJDSJH4PM2MNE","short_pith_number":"pith:Z5EPUW7N","schema_version":"1.0","canonical_sha256":"cf48fa5bedb823f2b123924fc7b34c69271ec0106d316b502227987592a338a1","source":{"kind":"arxiv","id":"1908.08037","version":4},"attestation_state":"computed","paper":{"title":"Hebbian Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shalin Shah, Venkataramana Kini","submitted_at":"2019-08-21T02:45:43Z","abstract_excerpt":"Representation learning has recently been successfully used to create vector representations of entities in language learning, recommender systems and in similarity learning. Graph embeddings exploit the locality structure of a graph and generate embeddings for nodes which could be words in a language, products of a retail website; and the nodes are connected based on a context window. In this paper, we consider graph embeddings with an error-free associative learning update rule, which models the embedding vector of node as a non-convex Gaussian mixture of the embeddings of the nodes in its i"},"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":"1908.08037","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-21T02:45:43Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"2a82703c04a36059d6eb2f6be3f09187f0f6ebc8c21d0a8f58f40890cbfa1e7f","abstract_canon_sha256":"37fa9a1ee54c40d3e3b4fe684ebab9c7153462a54a4b38d09ec4de2c0adfccbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:42.727516Z","signature_b64":"PO/5xD7ntDRHutSog+PfSCFEpOU7duhb6/MrIvSb6Mm4a9rih4Ot96JwcB4JCEjBXYVOGNGM1cD/5s7CmMtCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf48fa5bedb823f2b123924fc7b34c69271ec0106d316b502227987592a338a1","last_reissued_at":"2026-07-05T00:42:42.727093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:42.727093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hebbian Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shalin Shah, Venkataramana Kini","submitted_at":"2019-08-21T02:45:43Z","abstract_excerpt":"Representation learning has recently been successfully used to create vector representations of entities in language learning, recommender systems and in similarity learning. Graph embeddings exploit the locality structure of a graph and generate embeddings for nodes which could be words in a language, products of a retail website; and the nodes are connected based on a context window. In this paper, we consider graph embeddings with an error-free associative learning update rule, which models the embedding vector of node as a non-convex Gaussian mixture of the embeddings of the nodes in its i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08037","kind":"arxiv","version":4},"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/1908.08037/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":"1908.08037","created_at":"2026-07-05T00:42:42.727166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08037v4","created_at":"2026-07-05T00:42:42.727166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08037","created_at":"2026-07-05T00:42:42.727166+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5EPUW7NXAR7","created_at":"2026-07-05T00:42:42.727166+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5EPUW7NXAR7FMJD","created_at":"2026-07-05T00:42:42.727166+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5EPUW7N","created_at":"2026-07-05T00:42:42.727166+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/Z5EPUW7NXAR7FMJDSJH4PM2MNE","json":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE.json","graph_json":"https://pith.science/api/pith-number/Z5EPUW7NXAR7FMJDSJH4PM2MNE/graph.json","events_json":"https://pith.science/api/pith-number/Z5EPUW7NXAR7FMJDSJH4PM2MNE/events.json","paper":"https://pith.science/paper/Z5EPUW7N"},"agent_actions":{"view_html":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE","download_json":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE.json","view_paper":"https://pith.science/paper/Z5EPUW7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08037&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5EPUW7NXAR7FMJDSJH4PM2MNE/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5EPUW7NXAR7FMJDSJH4PM2MNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE/action/storage_attestation","attest_author":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE/action/author_attestation","sign_citation":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE/action/citation_signature","submit_replication":"https://pith.science/pith/Z5EPUW7NXAR7FMJDSJH4PM2MNE/action/replication_record"}},"created_at":"2026-07-05T00:42:42.727166+00:00","updated_at":"2026-07-05T00:42:42.727166+00:00"}