{"as_of":"2026-08-08T04:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ff08366154a65cbc95d5b1165d3b83f1834747430ec5da64de6d0dd2aa78429","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:36:53.782767Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.04793/citation-record","integrity":"/paper/2506.04793/integrity","json":"/paper/2506.04793/citation-record.json","paper":"/paper/2506.04793"},"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-07T10:36:53.962059Z","title":"Tree algorithms for packet broadcast channels,","venue":null,"work_id":"68262375-c813-4c7d-9f19-e3882432b2a2","year":1979},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.190067Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:cd6f3a7cc5d22b0318e2c49eae2fc8accdefec555d403b1ec5ec6b6a8bb5e5a5","observation_id":"cfe0736e-1eeb-450b-b765-b5d2f02f2e42","resolution":{"observed_at":"2026-08-07T10:36:53.965372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.953629Z","title":"Age of information: An introduction and survey,","venue":null,"work_id":"dbf1eb15-d25b-4021-99e5-d5c8eab2ec3b","year":2021},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.244807Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:4c74c1555666018262a06923a16e24dc2b22c17a82052e4253eabc9269cb9099","observation_id":"546f6d08-722e-446f-9ddc-2a150766123f","resolution":{"observed_at":"2026-08-07T10:36:53.956422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.944262Z","title":"The throughput of packet broadcasting channels,","venue":null,"work_id":"7e5bbed9-e28b-4b11-858c-104b9068f4ea","year":1977},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.320065Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:6b11e31f91de34b99de2e9c65f4e99a1774fe8d6ca821c2e6ed754d2efc96165","observation_id":"122a2071-5e46-45ef-8574-539e6fad19cf","resolution":{"observed_at":"2026-08-07T10:36:53.947675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.935778Z","title":"Unsourced multiple access: A coding paradigm for massive random access,","venue":null,"work_id":"0d2f8bb0-f44e-4370-86ce-efa9f01134c1","year":2024},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.420667Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:fa42901cdfe86a2925fe0acf1500d277a6a5474034dc663769e9ee7cb16f67cc","observation_id":"18268226-ea22-4c9b-b107-e8fa2ad1572b","resolution":{"observed_at":"2026-08-07T10:36:53.938759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.926909Z","title":"Collision-resolution algorithms and random-access commu- nications,","venue":null,"work_id":"7cbfacc1-a43b-43c5-b3d7-ff81a7f2cc92","year":1981},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.520882Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:362a928caeb02a1f4ac45542db1a5656c4c6c4e7bece2b8ee331d1760a700b53","observation_id":"e33ce645-823c-47ff-9e2d-492ed0fd2d3d","resolution":{"observed_at":"2026-08-07T10:36:53.930093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.916835Z","title":"Q-ary collision resolution algorithms in random-access systems with free or blocked channel access,","venue":null,"work_id":"fc786987-3a97-4260-9514-dd0fd3c80ee0","year":1985},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.570457Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:e399256d9c59fc214c402288ff91a26cbbd18ca93289a5012e5a9b960a794f43","observation_id":"343c8cff-a763-40ec-848b-425b5bb01447","resolution":{"observed_at":"2026-08-07T10:36:53.920354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.907296Z","title":"High-throughput random access using successive interference cancellation in a tree algorithm,","venue":null,"work_id":"6e4f7b9d-e674-44fb-b275-2437f8186912","year":2007},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.701197Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:468621ad4fcacc9c743c1e146b8c11c3b122489daaaeac436f1b72d2e6f56b71","observation_id":"09d22a43-7913-41e1-97c3-1a43034ca60e","resolution":{"observed_at":"2026-08-07T10:36:53.910430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.897548Z","title":"Analysis of d-ary tree algorithms with successive interference cancellation,","venue":null,"work_id":"b5f1b782-0067-4886-be06-2caf5ffb9a79","year":2024},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.744035Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:352ad7cd82d9787fba2fe85ec32d5292bc227e3fdf4a3f0d16f744a1c49ad857","observation_id":"98a20b02-b32e-42a5-b4b8-b70344fc4b39","resolution":{"observed_at":"2026-08-07T10:36:53.900877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.888400Z","title":"Status updates over unreliable multiaccess channels,","venue":null,"work_id":"03911faa-4352-4584-abe1-5aa7a136cb88","year":2017},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.759943Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:9b629ad4a042230851ae6bed9bd86d3a08e6c582cfb0c54c2da313fbe0613f1e","observation_id":"6e20127e-a878-46cb-9968-7d3f49414321","resolution":{"observed_at":"2026-08-07T10:36:53.891650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.878605Z","title":"Age of information in uncoordinated unslotted updating,","venue":null,"work_id":"64290ae2-e665-45bc-af00-96ea271d4ffc","year":2020},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.763228Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:9e282a5f56a710e534a39830813cb0a4aae7f9cd7ddb9cb803ba2fbafc2c41a3","observation_id":"eace47e2-a4f0-4727-a92f-63d057b9856e","resolution":{"observed_at":"2026-08-07T10:36:53.882000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.868263Z","title":"Analysis of slotted ALOHA with an age threshold,","venue":null,"work_id":"0b45274e-b108-403b-a414-cdec349ad5af","year":2021},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.766354Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:fcf3b0876fd1a13fc2235d71dc7439acbd30a1bddb12812138d2fb4dd9b76ce4","observation_id":"096a5e61-b73f-4353-a5e6-f7880263c2bc","resolution":{"observed_at":"2026-08-07T10:36:53.871538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.857098Z","title":"Age of information in random access channels,","venue":null,"work_id":"51eae1a4-e704-4799-93df-3997411b97e6","year":2022},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.769384Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:690cba03da9902908fe0b07b26ef9674192b396d8ef9aa9011732167d45e094b","observation_id":"e5525caf-2bd2-4602-9c01-ab7b3bd6655f","resolution":{"observed_at":"2026-08-07T10:36:53.861133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.845053Z","title":"Modern random access: an age of information perspective on irregular repetition slotted ALOHA,","venue":null,"work_id":"f7e82868-72e0-4da4-aae5-937989b397f2","year":2021},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.772746Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:c80caf5fa8cf6219b743f06a2d4eaf3c24e17c3b5b6cdc244d63c34a11ff253e","observation_id":"4960b562-d3f0-4e1a-b416-79d715f60e06","resolution":{"observed_at":"2026-08-07T10:36:53.850132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.834145Z","title":"The dynamic behavior of frameless ALOHA: Drift analysis, throughput, and age of information,","venue":null,"work_id":"a29379cc-a6c3-4e4d-8cdc-838d361e7b06","year":2023},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.776415Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:26a3ded8c77717db72f8edfd66cf96ac8f739fd2c8adcb2d7bcd269f452cc474","observation_id":"15ce7830-5d41-482e-86e3-3612a1419ca1","resolution":{"observed_at":"2026-08-07T10:36:53.838144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.822509Z","title":"Age of information with collision-resolution random access,","venue":null,"work_id":"2e515338-ef09-4358-a8e6-fbe13ffd478b","year":2022},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.779599Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:85f526200ae16810bf277776c715b98edd5c121dc3e9b36ccc1cc96ae42e9dbb","observation_id":"a6714bda-15f6-4bb2-b493-29f1460a2518","resolution":{"observed_at":"2026-08-07T10:36:53.826499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:36:53.809258Z","title":"Gallager, Stochastic Processes: Theory for Applications","venue":null,"work_id":"6b0e4d3c-959c-40fd-a84f-3a8ce583ccd0","year":2013},"citing_paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:36:53.782767Z"},"links":{"citing_paper":"/paper/2506.04793"},"observation_digest":"sha256:6da0de0c773143dab41bf247ef7b06d94f6398b0d8020584442e24547ccabd51","observation_id":"bdea4c50-deaf-42af-865c-41bdd5f0e6c3","resolution":{"observed_at":"2026-08-07T10:36:53.814320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04793","last_updated":"2025-06-05T09:21:31Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T10:30:24.491945Z","submitted_at":"2025-06-05T09:21:31Z","title":"On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":16},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2506.04793."}