{"as_of":"2026-08-21T05:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d0b9e8aab4825e19f49e5e7c62dffaba93fec26f260b56fd4d4adcd4a5aef06","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:07:29.573149Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.14085/citation-record","integrity":"/paper/2504.14085/integrity","json":"/paper/2504.14085/citation-record.json","paper":"/paper/2504.14085"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.115206Z","title":"Modeling and analysis of random access channels with bursty arrivals in OFDMA wireless networks,","venue":null,"work_id":"24540a58-bb18-4ea9-b5e5-3d2b45e6a836","year":1940},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.404547Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:114af7c13a82ccfc2dd64bb2f3880e6bfa65a3a03712c5a76e6a736b52027178","observation_id":"ef471368-a781-4ce6-8b96-23b746c038fe","resolution":{"observed_at":"2026-08-16T12:07:30.118949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.103972Z","title":"Is the random access channel of LTE and LTE-A suitable for m2m communications? a survey of alternatives,","venue":null,"work_id":"2800abd1-f8e4-47f9-9a5d-8decc8daad35","year":2013},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.408812Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:701398db9c293c9bda54c3edbda6c353ec98faba5978429ea7b8e4ac08b8c4af","observation_id":"a1422138-191c-41a5-912a-f6ea7b737926","resolution":{"observed_at":"2026-08-16T12:07:30.108105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.093346Z","title":"Toward 5G densenets: architectural advances for effective machine-type communications over femtocells,","venue":null,"work_id":"400663f3-c886-4537-a2ff-939ec589444b","year":2015},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.412414Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:17f082039ba25a42c96bb74db40a783066bcb87099d61cf1de279a341f107f4e","observation_id":"36c32c46-c3a8-4e3f-94df-1230e2188376","resolution":{"observed_at":"2026-08-16T12:07:30.097070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.082622Z","title":"Hybrid random access and data transmission protocol for machine-to-machine communications in cellular networks,","venue":null,"work_id":"fd8be3bf-6e92-4ba7-aab5-8ec50d7edf10","year":2014},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.416337Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:a770f61942adbdfeb96dc89ea3944fb20a94a0977d1b91fe73e9e49dbebf6ed8","observation_id":"d43be8da-99de-46bd-8ba0-c9a10c9d1cb8","resolution":{"observed_at":"2026-08-16T12:07:30.086301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.071576Z","title":"3GPP ts 37.869 v12.0.0 (2013-09),","venue":null,"work_id":"7a39a6fe-54ad-4567-b3ad-879825deb261","year":2013},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.419815Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:e3638fc2aa2292b78fa3e040660e5148966efd56afeae8e1a31b126ffe8ae059","observation_id":"03949cc0-f2e7-47f7-a844-270f4d8255e7","resolution":{"observed_at":"2026-08-16T12:07:30.075224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.060450Z","title":"How accurate is the RACH procedure model in LTE and LTE-A?","venue":null,"work_id":"b68bc23d-7a74-4ec9-836f-7ca8d6162a6d","year":2016},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.423591Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:b614991d627198b8351c8abe2126fa8879d9f0b2ee1b59fa617e94ec06c84993","observation_id":"0bb3aa5c-b80c-44c3-ba1c-483dca956af8","resolution":{"observed_at":"2026-08-16T12:07:30.064300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.048453Z","title":"A novel RACH scheme for efficient access in 5G and beyond networks using hash function,","venue":null,"work_id":"aab533e7-7fd6-4dfa-9b2f-3c9ac83b07e6","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.427526Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:eb1c8825fe834d19d96ac6bceaf9ed2fc5e42b0abae424a36af4d86c525e0870","observation_id":"14fbe109-7461-45ac-9167-0360e1a9e0ac","resolution":{"observed_at":"2026-08-16T12:07:30.052467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.034677Z","title":"Random access channel management for handling massive numbers of machine-to-machine communication devices,","venue":null,"work_id":"94cdea2f-06c7-4e84-a779-fb23bde91a75","year":2018},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.430845Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:3720393cc88f414befb89b550eb7706e0a87bbb5a3b87579df77badf531bd09b","observation_id":"ac45d6a9-82f0-4f02-8584-d24eb7009522","resolution":{"observed_at":"2026-08-16T12:07:30.039577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.022566Z","title":"Statistical priority-based multiple access system and method,","venue":null,"work_id":"c445ee8c-6ca3-4a5e-8e1a-1c1f746bbc18","year":2010},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.434329Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:fac49038027855b0ec2d13732ed8a32d40095da70c5e29d46375f881d7071b76","observation_id":"f8f7e247-4ae5-47dd-af88-7621a07fbfba","resolution":{"observed_at":"2026-08-16T12:07:30.027202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:30.009146Z","title":"Modeling and performance analysis of statistical priority-based multiple access protocol,","venue":null,"work_id":"10f49fc4-19be-4b42-8df8-0dd35c208439","year":2018},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.437862Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:2a344a07e62ab7926edca51f77ca4db8fb506577b5026b91cc8dd360881685aa","observation_id":"c3063383-e520-45a8-bbe7-de26409e1a10","resolution":{"observed_at":"2026-08-16T12:07:30.014886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.996173Z","title":"Performance analysis of the statistical priority-based multiple access,","venue":null,"work_id":"cbcd0d6c-a9a2-4bf9-b25d-dddb26579a44","year":2017},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.441819Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:55928cb403b9690761435a124a620aaef7f4644ab6235db7ea6cacff2cd13123","observation_id":"2aca77ce-99ca-4d00-b9fb-fc9ea6ca17a3","resolution":{"observed_at":"2026-08-16T12:07:30.001017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.985193Z","title":"Modeling and performance analysis of statistical priority-based multiple access: A stochastic geometry approach,","venue":null,"work_id":"a8d293e4-ab0e-44fe-b8a9-b02ee70aa3b6","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.445347Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:4c4fb59fbc80aabe2f3e0595b865b8741b2f8497a7cc59dae63c5712934c4220","observation_id":"70a521d4-2b8f-446e-b1f0-57659d72efdb","resolution":{"observed_at":"2026-08-16T12:07:29.989189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.973528Z","title":"Priority- based load-adaptive preamble separation random access for QoS- differentiated services in 5G networks,","venue":null,"work_id":"96ada9af-31ef-48e8-81b4-db2d5d1843df","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.448934Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:562596f9401c68d41e9dc08a72ffab3796d0d6a3c3772c983376921c8dd4c9b7","observation_id":"53f34c10-87fe-4ac1-a945-661e4d839803","resolution":{"observed_at":"2026-08-16T12:07:29.977557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.962944Z","title":"D-ACB: Adaptive congestion control algorithm for bursty M2M traffic in LTE networks,","venue":null,"work_id":"0f0c7677-2ae3-4915-b376-fd4d554563c9","year":2016},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.453562Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:e61e13bcf9d618d783c8033d29f6b1a40002de3fbf89a16141c7bdad9242b64d","observation_id":"19f7c063-6aab-4b60-9efe-e77ab44ab6bc","resolution":{"observed_at":"2026-08-16T12:07:29.966688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.951645Z","title":"Queue-aware access prioritization for massive machine-type communication,","venue":null,"work_id":"ee10c8f0-1f19-4347-b235-d6aa79046b09","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.457204Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:d43e04ddd6d07f50aabe90f108376602e5ac8bce9655a7e67caf2eca26b91aeb","observation_id":"33f8e98c-77e2-471b-87fc-1109b31fc709","resolution":{"observed_at":"2026-08-16T12:07:29.955632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.939871Z","title":"Online control of preamble groups with priority in massive iot networks,","venue":null,"work_id":"ad701e50-66f3-4204-97b6-c358d94742ac","year":2020},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.460572Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:674504db26c148ba3e30ec32c9e7cfb9489e4c5210c2bd4d0874b5c292fde15b","observation_id":"bee82b04-a325-4ed5-97f5-33c6b7abde83","resolution":{"observed_at":"2026-08-16T12:07:29.943994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.928685Z","title":"Utilizing cognitive radio and reinforcement learning for multiple preamble detection in 5G- PRACH,","venue":null,"work_id":"60258c89-4009-40b7-8fdf-0ebf506f5b45","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.464162Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:5e89a4228126552eeaa20659957a80e30b39c4ba1aa83b1240f504e1c38b1e47","observation_id":"a5fd6e15-41c7-4b76-8359-b2fe7cbe0f74","resolution":{"observed_at":"2026-08-16T12:07:29.932544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.917459Z","title":"Deep reinforcement learning mechanism for dynamic access control in wireless networks handling mMTC,","venue":null,"work_id":"fe5df3f8-a613-434e-9e88-ae245be3c114","year":2019},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.467495Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:964edefdb002e5d084fb767606e9ef0205ed3f16f17c9ae6617d13b7cc077707","observation_id":"abde2b85-475a-4f5f-9d8c-2aa49ea8eb5c","resolution":{"observed_at":"2026-08-16T12:07:29.921521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.906556Z","title":"A reinforcement-learning- based access scheme for low-latency and correlated-traffic mtc networks,","venue":null,"work_id":"8fe9163f-7eec-43a8-b297-5f84c9ea41bf","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.471244Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:f4841280be35e8d88df98353489caa538f3fbcee65f538489d41005ee804c38e","observation_id":"1236e70b-9436-4bb4-9534-a7fa2fa8a04e","resolution":{"observed_at":"2026-08-16T12:07:29.910262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.894543Z","title":"Reinforcement learning based dynamic resource allocation for massive MTC in sliced mobile networks,","venue":null,"work_id":"d9352bd0-06e1-40ea-bd61-14e307413879","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.474689Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:fca8a8958820d263dde5d208b2e63ab9f498f20bf9c776e4dd8f2d7ed9331d77","observation_id":"92283e8a-d2e7-4904-a5bc-93f2e401a7be","resolution":{"observed_at":"2026-08-16T12:07:29.898418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.883397Z","title":"Reinforcement learning based preamble resource allocation scheme for access control in machine-to-machine communication,","venue":null,"work_id":"c387a50f-52e8-47fb-9b68-f034579e4eb5","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.478532Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:0e1d1d5e4c7e848dcc9bb7c341674496c24cf8074126cf1a39f035581db9bf69","observation_id":"3d6f6bfa-a2d2-4790-bcaf-ed701fbe45f3","resolution":{"observed_at":"2026-08-16T12:07:29.887094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.872584Z","title":"Priority- based learning automata in Q-learning random access scheme for cellular M2M communications,","venue":null,"work_id":"75666c15-ce57-499d-ac16-24769e5cfbc2","year":2021},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.482033Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:2e77c4f478bda62daa1c29caec7470f95b108c9a87fb13b2e62370970e98941e","observation_id":"7a20b827-ae9d-45e7-95e9-0876e770788d","resolution":{"observed_at":"2026-08-16T12:07:29.876328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.861266Z","title":"PPO-based PDACB traffic control scheme for massive IoV communications,","venue":null,"work_id":"5c4eabb4-6df0-4083-8523-a9a56a48828c","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.485530Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:44059724c5faef2f8975b6eaa0669a3259d93457c8b25038c3a00d53407b0e54","observation_id":"ccc8b4ea-9dd6-44da-9928-83ab81eb7bad","resolution":{"observed_at":"2026-08-16T12:07:29.865154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.850111Z","title":"Deep reinforcement learning based flexible preamble allocation for RAN slicing in 5G networks,","venue":null,"work_id":"1fbfea90-d6ea-479a-af01-3f18db6472e8","year":2022},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.488941Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:71fada385ef6da9d812cf1f8af9650c7209ddbb3647d8c1e8827f4f24079dc35","observation_id":"a3a48239-4cf0-4633-9484-f90955400a19","resolution":{"observed_at":"2026-08-16T12:07:29.853810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.839452Z","title":"Prioritized random access with dynamic access barring for RAN overload in 3GPP LTE-A networks,","venue":null,"work_id":"a9ada302-4fbe-4115-894e-b9a214fad7fd","year":2011},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.492142Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:7124be4c8956673a9914c1a03a78f3d1d073c12f492a6d0188656dbaae126042","observation_id":"d4e41f45-5f58-427e-9069-143ea6752187","resolution":{"observed_at":"2026-08-16T12:07:29.843006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.828634Z","title":"PRADA: Prioritized random access with dynamic access barring for MTC in 3GPP LTE-A networks,","venue":null,"work_id":"b06a158d-3422-4a73-99b6-f4fcec77b29b","year":2014},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.495619Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:b80ede91dbad0831446b5cfa528d792cc998503f98111f232d0ca2151fc8806c","observation_id":"ee176278-6b3c-40b5-b103-0f8ca1cb6dd2","resolution":{"observed_at":"2026-08-16T12:07:29.832433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.818028Z","title":"Handling mission- critical communication in smart grid distribution automation services through lte,","venue":null,"work_id":"46318b31-69bb-45e1-b5f3-4981f6e88ed6","year":2016},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.499100Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:2c6f227eced9d8ca006f8dfa0266a7e17ba3aea9b9887fb889a0ce0a67e2d69c","observation_id":"eb7eb115-acf9-4569-b768-51b331545786","resolution":{"observed_at":"2026-08-16T12:07:29.821731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.807553Z","title":"Multiagent reinforcement learning meets random access in massive cellular internet of things,","venue":null,"work_id":"b4753823-dab2-422e-8aa9-fcd6e91c1213","year":2021},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.502878Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:466af91d569493b65a814729fa0a28676953d7efe6d22bc2a7dd42dd53239829","observation_id":"807637ce-7348-4eb6-ba09-b7b84fad4ff1","resolution":{"observed_at":"2026-08-16T12:07:29.811119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.796534Z","title":"Random access scheme for machine type communication networks using reinforcement learning approach,","venue":null,"work_id":"48cfdd60-fe1a-4ab1-ba9b-26b530e8af7a","year":2023},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.506941Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:c194142ccb4efbdc6346638e000e868f8cdeb4c28a98a196954bcd6dd51159a4","observation_id":"bd824e58-9a81-4017-bbe9-439a836e64e4","resolution":{"observed_at":"2026-08-16T12:07:29.800193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.785399Z","title":"A minimalist approach to offline reinforcement learning,","venue":null,"work_id":"995fa8bf-6961-4c08-89df-26adbb990f17","year":2021},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.511479Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:2cb7ebc4439342a2934b86cc1067f5d36e4362b4774867cb79ec10a83f055c01","observation_id":"573bb899-f1ca-43c3-877a-4a541e7f6c80","resolution":{"observed_at":"2026-08-16T12:07:29.789285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.774236Z","title":"Fast adaptive S-ALOHA scheme for event-driven machine-to-machine communications,","venue":null,"work_id":"7cbf94bc-26b8-4a77-a2a7-a6b7626d5ec5","year":2012},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.514960Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:72e836e75cfcc41f97a13b00e8b47e4bf6e18196f5803adb2674380f12cfa34b","observation_id":"b1152d61-95e2-49cd-9313-b4ab01052663","resolution":{"observed_at":"2026-08-16T12:07:29.778134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.763579Z","title":"Stabilizing multi-channel slotted aloha for machine-type communications,","venue":null,"work_id":"62c709dd-5d09-48d0-b5b9-d6698086d2c8","year":2013},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.518485Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:a704921b043d526c32ba68739509dc4676a06a1a19f76e53bb3a6e370190af24","observation_id":"9761c266-069c-414b-a5a9-2deba36a759c","resolution":{"observed_at":"2026-08-16T12:07:29.767232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.751729Z","title":"Optimal access class barring for stationary machine type communication devices with timing advance information,","venue":null,"work_id":"ac1ae98d-93a0-484e-a688-ecad54cb0b2a","year":2015},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.522728Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:aab430db7a2aece90cb6e83af5a0b4e6f85d739161692459d960b7ff6eba1e8e","observation_id":"615135f0-c3ae-4ad4-a220-8859fb45cf35","resolution":{"observed_at":"2026-08-16T12:07:29.755797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.739583Z","title":"Load estimation in a two-priority mMTC random access channel,","venue":null,"work_id":"c2d041f3-489c-4003-a93e-37d7048a424d","year":2024},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.526824Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:c3e5f5ce3cf9c6a7527462c06b4c243a837dd28d9b002f0c5569914b965fb086","observation_id":"03f43da7-4246-4fb1-a9ef-7b929fa7c40f","resolution":{"observed_at":"2026-08-16T12:07:29.743578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.728127Z","title":"NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems,","venue":null,"work_id":"25cad38a-b4d1-49c9-8808-5c244b1d8ab9","year":1986},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.530313Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:620f0a6ca81dbef57d9c2e0421e18ea0014f9f61bc61cb40fc8d06f8aaf52b55","observation_id":"e82fd76a-5035-4a12-97d5-21559190febf","resolution":{"observed_at":"2026-08-16T12:07:29.731960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.716594Z","title":"Finite-time analysis of the multiarmed bandit problem,","venue":null,"work_id":"23854bb6-489f-4b67-a792-f4a5fb1e82d8","year":2002},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.534059Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:57e6ef67410ad1064d633645f83a32b18f3590ef020119f9691b5a27384e7bed","observation_id":"3950c121-6e1b-4252-9ac6-edb8aab78be2","resolution":{"observed_at":"2026-08-16T12:07:29.720602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00757","last_updated":"2015-11-03T18:37:43Z","snapshot_observed_at":"2026-08-14T22:29:44.120623Z","submitted_at":"2015-10-02T23:28:11Z","title":"A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00757","snapshot_observed_at":"2026-08-16T12:07:29.538274Z","title":"A survey of online exper- iment design with the stochastic multi-armed bandit,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.538274Z"},"links":{"cited_paper":"/paper/1510.00757","citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:29fa0f97ce133cd43bf119a20e4c41f50eab037b5ce370a1960c27b242c83e99","observation_id":"ec733376-1d0e-4ca5-b733-f8721c0afef9","resolution":{"observed_at":"2026-08-16T12:07:29.538274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.704730Z","title":"Internally re- warded reinforcement learning,","venue":null,"work_id":"1a48502e-3dab-422c-b63d-d5c03e2fb15e","year":2023},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.542255Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:65a3fde6a35d3386310414e42ecc3b76b36bb81d41ec6f05a3b6ac6dfca1a147","observation_id":"18b78918-70e9-422f-a109-f2449cac31fe","resolution":{"observed_at":"2026-08-16T12:07:29.708668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.14226","last_updated":"2022-05-12T14:07:48Z","snapshot_observed_at":"2026-08-17T20:51:51.322849Z","submitted_at":"2021-07-29T17:58:04Z","title":"Learning more skills through optimistic exploration","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.14226","snapshot_observed_at":"2026-08-16T12:07:29.545678Z","title":"Learning more skills through optimistic exploration,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.545678Z"},"links":{"cited_paper":"/paper/2107.14226","citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:fba1bbb53970cf7b0c4ad35d061583a76a274eceadd3d5d92e408749872b8e43","observation_id":"b50d2274-7448-4c9c-aeba-79821e17207e","resolution":{"observed_at":"2026-08-16T12:07:29.545678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.692932Z","title":"Reward scale robustness for proximal policy optimization via dreamerv3 tricks,","venue":null,"work_id":"5f044b43-d37f-441e-9419-64eded4f6c57","year":2024},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.549686Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:8fda74d2e7db55132889c715b16aba9a8f6b9f7e2929ad4e29a01d257cca2a9f","observation_id":"df6134e5-225c-44da-b3b8-86a0ada08ae7","resolution":{"observed_at":"2026-08-16T12:07:29.696862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-08-17T17:19:33.060917Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-16T12:07:29.553473Z","title":"Playing atari with deep reinforcement learning,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.553473Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:2275752ebf5e80daa57a9b690b3582392f733ae36e653f4578cd5ef5939d6299","observation_id":"2021f6de-ad43-4588-ac6b-073ebc775df1","resolution":{"observed_at":"2026-08-16T12:07:29.553473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.557649Z","title":"Human-level control through deep reinforcement learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.557649Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:dc2bcad6082a58d3886d129c637effedb8742f7c6979ae3238d41f260e5b079b","observation_id":"a98a86a9-0718-4cb5-9011-49321ac4778d","resolution":{"observed_at":"2026-08-16T12:07:29.557649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.673567Z","title":"A generative adversarial network enabled deep distributional reinforcement learning for transmis- sion scheduling in internet of vehicles,","venue":null,"work_id":"a50945a8-24d4-4fba-8679-7f05fe94dea7","year":2020},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.561341Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:4db21b151ed138b4ecc1aacfdcd11243ccde111da9165af96e7307617ce787f2","observation_id":"e72a2296-c8ca-4b03-b6d3-a3cf55e9f65b","resolution":{"observed_at":"2026-08-16T12:07:29.677486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.660584Z","title":"Cemab: A cross-entropy- based method for large-scale multi-armed bandits,","venue":null,"work_id":"deb38afc-8b40-47da-b502-843b7af05d1b","year":2017},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.565808Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:3158623a0cf5fa3b9ec7ca84338091d9706dbf2c2d746419a3d28c60da1fb0bb","observation_id":"1b8b5925-a1e0-491a-9660-a9f64568330f","resolution":{"observed_at":"2026-08-16T12:07:29.664637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.648091Z","title":null,"venue":null,"work_id":"9cc02273-0094-41ff-b762-77ede73fc270","year":2004},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.569477Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:31dff2b136f9a915cf5ea4e0e6d11dfee37aa8d54f5547f0f3f3a4b98eac30b3","observation_id":"0dc863e2-2e09-4203-b0e5-805ac8367f46","resolution":{"observed_at":"2026-08-16T12:07:29.651883Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:07:29.633922Z","title":"Study on ran improvements for machine type communications,","venue":null,"work_id":"019f1e53-08d1-4e25-a34c-41fdb1efde6d","year":2011},"citing_paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T12:07:29.573149Z"},"links":{"citing_paper":"/paper/2504.14085"},"observation_digest":"sha256:a9a91879992ba5605ce97b0035cb1099a7296c20d0806572477f279362918e71","observation_id":"4e7fecc2-2648-436c-ada1-27b4779dd45a","resolution":{"observed_at":"2026-08-16T12:07:29.640081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.14085","last_updated":"2025-04-18T21:42:36Z","latest_version":1,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-16T11:54:32.575479Z","submitted_at":"2025-04-18T21:42:36Z","title":"Access Probability Optimization in RACH: A Multi-Armed Bandits Approach"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":41},"total_outbound_references":46},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2504.14085."}