{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LFDM5MZVT4LGG65PKD6TIPBLGM","short_pith_number":"pith:LFDM5MZV","schema_version":"1.0","canonical_sha256":"5946ceb3359f16637baf50fd343c2b331ae608b56ab926227bd8bcce0fe78b8f","source":{"kind":"arxiv","id":"2506.03324","version":1},"attestation_state":"computed","paper":{"title":"Optimization of Epsilon-Greedy Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ethan Che, Hakan Ceylan, James McInerney, Nathan Kallus","submitted_at":"2025-06-03T19:14:53Z","abstract_excerpt":"Modern recommendation systems rely on exploration to learn user preferences for new items, typically implementing uniform exploration policies (e.g., epsilon-greedy) due to their simplicity and compatibility with machine learning (ML) personalization models. Within these systems, a crucial consideration is the rate of exploration - what fraction of user traffic should receive random item recommendations and how this should evolve over time. While various heuristics exist for navigating the resulting exploration-exploitation tradeoff, selecting optimal exploration rates is complicated by practi"},"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":"2506.03324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T19:14:53Z","cross_cats_sorted":[],"title_canon_sha256":"3d09df9a266a64660a2b24668ccbd779d8f18aef59a9901914f83acce2e0094c","abstract_canon_sha256":"da61e38f043b054a524baba69231abafb68afebd47b6ef2f83d2b0a208879933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:25.177081Z","signature_b64":"spWp16nMZJ+7d93TG9DbN2m53RyzjF/hFcyL4bVSD0iXUnbE84p5o8hjlNnD4QycOLZRzNM0JygJ2YVSsi7nBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5946ceb3359f16637baf50fd343c2b331ae608b56ab926227bd8bcce0fe78b8f","last_reissued_at":"2026-07-05T11:15:25.176606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:25.176606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Epsilon-Greedy Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ethan Che, Hakan Ceylan, James McInerney, Nathan Kallus","submitted_at":"2025-06-03T19:14:53Z","abstract_excerpt":"Modern recommendation systems rely on exploration to learn user preferences for new items, typically implementing uniform exploration policies (e.g., epsilon-greedy) due to their simplicity and compatibility with machine learning (ML) personalization models. Within these systems, a crucial consideration is the rate of exploration - what fraction of user traffic should receive random item recommendations and how this should evolve over time. While various heuristics exist for navigating the resulting exploration-exploitation tradeoff, selecting optimal exploration rates is complicated by practi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03324","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/2506.03324/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":"2506.03324","created_at":"2026-07-05T11:15:25.176666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03324v1","created_at":"2026-07-05T11:15:25.176666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03324","created_at":"2026-07-05T11:15:25.176666+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFDM5MZVT4LG","created_at":"2026-07-05T11:15:25.176666+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFDM5MZVT4LGG65P","created_at":"2026-07-05T11:15:25.176666+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFDM5MZV","created_at":"2026-07-05T11:15:25.176666+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/LFDM5MZVT4LGG65PKD6TIPBLGM","json":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM.json","graph_json":"https://pith.science/api/pith-number/LFDM5MZVT4LGG65PKD6TIPBLGM/graph.json","events_json":"https://pith.science/api/pith-number/LFDM5MZVT4LGG65PKD6TIPBLGM/events.json","paper":"https://pith.science/paper/LFDM5MZV"},"agent_actions":{"view_html":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM","download_json":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM.json","view_paper":"https://pith.science/paper/LFDM5MZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03324&json=true","fetch_graph":"https://pith.science/api/pith-number/LFDM5MZVT4LGG65PKD6TIPBLGM/graph.json","fetch_events":"https://pith.science/api/pith-number/LFDM5MZVT4LGG65PKD6TIPBLGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM/action/storage_attestation","attest_author":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM/action/author_attestation","sign_citation":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM/action/citation_signature","submit_replication":"https://pith.science/pith/LFDM5MZVT4LGG65PKD6TIPBLGM/action/replication_record"}},"created_at":"2026-07-05T11:15:25.176666+00:00","updated_at":"2026-07-05T11:15:25.176666+00:00"}