{"as_of":"2026-08-08T03:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0530edef9b83f1ae25f25d16ac2f324f493ae5846168fde94b8ab74d1b2fec5","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:44:11.583522Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T14:03:39.462299Z","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-11T17:06:04.396571Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"cited_work":{"arxiv_id":"2506.01571","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.01571","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Singh, N","venue":null,"work_id":"494b4774-94a9-4a9d-85c0-0005875b701d","year":2025},"citing_paper":{"arxiv_id":"2605.01620","last_updated":"2026-05-02T22:12:18Z","snapshot_observed_at":"2026-07-06T23:14:47.444386Z","submitted_at":"2026-05-02T22:12:18Z","title":"Structured Parameterization and Non-Stabilizerness in Hypergraph QAOA","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-09T14:03:39.462299Z"},"links":{"cited_paper":"/paper/2506.01571","citing_paper":"/paper/2605.01620"},"observation_digest":"sha256:25f5662a11dacb29cb3f778a80a8b8a653449617ca4b0bbe937ecbe3e8cc6891","observation_id":"b67301d8-1543-474c-b5c5-caca266dacf2","resolution":{"observed_at":"2026-05-11T17:06:04.397984Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2506.01571/citation-record","integrity":"/paper/2506.01571/integrity","json":"/paper/2506.01571/citation-record.json","paper":"/paper/2506.01571"},"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-07T11:44:12.281868Z","title":"Is table retrieval a solved problem? exploring join-aware multi-table retrieval, 2024","venue":null,"work_id":"1d6b2e22-136d-4d0d-8227-510088bbddd7","year":2024},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.177611Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:92e0e338e3910a45434e7d1fe27d42084c2640b078df7f5034d1776f88af21d9","observation_id":"3691d0ec-74d5-48d8-b08b-53d7df25e192","resolution":{"observed_at":"2026-08-07T11:44:12.294407Z","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-07T11:44:12.252525Z","title":"Cellular network traffic scheduling with deep reinforcement learning","venue":null,"work_id":"3606d835-1313-42a7-9a00-458364c89adf","year":2018},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.193653Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:bba0766df20a70ee764f030d4c659d530158656ffce6c8f6f513bd65c1484d55","observation_id":"f8fb7d8f-52dc-4788-a786-bd8735d88899","resolution":{"observed_at":"2026-08-07T11:44:12.266829Z","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-07T11:44:12.225754Z","title":"Paths, trees, and flowers.Canadian Journal of Mathe- matics, 17:449–467, 1965","venue":null,"work_id":"3542599b-017f-47ca-983a-6fcf0b11e6f6","year":1965},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.217801Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:9dc3c7b52ee9144ae1e0b082116fab13c4a1138cce7185a9e4b98a3a68c2ee8a","observation_id":"0e88efe3-9244-434f-abeb-dab5cd0eb022","resolution":{"observed_at":"2026-08-07T11:44:12.238640Z","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-07T11:44:12.196144Z","title":"Ai-based robust resource allocation in end-to-end network slicing under demand and csi uncer- tainties, 02 2022","venue":null,"work_id":"ca206c40-c3e8-4eaf-9d58-41fa8eee6be5","year":2022},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.243125Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:dcfa7bf2b3ac38d185710f29ecd5d0079c4e071d3bbb4153fd86cf7a67d6dfe2","observation_id":"465f1eef-55ad-419b-b9a5-e7a49550c251","resolution":{"observed_at":"2026-08-07T11:44:12.206713Z","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-07T11:44:12.164020Z","title":"Dynamic resource allocation for virtual machine migration optimization using machine learning, 2024","venue":null,"work_id":"bff5d193-1416-47fb-8a2d-8d20904e709b","year":2024},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.263372Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:2b3fc9d6cb09b8b8f6743151766839a4dbaa3d87b1adde1bc1580535f4054527","observation_id":"8c6db28d-678d-4359-bc0a-c0c84495e5c7","resolution":{"observed_at":"2026-08-07T11:44:12.181036Z","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-07T11:44:12.131555Z","title":"Advanced network design for 6g: Leveraging graph theory and slicing for edge stability.Simulation Modelling Practice and Theory, 138:103029, 2025","venue":null,"work_id":"b03c3772-7008-4a5a-ab4c-3c9224b67be5","year":2025},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.285489Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:97a224579e37b4ff03d84d8ca0711e1b56a3b7f290eb213b05b06abeb18dc193","observation_id":"ac1dc90c-5ad2-4f30-8e76-d5b22f2fe01a","resolution":{"observed_at":"2026-08-07T11:44:12.142958Z","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-07T11:44:12.104066Z","title":"Skill ranking of researchers via hypergraph.PeerJ Prepr., 7:e27480, 2019","venue":null,"work_id":"0c36e9fd-a8bb-408d-8199-dcdab96c618e","year":2019},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.302274Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:970a529e2606781b5fbf6f42afe2f8bd0268f739be5ede79b1b9fa8710a6f948","observation_id":"aacdd2af-d9cb-465c-b788-53d956671c3a","resolution":{"observed_at":"2026-08-07T11:44:12.115003Z","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-07T11:44:12.069187Z","title":"Ioannidis, Huzefa Rangwala, and Christos Faloutsos","venue":null,"work_id":"80ed3559-f271-461c-8d5b-c4c70b649c30","year":2024},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.322250Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:955af68170890af29145ac3b75bb7dfcca2404c2fe02563779b9f037a9cce919","observation_id":"133abccc-1f75-4a63-bec9-77a66eb5486b","resolution":{"observed_at":"2026-08-07T11:44:12.084344Z","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-07T11:44:12.039791Z","title":"Random assignment method based on genetic algorithms and its application in resource allocation.Expert Systems with Applications, 39(15):12213–12219, 2012","venue":null,"work_id":"005c8c9a-8f85-488d-9801-24c753cac7de","year":2012},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.348106Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:f388199e27be782c08e05b017856b4f2ff7ffb0f8087a7375f0d9c0c04213bf0","observation_id":"9436d0e2-0697-4dca-8124-60f221c17a22","resolution":{"observed_at":"2026-08-07T11:44:12.052516Z","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-07T11:44:12.008382Z","title":"An end-to-end network slicing framework for 5g wireless communi- cation systems, 2016","venue":null,"work_id":"3160a29c-5bf9-4bf0-aff8-9faf75bc1ca6","year":2016},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.368727Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:a18ad850349fa5e6d59900941053b06514103bdb228a8ec5ccc243d26bfd65e2","observation_id":"658365ff-af80-42bc-8918-2c621e2e1f78","resolution":{"observed_at":"2026-08-07T11:44:12.022754Z","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-07T11:44:11.969740Z","title":"Deep-learning- based wireless resource allocation with application to vehicular net- works.Proceedings of the IEEE, 108(2):341–356, 2020","venue":null,"work_id":"f289e82b-3bae-4684-8fcf-045b0d2b878f","year":2020},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.392442Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:bbe248819efb0efda774adceefaaf188adb6ff4f08366754b302f6cfe697425d","observation_id":"80688acc-d999-4ed8-a714-a35596e65341","resolution":{"observed_at":"2026-08-07T11:44:11.987557Z","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-07T11:44:11.933098Z","title":"Resource allocation optimization based on mixed integer linear programming in the multi-cloudlet environment.IEEE Access, 6:24533–24542, 2018","venue":null,"work_id":"98f26aff-4ac1-4406-b562-4bca23c4cce0","year":2018},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.422245Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:aa95bdc3586c180480eed4ec5d53e188838a0fa8fcf0e2c420046e0f5b055a1a","observation_id":"15669369-292b-49dc-9bb3-d12d1d42310d","resolution":{"observed_at":"2026-08-07T11:44:11.952290Z","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-07T11:44:11.899418Z","title":"Deep reinforcement learn- ing for end-to-end network slicing: Challenges and solutions.IEEE Network, 37(2):222–228, 2023","venue":null,"work_id":"33562f94-6288-4ef0-b6fc-dcd31feda4a5","year":2023},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.442519Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:6ad4d8b9ea2b766cfb0a4d99141ca381b8318ebd644b4af05e3325c408fd6b24","observation_id":"4bd5f086-2d7d-4dc1-afc1-e417313a8511","resolution":{"observed_at":"2026-08-07T11:44:11.914423Z","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-07T11:44:11.864897Z","title":null,"venue":null,"work_id":"5b4f30ea-7d0d-469e-911e-f1ce5e258800","year":2025},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.467556Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:4dfc6d8f058261c6998d84e7a0562da655c4ebd8c026cf860b004b75972ca6ec","observation_id":"727242af-e26b-4e21-a0e7-63153b8e30da","resolution":{"observed_at":"2026-08-07T11:44:11.882589Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T11:44:11.821741Z","title":"Measurement-based resource allocation and control in data centers: A survey, 2024","venue":null,"work_id":"73cddc35-ccc8-4db9-b1d3-310faabae710","year":2024},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.486474Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:8d3276a83c8a549aa0341f9f06d18abef2b8f3ba6d2551f7750a3b5a7cfa85cd","observation_id":"b8144992-ba3e-4433-b031-c38c7c872640","resolution":{"observed_at":"2026-08-07T11:44:11.837465Z","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-07T11:44:11.768395Z","title":"Resource allocation for network slicing in open ran: A hierarchical learning approach.IEEE Transactions on Cognitive Communications and Networking, PP:1–1, 01 2025","venue":null,"work_id":"67b2fd4f-a452-47b6-8dd9-5f03ca29f8e3","year":2025},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.506464Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:4473a45cdd037f195865986dfee2f4fe7e41c2ae45c2a462d2d3f26c4c70ddc8","observation_id":"87ebf150-ddaf-406a-94cf-b59db7a1e25b","resolution":{"observed_at":"2026-08-07T11:44:11.791556Z","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-07T11:44:11.728609Z","title":"Zhao, Gennady Shaikhet, and Amirhossein Asgharnia","venue":null,"work_id":"b9141031-3a36-4678-aadb-4f040421aea7","year":2023},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.526481Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:9daa878a598cefdd6adb97d20cb6b7b093f0e44a4e803739754b4ae61a48a59f","observation_id":"b8ba7860-9ce1-447b-8150-5de851e90bc9","resolution":{"observed_at":"2026-08-07T11:44:11.745152Z","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-07T11:44:11.693413Z","title":"Rat-sql: Relation-aware schema encoding and linking for text-to-sql parsers, 2021","venue":null,"work_id":"acf9b3af-7f56-4f4f-b6f5-9f5b6063b36d","year":2021},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.550640Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:88af04553d776826f3a0108221930a0343126c5ba8bba3095b9b3a0cb0d00b59","observation_id":"4fe0f6e0-df3f-4693-99ef-8ea1ac4175f8","resolution":{"observed_at":"2026-08-07T11:44:11.711233Z","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-07T11:44:11.655649Z","title":"Spider: A large-scale human-labeled dataset for complex and cross-domain semantic parsing and text-to- SQL task","venue":null,"work_id":"109266e8-a2d5-45ab-87fe-c6e0f446e2aa","year":2018},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.567306Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:7981f5064dc424cedbeef8fa1def28332ed86f1de8a9eb813ba45ee6a0f34235","observation_id":"aedd6009-a37b-4e2f-9c61-e9c8e96b357b","resolution":{"observed_at":"2026-08-07T11:44:11.667732Z","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-07T11:44:11.614281Z","title":"Node␣Scores:\\n","venue":null,"work_id":"e09ae387-bd1f-4542-9d86-5d9e608309a8","year":2024},"citing_paper":{"arxiv_id":"2506.01571","last_updated":"2025-06-02T11:55:41Z","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:11.583522Z"},"links":{"citing_paper":"/paper/2506.01571"},"observation_digest":"sha256:0b5a5e0f5558fd0cba3f2649455c05323cb38ca9edec3d8faf1f1d5b6efd145a","observation_id":"69c61153-8aec-4d4d-b683-a1a332598e90","resolution":{"observed_at":"2026-08-07T11:44:11.629020Z","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.01571","last_updated":"2025-06-02T11:55:41Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T11:35:55.896839Z","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":20},"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 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2506.01571."}