{"as_of":"2026-08-22T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc24928231ac14f5b24a0e1d708a647aead39d55010f8ab49e1ba933a3826e1a","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:21:42.243601Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.20939/citation-record","integrity":"/paper/2504.20939/integrity","json":"/paper/2504.20939/citation-record.json","paper":"/paper/2504.20939"},"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-16T05:21:42.553585Z","title":null,"venue":null,"work_id":"c296507c-530e-452b-8e6a-b9afa52681af","year":2022},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.134443Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:5d02ba81b4727b73a4fd5594b5800d1876f9273d7b77478440b54c49851fad5d","observation_id":"48c971d2-1023-400d-9592-6ecdfd3ccd41","resolution":{"observed_at":"2026-08-16T05:21:42.557562Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.537669Z","title":"Chaccour, W","venue":null,"work_id":"6f961948-92c3-417a-a4f6-f70370975312","year":2025},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.142152Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:9ba6c5fd2ce89d8cfd0ddc65e1f1c2b9fc234c93f4526d41e94d508114ad4386","observation_id":"d7eda1d0-3560-44ee-8ca5-f4ef6602cb8e","resolution":{"observed_at":"2026-08-16T05:21:42.545403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.16986","last_updated":"2025-04-09T09:41:40Z","snapshot_observed_at":"2026-08-16T14:06:34.934370Z","submitted_at":"2024-03-25T17:48:06Z","title":"Dynamic Relative Representations for Goal-Oriented Semantic Communications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.16986","snapshot_observed_at":"2026-08-16T05:21:42.147515Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.147515Z"},"links":{"cited_paper":"/paper/2403.16986","citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:1d7b51df1eccd736b04d34fd196d255c02e0d145521a7f4219ae7e43ad5ef5b2","observation_id":"6e7eafd8-31d3-41a8-9cdc-e44445ca6e3c","resolution":{"observed_at":"2026-08-16T05:21:42.147515Z","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-16T05:21:42.523131Z","title":null,"venue":null,"work_id":"e636cb27-b42b-4349-991f-7b4fd5ded788","year":2022},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.152664Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:7bf374e4e0ce6cc488cb86af5f1a4e9b869e42a82f068a7e67f8d2e027ce9001","observation_id":"2752cf62-07c2-4700-b9bd-df025c18cdd1","resolution":{"observed_at":"2026-08-16T05:21:42.528012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.507784Z","title":null,"venue":null,"work_id":"1ee719f6-ef8e-4e08-9915-2b35f9f6d347","year":2022},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.157176Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:82efda16670231e330da57288b88e9ad63e2d86eb1312fd55b8a5ee4ba23a327","observation_id":"ad76c649-96a6-473b-a3a3-0583f25d3ba0","resolution":{"observed_at":"2026-08-16T05:21:42.512244Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.496077Z","title":null,"venue":null,"work_id":"509de96c-49af-4fa5-a9ce-b5a7039f639c","year":2024},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.162430Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:002e39da3d615385fb0b0e30aaa6265f6f4fac36e52c60d915029f0388c69b3b","observation_id":"9e871d7e-3008-4a9c-ab4a-298a7c32a5c6","resolution":{"observed_at":"2026-08-16T05:21:42.499895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.482032Z","title":null,"venue":null,"work_id":"cd3f9125-fced-4997-97f4-52fc8adfcca0","year":null},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.169322Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:03c36350f8e1a6b167f371f0999b2103f2ec337b2a5930b09848a57de3ef3c32","observation_id":"ec7814a1-1a0b-4e38-a5ed-abaf3946810b","resolution":{"observed_at":"2026-08-16T05:21:42.486346Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01635","last_updated":"2025-01-03T04:59:33Z","snapshot_observed_at":"2026-08-14T19:32:58.411289Z","submitted_at":"2025-01-03T04:59:33Z","title":"Knowledge Sharing-enabled Semantic Rate Maximization for Multi-cell Task-oriented Hybrid Semantic-Bit Communication Networks","version":1},"cited_work":{"arxiv_id":"2501.01635","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.01635","snapshot_observed_at":"2026-08-16T05:21:42.364935Z","title":"Knowledge Sharing-enabled Semantic Rate Maximization for Multi-cell Task-oriented Hybrid Semantic-Bit Communication Networks","venue":"eess.SP","work_id":"021839b0-ddd6-41f5-93be-19acca84fe33","year":2025},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.174460Z"},"links":{"cited_paper":"/paper/2501.01635","citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:cd811f7b4c03eb3cf13b1025cf37c8d022a63532abb9f9a7667e246325cf5836","observation_id":"b32a5363-13db-4e2a-bcb3-4fcc63caedaf","resolution":{"observed_at":"2026-08-16T05:21:42.368697Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.470144Z","title":null,"venue":null,"work_id":"a3f75083-8db6-4ae7-a010-1c91d81b2c56","year":2022},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.181061Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:5cb0daa42b94b61054eadb68d7a93e10b08c676955da18e04a085965c69f3fb7","observation_id":"9f594b65-aa8a-4110-bdc7-3af0da8d4013","resolution":{"observed_at":"2026-08-16T05:21:42.473870Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04672","last_updated":"2025-05-26T12:55:04Z","snapshot_observed_at":"2026-08-16T13:02:07.583420Z","submitted_at":"2024-11-07T12:55:35Z","title":"Semantic-Aware Resource Management for C-V2X Platooning via Multi-Agent Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2411.04672","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04672","snapshot_observed_at":"2026-08-16T05:21:42.349474Z","title":"Semantic-Aware Resource Management for C-V2X Platooning via Multi-Agent Reinforcement Learning","venue":"cs.LG","work_id":"528b2ccb-2a3d-4f4e-a9aa-feea046d4096","year":2024},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.185882Z"},"links":{"cited_paper":"/paper/2411.04672","citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:6ccba0738c9b628b9abe4dde802e953106e361b00ed151dbdaa3ac4f3a695acb","observation_id":"bffca27b-4a29-457a-8f16-8937af0d9dff","resolution":{"observed_at":"2026-08-16T05:21:42.353552Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06543","last_updated":"2024-04-08T14:40:07Z","snapshot_observed_at":"2026-08-16T15:33:59.136527Z","submitted_at":"2023-05-11T03:18:06Z","title":"QoE-based Semantic-Aware Resource Allocation for Multi-Task Networks","version":2},"cited_work":{"arxiv_id":"2305.06543","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.06543","snapshot_observed_at":"2026-08-16T05:21:42.325482Z","title":"QoE-based Semantic-Aware Resource Allocation for Multi-Task Networks","venue":"cs.IT","work_id":"eb3ab9f7-6447-4667-b1a5-0573f40c6adb","year":2023},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.191868Z"},"links":{"cited_paper":"/paper/2305.06543","citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:04d811695d68ffba6fb5f508cab7f9f12a01849f93c3deae9444c23e288ac47d","observation_id":"9cd28706-6abd-46df-923c-7f585c42772c","resolution":{"observed_at":"2026-08-16T05:21:42.334010Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.456919Z","title":null,"venue":null,"work_id":"4fd585f0-ffbc-48f1-a166-830f11ef4da6","year":2023},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.205887Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:423c2796992cfdde4c41eb26bb6a2cb969a5c918218a6b3cc6aabca2a4bcd6f6","observation_id":"1762ad84-c18d-40c8-b875-3148c1fe2450","resolution":{"observed_at":"2026-08-16T05:21:42.461400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.08910","last_updated":"2022-04-19T14:15:09Z","snapshot_observed_at":"2026-08-16T17:06:03.913479Z","submitted_at":"2022-04-19T14:15:09Z","title":"Adaptable Semantic Compression and Resource Allocation for Task-Oriented Communications","version":1},"cited_work":{"arxiv_id":"2204.08910","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.08910","snapshot_observed_at":"2026-08-16T05:21:42.301566Z","title":"Adaptable Semantic Compression and Resource Allocation for Task-Oriented Communications","venue":"eess.SP","work_id":"f7c01cc4-dc9a-4873-a555-35594dee75e9","year":2022},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.214298Z"},"links":{"cited_paper":"/paper/2204.08910","citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:c85cbf9d56abcdba3e85fd3e7f4ee390fb3d47e1224d30faa0595a0e334e4d25","observation_id":"5f22f933-58c7-4f87-9d34-92950b29015b","resolution":{"observed_at":"2026-08-16T05:21:42.307307Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.443353Z","title":"Zhang, H","venue":null,"work_id":"996710b7-5dea-4e46-af37-e5a5a50b5826","year":2023},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.221661Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:4a4b627b4d2060ae6df1319babf926a0e5b0f02531e9d82fff1225f9e466101c","observation_id":"0e1f180a-9797-4549-b71d-b8215ace1826","resolution":{"observed_at":"2026-08-16T05:21:42.448137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10795","last_updated":"2022-01-26T08:03:40Z","snapshot_observed_at":"2026-08-18T21:25:43.252112Z","submitted_at":"2022-01-26T08:03:40Z","title":"Bandwidth and Power Allocation for Task-Oriented SemanticCommunication","version":1},"cited_work":{"arxiv_id":"2201.10795","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.10795","snapshot_observed_at":"2026-08-16T05:21:42.280527Z","title":"Bandwidth and Power Allocation for Task-Oriented SemanticCommunication","venue":"eess.SP","work_id":"324e93cf-f597-4f3a-acfb-41df497c94f4","year":2022},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.227795Z"},"links":{"cited_paper":"/paper/2201.10795","citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:abf93f46b7995f29bfa14ebac6887ad6d48618c29a6f05f38e0c04fd1c720d1b","observation_id":"13ebf4a3-6caf-4c0d-a117-107896277267","resolution":{"observed_at":"2026-08-16T05:21:42.287630Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.432388Z","title":null,"venue":null,"work_id":"99af2433-a41c-4444-ab79-89f488068350","year":2023},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.231912Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:8cce982c9485ae7a6798106ed550b88a772901f330e1d1a90edae771eaba3b5a","observation_id":"fde80dd4-b47a-4ee3-b9f0-bca1e925a2bc","resolution":{"observed_at":"2026-08-16T05:21:42.435984Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.419948Z","title":"Zhang, Q","venue":null,"work_id":"3878ebd3-2be6-47fd-8a09-29dc75906aa1","year":2024},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.235483Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:6143e59bb0366a4d084e24a0367ae7d6db33a69841cf18b156df9f2c9769755f","observation_id":"c5abf860-c67e-4710-91a6-5dd5e0943380","resolution":{"observed_at":"2026-08-16T05:21:42.424396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.402734Z","title":"Nesterov and A","venue":null,"work_id":"5691d80c-8b59-4f5f-8780-bfc28d2591a4","year":1994},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.240275Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:13de859a4633613a20f0a4daed04ac8dfb0ad5a7e705617d2eb2529464f3b291","observation_id":"bc1f2c0a-f03c-4435-ac13-573301bc8d56","resolution":{"observed_at":"2026-08-16T05:21:42.406788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:21:42.389456Z","title":"Geometric programming for communication systems","venue":null,"work_id":"9fb3a6f4-4a91-45fa-b997-b4ae6c051583","year":2005},"citing_paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:21:42.243601Z"},"links":{"citing_paper":"/paper/2504.20939"},"observation_digest":"sha256:09976796e2876ffbc6dee713cea7a443a0cc4c30e7fa3960b41987339e36bfa9","observation_id":"1620bd79-33a4-44df-8d15-5528aa8e3e7e","resolution":{"observed_at":"2026-08-16T05:21:42.393441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.20939","last_updated":"2025-04-29T17:04:48Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-16T05:13:08.310704Z","submitted_at":"2025-04-29T17:04:48Z","title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":5,"verified_fuzzy":5},"total_outbound_references":19},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2504.20939."}