{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BDBOLFGAIG76E4NNATLSU3TZTY","short_pith_number":"pith:BDBOLFGA","schema_version":"1.0","canonical_sha256":"08c2e594c041bfe271ad04d72a6e799e19b8c4a040d899a11c045232d55608f2","source":{"kind":"arxiv","id":"1405.5960","version":1},"attestation_state":"computed","paper":{"title":"LASS: a simple assignment model with Laplacian smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","submitted_at":"2014-05-23T04:28:29Z","abstract_excerpt":"We consider the problem of learning soft assignments of $N$ items to $K$ categories given two sources of information: an item-category similarity matrix, which encourages items to be assigned to categories they are similar to (and to not be assigned to categories they are dissimilar to), and an item-item similarity matrix, which encourages similar items to have similar assignments. We propose a simple quadratic programming model that captures this intuition. We give necessary conditions for its solution to be unique, define an out-of-sample mapping, and derive a simple, effective training algo"},"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":"1405.5960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-23T04:28:29Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"76a6fd6c0f52f575fb43fb64fe8301a0a2eab8f4bde9c331c86ac99770e607bf","abstract_canon_sha256":"8ef3fc7b8733190fa5c29140f794106fc2cdda30e5612745cdec9c9779b5eb52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.360235Z","signature_b64":"e8N6EcqECgzq/wwPNT+u9QtQnevs/qR1b198Lcp4eOjhC8FutBarJixXPJSoiCBtZdFWj9Vr/BHlNAzVd2xlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08c2e594c041bfe271ad04d72a6e799e19b8c4a040d899a11c045232d55608f2","last_reissued_at":"2026-05-18T02:51:14.359697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.359697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LASS: a simple assignment model with Laplacian smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","submitted_at":"2014-05-23T04:28:29Z","abstract_excerpt":"We consider the problem of learning soft assignments of $N$ items to $K$ categories given two sources of information: an item-category similarity matrix, which encourages items to be assigned to categories they are similar to (and to not be assigned to categories they are dissimilar to), and an item-item similarity matrix, which encourages similar items to have similar assignments. We propose a simple quadratic programming model that captures this intuition. We give necessary conditions for its solution to be unique, define an out-of-sample mapping, and derive a simple, effective training algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5960","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":"1405.5960","created_at":"2026-05-18T02:51:14.359791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5960v1","created_at":"2026-05-18T02:51:14.359791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5960","created_at":"2026-05-18T02:51:14.359791+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDBOLFGAIG76","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDBOLFGAIG76E4NN","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDBOLFGA","created_at":"2026-05-18T12:28:22.404517+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/BDBOLFGAIG76E4NNATLSU3TZTY","json":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY.json","graph_json":"https://pith.science/api/pith-number/BDBOLFGAIG76E4NNATLSU3TZTY/graph.json","events_json":"https://pith.science/api/pith-number/BDBOLFGAIG76E4NNATLSU3TZTY/events.json","paper":"https://pith.science/paper/BDBOLFGA"},"agent_actions":{"view_html":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY","download_json":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY.json","view_paper":"https://pith.science/paper/BDBOLFGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5960&json=true","fetch_graph":"https://pith.science/api/pith-number/BDBOLFGAIG76E4NNATLSU3TZTY/graph.json","fetch_events":"https://pith.science/api/pith-number/BDBOLFGAIG76E4NNATLSU3TZTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY/action/storage_attestation","attest_author":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY/action/author_attestation","sign_citation":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY/action/citation_signature","submit_replication":"https://pith.science/pith/BDBOLFGAIG76E4NNATLSU3TZTY/action/replication_record"}},"created_at":"2026-05-18T02:51:14.359791+00:00","updated_at":"2026-05-18T02:51:14.359791+00:00"}