{"as_of":"2026-08-09T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24b2531b38cf2cc866dcbca6a194eced4e68f74b05e1e121eab38a47c6d9d4f1","coverage":[{"denominator":74,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":74,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:52:38.860237Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.07401/citation-record","integrity":"/paper/2507.07401/integrity","json":"/paper/2507.07401/citation-record.json","paper":"/paper/2507.07401"},"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-06T18:52:40.215148Z","title":"Deep learning enabled semantic-secure communication with shuffling,","venue":null,"work_id":"021963a2-7b58-4d0c-96e0-3b674bf9e072","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:33.578719Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:e39040f8ca349ecd94dd4007bb132e2cef50fb6fdd5b50634bae96a86b8fd046","observation_id":"eec55ecf-16a8-4b77-ac96-415cf2f9998a","resolution":{"observed_at":"2026-08-06T18:52:40.221353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:33.694656Z","title":"A mathematical theory of communication,","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:33.694656Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:e16b3b5ac2c193a78ce1fc3d4a2c51a4ef2f6a5e51fe0f70dd205695f9adca71","observation_id":"84ba92d3-f367-49e8-9bf5-f7bbb4d489f7","resolution":{"observed_at":"2026-08-06T18:52:33.694656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.01389","last_updated":"2022-06-27T09:41:14Z","snapshot_observed_at":"2026-08-08T02:19:31.640836Z","submitted_at":"2021-12-30T16:32:00Z","title":"Semantic Communications: Principles and Challenges","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.01389","snapshot_observed_at":"2026-08-06T18:52:33.788355Z","title":"Semantic communications: Principles and challenges,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:33.788355Z"},"links":{"cited_paper":"/paper/2201.01389","citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:2ad28d669e24ff6076c43b385ad873f497bb98144f8b7931f83bdd17924bd69b","observation_id":"3f5505b7-27b5-467c-9572-302252f68354","resolution":{"observed_at":"2026-08-06T18:52:33.788355Z","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-06T18:52:33.865547Z","title":"A method for obtaining digital signatures and public-key cryptosystems,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:33.865547Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:fc96e78d45c293119dafbba44222d2d306f2557d8c935a380a08d7c5d4fb0e58","observation_id":"5acf4f09-5c6c-412b-bbef-ab41c78d8bba","resolution":{"observed_at":"2026-08-06T18:52:33.865547Z","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-06T18:52:40.168872Z","title":"Wire- less information-theoretic security,","venue":null,"work_id":"2a7ebb0f-748e-4a0f-b6c0-2a48b9566473","year":2008},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:33.934829Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:9e645b72c6ae86860f75f58cf60f04ad5d38ddaaf6656ee91f7bfe0d712a9dbb","observation_id":"2a00b5aa-2bd1-47ab-9b9c-b0cee136da7e","resolution":{"observed_at":"2026-08-06T18:52:40.173978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.151130Z","title":"Encrypted semantic communi- cation using adversarial training for privacy preserving,","venue":null,"work_id":"d9ff9da4-62a4-444e-909e-26d184832e2a","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.039645Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:ccbc4b825fba04a0a2a1cfa983311cfd0ff79ee59f199a738c6ea17938e88185","observation_id":"6c0f1066-a350-4b2a-bd4d-83effd98a122","resolution":{"observed_at":"2026-08-06T18:52:40.156286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.133387Z","title":"Semprotector: A unified framework for semantic protection in deep learning-based semantic communication systems,","venue":null,"work_id":"081ad16f-f41f-4baa-962e-3ae6d3f7c33d","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.198416Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:954afc9d27c331c6cf71e5e96e09c8bab8b3f06a2065c84af3ca3f5cea396518","observation_id":"34560221-9ed2-466d-85bb-88233c4583be","resolution":{"observed_at":"2026-08-06T18:52:40.139284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.115089Z","title":"Privacy-preserving task-oriented semantic communications against model inversion attacks,","venue":null,"work_id":"c0e6acca-a90d-4376-9c64-969f637418d7","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.264275Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:46df44da13b0d4300d06b60342a679825823ba43366051e7dbffd1b20db01005","observation_id":"d404d868-7a06-413d-bbbf-11f59a35b7d8","resolution":{"observed_at":"2026-08-06T18:52:40.120553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.095460Z","title":"Capacity of noisy permutation channels,","venue":null,"work_id":"a9da72ef-81b3-45e9-9957-307c0acc28d3","year":2022},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.366617Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:0bea6caa5c0e89294baeed189033373d6631e55e5efa7cc43e2a74366c72f88f","observation_id":"07fda504-b96c-4e7d-b5d4-1d33a6f48f28","resolution":{"observed_at":"2026-08-06T18:52:40.101177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.076782Z","title":"Communication theory of secrecy systems,","venue":null,"work_id":"dfe5aabf-fe78-4acf-b01f-10aaabff1693","year":1949},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.472345Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:283637b8985d37154e983cb88b8db09d2e3719730d22719a09a98f4c6f4a69d1","observation_id":"dd32fe9e-8715-43cb-953e-9f7a6f66370d","resolution":{"observed_at":"2026-08-06T18:52:40.081854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.056512Z","title":"The wire-tap channel,","venue":null,"work_id":"4b363dca-99fd-4101-96a3-01e19ca0f7b5","year":1975},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.543257Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:5127476cc65b38d3888a124da6d9208e7fcbd9af0d907a6b0bf3fcd14f580743","observation_id":"7408553b-348e-43ee-8d76-ddd2f5fa4068","resolution":{"observed_at":"2026-08-06T18:52:40.062472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.038646Z","title":"Wiretap channel with secure rate-limited feedback,","venue":null,"work_id":"0292a42d-a58f-4dad-97ef-a8058db46f2c","year":2009},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.640107Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:f897c00f337200cbb1ce74c44394684ee08671182c9f7faea9566066ebd4745a","observation_id":"f4fca862-1f06-4361-ae7c-cbfc9780f126","resolution":{"observed_at":"2026-08-06T18:52:40.043668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.021698Z","title":"Polar coding for the wiretap channel with shared key,","venue":null,"work_id":"348cc680-7efd-4c9d-ad03-8205caa2206e","year":2018},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.793838Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:945dc16605295e694cf3f97016475ba208447e71b9751871b1f2c8a9da25e333","observation_id":"47b188b4-2d5e-46b6-af2f-37e1accc2b03","resolution":{"observed_at":"2026-08-06T18:52:40.026607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:40.004308Z","title":"An ldpc code based physical layer message authentication scheme with prefect security,","venue":null,"work_id":"a2b0f69f-b8a8-4e71-8a40-9a2f414e7e50","year":2018},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.870748Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:0afd14bafdebd6f423c8d77a770a5f3792da8d522b228a0f812e41d86a9ccd8c","observation_id":"91f0c752-b16f-46d2-a8ac-c9441a6f742e","resolution":{"observed_at":"2026-08-06T18:52:40.009331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.986780Z","title":"Generating a binary symmetric channel for wiretap codes,","venue":null,"work_id":"089a057b-6a71-406a-9c94-26efec6b1012","year":2019},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:34.947323Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:f9d58d49b3a739e1e609bfabcf1a3df96c29ebfdf47b0872edb4ab3904f068e4","observation_id":"138a6cb2-2245-4c4e-b4a5-a120d9d90e29","resolution":{"observed_at":"2026-08-06T18:52:39.991881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.970135Z","title":"Joint precoding and artificial noise design for mu-mimo wiretap channels,","venue":null,"work_id":"a1968cfc-63ac-43fa-8b93-e880297fdac8","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.058243Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:70fdf402eb163a1359a740881743d9e980b96d1b56ffcbcf3eb79d00c2a5ef36","observation_id":"2a91446c-fe8b-4992-be83-2ab85ff92da1","resolution":{"observed_at":"2026-08-06T18:52:39.975160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:35.156800Z","title":"Deep learning enabled semantic communication systems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.156800Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:2f7405c0a6cb6f614d31685a43640aaeaeefa7574710471de00d4097f4d5a6c7","observation_id":"6d55caca-aad5-4469-9091-e716c21ae03d","resolution":{"observed_at":"2026-08-06T18:52:35.156800Z","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-06T18:52:39.940915Z","title":"Deep learning for joint source- channel coding of text,","venue":null,"work_id":"d43707b6-9128-4e3c-9354-80181d6084a6","year":2018},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.231371Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:21d3e642f3dd5ebd055faf93a1378de3481d5f98b6e62b86f906e113537b2d9b","observation_id":"378d0b69-811b-483e-8b25-f2b6079010a3","resolution":{"observed_at":"2026-08-06T18:52:39.945911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.922258Z","title":"A lite distributed semantic communication system for internet of things,","venue":null,"work_id":"e5d8e9c5-246c-43ed-b21a-a0d22b2ccfeb","year":2021},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.348491Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:43ee147025b75671515f3ece2038eea0f23f8b05fd42fb56216e266b800c8355","observation_id":"83280ddb-2e32-457b-bb74-4bd9e9729457","resolution":{"observed_at":"2026-08-06T18:52:39.929039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.903842Z","title":"An investigation on intelligent relay assisted semantic communication networks,","venue":null,"work_id":"42cab6c2-5dcf-4759-860e-59356d08795e","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.451347Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:c750f9dd5fe7791b92a021c54f6df7b3605e2407efd706e4536393e6d5d0b735","observation_id":"d38e60a4-7ff5-4d9c-aa4a-6a1e6d7fbbb1","resolution":{"observed_at":"2026-08-06T18:52:39.909629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.886364Z","title":"Deep source-channel coding for sentence semantic transmission with harq,","venue":null,"work_id":"18a0b5dd-d4f5-4f96-be09-1820b9d51623","year":2022},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.600633Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:610df37cc404bf88a617ec594b0679b2ac4563d9ae3e15b98f05ae9d648a8968","observation_id":"2eeef212-c336-4bb6-bdc5-86491acbf28c","resolution":{"observed_at":"2026-08-06T18:52:39.891375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.869971Z","title":"Toward semantic communications: Deep learning-based image semantic coding,","venue":null,"work_id":"fbf5801f-b3a7-4bd2-b933-6f96c0de3395","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.670505Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:67706bdcf7a20a9c27866f1e17d7d75db4ce63d997221009cfb729cf8f414b24","observation_id":"6c5be1d5-1ac2-4368-b416-8d42e816bd49","resolution":{"observed_at":"2026-08-06T18:52:39.875257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.854116Z","title":"Predictive and adaptive deep coding for wireless image transmission in semantic communication,","venue":null,"work_id":"135643cc-07cb-4447-aa05-b1ea0f663ec8","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.794093Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:790fa4205d78bdb3904a2dd6e4fbd455b69af1b0d17f7e9f464bb00167fbb920","observation_id":"9ba20b3d-050e-4e80-8240-4ea54f1ad3ba","resolution":{"observed_at":"2026-08-06T18:52:39.859196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.837549Z","title":"Semantic communication system based on semantic slice models propagation,","venue":null,"work_id":"7d3b7a4e-6708-4317-9131-8e6f15d0f658","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.885234Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:263be078361fad60600bebd179c00696c9cf1f094949b025824630c4c11ca628","observation_id":"06872d71-bd10-42c8-b41e-3e7527843c9e","resolution":{"observed_at":"2026-08-06T18:52:39.842640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.820982Z","title":"Deep learning- enabled semantic communication systems with task-unaware transmitter and dynamic data,","venue":null,"work_id":"24b26853-078e-469c-9299-09234ef8e2bb","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:35.951187Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:9f04b3df7baee2a333b5fd369defbe21756d595f65b1867c4fafb0381b28b2bf","observation_id":"d696932e-8a15-47f0-9976-9354540622b0","resolution":{"observed_at":"2026-08-06T18:52:39.826033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.804915Z","title":"On the role of vit and cnn in semantic communications: Analysis and prototype validation,","venue":null,"work_id":"2b2c6791-9466-41df-82b7-aa80f8c6d23d","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.014267Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:6cfa4095b618b317419194ef54adad1a7f85dff85aba858e87207817070a68db","observation_id":"1648ca21-9fed-4813-84f2-f1271eb6af07","resolution":{"observed_at":"2026-08-06T18:52:39.810001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.787326Z","title":"Witt: A wireless image transmission transformer for semantic communications,","venue":null,"work_id":"8af45dbb-f36e-4307-9733-96221b00358a","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.081874Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:5b80fcfc408f5978a71e17975caeeb30cf531dbdec8253b98e22a5b8194730d2","observation_id":"a871ded8-f4c8-4c14-baac-b695d957c76c","resolution":{"observed_at":"2026-08-06T18:52:39.792770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.770247Z","title":"Semantic communication systems for speech transmission,","venue":null,"work_id":"73525afd-9412-46b9-8809-6b2bcff1b230","year":2021},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.169490Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:0d701b332e869dc0110c935080ab53f562fbc68ff66bbde9b9961041b53e9dc8","observation_id":"35fc9312-30aa-4b66-b713-79f18178e174","resolution":{"observed_at":"2026-08-06T18:52:39.776263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.753579Z","title":"Semantic-preserved communication system for highly efficient speech transmission,","venue":null,"work_id":"557d25f6-29e9-4419-b3e5-b9a86a09c359","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.264386Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:361483aba72450a441797e9c25d3238bc7873e5c767f4f0f4f7c2fc1ece3b0d7","observation_id":"a97a176e-3f28-43e4-9be2-8a91a347f878","resolution":{"observed_at":"2026-08-06T18:52:39.758729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.732406Z","title":"Deep learning enabled semantic communications with speech recognition and synthesis,","venue":null,"work_id":"e73b8b02-4660-47d4-9189-bd695125f3cb","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.335699Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:76726179546d7c1eae042cc04149a9516fd883efed0361884ea774c16c086da6","observation_id":"d2623a8d-08cc-4176-87af-5a0226d9b9b6","resolution":{"observed_at":"2026-08-06T18:52:39.737045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.715879Z","title":"Wireless deep video semantic transmission,","venue":null,"work_id":"d1ae6f1c-4031-4398-a007-312a06f380b2","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.408886Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:676f66895d6b92458bd4bd4de6f60d9ceea19c7a506af488553777aa578e9a7d","observation_id":"21897f8b-9c2e-4d41-a48c-6ce99772ce82","resolution":{"observed_at":"2026-08-06T18:52:39.720980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.699125Z","title":"Toward adaptive semantic communications: Efficient data transmission via online learned nonlinear transform source-channel coding,","venue":null,"work_id":"976ccd94-b7b1-42d6-84a5-7659439147f2","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.471505Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:61aff0c715d5b948475218fabcc87eb032c74b432861fdc23c509261ad7d75a5","observation_id":"7a3847cd-3032-439a-94b6-3bab1258cb67","resolution":{"observed_at":"2026-08-06T18:52:39.704750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.681844Z","title":"Wireless semantic communi- cations for video conferencing,","venue":null,"work_id":"fcc48dc0-95e4-431a-a4d2-a50ee7aec9ff","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.561578Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:dfa2e4778a4ea63a8a0b786c59d5877ff82f4ae648e46723bef2cef20efcdd26","observation_id":"21137ae4-5330-4fa1-9db8-7dfd954ebb0e","resolution":{"observed_at":"2026-08-06T18:52:39.687043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.666543Z","title":"Model division multiple access for semantic communications,","venue":null,"work_id":"8ee94802-a4b7-4adc-bfb6-e5e94a27440e","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.626774Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:73f3a65b2d8eb66844e4519b6720a1f72c256d363b1a14ed3c054a6b6bb92fa5","observation_id":"dde9c897-3f37-40c7-a848-01b5b3289c08","resolution":{"observed_at":"2026-08-06T18:52:39.671382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.649852Z","title":"Deepma: End-to-end deep multiple access for wireless image transmission in semantic communication,","venue":null,"work_id":"f1fb4399-c5df-47b1-8c19-b100055d6c0d","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.722272Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:1a86bbd8702785baaba10bfda9a866268158f72b6cd2d49d6ea9f21ea635c298","observation_id":"7eeca357-6085-4736-9454-47a8cc47d797","resolution":{"observed_at":"2026-08-06T18:52:39.655545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.631799Z","title":"Orthogonal model division multiple access,","venue":null,"work_id":"73cd5d0a-f3bc-4dc0-b8aa-b3bb6e268dab","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.788767Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:6d50fce6fa5f023c7fefe74f1d0dfedbd2d3b66e9faa4f27ce540d5919afeed0","observation_id":"af34d8bd-befb-40b0-b4a0-f1fcc37077e8","resolution":{"observed_at":"2026-08-06T18:52:39.638205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.613730Z","title":"Rethinking wireless communication security in semantic internet of things,","venue":null,"work_id":"b7590d24-739d-482b-a70d-e7d1a88b2317","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.855449Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:d841d5d0bd3f144d42e211bcc1c4c38150226abc45a6044dc96d8440fcf3f939","observation_id":"7fd01590-d86e-40da-9580-1c8f75602a4b","resolution":{"observed_at":"2026-08-06T18:52:39.618984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.594742Z","title":"Secure semantic communications: Challenges, approaches, and opportunities,","venue":null,"work_id":"f89a27c1-1c0b-4328-a032-7cd88c713e69","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:36.915597Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:199d9d02141ef9aa9f5d20283c8f429140f52be8eb398725b305547f350edef7","observation_id":"e66780ca-5ec5-46a0-bb67-9ae77631e656","resolution":{"observed_at":"2026-08-06T18:52:39.599660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01421","last_updated":"2023-01-04T03:20:38Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-04T03:20:38Z","title":"Secure Semantic Communications: Fundamentals and Challenges","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01421","snapshot_observed_at":"2026-08-06T18:52:37.001572Z","title":"Secure semantic communications: Fundamentals and challenges,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.001572Z"},"links":{"cited_paper":"/paper/2301.01421","citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:ad7a0fa868c1520ba893a6aa4c592e4682272a39edaff796eebb65dd21b871dc","observation_id":"6e4dbec8-c078-41e0-ab07-6355ce98a2e7","resolution":{"observed_at":"2026-08-06T18:52:37.001572Z","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-06T18:52:39.578104Z","title":"Physical-layer adversarial robustness for deep learning-based semantic communications,","venue":null,"work_id":"a1e42ca1-7d22-4595-b83a-ad03ea6f6173","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.079701Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:433677c3f63bdd0823436946b1c9028b4f26516298b034f32966be38cb4503b4","observation_id":"c83bf2a8-bfe1-4d28-9a72-0ce1aff0bbd6","resolution":{"observed_at":"2026-08-06T18:52:39.583523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.560601Z","title":"Secure semantic communication via paired adversarial residual networks,","venue":null,"work_id":"f640dcac-f1e9-49dc-bc9b-dd2e50e5f925","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.153308Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:0fe4436cb74aa128450fd910a361fc51f4e4aee71d93c7fea1d7ff9ed5b6ccef","observation_id":"6a193b5a-9df6-4d36-874b-7ac7b18f4a7e","resolution":{"observed_at":"2026-08-06T18:52:39.566383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.542771Z","title":"Deep joint source- channel coding for image transmission with visual protection,","venue":null,"work_id":"63dd0faf-a961-41ca-83bf-830ae77a3998","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.224987Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:8d738ae0a0fd9354fb3e36219dd940c0e33ae7e5dd182445db9a350ed92a2507","observation_id":"68bf5a2c-fd1e-47f3-a236-ebd6cc82b7f8","resolution":{"observed_at":"2026-08-06T18:52:39.548415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.526026Z","title":"Secure transmission in wireless semantic communications with adversarial training,","venue":null,"work_id":"cbfe6d7a-82aa-4efc-99bb-d1894404b4a2","year":2025},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.280911Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:0fc31c5aff87e10554837ca062bc22236f0e739afec5be867c40c2e173378f1d","observation_id":"5fff9a63-24cc-47e6-93bc-33ff48ad4ba5","resolution":{"observed_at":"2026-08-06T18:52:39.531245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00227","last_updated":"2022-12-01T02:22:08Z","snapshot_observed_at":"2026-07-06T14:25:24.844889Z","submitted_at":"2022-12-01T02:22:08Z","title":"Wireless Image Transmission with Semantic and Security Awareness","version":1},"cited_work":{"arxiv_id":"2212.00227","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.00227","snapshot_observed_at":"2026-08-06T18:52:38.965534Z","title":"Wireless Image Transmission with Semantic and Security Awareness","venue":"cs.IT","work_id":"df80c0f2-4ddf-4e3f-b268-26a03bf6df02","year":2022},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.389643Z"},"links":{"cited_paper":"/paper/2212.00227","citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:06bdafe346e8812c21f6fd17afb5e4feed28a191fcd0566efb536a7b70c2e41f","observation_id":"99af9e67-2305-41e4-a180-10041e69be6c","resolution":{"observed_at":"2026-08-06T18:52:38.971545Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.509184Z","title":"Secure semantic com- munication for image transmission in the presence of eavesdroppers,","venue":null,"work_id":"664b7c0b-19a0-4811-bb02-c280812628f8","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.471651Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:ad289d10ccd334685a7862524bc8000f0bfb45ebab77d69270e7dc7828c6202b","observation_id":"a1f5052f-d154-44d5-8280-22fcfe3f7b16","resolution":{"observed_at":"2026-08-06T18:52:39.515043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.489988Z","title":"Deep joint source-channel and encryption coding: Secure semantic communications,","venue":null,"work_id":"36147f7f-5f51-4ae5-ba07-cf782977ef7e","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.536134Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:c6cded43aaa010e701bd69b71d66d5ffc78f424f34c7420f9021778e598aa94f","observation_id":"f560915f-49ce-4840-b6f5-bc34c362aaf8","resolution":{"observed_at":"2026-08-06T18:52:39.496885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.472195Z","title":"Secur- ing semantic communications with physical-layer semantic encryption and obfuscation,","venue":null,"work_id":"a7e01aeb-1e17-4343-9476-3b5cf21f9fa5","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.599323Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:1e09b230d8b87fd02a2dffbac3c40d9e088504e801a92d9e3ccbbbe06fb92431","observation_id":"31200f9d-9330-4a74-94f1-8042a483a7fd","resolution":{"observed_at":"2026-08-06T18:52:39.477192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13980","last_updated":"2025-09-04T11:59:14Z","snapshot_observed_at":"2026-07-06T17:20:17.051503Z","submitted_at":"2024-01-25T06:46:13Z","title":"A Superposition Code-Based Semantic Communication Approach with Quantifiable and Controllable Security","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13980","snapshot_observed_at":"2026-08-06T18:52:37.665464Z","title":"A superposition code-based semantic communication approach with quantifiable and controllable security,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.665464Z"},"links":{"cited_paper":"/paper/2401.13980","citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:3b5545f6ee79d63d745042ab8fb9954fd75ca653873434d32400d3aca5881673","observation_id":"a684221b-4bac-4e9c-a986-73e3e963bb34","resolution":{"observed_at":"2026-08-06T18:52:37.665464Z","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-06T18:52:39.452323Z","title":"Semantic communication-assisted physical layer security over fading wiretap channels,","venue":null,"work_id":"c11d45a6-e0b0-427b-984d-2ef777b77ec1","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.724436Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:1bf3b4eb55f98e6f47d745e9ec33eeba09427d5a48470e411b273864a7ad80cc","observation_id":"7e507a79-7b83-4ca8-a674-8d87d3dddcfc","resolution":{"observed_at":"2026-08-06T18:52:39.459250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.430068Z","title":"Semantic entropy can simultaneously benefit transmission efficiency and channel security of wireless semantic communications,","venue":null,"work_id":"be83f23d-2447-4406-a23c-0ed52b07b7de","year":2025},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.831439Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:c9d04971cde3b0c7dfdc39f1e467cbdcc87fade9bf089e322cf06cc5e69a1ad2","observation_id":"f2291a54-cc81-473a-b940-e7a11783cf5e","resolution":{"observed_at":"2026-08-06T18:52:39.435254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.408275Z","title":"The model inversion eavesdrop- ping attack in semantic communication systems,","venue":null,"work_id":"420c0450-67f5-4232-a6ce-017b8e08ec3b","year":2023},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.893696Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:bf6cc4b9f1111b63dba2bbc33181356355500ba22bb8d00baf6c44bcce543e5e","observation_id":"ae4c160d-080e-4475-bf0c-4f0a25883841","resolution":{"observed_at":"2026-08-06T18:52:39.415182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.389767Z","title":"Neural network inversion in adversarial setting via background knowledge alignment,","venue":null,"work_id":"f1b24e1f-eb61-4739-8275-9e260fda238e","year":2019},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:37.954721Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:b9e42a504e12523f7fcd64be60ad6fefe3aac8422408968350e9c6c4145a7da9","observation_id":"3b7bbec2-1779-49c4-b6af-6de3f22358fc","resolution":{"observed_at":"2026-08-06T18:52:39.395291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:38.019584Z","title":"Model inversion attacks that exploit confidence information and basic countermeasures,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.019584Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:2c4f04afa9f63f0900f8a2559d5551733dd0988a05d4afea75327fffe3744ef3","observation_id":"b7331eb0-105f-4ed7-99a4-8c1ca6879277","resolution":{"observed_at":"2026-08-06T18:52:38.019584Z","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-06T18:52:39.357377Z","title":"Coding theorems for noisy permutation channels,","venue":null,"work_id":"a4be36a7-1698-4e7f-a891-4d05034b5ced","year":2020},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.147427Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:74cb24c82c9cfcdf4e2571c82cee3a82298c650a96216562d54cf00c2cbb1e12","observation_id":"3bf9cbd3-f0d4-4068-be10-b0cc15610a18","resolution":{"observed_at":"2026-08-06T18:52:39.363628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.340268Z","title":"Permutation equiv- ariance of transformers and its applications,","venue":null,"work_id":"db5af2b7-873e-45d1-88bd-865ed2050c6b","year":2024},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.268838Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:24c2314a59cf8a4edcc10816cf22a58b5754cc7658be5888b378d26009cfcd51","observation_id":"9824e63a-1046-4da4-924f-8d8c7498d878","resolution":{"observed_at":"2026-08-06T18:52:39.345138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-06T18:52:38.438112Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.438112Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:fcf5783677777abcefeab26f23c307c92046ca76b979667e2a716444d3cac733","observation_id":"4dbcdb04-78bc-41b6-a13c-111ef4e63a27","resolution":{"observed_at":"2026-08-06T18:52:38.438112Z","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-06T18:52:39.323638Z","title":"El Gamal and Y .-H","venue":null,"work_id":"f166f087-13ff-4f59-901e-8cddff23d9cd","year":2011},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.564250Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:fb7f7cfa901dc331545643e5cd0f0de0063e3f61bdd7e2aed3dd3ef05ce6acd1","observation_id":"3e959524-c150-4241-812f-f225abe97cdb","resolution":{"observed_at":"2026-08-06T18:52:39.328438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.306837Z","title":"Mutual information neural estimation,","venue":null,"work_id":"a08bbbb9-ec86-4b1b-91c8-cef16b6f780d","year":2018},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.683262Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:59f4b75f7935aa14dd3cca32581a51ae0c0101dd2f87748a3e9602611bb2eeb0","observation_id":"52338891-f013-45d6-be12-a608d87673d9","resolution":{"observed_at":"2026-08-06T18:52:39.311605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.286218Z","title":"Europarl: A parallel corpus for statistical machine translation,","venue":null,"work_id":"c2b40062-5717-49ea-91f8-fdc7add67210","year":2005},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.779352Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:e2a109861ee7e1f0219e5927e99dd484672c8b8e32756c2ef1cc5d19d9231508","observation_id":"a975de55-234d-40d5-b165-8272943d0264","resolution":{"observed_at":"2026-08-06T18:52:39.295364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.266435Z","title":"Progressive growing of GANs for improved quality, stability, and variation,","venue":null,"work_id":"8af03c31-c46e-41b4-887b-e5c7bf0f83d7","year":2018},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.784610Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:e80cc13921f300a058f3eb01d9358ff9d033ea70b319ac53459d856a2ae3e23f","observation_id":"d916fc96-0bd2-49af-a677-27b826e25ea8","resolution":{"observed_at":"2026-08-06T18:52:39.272738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7488/ds/2139","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:52:38.898048Z","title":"Noisy reverberant speech database for training speech enhancement algorithms and tts models,","venue":null,"work_id":"f77c7743-16af-4e74-9d06-1ea5da3672e6","year":2017},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.790370Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:771608e06882e12d124fb8a860cc9ebcf93a2c85cb6e4b95dce73e252a35901b","observation_id":"e3ea5c8a-1356-4109-b2e8-36d34702edea","resolution":{"observed_at":"2026-08-06T18:52:38.905222Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.242003Z","title":"A method for the construction of minimum-redundancy codes,","venue":null,"work_id":"262ad6d6-8399-486b-90ed-1bc3419b730d","year":1952},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.797089Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:2fb6c06732b085ed049a41ea0af4c9b97c8b3dc98c9dcdb1391fc0947a3fac6c","observation_id":"62c39b84-307d-4da4-ab59-4a231b73a2a3","resolution":{"observed_at":"2026-08-06T18:52:39.248047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.220307Z","title":"Channel polarization: A method for constructing capacity- achieving codes,","venue":null,"work_id":"f228f022-a514-49ed-aad7-fc0713a72b65","year":2008},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.803034Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:ec897f8345b825a95c030e24ec5535b85ea04481dcba53756ead6ce23017b76a","observation_id":"abab94a9-6505-46fa-a8d9-d5642273b6e5","resolution":{"observed_at":"2026-08-06T18:52:39.226525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.201345Z","title":"The jpeg still picture compression standard,","venue":null,"work_id":"2a95038d-f314-45df-b4bc-b9febdec9ccd","year":1992},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.808437Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:b879d475fdf83cf6cfcd47cd71837d8b24bac5d79bcb6309a606c630f8fdbb5d","observation_id":"be3843d0-853a-49fc-8a0e-23370796be55","resolution":{"observed_at":"2026-08-06T18:52:39.206684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.183585Z","title":"Low-density parity-check codes,","venue":null,"work_id":"0512c595-48fb-44de-ada7-3ed0ce6cd572","year":1962},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.814872Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:2cb7025b58a78cf720d4bdedbe80902d08a7cd844c86dcfee47579bfa3e1461c","observation_id":"0b6007ac-5f6a-422a-a540-05f60ab32842","resolution":{"observed_at":"2026-08-06T18:52:39.188797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.166053Z","title":"Bleu: a method for automatic evaluation of machine translation,","venue":null,"work_id":"ecb08d7b-fc7b-4356-ae75-9f4385b6695a","year":2002},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.819617Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:80103b6925044ecbdce180e293aea20b4b934ee20ddd7e7735c840ab48e82495","observation_id":"bb641bae-a781-4e2d-99fe-accf8d95e052","resolution":{"observed_at":"2026-08-06T18:52:39.170864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.136597Z","title":"Sentence-BERT: Sentence embeddings using Siamese BERT-networks,","venue":null,"work_id":"2b54da4e-722d-411b-a143-20fce1981d43","year":2019},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.831052Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:1d49998eea66d7ca4a95d3fe8f76831fdcb6a85d68079e684b89bbf455955b8c","observation_id":"a01bdf05-60c0-47c5-93f9-51e28c226dfa","resolution":{"observed_at":"2026-08-06T18:52:39.141596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.117093Z","title":null,"venue":null,"work_id":"840ac044-1826-43b1-9678-394597b8825f","year":null},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.836088Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:95dabea1bde24187b9775039d158c08db1642a26db6807641b41d36f6fda954b","observation_id":"0dbf5369-7066-4060-821c-4e47a2f8aa00","resolution":{"observed_at":"2026-08-06T18:52:39.122853Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.097186Z","title":null,"venue":null,"work_id":"4e0cb802-44cd-444a-a044-a4d4d5895a18","year":null},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.840841Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:09005c88556d2b5701ce9f44cebf7c46006b91195011f7776b33ce61222b0520","observation_id":"3b7fb43c-8bde-4373-8f5c-4da9fdbe1fe3","resolution":{"observed_at":"2026-08-06T18:52:39.101873Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.079548Z","title":null,"venue":null,"work_id":"5ca98ace-ec48-4d8a-9204-5eebbd2d1daf","year":null},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.845683Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:a3e2ec41ee0c68a3405cdef92aafd2985b40b7ff61f876a721b1d6efd1bb8ef2","observation_id":"c84b8d70-bbaa-49af-a448-c920c32b4fae","resolution":{"observed_at":"2026-08-06T18:52:39.084919Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.062172Z","title":null,"venue":null,"work_id":"230ea732-0407-4b84-bd4e-494254ba9ea9","year":null},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.850504Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:04254726da15e70343519888f797f11b9ff419ebbd10eba51a9ad7aa539471f5","observation_id":"462673ed-fac2-4a3c-b4cd-5da356929b47","resolution":{"observed_at":"2026-08-06T18:52:39.066986Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.044204Z","title":null,"venue":null,"work_id":"d4d31f83-14d8-457e-b83c-d8bb13a0ca3c","year":null},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.855174Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:17bb32468544b6649655542654e606d172af4ef21db2cfcb0ab2ee86f0cc7be7","observation_id":"c7f181bb-8444-47ea-adba-5900a11d29d4","resolution":{"observed_at":"2026-08-06T18:52:39.049939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:39.024729Z","title":"18 Alice 𝑃, 𝐺 Bob Private key 𝑎 Public key 𝐴 = 𝐺𝑎 𝑚𝑜𝑑 𝑃 𝐼1 = 𝐵𝑎 𝑚𝑜𝑑 𝑃 Private key 𝑏 Public key 𝐵 = 𝐺𝑏 𝑚𝑜𝑑 𝑃 𝐼2 = 𝐴𝑏 𝑚𝑜𝑑 𝑃 𝐴 𝐵 𝐼𝑛𝑑𝑒𝑥 = 𝐼 1 = 𝐼 2 Fig","venue":null,"work_id":"a439f080-9965-4024-ac4f-ef468be003ab","year":null},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.860237Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:21afa022b99215038f322887af2ebdd06b4cb4ed05992c07b3efaaa5e78cc5d8","observation_id":"84ba3840-287d-4527-abc7-85f277dcd9fd","resolution":{"observed_at":"2026-08-06T18:52:39.031717Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T18:52:38.825480Z","title":"Available: https://aclanthology.org/P02-1040","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy","version":1},"reference_index":318,"source":"pdf_text","source_observed_at":"2026-08-06T18:52:38.825480Z"},"links":{"citing_paper":"/paper/2507.07401"},"observation_digest":"sha256:251fbcf6466c94d7758c657fceee606f5636f42bf6c2aa3f87f8bd80f2b0196c","observation_id":"bf7d5eb9-6946-4e7a-823d-5b24ad832d8d","resolution":{"observed_at":"2026-08-06T18:52:38.825480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.07401","last_updated":"2025-07-10T03:42:17Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-06T18:39:43.900509Z","submitted_at":"2025-07-10T03:42:17Z","title":"Shuffling for Semantic Secrecy"},"reference_resolution":{"displayed":74,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":2,"verified_fuzzy":57},"total_outbound_references":74},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 74 of 74 outbound references and 0 inbound Pith citation observations for arXiv:2507.07401."}