{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5MYLW7UNPSVSVSUB3SODGDCXDB","short_pith_number":"pith:5MYLW7UN","schema_version":"1.0","canonical_sha256":"eb30bb7e8d7cab2aca81dc9c330c57187c2860ba2418a4ced644342024d748c4","source":{"kind":"arxiv","id":"1809.08823","version":1},"attestation_state":"computed","paper":{"title":"Representing Sets as Summed Semantic Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dandan Li, Douglas Summers-Stay, Peter Sutor","submitted_at":"2018-09-24T09:55:37Z","abstract_excerpt":"Representing meaning in the form of high dimensional vectors is a common and powerful tool in biologically inspired architectures. While the meaning of a set of concepts can be summarized by taking a (possibly weighted) sum of their associated vectors, this has generally been treated as a one-way operation. In this paper we show how a technique built to aid sparse vector decomposition allows in many cases the exact recovery of the inputs and weights to such a sum, allowing a single vector to represent an entire set of vectors from a dictionary. We characterize the number of vectors that can be"},"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":"1809.08823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-24T09:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"f4594fad27c75cb6527d2ef3df1d95927f6a3c45c1b5fc1a0b84f5fcbb96cf65","abstract_canon_sha256":"11ba6fcf4aa867be13c073606d8e9a7ef463b50092ef992db477a04a5f8242c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.452122Z","signature_b64":"+EhQSOiItm0Zy1Pb7f6obqJIs0FblZ5+2d3ywsrMaVr0eviNkICCpO6xPvt0nny0ypQnFGW/gW6qlCFtYNYiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb30bb7e8d7cab2aca81dc9c330c57187c2860ba2418a4ced644342024d748c4","last_reissued_at":"2026-05-18T00:05:03.451677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.451677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representing Sets as Summed Semantic Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dandan Li, Douglas Summers-Stay, Peter Sutor","submitted_at":"2018-09-24T09:55:37Z","abstract_excerpt":"Representing meaning in the form of high dimensional vectors is a common and powerful tool in biologically inspired architectures. While the meaning of a set of concepts can be summarized by taking a (possibly weighted) sum of their associated vectors, this has generally been treated as a one-way operation. In this paper we show how a technique built to aid sparse vector decomposition allows in many cases the exact recovery of the inputs and weights to such a sum, allowing a single vector to represent an entire set of vectors from a dictionary. We characterize the number of vectors that can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08823","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.08823","created_at":"2026-05-18T00:05:03.451744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08823v1","created_at":"2026-05-18T00:05:03.451744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08823","created_at":"2026-05-18T00:05:03.451744+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MYLW7UNPSVS","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MYLW7UNPSVSVSUB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MYLW7UN","created_at":"2026-05-18T12:32:08.215937+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/5MYLW7UNPSVSVSUB3SODGDCXDB","json":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB.json","graph_json":"https://pith.science/api/pith-number/5MYLW7UNPSVSVSUB3SODGDCXDB/graph.json","events_json":"https://pith.science/api/pith-number/5MYLW7UNPSVSVSUB3SODGDCXDB/events.json","paper":"https://pith.science/paper/5MYLW7UN"},"agent_actions":{"view_html":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB","download_json":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB.json","view_paper":"https://pith.science/paper/5MYLW7UN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08823&json=true","fetch_graph":"https://pith.science/api/pith-number/5MYLW7UNPSVSVSUB3SODGDCXDB/graph.json","fetch_events":"https://pith.science/api/pith-number/5MYLW7UNPSVSVSUB3SODGDCXDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB/action/storage_attestation","attest_author":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB/action/author_attestation","sign_citation":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB/action/citation_signature","submit_replication":"https://pith.science/pith/5MYLW7UNPSVSVSUB3SODGDCXDB/action/replication_record"}},"created_at":"2026-05-18T00:05:03.451744+00:00","updated_at":"2026-05-18T00:05:03.451744+00:00"}