{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:IAUNVDSDKCFXRP77I6UUXOXU3C","short_pith_number":"pith:IAUNVDSD","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"},"canonical_sha256":"4028da8e43508b78bfff47a94bbaf4d89cc8047324169791e768303a596a672b","source":{"kind":"arxiv","id":"0908.2494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.2494","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"0908.2494v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2494","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"IAUNVDSDKCFX","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"IAUNVDSDKCFXRP77","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"IAUNVDSD","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:IAUNVDSDKCFXRP77I6UUXOXU3C","target":"record","payload":{"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"},"canonical_sha256":"4028da8e43508b78bfff47a94bbaf4d89cc8047324169791e768303a596a672b","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"},"source_kind":"arxiv","source_id":"0908.2494","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqS9UY63S2l/911nXVcDpj9IEpW9jXFE2ZbuZA8cPzDP+wTgYCqHfQEg6/SwiL5j8DuqdkmFbA/kpal2FwjGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:13:05.521368Z"},"content_sha256":"9cb74a0f6b765cf944410769f5a6d2a3127c8cc19fd1666722dd109036db763a","schema_version":"1.0","event_id":"sha256:9cb74a0f6b765cf944410769f5a6d2a3127c8cc19fd1666722dd109036db763a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:IAUNVDSDKCFXRP77I6UUXOXU3C","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IB7jsWGMmveS6UdXE/86mOY6djc1Z65olG91msFMGKMnbNtXTVdVmk/T/+cwXuJ5CqQa16lA4xS1yxJbRHyqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:13:05.522104Z"},"content_sha256":"0c71ef56f76eba663d15351352b4d39299afcd1bddd6d0a4f701b8e3c51ae420","schema_version":"1.0","event_id":"sha256:0c71ef56f76eba663d15351352b4d39299afcd1bddd6d0a4f701b8e3c51ae420"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/bundle.json","state_url":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T04:13:05Z","links":{"resolver":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C","bundle":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/bundle.json","state":"https://pith.science/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAUNVDSDKCFXRP77I6UUXOXU3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:IAUNVDSDKCFXRP77I6UUXOXU3C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"91a0d6c68ab6a8413983f280d9756f4a7c600a4029eae04026f0211eb0c0408d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-18T06:24:17Z","title_canon_sha256":"1bc441d129c421561b0fd02480d9ac7b3260d5e57a1f8ee38bd2452bd2243f94"},"schema_version":"1.0","source":{"id":"0908.2494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.2494","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"0908.2494v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2494","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"IAUNVDSDKCFX","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"IAUNVDSDKCFXRP77","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"IAUNVDSD","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:0c71ef56f76eba663d15351352b4d39299afcd1bddd6d0a4f701b8e3c51ae420","target":"graph","created_at":"2026-05-18T00:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bikash Kumar Dey, Onkar Dabeer, S. T. Aditya","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-18T06:24:17Z","title":"A Channel Coding Perspective of Collaborative Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2494","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9cb74a0f6b765cf944410769f5a6d2a3127c8cc19fd1666722dd109036db763a","target":"record","created_at":"2026-05-18T00:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"91a0d6c68ab6a8413983f280d9756f4a7c600a4029eae04026f0211eb0c0408d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-18T06:24:17Z","title_canon_sha256":"1bc441d129c421561b0fd02480d9ac7b3260d5e57a1f8ee38bd2452bd2243f94"},"schema_version":"1.0","source":{"id":"0908.2494","kind":"arxiv","version":1}},"canonical_sha256":"4028da8e43508b78bfff47a94bbaf4d89cc8047324169791e768303a596a672b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4028da8e43508b78bfff47a94bbaf4d89cc8047324169791e768303a596a672b","first_computed_at":"2026-05-18T00:58:19.989009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.989009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZhiStmUIUQf/QhiN7b3N9dxxrWiPi6RcPi5wHp0qvq6Vm5BXyJw5rcN3X/zwqwmEF3R4cusZTxYeuAybM+a+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.989741Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.2494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cb74a0f6b765cf944410769f5a6d2a3127c8cc19fd1666722dd109036db763a","sha256:0c71ef56f76eba663d15351352b4d39299afcd1bddd6d0a4f701b8e3c51ae420"],"state_sha256":"7565f0177064ab89908f8f533a0ddd9a90ea4a8fd7a8515e706e97705b32761d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFP4lM05YINPfXKEFL5KxOcgwfaqjyC/mkOE3sUxhiS4hpzsic61BJW/46mAKA9r/sDH0sBgrfqjx/v/U2XyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:13:05.526189Z","bundle_sha256":"452a341846aec8a067baeb94dba3c7799ba5b2af3205262e827487703a6b7e5c"}}