{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IAUNVDSDKCFXRP77I6UUXOXU3C","short_pith_number":"pith:IAUNVDSD","schema_version":"1.0","canonical_sha256":"4028da8e43508b78bfff47a94bbaf4d89cc8047324169791e768303a596a672b","source":{"kind":"arxiv","id":"0908.2494","version":1},"attestation_state":"computed","paper":{"title":"A Channel Coding Perspective of Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Onkar Dabeer, S. T. Aditya","submitted_at":"2009-08-18T06:24:17Z","abstract_excerpt":"We consider the problem of collaborative filtering from a channel coding perspective. We model the underlying rating matrix as a finite alphabet matrix with block constant structure. The observations are obtained from this underlying matrix through a discrete memoryless channel with a noisy part representing noisy user behavior and an erasure part representing missing data. Moreover, the clusters over which the underlying matrix is constant are {\\it unknown}. We establish a sharp threshold result for this model: if the largest cluster size is smaller than $C_1 \\log(mn)$ (where the rating matri"},"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":"0908.2494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-18T06:24:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1bc441d129c421561b0fd02480d9ac7b3260d5e57a1f8ee38bd2452bd2243f94","abstract_canon_sha256":"91a0d6c68ab6a8413983f280d9756f4a7c600a4029eae04026f0211eb0c0408d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.989741Z","signature_b64":"ZhiStmUIUQf/QhiN7b3N9dxxrWiPi6RcPi5wHp0qvq6Vm5BXyJw5rcN3X/zwqwmEF3R4cusZTxYeuAybM+a+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4028da8e43508b78bfff47a94bbaf4d89cc8047324169791e768303a596a672b","last_reissued_at":"2026-05-18T00:58:19.989009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.989009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Channel Coding Perspective of Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Onkar Dabeer, S. T. Aditya","submitted_at":"2009-08-18T06:24:17Z","abstract_excerpt":"We consider the problem of collaborative filtering from a channel coding perspective. We model the underlying rating matrix as a finite alphabet matrix with block constant structure. The observations are obtained from this underlying matrix through a discrete memoryless channel with a noisy part representing noisy user behavior and an erasure part representing missing data. Moreover, the clusters over which the underlying matrix is constant are {\\it unknown}. We establish a sharp threshold result for this model: if the largest cluster size is smaller than $C_1 \\log(mn)$ (where the rating matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2494","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":"0908.2494","created_at":"2026-05-18T00:58:19.989135+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.2494v1","created_at":"2026-05-18T00:58:19.989135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2494","created_at":"2026-05-18T00:58:19.989135+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAUNVDSDKCFX","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAUNVDSDKCFXRP77","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAUNVDSD","created_at":"2026-05-18T12:26:00.592388+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/IAUNVDSDKCFXRP77I6UUXOXU3C","json":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C.json","graph_json":"https://pith.science/api/pith-number/IAUNVDSDKCFXRP77I6UUXOXU3C/graph.json","events_json":"https://pith.science/api/pith-number/IAUNVDSDKCFXRP77I6UUXOXU3C/events.json","paper":"https://pith.science/paper/IAUNVDSD"},"agent_actions":{"view_html":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C","download_json":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C.json","view_paper":"https://pith.science/paper/IAUNVDSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.2494&json=true","fetch_graph":"https://pith.science/api/pith-number/IAUNVDSDKCFXRP77I6UUXOXU3C/graph.json","fetch_events":"https://pith.science/api/pith-number/IAUNVDSDKCFXRP77I6UUXOXU3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/action/storage_attestation","attest_author":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/action/author_attestation","sign_citation":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/action/citation_signature","submit_replication":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/action/replication_record"}},"created_at":"2026-05-18T00:58:19.989135+00:00","updated_at":"2026-05-18T00:58:19.989135+00:00"}