{"as_of":"2026-08-18T01:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0448107e9b577fc7e38bc6d6ac347a3ea9a6f217ad250111f881110d592a4aa5","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:13:05.459353Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:52:01.243486Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T16:26:09.426153Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"cited_work":{"arxiv_id":"2506.19451","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.19451","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Low-complexity sem antic packet aggregation for token communication via lookahead search","venue":null,"work_id":"5e65b9ec-5784-43bb-86fd-bd5c26ba3822","year":2025},"citing_paper":{"arxiv_id":"2605.02123","last_updated":"2026-05-04T01:06:04Z","snapshot_observed_at":"2026-08-16T12:43:12.235794Z","submitted_at":"2026-05-04T01:06:04Z","title":"Context-Aware Wireless Token Communication via Joint Token Masking and Detection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-09T16:53:21.478889Z"},"links":{"cited_paper":"/paper/2506.19451","citing_paper":"/paper/2605.02123"},"observation_digest":"sha256:80799cc2bbb1e03203086669e4301fdee3574adc75a9d1fd71c4b5291795111b","observation_id":"5645133f-0c76-4e28-8043-e7626c46d187","resolution":{"observed_at":"2026-05-11T16:26:09.428955Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.19451","snapshot_observed_at":"2026-08-06T00:52:01.243486Z","title":"Low-complexity se mantic packet aggregation for token communication via lookahead search,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03141","last_updated":"2026-08-04T05:14:08Z","snapshot_observed_at":"2026-08-17T22:55:43.701856Z","submitted_at":"2026-08-04T05:14:08Z","title":"Geometric Cross-Modal Token Selection for Latency-Constrained Multimodal Token Communication","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:01.243486Z"},"links":{"cited_paper":"/paper/2506.19451","citing_paper":"/paper/2608.03141"},"observation_digest":"sha256:8b8405a235c1129433f7a5c03527b6c43a3e46e74597727ef98b09da9d5ebbb6","observation_id":"33984434-4f9e-4851-96ab-e9021adbdc87","resolution":{"observed_at":"2026-08-06T00:52:01.243486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.19451/citation-record","integrity":"/paper/2506.19451/integrity","json":"/paper/2506.19451/citation-record.json","paper":"/paper/2506.19451"},"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-06T23:13:10.667630Z","title":"Beyond transmitting bits: Context, s emantics, and task-oriented communications,","venue":null,"work_id":"d65b921f-ad78-45df-b1c9-9b44489bd48f","year":2023},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:01.966822Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:db22f65919d55322e5306ebfdb95e9f2389fbaafa053040ea91999862399cb63","observation_id":"3c85f3f6-209f-4f18-a6c2-f858b182dd8c","resolution":{"observed_at":"2026-08-06T23:13:10.804690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:10.424426Z","title":"Less data, more knowledge: Building next-generation semantic c ommunication networks,","venue":null,"work_id":"514cb8e8-16c5-436c-8e70-4f2236579246","year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.052533Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:b5a5da30709db9804ff54f646a3ab329278523ac20b5dc718445d498324879c0","observation_id":"51d38169-a30f-42ce-b7a3-e4fe596f6762","resolution":{"observed_at":"2026-08-06T23:13:10.526626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:10.228931Z","title":"Unleashing the power of edge-cloud generative ai in mobile networks: A survey of AIGC services,","venue":null,"work_id":"ad6e0047-2768-4819-bdb2-3056cbd78f3a","year":2024},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.161633Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:89ce5047508e06f964f90e5bef6e15947d61d0490dfa57da5ea484087f9a417f","observation_id":"6bd434d5-1a32-4a18-8bb9-ae54e3ac5b4c","resolution":{"observed_at":"2026-08-06T23:13:10.317075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.12687","last_updated":"2025-03-18T10:50:58Z","snapshot_observed_at":"2026-08-16T12:41:48.781795Z","submitted_at":"2024-12-17T09:08:18Z","title":"Uncertainty-Aware Hybrid Inference with On-Device Small and Remote Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.12687","snapshot_observed_at":"2026-08-06T23:13:02.245722Z","title":"Uncertainty-aware hybrid inference with on-devic e small and remote large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.245722Z"},"links":{"cited_paper":"/paper/2412.12687","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:4f3280d440155f740e772187c75c7194ad44fa2c668c5cd4dd53ec7d5f63ef81","observation_id":"18aed4b0-f397-4acc-9500-50d23ce2a4f0","resolution":{"observed_at":"2026-08-06T23:13:02.245722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12096","last_updated":"2026-07-03T18:33:04Z","snapshot_observed_at":"2026-08-16T12:57:36.417698Z","submitted_at":"2025-02-17T18:14:18Z","title":"Token Communications: A Large Model-Driven Framework for Cross-modal Context-aware Semantic Communications","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12096","snapshot_observed_at":"2026-08-06T23:13:02.336648Z","title":"Token communications: A uniﬁed framework fo r cross-modal context-aware semantic communications,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.336648Z"},"links":{"cited_paper":"/paper/2502.12096","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:ac4ed373cb9116fc6ee0513b9471fd3cc56cea5b278b294238a2fc23fd978f3d","observation_id":"d99b0969-41c1-43bc-abed-e10692143622","resolution":{"observed_at":"2026-08-06T23:13:02.336648Z","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-06T23:13:10.095038Z","title":"Generative AI for semantic communication: Architecture, challenges, and outlook,","venue":null,"work_id":"90d0c26f-0bea-425a-a475-8336d9c4f2e9","year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.398791Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:1459ec437fd984d0039eb27e94501be874b0dd8f43ce5bbebf134a3a7832f378","observation_id":"15307cc9-8755-41d7-9fb0-2329fbc4250f","resolution":{"observed_at":"2026-08-06T23:13:10.165034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:09.881678Z","title":"Generative ai-driven semantic communication networks: A rchitecture, technologies, and applications,","venue":null,"work_id":"78f1f7a1-5581-4bb5-a03b-8b0fbcd860b4","year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.536948Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:69365e466c2f87307458106321785ebfaef9fc03789f643eabdf12831ac7dc37","observation_id":"7a3f3043-cbb1-4dfd-b08f-aa1f81ebf9bf","resolution":{"observed_at":"2026-08-06T23:13:09.996609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:09.571401Z","title":"Langua ge-oriented communication with semantic coding and knowledge distilla tion for text- to-image generation,","venue":null,"work_id":"8c6bc17f-28a3-4b4e-8a64-5bd6ea73e191","year":2024},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.585733Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:c98754eb18e768e83e7d8166ea9fda25333c1c11b2cb84c1eab6bb3209d20d2a","observation_id":"46b4fd2d-2dbe-42f8-9bc3-a0a06917ce6b","resolution":{"observed_at":"2026-08-06T23:13:09.731948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:09.296244Z","title":"Semantic importance -aware communications using pre-trained language models,","venue":null,"work_id":"e15a4e0e-3cb9-4d7e-bcb1-1a07b7dd8294","year":2023},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.691065Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:b1e006800f0214acb0df1f52f99eeab1c996b4d9cb45db56f3c3b75d7e98f526","observation_id":"de8a96f6-2d1b-4959-8da1-34f9ddea7ba0","resolution":{"observed_at":"2026-08-06T23:13:09.457299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16011","last_updated":"2024-05-25T02:30:28Z","snapshot_observed_at":"2026-08-16T22:07:44.959605Z","submitted_at":"2024-05-25T02:30:28Z","title":"Semantic Importance-Aware Communications with Semantic Correction Using Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16011","snapshot_observed_at":"2026-08-06T23:13:02.783624Z","title":"Semantic impo rtance- aware communications with semantic correction using large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.783624Z"},"links":{"cited_paper":"/paper/2405.16011","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:8633a17a6d678cfe0b4fad88ec70b9d766445dabb637c2eef94481b6eda62f48","observation_id":"9a5cacae-ea0a-4f87-a626-64342bebdb74","resolution":{"observed_at":"2026-08-06T23:13:02.783624Z","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-06T23:13:09.037298Z","title":"Language-oriented semantic latent representa tion for image transmission,","venue":null,"work_id":"13fd0054-141f-429d-a47c-a9a8081f74f8","year":2024},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.906606Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:2ab209e6ec24bc07c6ed81257f8a92082fdde092f6a60149475a199dfd11879c","observation_id":"07b91a49-6f07-4772-93e3-5a49102217f0","resolution":{"observed_at":"2026-08-06T23:13:09.127837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:08.932005Z","title":"Resource all ocation for text semantic communications,","venue":null,"work_id":"12497a78-b26c-4bc4-a0e6-8b9bb40fa4b6","year":2022},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:02.995788Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:2821d03b49e27ca2e9d413136883dbb04d2f34d167830ac07115a0693df3719a","observation_id":"3cc7c064-4e2e-437e-9ed6-1a0668da5c06","resolution":{"observed_at":"2026-08-06T23:13:08.989243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:08.794208Z","title":"Heterogeneous s emantic and bit communications: A semi-NOMA scheme,","venue":null,"work_id":"79a478b4-c07f-4786-9709-6c5a73ba1e48","year":2023},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.087075Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:1781ceff764cff3c609c56be032a8c25a2fed7342cfdf2f332bd8c5438a2c279","observation_id":"891f9521-f291-47a9-887b-3f65420e5b93","resolution":{"observed_at":"2026-08-06T23:13:08.857241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:08.634871Z","title":"Cove rt communications for text semantic with ﬁnite blocklength,","venue":null,"work_id":"2b1ff6f0-eb47-4697-9fe0-9f43f72b58a0","year":2024},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.229789Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:70080271345a8f824c3140b410fb37c9e4214c3e01fc2cd348a789ede4aec8fb","observation_id":"0ba7316f-6dcf-4aca-b473-27c9078324fb","resolution":{"observed_at":"2026-08-06T23:13:08.728869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:08.495278Z","title":"A robust deep learning enabled semantic communication syste m for text,","venue":null,"work_id":"0112a166-1e1a-49ef-a25c-4526d4224ee0","year":2022},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.360594Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:c393a01990c25aa7653363f15e021bb8a71d56e4b035bd0ea259726c7609f6ea","observation_id":"1d3c07d9-c4ca-4df2-b3ed-00d6fb8f343f","resolution":{"observed_at":"2026-08-06T23:13:08.548151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:08.359609Z","title":"Network coding for the internet and wireless networks,","venue":null,"work_id":"70157ff0-153f-46cb-b299-5060cc05b84c","year":2007},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.428744Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:2a1256efa128dbfc42db7f9e5b091bae68192a99ca3a47bc9cdecb46f3a43d2f","observation_id":"f4852207-0200-4603-9a8c-d7a9dadbaa71","resolution":{"observed_at":"2026-08-06T23:13:08.443055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:08.224892Z","title":"Network coding meets TCP: Theory and impleme ntation,","venue":null,"work_id":"827a195b-cde5-4db3-866c-217ecc6899fa","year":2011},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.517390Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:82f7f8840fbc2611f670b976bd3eb14b995ca9d67cd92c770626f08cba6b488c","observation_id":"b51774e6-423e-4c33-b520-2b173d374805","resolution":{"observed_at":"2026-08-06T23:13:08.306780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:08.038258Z","title":"Medard and A","venue":null,"work_id":"66fd803c-0cc2-47d7-b087-645b01e20fae","year":2012},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.608438Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:0920101d4f07331a7e5040dfa5a403c78d910cf7ce9e0a999e441040548d131f","observation_id":"469764e2-e6bd-47cd-9f4a-82b573c55310","resolution":{"observed_at":"2026-08-06T23:13:08.155769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.23734","last_updated":"2025-03-31T05:14:40Z","snapshot_observed_at":"2026-08-18T00:57:44.389676Z","submitted_at":"2025-03-31T05:14:40Z","title":"Semantic Packet Aggregation and Repeated Transmission for Text-to-Image Generation","version":1},"cited_work":{"arxiv_id":"2503.23734","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.23734","snapshot_observed_at":"2026-08-06T23:13:05.734456Z","title":"Semantic Packet Aggregation and Repeated Transmission for Text-to-Image Generation","venue":"eess.SP","work_id":"a056f553-9f16-4f7a-b951-0123d5c11fb3","year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.678729Z"},"links":{"cited_paper":"/paper/2503.23734","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:a3f408aedb58755ae7bf8601ce293bea0ca7367fe5490418b076899b458f59bf","observation_id":"fc0bf5a3-fd42-4b7a-880a-2a0a2517e2be","resolution":{"observed_at":"2026-08-06T23:13:05.774570Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-06T23:13:03.764595Z","title":"Scaling LLM test-t ime compute optimally can be more effective than scaling model paramete rs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.764595Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:33e0b1eeb31e7563c98d812107ef7f36bc624d156485fee7366b9e1095c69989","observation_id":"e47c7c2f-678c-47e5-844d-371959411d56","resolution":{"observed_at":"2026-08-06T23:13:03.764595Z","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":"10.1214/12-sts401","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Lookahead Strategies for Sequential Monte Carlo,","venue":"Statistical Science","work_id":"6541ae8a-7fd5-451c-92c1-dd07b5bc2028","year":2013},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.884720Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:040a41ed76d3cc1ffd44bd611df9fd3f308e344217d6a89f18da3a7a9f34f256","observation_id":"b52d209c-7586-4086-baf1-4afe6e6fb652","resolution":{"observed_at":"2026-08-06T23:13:05.615964Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:07.819130Z","title":"Lookahead optimizer: k steps forward, 1 step back,","venue":null,"work_id":"2440aaad-7969-4b73-a106-c74877dbd1e1","year":2019},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:03.954361Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:bcaf9b7935cb478671582f0aad1bdf028727041b5b8401f1ff47682a62cb3132","observation_id":"906b6fbd-4155-4ed0-a98d-e8068b7f9b59","resolution":{"observed_at":"2026-08-06T23:13:07.925675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06118","last_updated":"2025-07-10T15:53:23Z","snapshot_observed_at":"2026-08-17T16:58:56.211708Z","submitted_at":"2025-02-10T03:09:55Z","title":"Token-Domain Multiple Access: Exploiting Semantic Orthogonality for Collision Mitigation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06118","snapshot_observed_at":"2026-08-06T23:13:04.084279Z","title":"Token- domain multiple access: Exploiting semantic orthogonalit y for collision mitigation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.084279Z"},"links":{"cited_paper":"/paper/2502.06118","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:906d9979f6702c72cfefc3d3756d6c2c2d11b2bc8a5ff30f803a5def60319702","observation_id":"c6b04553-1bfe-4ee3-85a9-83fbb96cfb3f","resolution":{"observed_at":"2026-08-06T23:13:04.084279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17604","last_updated":"2025-05-23T08:15:05Z","snapshot_observed_at":"2026-08-16T21:16:09.055483Z","submitted_at":"2025-05-23T08:15:05Z","title":"Adaptive Semantic Token Communication for Transformer-based Edge Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.17604","snapshot_observed_at":"2026-08-06T23:13:04.211264Z","title":"Adaptive semantic token communication for transformer-b ased edge inference,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.211264Z"},"links":{"cited_paper":"/paper/2505.17604","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:4befaf85bfff2d71698a065b9249289b34dbeac56bbdd6b78ee8387dc0937e95","observation_id":"fdcafda6-e8c4-4294-9767-b1c28b8db18d","resolution":{"observed_at":"2026-08-06T23:13:04.211264Z","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-06T23:13:07.560879Z","title":"Deep learning e nabled seman- tic communication systems,","venue":null,"work_id":"94ff8c6f-9bc7-4d07-8515-c678d6917aea","year":2021},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.332281Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:a2273d481ae3b5d8427695273b2e90000cb370f31a48b53ef52100d123339ab2","observation_id":"7250e792-5701-4ed1-b74c-6c37897bf1c7","resolution":{"observed_at":"2026-08-06T23:13:07.690562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:07.315144Z","title":"Synchronous multi- modal semantic communication system with packet-level cod ing,","venue":null,"work_id":"1b3f282b-f9c0-4cd7-93af-10b9bed351ef","year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.419546Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:57600fe6f4fd5ce0d604cfc82e11def7c380cfe22e0a18ecd79e7a3bfb1c9531","observation_id":"c9d456c1-3053-447a-b97d-deefd3574c90","resolution":{"observed_at":"2026-08-06T23:13:07.441172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:07.045985Z","title":"Lightweight semantic-aw are commu- nication with packet transmission,","venue":null,"work_id":"f37aefa1-080e-4af1-8da6-c0b0cd5fc339","year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.527892Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:5a9952239604bd8222edcb67e36f1c53196aeb860e8dbdfc17f174f2e3c4395c","observation_id":"f8914d2d-7f44-431c-b369-4be7293a8d95","resolution":{"observed_at":"2026-08-06T23:13:07.193828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19591","last_updated":"2025-04-28T08:53:39Z","snapshot_observed_at":"2026-08-16T12:42:27.593154Z","submitted_at":"2025-04-28T08:53:39Z","title":"Semantic Packet Aggregation for Token Communication via Genetic Beam Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19591","snapshot_observed_at":"2026-08-06T23:13:04.636587Z","title":"Semantic packet aggregation for token communication via genetic beam searc h,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.636587Z"},"links":{"cited_paper":"/paper/2504.19591","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:3f92f1f173cb0663817dae12390efed85604d10912440c6d13929198034de01b","observation_id":"1ca3d433-0793-4a6b-bff5-7cf949098cde","resolution":{"observed_at":"2026-08-06T23:13:04.636587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.07909","last_updated":"2016-06-10T14:45:08Z","snapshot_observed_at":"2026-08-17T07:28:37.146698Z","submitted_at":"2015-08-31T16:37:31Z","title":"Neural Machine Translation of Rare Words with Subword Units","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.07909","snapshot_observed_at":"2026-08-06T23:13:04.754043Z","title":"Neural machine tr anslation of rare words with subword units,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.754043Z"},"links":{"cited_paper":"/paper/1508.07909","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:553cde5ae20d83a9e47faa12b63d1633724e715fd1bea5f514c0400dc96e010e","observation_id":"884451b4-442f-47ff-8f76-4a0f522d8f46","resolution":{"observed_at":"2026-08-06T23:13:04.754043Z","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-06T23:13:06.882606Z","title":"BERT: Pre- training of deep bidirectional transformers for language u nderstanding,","venue":null,"work_id":"172de3c9-93c5-4084-bbd1-791e2d732be2","year":2019},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.894750Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:14796703f7d170419adcaf97aa6f28674edfe348c1992a5c4d457c0e53647962","observation_id":"d2f0493e-843c-44b3-b8b2-ed8f430a096d","resolution":{"observed_at":"2026-08-06T23:13:06.963963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:06.559698Z","title":"Learning transferable visual models from natural language supervision,","venue":null,"work_id":"ae61c760-120c-4264-880f-28983e274edf","year":2021},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:04.956681Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:0b767c443fc038c558342ff8decfa84881a3096adcbdcb1154fc5743020be088","observation_id":"64112c81-add9-4501-b029-2ea0551cfa50","resolution":{"observed_at":"2026-08-06T23:13:06.733357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:06.353500Z","title":null,"venue":null,"work_id":"22a93ccd-c547-4922-8842-fc89dcef38cf","year":2012},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:05.087086Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:c68550cc7a92c5f2b2cda09cf00b33eb11433ac78b7f3e9b8fb38fcabbaeacd4","observation_id":"bb539a63-70fe-4804-9da4-f3004672f3b8","resolution":{"observed_at":"2026-08-06T23:13:06.438618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:06.130354Z","title":"A review on genet ic algorithm: past, present, and future,","venue":null,"work_id":"710e6f48-964e-4aad-ae3b-b92a37ef1ecd","year":2021},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:05.181039Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:d9a92c3dd0e539c7b68a481ba68414cb463e2c38a28bdb612d2ae71f59c30226","observation_id":"a5698648-229b-4662-9b09-249811f8a8e3","resolution":{"observed_at":"2026-08-06T23:13:06.296109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:13:05.996832Z","title":"Microsoft COCO: Common objects in context,","venue":null,"work_id":"cb70d575-2ba9-4e72-b047-fb8af1978bdf","year":2014},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:05.292112Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:5cb74c4e3b320c75aac1422045daa152df75352d1ca27d5a07af6478dd08a1b8","observation_id":"cde4de61-0b7e-4f51-b848-bfa1c160d044","resolution":{"observed_at":"2026-08-06T23:13:06.063400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.09305","last_updated":"2018-10-18T05:29:41Z","snapshot_observed_at":"2026-08-14T18:12:51.564754Z","submitted_at":"2018-10-18T05:29:41Z","title":"WikiHow: A Large Scale Text Summarization Dataset","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.09305","snapshot_observed_at":"2026-08-06T23:13:05.363149Z","title":"Wikihow: A large scale text su mmarization dataset,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:05.363149Z"},"links":{"cited_paper":"/paper/1810.09305","citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:30eb6376f0ade3112bba3425f1aaa0fae75347f95adea2e8c58ef1b97f975d1a","observation_id":"86b93b41-b43d-42fc-ab19-0f9bb32d724e","resolution":{"observed_at":"2026-08-06T23:13:05.363149Z","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-06T23:13:05.892092Z","title":"High- resolution image synthesis with latent diffusion models,","venue":null,"work_id":"2b20debb-a9d1-43b4-a37e-5c12e47e0a96","year":2022},"citing_paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T23:13:05.459353Z"},"links":{"citing_paper":"/paper/2506.19451"},"observation_digest":"sha256:c8fe2feced0fb3a0a15b10d37e3a9be84535de149d6828791cb1b0d7faf7cfcd","observation_id":"8d4f2ede-743a-431e-8af7-8f6a594cb131","resolution":{"observed_at":"2026-08-06T23:13:05.928158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.19451","last_updated":"2025-06-24T09:25:44Z","latest_version":1,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-17T07:35:51.832811Z","submitted_at":"2025-06-24T09:25:44Z","title":"Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":24},"total_outbound_references":36},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 2 inbound Pith citation observations for arXiv:2506.19451."}