{"as_of":"2026-08-16T21:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdd380b05996104c713ba7db95e1964ae8175c12cb4d60e888130ba29366efdd","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:15:41.667567Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01607/citation-record","integrity":"/paper/1908.01607/integrity","json":"/paper/1908.01607/citation-record.json","paper":"/paper/1908.01607"},"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-14T15:15:42.327226Z","title":"Scenario for 5G mobile and wireless communications: the vision of the METIS project,","venue":null,"work_id":"581fb059-6396-4bcc-aac4-48c034a3a354","year":2014},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.454989Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:dfb268b389de09e8c679ddb4a3c418620051cdc1fe005b69c37d82eb8c5338d8","observation_id":"6e1f7375-7c08-456c-afa5-dbe9c49d86ff","resolution":{"observed_at":"2026-08-14T15:15:42.331551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.309411Z","title":"TR 21.915 v1.1.0, Release 15 Description,","venue":null,"work_id":"546699df-0943-4366-a489-c65efc0acff1","year":2019},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.459749Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:d790c16870ec5071e9b35270572049229873bd0ec6ec7ba67a948a0d940be2c1","observation_id":"b0a25756-8794-421d-8389-7dd06598019d","resolution":{"observed_at":"2026-08-14T15:15:42.315153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.294882Z","title":"Is the Random Access Channel of LTE and LTE-A Suitable for M2M Communications? A Survey of Alternatives,","venue":null,"work_id":"47d721dc-aec3-4614-9674-7cda6ab6bfcb","year":2014},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.464249Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:61529b1b483279acdaa35f9db7d88b9110972d4f79b33ada00f793a689993eec","observation_id":"69141b22-df8a-4980-8012-57447c6e7bd1","resolution":{"observed_at":"2026-08-14T15:15:42.299808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.279465Z","title":"The ALOHA system: Another alternative for computer communications,","venue":null,"work_id":"33925ec0-cd78-45ae-9436-d1184fcdabf8","year":1970},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.469349Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:7de8b25c366003d274a8f3c06c088d4fbe6d9863ed447a1c6d658fc40c649fcd","observation_id":"3df2db7c-dbfd-4d3b-9ceb-9b88f83a92d0","resolution":{"observed_at":"2026-08-14T15:15:42.284505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.264141Z","title":"ALOHA packet system with and without slots and capture,","venue":null,"work_id":"137b4be8-2a81-4064-ad50-fda30a3f702a","year":1975},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.474222Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:53ca7c045be0a5c9ae451a0f1c99806ed8f0a125fbd1368a1765ab71eabe8d9a","observation_id":"d80f6fa7-b832-4f91-9ac8-fcc511a7e27b","resolution":{"observed_at":"2026-08-14T15:15:42.268941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.249917Z","title":"Contention resolution diversity slotted ALOHA (CRDSA): An enhanced random access scheme for satellite access packet networks,","venue":null,"work_id":"82cec4ca-54a6-4f98-a231-eaaaafffe103","year":2007},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.478765Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:430152c2c6586c5fca72f5863ab7f9ba3ede8385d0b8796db613910fed5ab278","observation_id":"5a4a9346-764d-44a9-8290-ad0983766da9","resolution":{"observed_at":"2026-08-14T15:15:42.254081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.237238Z","title":"Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA,","venue":null,"work_id":"a0df3356-3a3d-41bf-9227-2e95e6998db3","year":2011},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.483698Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:633c463cfbb7bb82f4986c579a720e5b10a23e8be4372af6fb573985b5036dbf","observation_id":"6b469e73-9d49-4987-9429-3e62e623d305","resolution":{"observed_at":"2026-08-14T15:15:42.241517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.223549Z","title":"Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access,","venue":null,"work_id":"5040552f-a2e0-44b3-9975-37fc131a38df","year":2015},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.487655Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:2dfa8e62a8f98cf6d878f7e3298c2c40a7e316960414bb2e6339950ccef2eb9f","observation_id":"a5b184e4-bbed-4f97-a3ae-2d61d0a80879","resolution":{"observed_at":"2026-08-14T15:15:42.227844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.210881Z","title":"On Frame Asynchronous Coded Slotted ALOHA: Asymptotic, Finite Length, and Delay Analysis,","venue":null,"work_id":"7e5f61d3-c3ee-4b22-ac0d-28495662bea8","year":2017},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.491488Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:c428a6637d9ccd638b91ffbf33ecb807a73bc5c0acb31c912cf26ca787988d9a","observation_id":"6ecc41cb-0140-4dfe-bd0f-f22166e32dac","resolution":{"observed_at":"2026-08-14T15:15:42.215343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.198178Z","title":"ALOHA Random Access that Operates as a Rateless Code,","venue":null,"work_id":"3ef6d51a-f478-45d6-860a-7ac9ed3f2a1d","year":2013},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.494881Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:f5adf988311b653ac49a8d2d641a7fa7eb8de64673bb5be31dba08f9d266013b","observation_id":"17baac2a-7089-414d-8adc-13b523c081d1","resolution":{"observed_at":"2026-08-14T15:15:42.202621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.186069Z","title":"High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm,","venue":null,"work_id":"9e615ad7-9315-49e0-a790-d1faa529636e","year":2007},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.498260Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:cd51490aef0d55ba4460c214af772c721d6bce2d880ce58c556ba88e7e60db80","observation_id":"f0f785dd-371b-4ff2-9a84-90eba6e9e1d0","resolution":{"observed_at":"2026-08-14T15:15:42.190335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.173775Z","title":"Collision-Resolution Algorithm and Random-Access Communication,","venue":null,"work_id":"c3d60269-85df-443b-b25e-9b21126b17f9","year":1981},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.501643Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:8b8a2a58b165c6094ac777101c62ef970d3abe2efc74f7f380243b0b97b728d0","observation_id":"f7bfd104-d907-40a0-9b7e-6822f87a9009","resolution":{"observed_at":"2026-08-14T15:15:42.177851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.162150Z","title":"A perspective on Multiaccess Channels,","venue":null,"work_id":"dd4ac588-2a56-4612-8158-3638c52ba24e","year":1985},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.505518Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:80c79ebcc3753d417fb0adc0a61947b05d029991b5ffe9be949f77dc25428285","observation_id":"9d46fb0b-0ae7-475f-8f3e-c8c6d6b24a3c","resolution":{"observed_at":"2026-08-14T15:15:42.165902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.150275Z","title":"Improved Low-Density Parity-Check Codes Using Irregular Graphs,","venue":null,"work_id":"c38735a4-6df3-4a90-9cc4-1dc33547a8e8","year":2001},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.512693Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:a5c2aed411d1ed2cba73f37b10e8577122075c42a30660e3886c5151ce0478fc","observation_id":"f7a93499-e4d3-4ea4-9594-3a2d66d05e20","resolution":{"observed_at":"2026-08-14T15:15:42.154015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.137796Z","title":"Design of Capacity-Approaching Irregular Low-Density Parity- Check Codes,","venue":null,"work_id":"54a559df-319d-45b9-ae53-c3ddbe63b15b","year":2001},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.521393Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:defd1aeac8f527924661414fc3711660cea4cc4a9f76357558828fc2ac7eaaa5","observation_id":"72f1eee8-5245-4817-b9ca-0ccea93834f5","resolution":{"observed_at":"2026-08-14T15:15:42.142244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.122070Z","title":"Error Floor Analysis of Coded Slotted ALOHA Over Packet Erasure Channels,","venue":null,"work_id":"591df69e-1682-4a04-ab6f-528a8473a07c","year":2015},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.527134Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:841b95920eca84ef66f66c18f72759712671f11e0851e8080cf0f5cde2768d54","observation_id":"c5aca9ea-1896-4ef4-bdc7-812730e839a7","resolution":{"observed_at":"2026-08-14T15:15:42.127874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.107357Z","title":"Finite-length analysis of irregular repetition slotted aloha in the waterfall region,","venue":null,"work_id":"7657236c-b684-4021-a118-6c82c4c2b7b7","year":2018},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.531338Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:31aa031ff77675a1e99f622272326dfca0c0d2f1d66a4251a27ad6556de8775f","observation_id":"7e7ff380-ebdc-41b7-9641-496f7c9c0c5a","resolution":{"observed_at":"2026-08-14T15:15:42.112619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.090504Z","title":"Iterative Collision Resolution for Slotted ALOHA: An Optimal Uncoordinated Transmission Policy,","venue":null,"work_id":"dfa88700-7659-40f5-ac38-33160e9c200f","year":2012},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.536721Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:d0f524efbf63bce6dacbdc8dff2d798c563526198e9e837975e3e9f13ad80162","observation_id":"4757777d-f765-45c8-8a27-b24a2130d3d5","resolution":{"observed_at":"2026-08-14T15:15:42.095076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.075693Z","title":"A Perspecitve on Massive Random-Access,","venue":null,"work_id":"95624c9f-e12d-4f46-bb76-26b2c270796e","year":2017},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.544586Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:7ec6dcece133228a83fda374566b74ebfa9e2075e6cdf69d8fafabdefb6e0975","observation_id":"c079d13f-4128-43b2-b088-3097b0866052","resolution":{"observed_at":"2026-08-14T15:15:42.081004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.062127Z","title":"Random Access Channel Coding in the Finite Blocklength Regime,","venue":null,"work_id":"4c8265de-3b9f-47bd-8f50-ebe31000c966","year":2018},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.548877Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:00ab4a60ed90962d68b9d6c9740caf365c30e9c43c762d36adc52140f82fcb3e","observation_id":"228ccebc-6b71-452c-bd0d-6b3e82d2b692","resolution":{"observed_at":"2026-08-14T15:15:42.066221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.049337Z","title":"Low Complexity Scheme for the Random Access Gaussian Channel,","venue":null,"work_id":"2d529e53-47df-4544-bc08-9d546300e890","year":2017},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.557170Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:3847ed1fc0d1dbd7d2f468238b9f61c1810c29b4fb5bf82e718a72be0acac40c","observation_id":"2a8bd52b-9da8-4e4f-b1d8-9ff6d56eaaea","resolution":{"observed_at":"2026-08-14T15:15:42.053245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.032143Z","title":"A User-Indipendent Serial Interference Cancellation August 6, 2019 DRAFT 28 Based Coding Scheme for the Unsourced Random Access Gaussian Channel,","venue":null,"work_id":"67355c32-cfc7-4af9-ae95-2583931d7cbe","year":2019},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.561971Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:656b469538af8eb43b1e59a190e6ac8d7215ce276e32904423bf11397d3fe6ea","observation_id":"ac78f698-611e-4a9d-8308-abe9c7770f49","resolution":{"observed_at":"2026-08-14T15:15:42.038647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:42.015545Z","title":"CHIRRUP: a Practical Algorithm for Unsourced Multiple Access,","venue":null,"work_id":"00e577f7-c336-453d-8c8b-326d0c08a3e7","year":2018},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.567405Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:478f841cae34a8055bbdfa9a22c61ac7859bd4466bb6619fdff5263a64d8ee7b","observation_id":"d6bb8041-84fd-456b-b284-6fdbc82886f8","resolution":{"observed_at":"2026-08-14T15:15:42.020953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.997969Z","title":"A Coded Compressed Sensing Scheme for Uncoordi- nated Multiple Access,","venue":null,"work_id":"3dab9cc4-1800-4842-bab6-40200b4e02cb","year":2018},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.571506Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:de5b18e2012b096b81c081449df0feb44cc3d4364a4ad8b6b5c0ed47141a73ad","observation_id":"cce0e74b-cb79-431e-b2e0-c8efe3941ca7","resolution":{"observed_at":"2026-08-14T15:15:42.002675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.982490Z","title":"Performance Enhancements for Asynchronous Random Access Protocols over Satellite,","venue":null,"work_id":"f8f018a7-a305-4e41-9a1b-489cafccb95e","year":2011},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.575904Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:7cfc198acb2edb9e2286eef983f636309f0be0f13ff315f8d4355ee98d3b2fd6","observation_id":"a97a7c57-351d-4cb8-aa94-7ecc1e0f88b1","resolution":{"observed_at":"2026-08-14T15:15:41.987239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.968467Z","title":"Asynchronous Contention Resolution Diversity ALOHA: Making CRDSA Truly Asynchronous,","venue":null,"work_id":"ef2cf8c8-029f-4c6c-94b1-49fc7850da20","year":2014},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.580417Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:f3bfb961ed6b794d275f24ddc868e5115a074e3605b6524a8bd456c3291e6841","observation_id":"28ce4b79-94e4-489b-9128-c9e1f318b3ea","resolution":{"observed_at":"2026-08-14T15:15:41.973619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.952379Z","title":"Enhancing Contention Resolution ALOHA using Combining Techniques,","venue":null,"work_id":"451c6507-310e-4b1b-bda5-5460d5cdb489","year":2018},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.585583Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:5b0cbc56dddc9a10accbaccfa9c76b6bed3d58faa9919d3fb99700ff08c4cfdd","observation_id":"ea7ecc8f-bb40-4aa7-95d9-e3d455fefc6f","resolution":{"observed_at":"2026-08-14T15:15:41.958800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.938468Z","title":"Asymptotic analysis of contention resolution ALOHA with replica concatenation,","venue":null,"work_id":"70221861-f0f9-4078-961d-b1a774c4c29e","year":2019},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.594272Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:778efdd5cb8ebb39946909015f22259256261f11eedaa3e946ddcd4cd959e80c","observation_id":"6a41e551-dc6b-4f20-b9f8-f3b60e24c3b9","resolution":{"observed_at":"2026-08-14T15:15:41.942981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.925330Z","title":"LDPC code performance and optimum code rate for contention resolution diversity ALOHA,","venue":null,"work_id":"8d489097-d08d-4bfb-8e6b-3023c3c34e0e","year":2013},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.599071Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:6fa6dc0e15071569707fd45365ede0a9420f3ac6793800d808447935d67a375d","observation_id":"7a90bd65-ec2f-4d6a-b1d7-5919762ff7b8","resolution":{"observed_at":"2026-08-14T15:15:41.929491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.911713Z","title":"LDPC code design for asynchronous random access,","venue":null,"work_id":"9699b27d-9483-47b4-9356-408a4fbdbc09","year":2018},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.602759Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:1d8803c0f668d8a94aa83b7f38c52c34f804b4ecce247397c5390b77a08fc132","observation_id":"bb07cf37-2d84-4896-b40c-e97ca3f6cb74","resolution":{"observed_at":"2026-08-14T15:15:41.916751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.896850Z","title":"On linear unequal error protection codes,","venue":null,"work_id":"b32590d9-b119-46c1-b227-b44941040918","year":1967},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.607418Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:106fd2be9f20f22a329c7f1002572b55100e35c70acb7ac8c831b0caabe5294a","observation_id":"c93aeae5-7bca-4539-b2c8-c76da5cbb8a4","resolution":{"observed_at":"2026-08-14T15:15:41.901363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.883032Z","title":"Parallel Concatenated Codes with Unequal Error Protection,","venue":null,"work_id":"67f35603-3890-4a45-aaed-d286dc3e3bdb","year":1998},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.612168Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:06e3130b283d27b6bff938af5e19a14562a8e8fd857a12c81b6e30f744644349","observation_id":"0f45fd89-3fe8-4b57-8901-629c11a70d48","resolution":{"observed_at":"2026-08-14T15:15:41.887678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.867731Z","title":"Analysis of Coding on Non-Ergodic Block fading Channels,","venue":null,"work_id":"7386a805-74e9-49cf-b37e-5d3137d6b4cb","year":2005},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.616119Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:91e3f31187c03a611ef11fd4d42a54d7f69adf256acc90e70e273b1cd378cb63","observation_id":"5a70fe7a-935d-401f-b1f7-78578fefaf5d","resolution":{"observed_at":"2026-08-14T15:15:41.872229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.852754Z","title":"Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels,","venue":null,"work_id":"36834ce0-8164-407f-92f2-1e112200803c","year":2010},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.620300Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:3be9df01c67bb29bbc580afa20a740961553af58ba68c1a903763d427fae598a","observation_id":"e64dc2ff-a7b9-43dc-add4-c3a3bdb937ea","resolution":{"observed_at":"2026-08-14T15:15:41.858269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.839031Z","title":"Noncoherent Frame Synchronization,","venue":null,"work_id":"7df8ad2a-1f51-48db-99e0-7739f5bb0fbd","year":2010},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.624581Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:68480974499ba2f049342a15a64f8d148e112de270ceb35734b4b9b34e8d6dd2","observation_id":"a122a033-c5d9-4d3c-9340-a2431c94b16b","resolution":{"observed_at":"2026-08-14T15:15:41.844316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.822015Z","title":"Detection and Combining Techniques for Asynchronous Random Access with Time Diversity,","venue":null,"work_id":"8e1d9f8c-b1d0-471e-a3b0-e79766dd4ab6","year":2017},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.629760Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:4bb5570caf722f5fdc6aec7374cd15bec391685a959ff46799ff7c941e2880f9","observation_id":"426c35fd-6798-4756-bcd2-63f2c7091b4c","resolution":{"observed_at":"2026-08-14T15:15:41.828022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.808433Z","title":"Mengali and A","venue":null,"work_id":"87b66133-f158-4b92-bdfb-76a95a378b97","year":1997},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.634567Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:3fcb16ca87451c9f7b0af8fd39acf4fa79c114beb24fd45c4d68b73d9cd8c274","observation_id":"c1e58729-0935-4d8f-a1c3-b3c62cdd38db","resolution":{"observed_at":"2026-08-14T15:15:41.812731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.794340Z","title":"Low-density parity-check (LDPC) codes constructed from protographs,","venue":null,"work_id":"e3730ec4-4d4a-4e88-9a76-6ab526644a0f","year":2003},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.640167Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:f9dc22a2bd537d857326e48161307a6ae166de9fafc1fd4c9efe48fd46984c93","observation_id":"cc00b909-65da-4127-a7df-ca56914059fe","resolution":{"observed_at":"2026-08-14T15:15:41.798700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.779802Z","title":"Design of Non-Precoded Protograph-Based LDPC Codes,","venue":null,"work_id":"b8c25245-60ef-4f72-8711-5be24ad707ce","year":2014},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.645932Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:8f12905edceaf63201d6743db2d00bafc30238050073defcb57754d194b73fd8","observation_id":"f8e97737-7d6e-4537-aa88-7417bae6d8ef","resolution":{"observed_at":"2026-08-14T15:15:41.784583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.764699Z","title":"Protograph LDPC Codes Design Based on EXIT Analysis,","venue":null,"work_id":"bb2a2417-8ccf-470c-ab0d-135c3aadeb97","year":2007},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.650153Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:7cda62e63226870f8e94b8ae57e425b0f9f116c13d2966428206e6c4aefbabea","observation_id":"f7a45781-57af-4477-8052-c134b59a0b94","resolution":{"observed_at":"2026-08-14T15:15:41.769626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.749199Z","title":"Channels with Block Interference,","venue":null,"work_id":"aeb41619-b0f0-4733-92af-96044b7685b8","year":1984},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.654346Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:376ea8e65bea2e7afc4ba0adb096e424f9782664b10a5c7ca28c09d4d4b91993","observation_id":"4fa0963b-13af-442a-ac17-8f3f064bc744","resolution":{"observed_at":"2026-08-14T15:15:41.754573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.732298Z","title":"Protograph-based Raptor-like LDPC codes for rate compatibility with short blocklengths,","venue":null,"work_id":"be1055f9-16f4-44b1-9aad-b7b9bb0692e8","year":2011},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.659177Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:1665f1daa71536dbb328ab8a72a7c1cee04077866003f4ade56532a3dc5ef28d","observation_id":"455fce57-72fa-4b94-9b32-65d8f100c209","resolution":{"observed_at":"2026-08-14T15:15:41.737858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.718686Z","title":"R1-1706970 LDPC design for eMBB data,","venue":null,"work_id":"444f6fde-1f38-4806-805a-0906c77b4e2e","year":2017},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.663638Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:2c8a0d4e005d6dc683a95d34dceb039df3938c10f314cb0ef7e5bf528d4e29f8","observation_id":"970253d5-d6b6-4e6c-91b6-10935c4a85a0","resolution":{"observed_at":"2026-08-14T15:15:41.723106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:41.702655Z","title":"Unequal Diversity LDPC Codes for Relay Channels,","venue":null,"work_id":"4117a1ac-41dd-441a-a29c-02b2cc93cbba","year":2013},"citing_paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:41.667567Z"},"links":{"citing_paper":"/paper/1908.01607"},"observation_digest":"sha256:dc8e56bfe56251b152f90fa8c8f16bdda4b07b2c21f397b5ea118c1ab42bc52e","observation_id":"f22ebfe7-c733-4981-8328-ea210dbe8964","resolution":{"observed_at":"2026-08-14T15:15:41.708572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01607","last_updated":"2019-08-05T13:26:12Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T15:05:49.317848Z","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":44},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:1908.01607."}