{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L7F4VW7EMWKXAMLGEXEEQA4LOR","short_pith_number":"pith:L7F4VW7E","schema_version":"1.0","canonical_sha256":"5fcbcadbe4659570316625c848038b74636b70523d0f4c94682254ba2f60359a","source":{"kind":"arxiv","id":"2411.08360","version":1},"attestation_state":"computed","paper":{"title":"Coverage Analysis for Digital Cousin Selection -- Improving Multi-Environment Q-Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Talha Bozkus, Tara Javidi, Urbashi Mitra","submitted_at":"2024-11-13T06:16:12Z","abstract_excerpt":"Q-learning is widely employed for optimizing various large-dimensional networks with unknown system dynamics. Recent advancements include multi-environment mixed Q-learning (MEMQ) algorithms, which utilize multiple independent Q-learning algorithms across multiple, structurally related but distinct environments and outperform several state-of-the-art Q-learning algorithms in terms of accuracy, complexity, and robustness. We herein conduct a comprehensive probabilistic coverage analysis to ensure optimal data coverage conditions for MEMQ algorithms. First, we derive upper and lower bounds on th"},"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":"2411.08360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-13T06:16:12Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"be741d10f620b79080fbb330c58f9af80b2db386da50a2ad6a0b853c087cdd9c","abstract_canon_sha256":"c81c22f73dc332e9a9b7534d3e74eee33372588684a455843a4f1b7727431956"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:46.059543Z","signature_b64":"rdgwZLrCYmBXywdw7Pjcj/3Q3TcCZ/Yw3cKwazymrSc4TH48IiyAa4u8ZUiyi6v4yz+1FuU5QWnTsiTNVNMhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fcbcadbe4659570316625c848038b74636b70523d0f4c94682254ba2f60359a","last_reissued_at":"2026-07-05T09:34:46.059012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:46.059012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coverage Analysis for Digital Cousin Selection -- Improving Multi-Environment Q-Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Talha Bozkus, Tara Javidi, Urbashi Mitra","submitted_at":"2024-11-13T06:16:12Z","abstract_excerpt":"Q-learning is widely employed for optimizing various large-dimensional networks with unknown system dynamics. Recent advancements include multi-environment mixed Q-learning (MEMQ) algorithms, which utilize multiple independent Q-learning algorithms across multiple, structurally related but distinct environments and outperform several state-of-the-art Q-learning algorithms in terms of accuracy, complexity, and robustness. We herein conduct a comprehensive probabilistic coverage analysis to ensure optimal data coverage conditions for MEMQ algorithms. First, we derive upper and lower bounds on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08360","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/2411.08360/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":"2411.08360","created_at":"2026-07-05T09:34:46.059085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08360v1","created_at":"2026-07-05T09:34:46.059085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08360","created_at":"2026-07-05T09:34:46.059085+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7F4VW7EMWKX","created_at":"2026-07-05T09:34:46.059085+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7F4VW7EMWKXAMLG","created_at":"2026-07-05T09:34:46.059085+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7F4VW7E","created_at":"2026-07-05T09:34:46.059085+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/L7F4VW7EMWKXAMLGEXEEQA4LOR","json":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR.json","graph_json":"https://pith.science/api/pith-number/L7F4VW7EMWKXAMLGEXEEQA4LOR/graph.json","events_json":"https://pith.science/api/pith-number/L7F4VW7EMWKXAMLGEXEEQA4LOR/events.json","paper":"https://pith.science/paper/L7F4VW7E"},"agent_actions":{"view_html":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR","download_json":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR.json","view_paper":"https://pith.science/paper/L7F4VW7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08360&json=true","fetch_graph":"https://pith.science/api/pith-number/L7F4VW7EMWKXAMLGEXEEQA4LOR/graph.json","fetch_events":"https://pith.science/api/pith-number/L7F4VW7EMWKXAMLGEXEEQA4LOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR/action/storage_attestation","attest_author":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR/action/author_attestation","sign_citation":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR/action/citation_signature","submit_replication":"https://pith.science/pith/L7F4VW7EMWKXAMLGEXEEQA4LOR/action/replication_record"}},"created_at":"2026-07-05T09:34:46.059085+00:00","updated_at":"2026-07-05T09:34:46.059085+00:00"}