{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5CKGPZBAALFEEOFU4GZZUGAEIT","short_pith_number":"pith:5CKGPZBA","schema_version":"1.0","canonical_sha256":"e89467e42002ca4238b4e1b39a180444ffdcc92babf7f75f0d878066c90410e7","source":{"kind":"arxiv","id":"1810.06313","version":1},"attestation_state":"computed","paper":{"title":"Regret vs. Bandwidth Trade-off for Recommendation Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Christina Fragouli, Devavrat Shah, Linqi Song","submitted_at":"2018-10-15T12:41:25Z","abstract_excerpt":"We consider recommendation systems that need to operate under wireless bandwidth constraints, measured as number of broadcast transmissions, and demonstrate a (tight for some instances) tradeoff between regret and bandwidth for two scenarios: the case of multi-armed bandit with context, and the case where there is a latent structure in the message space that we can exploit to reduce the learning phase."},"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":"1810.06313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-10-15T12:41:25Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5b4bfa40df6b4c31702a94c4fbf06ec4229951f3649afe93ce551cc6dced2e37","abstract_canon_sha256":"6667410806afec40b29cc4b33591a3224b8edc7e2950eb4282dae7ab2f9a0fe4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:20.850606Z","signature_b64":"c9rCwnXIO7/uYxeA9Hh4wdg5sNb3RjSX7zkfutMd4k5XgocHswcNRNhG7iP+CUnP7yqhxmMPcN2LDrMdBRBCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e89467e42002ca4238b4e1b39a180444ffdcc92babf7f75f0d878066c90410e7","last_reissued_at":"2026-05-18T00:03:20.850133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:20.850133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret vs. Bandwidth Trade-off for Recommendation Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Christina Fragouli, Devavrat Shah, Linqi Song","submitted_at":"2018-10-15T12:41:25Z","abstract_excerpt":"We consider recommendation systems that need to operate under wireless bandwidth constraints, measured as number of broadcast transmissions, and demonstrate a (tight for some instances) tradeoff between regret and bandwidth for two scenarios: the case of multi-armed bandit with context, and the case where there is a latent structure in the message space that we can exploit to reduce the learning phase."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06313","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":"1810.06313","created_at":"2026-05-18T00:03:20.850194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06313v1","created_at":"2026-05-18T00:03:20.850194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06313","created_at":"2026-05-18T00:03:20.850194+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CKGPZBAALFE","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CKGPZBAALFEEOFU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CKGPZBA","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/5CKGPZBAALFEEOFU4GZZUGAEIT","json":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT.json","graph_json":"https://pith.science/api/pith-number/5CKGPZBAALFEEOFU4GZZUGAEIT/graph.json","events_json":"https://pith.science/api/pith-number/5CKGPZBAALFEEOFU4GZZUGAEIT/events.json","paper":"https://pith.science/paper/5CKGPZBA"},"agent_actions":{"view_html":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT","download_json":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT.json","view_paper":"https://pith.science/paper/5CKGPZBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06313&json=true","fetch_graph":"https://pith.science/api/pith-number/5CKGPZBAALFEEOFU4GZZUGAEIT/graph.json","fetch_events":"https://pith.science/api/pith-number/5CKGPZBAALFEEOFU4GZZUGAEIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT/action/storage_attestation","attest_author":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT/action/author_attestation","sign_citation":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT/action/citation_signature","submit_replication":"https://pith.science/pith/5CKGPZBAALFEEOFU4GZZUGAEIT/action/replication_record"}},"created_at":"2026-05-18T00:03:20.850194+00:00","updated_at":"2026-05-18T00:03:20.850194+00:00"}