{"as_of":"2026-08-11T12:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98ac250bb62db2bb63a320b7b971f0bd97c5c5d36222c2f889aaa108764b5ca1","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:35:18.049116Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-08-07T04:35:17.981391Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"cited_work":{"arxiv_id":"2506.10362","doi":"10.48550/arxiv.2506.10362","metadata_source":"pith","pith_arxiv_id":"2506.10362","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","venue":"eess.SP","work_id":"b1d8b010-bc99-464e-b2e3-129fbb23f3b5","year":2025},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.981391Z"},"links":{"cited_paper":"/paper/2506.10362","citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:e92fffa1dc179f23fde9ff14933b8e0da5ee9951f081824c5f81ff1a91e8a247","observation_id":"2dc4ca7e-e48c-4aaa-977e-9bea4c480f05","resolution":{"observed_at":"2026-08-07T04:35:18.199435Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.10362/citation-record","integrity":"/paper/2506.10362/integrity","json":"/paper/2506.10362/citation-record.json","paper":"/paper/2506.10362"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:17.890321Z","title":"Signal processing for the 5G revolution,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.890321Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:14e4bb15d119e3bedf44e767376b9a2f06c8b5fc6448d4a5863d779b84a6fbb5","observation_id":"2b7c5660-7181-42ce-bfec-14b7ac9fc82e","resolution":{"observed_at":"2026-08-07T04:35:17.890321Z","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":"2017.26923","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:19.428888Z","title":"5G: A tutorial overview of standards, tri- als, challenges, deployment, and practice,","venue":null,"work_id":"11233c2d-3d18-4a8a-9b5b-949d56c8274e","year":2017},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.894874Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:849cf6010575c2e2c88d58b6b8ff1fd8c82c2b29ebdfbf0f18b415c4911b7a57","observation_id":"4d31fbed-a7c6-416d-89ba-a2be9747d703","resolution":{"observed_at":"2026-08-07T04:35:19.435102Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.24616","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:19.342701Z","title":"A survey of 5G network: Architecture and emerging technologies,","venue":null,"work_id":"d4a8bf10-0ccf-4e86-8dc8-7710c9f33245","year":2015},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.898678Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:aeb2b295cf0ea1590070905978110156b25e5129ddf5fbcb1898b3c447d7ceff","observation_id":"aa0379e3-17f5-42c4-9bda-5838ba9a1957","resolution":{"observed_at":"2026-08-07T04:35:19.349600Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/mcom.001.2000230","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"5G deployment: Standalone vs. non- standalone from the operator perspective,","venue":"IEEE Communications Magazine","work_id":"16be4958-2016-4a6f-b679-6e66a215d53b","year":2020},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.903259Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:fca108accafb3970b56bd657c0c0e60d6fadf3910bd4a992b6081400251bf2f3","observation_id":"c6fd197b-56f0-46b7-8dd8-842b38dc848a","resolution":{"observed_at":"2026-08-07T04:35:18.312319Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.72247","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:19.270788Z","title":"The quality of experience perspective toward 5g technology,","venue":null,"work_id":"953921e7-73a1-4fdd-9f2d-1269e75bb1a5","year":2015},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.907128Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:1a1b337987ac0e46754394561d15f10003edf82a49993c0c5b914499729fbc67","observation_id":"bba1f641-8d5c-490e-8ba2-d0874b6986d0","resolution":{"observed_at":"2026-08-07T04:35:19.277410Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/mcom.001.2200179","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"SRCON: A data-driven network perfor- mance simulator for real-world wireless networks,","venue":"IEEE Communications Magazine","work_id":"0856bada-b945-425e-9ed2-50746fe78fd6","year":2023},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.910987Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:6d9d265f18fab5a456a4ffb6ce5f3028b36260bebc6e714f337d0873eb906067","observation_id":"ead30bdd-e098-4a0f-8548-f950d7a24fb6","resolution":{"observed_at":"2026-08-07T04:35:18.300342Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.34437","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:19.197430Z","title":"A survey of recent advances in optimization methods for wireless communications,","venue":null,"work_id":"b38c2a43-e00d-40dd-99df-9c24854d8a9e","year":2024},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.915481Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:9c9cae8d1c26de6a5598305c17dff27cc1656b7d082a342473127c66401a25b9","observation_id":"7242434e-5e35-4746-807d-110f8f99d08d","resolution":{"observed_at":"2026-08-07T04:35:19.203682Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.28853","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:19.115381Z","title":"PCI planning based on binary quadratic programming in LTE/LTE-A net- works,","venue":null,"work_id":"dcf58180-f522-4e46-92b8-83bcfbb17577","year":2019},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.918859Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:3551de5500073675643789aad8591f760f97b17a229ef84504c9ca3ebd527706","observation_id":"5cf8eef9-cfd9-454d-bd33-68aff23db263","resolution":{"observed_at":"2026-08-07T04:35:19.122911Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s40012-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.283623Z","title":"A programmable distributed optimization framework for 5G,","venue":null,"work_id":"78f2f52a-f032-4f97-b28a-89db61ba8ddc","year":2020},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.922082Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:7b822db5b5f4339d92547846e6dd9e24899df73f9d88645129182d5035b8225e","observation_id":"6f4a6596-ac0b-4fd2-af18-059dbc0b9371","resolution":{"observed_at":"2026-08-07T04:35:18.287982Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2014.03051","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:19.038609Z","title":"Interference self-coordination: A proposal to enhance reliability of system-level information in OFDM-based mobile networks via PCI planning,","venue":null,"work_id":"19f2f35c-2e60-46fb-8945-42b2b3a57f9f","year":2014},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.925491Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:d8d2fc9e32c7e0af0acd7ab61d39e4bbc8bb3b3c1d5112ce10f57c3dcf0b934f","observation_id":"14bcd1c7-9f49-439d-9ce2-132548925ad3","resolution":{"observed_at":"2026-08-07T04:35:19.044959Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2379.15824","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.963835Z","title":"Graph coloring based physical-cell-ID assignment for LTE networks,","venue":null,"work_id":"433ba76c-2bdd-4d6e-93c1-fb1f41c14ae3","year":2009},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.929358Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:e1ea0119ac7446b1e712dd4d3ea03380c0f333c7962151ea3bf1880cdfc7b57d","observation_id":"45d7ac3f-b704-4be2-87f7-b8399f7ea17f","resolution":{"observed_at":"2026-08-07T04:35:18.969977Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11277-016-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.271056Z","title":"Randomized graph coloring algorithm for physical cell id assignment in lte-a femtocellular networks,","venue":null,"work_id":"04dbae0b-14e5-4777-86c9-8e40ffd92015","year":2016},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.933178Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:847770d3923a7c0c46fac5be261d11bbcb72e14704168600a010a79f37a62d66","observation_id":"bf1213c2-576f-4330-94aa-ae85782e20cb","resolution":{"observed_at":"2026-08-07T04:35:18.275308Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0801.20160","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.895323Z","title":"PCI planning method based on genetic algorithm in LTE network,","venue":null,"work_id":"67e62098-53b1-4db0-815f-4db7979af073","year":2016},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.937048Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:3b17b3ce69bcbcf818e5aa00dde883065fc7954a60cb2d99de49b59f5e0b4b06","observation_id":"fd63c0e4-f37f-4043-82f5-deb702f4ef0f","resolution":{"observed_at":"2026-08-07T04:35:18.901499Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-981-10-7521-6_42","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"A novel PCI optimization method in LTE system based on intelligent genetic algorithm,","venue":"Lecture notes in electrical engineering","work_id":"d430f3f4-9f80-4fc8-98ac-b2599ac15bb5","year":2017},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.940504Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:7c3283fc4377c9095833923350c389db09ecbf4130613e2ed5ad8067b57defa1","observation_id":"52169645-94ed-4d2d-9549-32693d8edc51","resolution":{"observed_at":"2026-08-07T04:35:18.262942Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.31859","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.823524Z","title":"The physical cell identity assignment problem: A practical optimization approach,","venue":null,"work_id":"a2dd8dea-9476-4773-9da4-a3c787ddba98","year":2024},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.944283Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:7bb4905fc1043110cd1c231afb215569fb416694c2c5c434375b8223811d6a3d","observation_id":"71def3de-f70e-40e6-a4f1-25b99c497f5b","resolution":{"observed_at":"2026-08-07T04:35:18.830088Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10589-017-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.245044Z","title":"A two-level graph partitioning problem arising in mobile wireless communications,","venue":null,"work_id":"257a85f3-bd20-4a02-9555-b896e235e5ce","year":2018},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.948067Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:e4f174e46e2334054598b1c8a5a75fbd452ef9dd827a3406d28f39ae2a6e3f3e","observation_id":"8c7c95f5-80a4-4a55-805c-36f05c6e7b2e","resolution":{"observed_at":"2026-08-07T04:35:18.249630Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:35:19.603543Z","title":"5G PCI and PRACH planning,","venue":null,"work_id":"4e02686e-9252-413f-a36a-ee23ba65de47","year":null},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.951686Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:db6e9e2c7c40cd3a4f8015e599f7c63196277707c37b105e01cc9513b9ed3a81","observation_id":"d03bcb1a-145c-42aa-a3a4-5677770017e4","resolution":{"observed_at":"2026-08-07T04:35:19.607346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:35:19.590314Z","title":"PCI optimization method and apparatus,","venue":null,"work_id":"8c345871-0c5c-4909-8c15-d3762dac5041","year":2014},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.955594Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:09e152ee7a2d513f494179753e71e11b8c7816bee4b21a0de12bdbe836e19758","observation_id":"585bd493-ae0b-4b3f-af06-5bebf120f1d6","resolution":{"observed_at":"2026-08-07T04:35:19.594254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:35:19.577718Z","title":"Relation matrix establishment system and method and PCI intelligent optimization system and method,","venue":null,"work_id":"4de5b8d5-f68d-46ef-99b8-23d79ce8e71d","year":2014},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.959063Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:107ef88def5fb26fee84b7a1ef780b483819fdf7f85604f5d0db054aba4e795a","observation_id":"dfdd3114-4271-438b-9a5f-cef36dff846e","resolution":{"observed_at":"2026-08-07T04:35:19.581618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/3254","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"WORLD SCIENTIFIC eBooks","work_id":"dd116d5f-9b53-4fe1-8655-251e1d8e7946","year":1996},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.962863Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:7e6ca278279fa39b2f3d5e12dd90744890432cf1f6d466fa0f5a1c1b636c241f","observation_id":"612d1d95-ee10-4f15-8dbd-56992c8b69ba","resolution":{"observed_at":"2026-08-07T04:35:18.236852Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02115753","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, re- laxations and bounds,","venue":"Annals of Operations Research","work_id":"990a986b-01f9-4757-87e2-331e4d86cba7","year":1991},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.966823Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:a8cb6b4774f919dc49fe6518604dcd90130431821692920fdef9a05b5edf5fff","observation_id":"018fb8b7-837d-438a-996f-d8caeb3775bf","resolution":{"observed_at":"2026-08-07T04:35:18.224420Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:35:19.565384Z","title":"On the hardness of approximating max k-cut and its dual,","venue":null,"work_id":"7ed9cabe-4bc8-477c-95b7-f633af620416","year":1996},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.970392Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:1129121d36cf9d6b9f1e3b0c21ac89b247927c232b365a3c97760e24df12c0f7","observation_id":"f04b0a63-cafe-448d-9ff6-e76536a185c9","resolution":{"observed_at":"2026-08-07T04:35:19.569414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10479-016-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.207941Z","title":"A multiple search operator heuris- tic for the max-k-cut problem,","venue":null,"work_id":"1f7e26dc-d236-4f2b-afb3-f6f715b829a7","year":2017},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.973891Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:1047933435de7fa7f9bbc3b6b5f10e2c65afa14a9fa908efcff58312ad083b46","observation_id":"2cd714a8-6582-421b-9b3d-0f6b40a196fd","resolution":{"observed_at":"2026-08-07T04:35:18.211869Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:35:19.552496Z","title":"Welsh powell algorithm to color graphs,","venue":null,"work_id":"c63afdc3-3e2c-4a48-b02f-01610429dd41","year":null},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.977547Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:d0d7acc00645e6baae724fcbaa999df6f33f470c8f56e62b6257f8ad2fe20075","observation_id":"9c4a5158-bb70-4bda-8cf1-49c0b73ac0eb","resolution":{"observed_at":"2026-08-07T04:35:19.556830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"cited_work":{"arxiv_id":"2506.10362","doi":"10.48550/arxiv.2506.10362","metadata_source":"pith","pith_arxiv_id":"2506.10362","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","venue":"eess.SP","work_id":"b1d8b010-bc99-464e-b2e3-129fbb23f3b5","year":2025},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.981391Z"},"links":{"cited_paper":"/paper/2506.10362","citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:e92fffa1dc179f23fde9ff14933b8e0da5ee9951f081824c5f81ff1a91e8a247","observation_id":"2dc4ca7e-e48c-4aaa-977e-9bea4c480f05","resolution":{"observed_at":"2026-08-07T04:35:18.199435Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01585184","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Laplacian eigenvalues and the maximum cut problem,","venue":"Mathematical Programming","work_id":"3d2158e4-3949-4bf3-a260-2e78ce1b1d2e","year":1993},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.985494Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:7f483d3dc8c3c7ed58d6145974f90c614a58fe785a7c71fe842b1e059dee0955","observation_id":"32858d47-4228-4055-8f31-4e6a5ba86d64","resolution":{"observed_at":"2026-08-07T04:35:18.182016Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1979.10559","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.755408Z","title":"On the shannon capacity of a graph,","venue":null,"work_id":"56dda718-7cc3-49dc-94ba-611d6b73f199","year":1979},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.988925Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:08ab97ffcdbe6f244038a2c171e66e2e242d0df6fd73bbf79bac10ed89bf4fe6","observation_id":"d37ef44c-56e2-4484-8e17-be301b92cfce","resolution":{"observed_at":"2026-08-07T04:35:18.762269Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:17.992673Z","title":"Cones of matrices and set- functions and 0–1 optimization,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.992673Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:c891fe87849fb545f98f5eecfc82f48d570b6274b34311d8f71fde72537abfa9","observation_id":"7fe308bc-7106-453d-a792-dd0bcc9f33a1","resolution":{"observed_at":"2026-08-07T04:35:17.992673Z","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.1137/0805024","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Nonpolyhedral relaxations of graph-bisection problems,","venue":"SIAM Journal on Optimization","work_id":"aebb63eb-9be1-4647-ab02-88ba9341f1e2","year":1995},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.996414Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:5cb902b0a7e6c3449e1c3f2eb648f6c32ec4024ad8f7010a778d623b52ca008e","observation_id":"6f339364-881f-4e88-a82c-863b595f4176","resolution":{"observed_at":"2026-08-07T04:35:18.161622Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:35:19.539989Z","title":"Quadratic optimization problems,","venue":null,"work_id":"9fe58cda-8011-4192-ac73-e1ff1616dda9","year":1987},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:17.999752Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:ff2367b712bdccb6e95aa06d8af564ea5dbae56a849a66d9963cb8043bd5ea5d","observation_id":"43f6df05-1382-4277-9c28-8b706f0536cd","resolution":{"observed_at":"2026-08-07T04:35:19.543803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s1052623400382467","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Rank-two re- laxation heuristics for max-cut and other binary quadratic programs,","venue":"SIAM Journal on Optimization","work_id":"4394821b-0dd0-47af-83da-309a9c178ca7","year":2002},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.003560Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:46fe5fe4021977a1307f8bfcf89595959845813a041141eee6de2a5a477d0700","observation_id":"c75c208e-0526-400c-93f9-931f013350ca","resolution":{"observed_at":"2026-08-07T04:35:18.149101Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.007383Z","title":"Clus- tering by orthogonal nmf model and non-convex penalty optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.007383Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:5a945e007383739ddb03e39fc2f3665ac10bc5b7571c36d946edb0c33e41cf16","observation_id":"2931ef70-8a0d-40a1-94ee-2e7578a87859","resolution":{"observed_at":"2026-08-07T04:35:18.007383Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.011087Z","title":"Nocedal and S","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.011087Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:9f5e93ded84d936da91e88b4194566d28246313623aeec373f562addcd7eddff","observation_id":"e5910c35-d5e3-4b75-9289-a7fa02e74614","resolution":{"observed_at":"2026-08-07T04:35:18.011087Z","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":"2014.22988","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.609033Z","title":"Sparse signal estimation by maximally sparse convex optimization,","venue":null,"work_id":"70ecab21-a5ae-431d-b973-5352e6d2b1d2","year":2014},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.014897Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:6d3c62917d40b730bf3d9c299b19f6e48fa7156d22c886b9cc9c11a52b34c666","observation_id":"1ab63384-5b8d-454a-baed-215aa8b8f807","resolution":{"observed_at":"2026-08-07T04:35:18.615202Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.018939Z","title":"Penalty dual decomposition method for nonsmooth nonconvex optimization—part I: Algorithms and convergence analysis,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.018939Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:7b59ade366736bf0103e8dd53f8a05cfffc4209c887cae3c1af097fc5e0480ba","observation_id":"2f463088-5ef9-46bf-b70c-e7090e2d7d5d","resolution":{"observed_at":"2026-08-07T04:35:18.018939Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.022691Z","title":"Penalty dual decomposition method for nonsmooth noncon- vex optimization—part II: Applications,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.022691Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:e4f767bce6d78c06f05eda71cda5bce06d50483122d2fe3d85dd4c91389c15d8","observation_id":"210eccc4-8646-4945-aefd-5e5c457edd3d","resolution":{"observed_at":"2026-08-07T04:35:18.022691Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.026696Z","title":"Beck, First-order methods in optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.026696Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:edb6cbf95af64cb9f1c2ab6a1f9b08c349605ea9a39c41e21d6d188d5d97f43d","observation_id":"f1bebbe6-3059-4d91-b9fc-654e0293048d","resolution":{"observed_at":"2026-08-07T04:35:18.026696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.04781","last_updated":"2018-06-12T21:56:48Z","snapshot_observed_at":"2026-08-05T08:10:37.595665Z","submitted_at":"2018-06-12T21:56:48Z","title":"On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.04781","snapshot_observed_at":"2026-08-07T04:35:18.030263Z","title":"On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.030263Z"},"links":{"cited_paper":"/paper/1806.04781","citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:4f7b82b5d4c2c62dd1aff0535ece601ffaa1b665e734f935215eb78850493ea4","observation_id":"25a3d04f-209a-4f22-9b85-042340b46d2d","resolution":{"observed_at":"2026-08-07T04:35:18.030263Z","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-07T04:35:19.518146Z","title":"Stochastic mirror descent in variationally coherent optimization problems,","venue":null,"work_id":"1a8386ff-3e31-489e-b7fe-0e94b0b666dd","year":2017},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.034321Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:71037e6c8e44c614be3bdb70b5c95edd2bafb7e31a43bbaab380eb51fbc1bb41","observation_id":"2b0545d4-0abf-40c7-901d-e587323b0ceb","resolution":{"observed_at":"2026-08-07T04:35:19.522548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05681","last_updated":"2018-07-16T11:36:49Z","snapshot_observed_at":"2026-07-06T05:47:18.831607Z","submitted_at":"2017-06-18T16:17:03Z","title":"On the convergence of mirror descent beyond stochastic convex programming","version":2},"cited_work":{"arxiv_id":"1706.05681","doi":"10.48550/arxiv.1706.05681","metadata_source":"pith","pith_arxiv_id":"1706.05681","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On the convergence of mirror descent beyond stochastic convex programming","venue":"math.OC","work_id":"7e73de57-6f0a-4ec0-b6f3-6ac52ba7e809","year":2017},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.037849Z"},"links":{"cited_paper":"/paper/1706.05681","citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:6105b7e65cdf165af1f4c0912bb13c58643c83199c9d0dfb9d98b1bcdbd8d3fb","observation_id":"5d805c10-794d-4f2d-adf8-c9fec618fbfa","resolution":{"observed_at":"2026-08-07T04:35:18.104554Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.asoc.2015.04.016","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A biased random-key genetic algorithm for wireless backhaul network design,","venue":"Applied Soft Computing","work_id":"78a3bcf2-6102-4278-921d-ebb9f11a7f85","year":2015},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.041706Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:c5cb0a970c63374e5bd1f06fbbf23a94ad0a51471cc4297f361ea983a227dc37","observation_id":"550d2d6d-a2c7-4db9-a97d-fc2e74580ba4","resolution":{"observed_at":"2026-08-07T04:35:18.085404Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2006.87625","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:35:18.434248Z","title":"Communi- cation over a wireless network with random connections,","venue":null,"work_id":"7da8c559-e8dc-4ac7-a6e5-9407676ecd1b","year":2006},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.045441Z"},"links":{"citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:0ffba39d0d92c59ca44968ab7a69f92001350264adc807ef9e7f291524162fcd","observation_id":"e3bf2832-4527-4e3a-8760-25ba6ca30197","resolution":{"observed_at":"2026-08-07T04:35:18.440593Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.09090","last_updated":"2021-03-24T01:15:17Z","snapshot_observed_at":"2026-07-06T09:56:57.276248Z","submitted_at":"2020-09-18T21:12:18Z","title":"MIRAGE: Mitigating Conflict-Based Cache Attacks with a Practical Fully-Associative Design","version":3},"cited_work":{"arxiv_id":"2009.09090","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.09090","snapshot_observed_at":"2026-08-07T04:35:18.325706Z","title":"MIRAGE: Mitigating Conflict-Based Cache Attacks with a Practical Fully-Associative Design","venue":"cs.CR","work_id":"f9393984-3178-4f2c-b4b5-4222405097ea","year":2020},"citing_paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:35:18.049116Z"},"links":{"cited_paper":"/paper/2009.09090","citing_paper":"/paper/2506.10362"},"observation_digest":"sha256:9ade15a6ae5fab5e3c750c1e7233b3c8fba377dd0458c2f134a75fb1ccba0447","observation_id":"3baa3dea-c411-40ea-afad-aad64d7f4d31","resolution":{"observed_at":"2026-08-07T04:35:18.329881Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.10362","last_updated":"2025-06-13T11:47:29Z","latest_version":2,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-07T04:25:49.492832Z","submitted_at":"2025-06-12T05:39:14Z","title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":5,"metadata_mismatch":13,"parse_uncertain":0,"unresolved":8,"verified_exact":10,"verified_fuzzy":7},"total_outbound_references":43},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 1 inbound Pith citation observation for arXiv:2506.10362."}