{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VV5ZBNFWMQWIF5Q7IOV5S3PGFN","short_pith_number":"pith:VV5ZBNFW","schema_version":"1.0","canonical_sha256":"ad7b90b4b6642c82f61f43abd96de62b5b1b9a605de59a966731debe5a29e662","source":{"kind":"arxiv","id":"2502.04678","version":1},"attestation_state":"computed","paper":{"title":"Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ruiyuan Huang, Zengfeng Huang","submitted_at":"2025-02-07T05:52:56Z","abstract_excerpt":"The cross-learning contextual bandit problem with graphical feedback has recently attracted significant attention. In this setting, there is a contextual bandit with a feedback graph over the arms, and pulling an arm reveals the loss for all neighboring arms in the feedback graph across all contexts. Initially proposed by Han et al. (2024), this problem has broad applications in areas such as bidding in first price auctions, and explores a novel frontier in the feedback structure of bandit problems. A key theoretical question is whether an algorithm with $\\widetilde{O}(\\sqrt{\\alpha T})$ regret"},"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":"2502.04678","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-07T05:52:56Z","cross_cats_sorted":[],"title_canon_sha256":"de3eabdfe85809de56d3f685c8b4a6024853b177fbd26ae8bdc35f44e7453982","abstract_canon_sha256":"e2a1458f3d25ab02de8ef903fd75bb18ca4baefaff811c00d2ee75556fd99688"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:55.122515Z","signature_b64":"fn3nqp9kU3PdjSaym6/3/10PVaodIIDj7EDOeQ6Fcsn6maIVYIxC791v/CNPtLvuzkeDwlyPEV/O11vVibIHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7b90b4b6642c82f61f43abd96de62b5b1b9a605de59a966731debe5a29e662","last_reissued_at":"2026-07-05T10:10:55.122024Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:55.122024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ruiyuan Huang, Zengfeng Huang","submitted_at":"2025-02-07T05:52:56Z","abstract_excerpt":"The cross-learning contextual bandit problem with graphical feedback has recently attracted significant attention. In this setting, there is a contextual bandit with a feedback graph over the arms, and pulling an arm reveals the loss for all neighboring arms in the feedback graph across all contexts. Initially proposed by Han et al. (2024), this problem has broad applications in areas such as bidding in first price auctions, and explores a novel frontier in the feedback structure of bandit problems. A key theoretical question is whether an algorithm with $\\widetilde{O}(\\sqrt{\\alpha T})$ regret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04678","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.04678/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.04678","created_at":"2026-07-05T10:10:55.122082+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.04678v1","created_at":"2026-07-05T10:10:55.122082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04678","created_at":"2026-07-05T10:10:55.122082+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV5ZBNFWMQWI","created_at":"2026-07-05T10:10:55.122082+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV5ZBNFWMQWIF5Q7","created_at":"2026-07-05T10:10:55.122082+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV5ZBNFW","created_at":"2026-07-05T10:10:55.122082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.27917","citing_title":"Graph Dimensionality Reduction for Contextual Bandits: Structure-Specific Regret Bounds under Approximate Smoothness and Noisy Eigenspaces","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN","json":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN.json","graph_json":"https://pith.science/api/pith-number/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/graph.json","events_json":"https://pith.science/api/pith-number/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/events.json","paper":"https://pith.science/paper/VV5ZBNFW"},"agent_actions":{"view_html":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN","download_json":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN.json","view_paper":"https://pith.science/paper/VV5ZBNFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.04678&json=true","fetch_graph":"https://pith.science/api/pith-number/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/graph.json","fetch_events":"https://pith.science/api/pith-number/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/action/storage_attestation","attest_author":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/action/author_attestation","sign_citation":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/action/citation_signature","submit_replication":"https://pith.science/pith/VV5ZBNFWMQWIF5Q7IOV5S3PGFN/action/replication_record"}},"created_at":"2026-07-05T10:10:55.122082+00:00","updated_at":"2026-07-05T10:10:55.122082+00:00"}