{"as_of":"2026-08-15T04:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec86c8a68e11a18f90cfaadbf61f5c04e5770f4d38e9fa981d169c9857a1fe84","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:29:56.239174Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2502.01827/citation-record","integrity":"/paper/2502.01827/integrity","json":"/paper/2502.01827/citation-record.json","paper":"/paper/2502.01827"},"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-09T14:29:57.478414Z","title":"On the limits of steganography,","venue":null,"work_id":"063b405a-0914-483f-90d8-dfb994556b97","year":1998},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:55.999653Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:52d02d3133983687909e75950ca0b721919559fc622a2afd5737b49d49e3521d","observation_id":"fad9d68c-72b2-4fd2-bb1e-256e83234ca7","resolution":{"observed_at":"2026-08-09T14:29:57.482558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.464565Z","title":null,"venue":null,"work_id":"948d4a15-13ee-4b05-b6a1-b4de5c0f1930","year":2007},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.004868Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:19c39066e222327882bc06ec453ca8b194ff1de50c989aec1cc9bad58d8126bc","observation_id":"933af9aa-700a-4fb2-9bd6-366c648d0990","resolution":{"observed_at":"2026-08-09T14:29:57.469220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.450366Z","title":"Hide and seek: An introduction to steganography,","venue":null,"work_id":"7c9716b2-4d7d-4cf3-ab87-7d7658145f47","year":2003},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.009531Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:fd089e53ff7617ae654a1fe187640c1fd4712d716718911862e2305662e7184a","observation_id":"40106b65-0c0a-4a56-8f48-b54d4d025feb","resolution":{"observed_at":"2026-08-09T14:29:57.454795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.436396Z","title":"The prisoners’ problem and the subliminal channel,","venue":null,"work_id":"122e385a-523e-4a56-8661-223a1bbf83ad","year":1984},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.014476Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:296c2ee979420fad14fa8e3d47ac5f6b8f749b5c4e5ff8f3f601fa57d2aa8108","observation_id":"ec0a1c63-2f18-4ecf-9b3c-cf3dcd2351ba","resolution":{"observed_at":"2026-08-09T14:29:57.441015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.408471Z","title":"The hiding virtues of ambiguity: quantifiably resilient watermarking of natural language text through synonym substitutions,","venue":null,"work_id":"d9adb25a-4770-4b56-b4ad-085c3feb105c","year":2006},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.019186Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:b44c389ef8be645ac2aae10bb37e2c7e0e71ac92ff0df9e1658803cde78b173b","observation_id":"0e8e5890-2ccc-4bf0-9c0d-bf7b9eeb395d","resolution":{"observed_at":"2026-08-09T14:29:57.423238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.372611Z","title":"Linguistic steganography using automatically generated paraphrases,","venue":null,"work_id":"b96bd543-a68f-461f-993d-1ad943ec880f","year":2010},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.023787Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:6a3f1ceb19b622bcc9fcaa2137c684bd581dafe5ae4671ba7bc638abda2ba315","observation_id":"38414f66-3748-4e8f-9e19-a0e3a584849d","resolution":{"observed_at":"2026-08-09T14:29:57.385223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.334484Z","title":"Matryoshka: Hiding secret communication in plain sight,","venue":null,"work_id":"38694c12-5313-4eff-a914-7d0ae05164e9","year":2016},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.028648Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:c07a421d7830e36ef72f611ba9726789d8eed55a776004741c783f13738e84b4","observation_id":"8e48794d-04b6-400e-a735-a9744d6b7643","resolution":{"observed_at":"2026-08-09T14:29:57.356353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.10742","last_updated":"2017-05-30T16:52:48Z","snapshot_observed_at":"2026-08-14T20:57:13.334596Z","submitted_at":"2017-05-30T16:52:48Z","title":"Generating Steganographic Text with LSTMs","version":1},"cited_work":{"arxiv_id":"1705.10742","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.10742","snapshot_observed_at":"2026-08-09T14:29:56.484671Z","title":"Generating Steganographic Text with LSTMs","venue":"cs.AI","work_id":"108e0d8f-e416-454b-8461-ac51e85d9ed8","year":2017},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.032820Z"},"links":{"cited_paper":"/paper/1705.10742","citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:88dcf3b68596042bcdfe194a1a17618ae0ffa74296e0035a6088578edec8ef92","observation_id":"7d6a7368-c142-44d0-a205-ec8484341934","resolution":{"observed_at":"2026-08-09T14:29:56.489522Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.272507Z","title":"RNN-stega: Linguistic steganography based on recurrent neural net- works,","venue":null,"work_id":"88e69169-f81e-4f2a-a52b-19eba7b87cf7","year":2018},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.037413Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:fe77ae5a5386a98efa13439b08bc3cb6a63142e3cca8b78dddcecb52359ad1d9","observation_id":"b9602f7e-8a1f-4ce8-9c4c-b25ece69a118","resolution":{"observed_at":"2026-08-09T14:29:57.304184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.210688Z","title":"Neural linguistic steganography,","venue":null,"work_id":"e87c3228-9d4e-4497-aac2-ea0a5663da64","year":2019},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.041693Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:ef5131589ba5e4bddc4d91c3a498d5532aa386dc5580d9e162be5c9cca265d47","observation_id":"ab9effcb-27a5-4e2f-9e89-1b1991dcae6a","resolution":{"observed_at":"2026-08-09T14:29:57.245229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.104222Z","title":"A novel linguistic steganog- raphy based on synonym run-length encoding,","venue":null,"work_id":"c951b4a6-f8a3-4e36-848e-a67ae6926e83","year":2017},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.045907Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:e3583e51c3a43b30b0092a2224b4cdcd475889243f242a72f793b2f4d874678f","observation_id":"d2d22b61-e17d-4262-9b96-8b264107b02b","resolution":{"observed_at":"2026-08-09T14:29:57.164929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:57.026316Z","title":"V AE- Stega: linguistic steganography based on variational auto-encoder,","venue":null,"work_id":"760652b8-1b2a-4b56-94e5-6fcb32e4a7d4","year":2020},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.050361Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:5d59efed04e470e18c1ef1c5c49ed9b85177b64ae680e7e1722234a5f9078b46","observation_id":"a58819b4-4ad7-4f31-818c-9a70a660aee7","resolution":{"observed_at":"2026-08-09T14:29:57.058620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.969842Z","title":"GAN-TStega: Text steganography based on generative adversarial networks,","venue":null,"work_id":"1062a5bb-90aa-49ef-b13a-096b7b7819b7","year":2019},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.054634Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:05303c3a538d9883134f893445e602e2f3e8656553104a96e42714a97becea54","observation_id":"8c3c726b-34e4-46a7-ab0c-f55a22a45bb2","resolution":{"observed_at":"2026-08-09T14:29:56.978862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-08-13T13:58:05.537350Z","submitted_at":"2022-10-24T17:40:07Z","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.14889","snapshot_observed_at":"2026-08-09T14:29:56.059057Z","title":"Perfectly secure steganography using minimum entropy coupling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.059057Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:22d29b44fd332a2c438cc768ad6cd2ed3bf7b9f5d9b2086e402dbd9d97e4bb87","observation_id":"eb114a57-dcb6-4c9f-bc3f-fdf0c154e85f","resolution":{"observed_at":"2026-08-09T14:29:56.059057Z","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-09T14:29:56.952642Z","title":"Meteor: Cryptographically secure steganography for realistic distributions,","venue":null,"work_id":"5fa90287-9054-4963-99f0-1135c6054579","year":2021},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.063531Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:2149fa08f03ec1597413749c3c116163b2e98e9b932edaed1294251a1400737d","observation_id":"a19f9a55-f7f5-4fe2-8bb4-abb524569147","resolution":{"observed_at":"2026-08-09T14:29:56.958620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.936850Z","title":"Provably secure public-key steganography based on elliptic curve cryptography,","venue":null,"work_id":"a8fa9af8-6ac3-44b5-b67c-35466a73ccb6","year":2024},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.067856Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:28a07537b6abe912228c2a4de687a162a9376e9849d1ae1d22ec6a36c211a60c","observation_id":"2bd7ff50-4019-482e-82e7-97da1d0686ce","resolution":{"observed_at":"2026-08-09T14:29:56.941433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02011","last_updated":"2021-06-03T17:27:10Z","snapshot_observed_at":"2026-08-13T19:10:23.631583Z","submitted_at":"2021-06-03T17:27:10Z","title":"Provably Secure Generative Linguistic Steganography","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02011","snapshot_observed_at":"2026-08-09T14:29:56.072079Z","title":"Provably secure generative linguistic steganography,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.072079Z"},"links":{"cited_paper":"/paper/2106.02011","citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:46ea979d684d1a42e7763213d7d1e9cf9341bc004f17462861ae0ba58015b948","observation_id":"37e8db1a-9242-4232-847f-db48337f556b","resolution":{"observed_at":"2026-08-09T14:29:56.072079Z","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-09T14:29:56.922819Z","title":"Dis- cop: Provably secure steganography in practice based on","venue":null,"work_id":"a3fc4b46-c1fa-47c2-8f83-15b5f6729980","year":2023},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.076619Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:68d74b855b4e666916d17d3141ba89f6dbdbfe60edfa9bbf5a9fb4a2f1dbdd74","observation_id":"79a6717d-a8d0-4c6e-a320-f9f2fc682d93","resolution":{"observed_at":"2026-08-09T14:29:56.927427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.909081Z","title":"Towards near-imperceptible steganographic text,","venue":null,"work_id":"d69e4f85-2d5c-404f-aa46-beb667323a96","year":2019},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.081092Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:dd1cb1e56d1b1270fb31165401bb76d7fc4499d0696b0693261c490903a2f299","observation_id":"b5c6e034-96ab-477a-b5f3-17217755f25b","resolution":{"observed_at":"2026-08-09T14:29:56.913511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.894841Z","title":"Near-imperceptible neural linguistic steganography via self-adjusting arithmetic coding,","venue":null,"work_id":"c5b06471-1724-436b-bdb2-725e006ea8a9","year":2020},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.085557Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:0b39d46ed7a555ac3ce1a51c3d48ccc1f3211f68436e7a51e533b5095c7580a6","observation_id":"2ea0b262-dbf5-46af-9bde-184827145b7c","resolution":{"observed_at":"2026-08-09T14:29:56.899703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.880318Z","title":"Co-Stega: Collaborative linguistic steganography for the low capacity challenge in social media,","venue":null,"work_id":"3f124800-7c9f-451d-97ac-14c59350ec65","year":2024},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.089863Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:58785d86422a53f0b85f5f39de83900de0f6e1a0e37223eb3186b7cc3a2f16de","observation_id":"2675025a-3fcd-4cfe-bd57-5e6478573f10","resolution":{"observed_at":"2026-08-09T14:29:56.885164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11043","last_updated":"2024-12-15T04:04:23Z","snapshot_observed_at":"2026-08-11T15:19:34.605206Z","submitted_at":"2024-12-15T04:04:23Z","title":"Semantic Steganography: A Framework for Robust and High-Capacity Information Hiding using Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11043","snapshot_observed_at":"2026-08-09T14:29:56.094316Z","title":"Semantic steganogra- phy: A framework for robust and high-capacity information hiding using large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.094316Z"},"links":{"cited_paper":"/paper/2412.11043","citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:c0f9c68902d6d3426be6191a52be0cc6cdc4bb95a15bcd0f24ba2fc7783be903","observation_id":"4791619e-2736-4bbc-b9f9-ffd876ee8fc7","resolution":{"observed_at":"2026-08-09T14:29:56.094316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19652","last_updated":"2026-06-26T14:08:06Z","snapshot_observed_at":"2026-08-14T23:43:31.135770Z","submitted_at":"2024-12-27T13:56:51Z","title":"A Plug-and-Play Method for Improving Imperceptibility and Capacity in Practical Generative Text Steganography","version":5},"cited_work":{"arxiv_id":"2412.19652","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.19652","snapshot_observed_at":"2026-08-09T14:29:56.419144Z","title":"A Plug-and-Play Method for Improving Imperceptibility and Capacity in Practical Generative Text Steganography","venue":"cs.CR","work_id":"ff97ca69-c1f1-4edc-8052-4e5a99d09d5d","year":2024},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.099001Z"},"links":{"cited_paper":"/paper/2412.19652","citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:1a6f8112f394a41d4e6b5bb44bf78ea716e19c48183aaa63943d22413a4bb3df","observation_id":"08f5398c-dc71-49a6-af35-8e92f0587e77","resolution":{"observed_at":"2026-08-09T14:29:56.425608Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.103714Z","title":"OD-Stega: LLM- based near-imperceptible steganography via optimized distributions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.103714Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:a6c7d483f551fad3f23bd4df39a739679a7e8c4aba06dcea1f89ebe65a0ddf57","observation_id":"7d2527c8-32a7-4c64-a315-b0dc69d41e9d","resolution":{"observed_at":"2026-08-09T14:29:56.103714Z","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-09T14:29:56.108081Z","title":"Altman, Constrained Markov decision processes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.108081Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:2748b1d43d8155eb67d350bb502d02ce9e8cce5d8c7f0f614834a420a9da42d4","observation_id":"9f437652-f97f-4635-92c0-8975e9822ba3","resolution":{"observed_at":"2026-08-09T14:29:56.108081Z","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-09T14:29:56.112193Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.112193Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:ac48d69ce0072fccf7100c7f7af324e9bc4acda9951db3a46b28c01436431d1d","observation_id":"58778ab9-837e-4d6a-a879-878bb11c66fb","resolution":{"observed_at":"2026-08-09T14:29:56.112193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-09T14:29:56.116411Z","title":"Language models are few-shot learners,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.116411Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:adbaa2bfd7d1374b1aebe0ef433fe43fe841922805a2741d7014e4d5be6912a1","observation_id":"5d975264-5474-4d8a-801b-72c46041b91b","resolution":{"observed_at":"2026-08-09T14:29:56.116411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-09T14:29:56.121311Z","title":"Llama: Open and efficient foundation language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.121311Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:e66a4cdb1a4d911033be91fc2096abf9161115aaea005139020439063e70006e","observation_id":"4f5c4a26-3d85-4757-906b-d03984a16e57","resolution":{"observed_at":"2026-08-09T14:29:56.121311Z","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-09T14:29:56.847034Z","title":"Arithmetic coding,","venue":null,"work_id":"23d6e79e-0cc5-4dca-b72f-32eea48302e4","year":1979},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.125606Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:acbc04a01102afefc91353e5adfa98ef03314b4443690cf76a3507f315652d80","observation_id":"9d79d98d-0f83-4f55-8fd9-750a846781e7","resolution":{"observed_at":"2026-08-09T14:29:56.851608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.832585Z","title":null,"venue":null,"work_id":"53344c34-ef10-40f5-a8e2-294c5fc80d91","year":2015},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.129966Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:1f5932958dfead7a032d8d4e8210f827491eaa5f171fc52bbd115cd4b8894ad6","observation_id":"7f326c41-0c7d-4813-9f38-8d71556c4717","resolution":{"observed_at":"2026-08-09T14:29:56.837570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.134261Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.134261Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:81cd43a57be1a7553dabf8b91ef7c5cb3e31b9c885faf732113bae1d60602601","observation_id":"8cb061fc-cdd1-471d-80f5-57c7b06b3753","resolution":{"observed_at":"2026-08-09T14:29:56.134261Z","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-09T14:29:56.809940Z","title":"Convex optimization,","venue":null,"work_id":"f0263ff8-067b-4d94-9791-140209bd7f46","year":2004},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.138517Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:6148b8aa2cf89facd2f49ace9d4ba760161ed9c250623eeda208b58755359702","observation_id":"81070b31-850d-4749-856c-86f970828f9b","resolution":{"observed_at":"2026-08-09T14:29:56.814338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.796400Z","title":"Therefore d⋆(s, a) satisfies the constraint (17) and (18)","venue":null,"work_id":"89cd7d00-666c-4895-989b-54a50dfd9ead","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.142986Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:e92eb291afc05281c804270107dc382e4a0ab67483340c9d8ae0ea8bc40d57bf","observation_id":"c8726c00-c726-4fdb-9bda-c7bf9642ab4e","resolution":{"observed_at":"2026-08-09T14:29:56.801357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.782470Z","title":null,"venue":null,"work_id":"10234acb-c298-4e83-86e8-d65f190a5a48","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.147324Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:0cacd17cd45925e23229fbc033f7e940d959890be97ed76b060bfd17a39700e2","observation_id":"d508f5b5-a0ce-47b2-9e81-abd6b1735cd4","resolution":{"observed_at":"2026-08-09T14:29:56.787167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.768913Z","title":null,"venue":null,"work_id":"c6e3a96b-5cfe-4d1f-bc54-77d9c53fa4c8","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.151848Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:3e1c3d0f26c527d1e10704770bccb15fd35224f63ab67ba9ab14bd14ce2a7d8a","observation_id":"32cc2a57-8556-4a83-b4f6-797abc20c159","resolution":{"observed_at":"2026-08-09T14:29:56.773284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.755800Z","title":null,"venue":null,"work_id":"5876a712-b958-41b5-8662-3be07f8d97dc","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.156490Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:6f5391da4363ffe1d4ef1fd7b8beba10a2e832049b9373a862e8ee025522c4a3","observation_id":"14d8728d-64dd-4056-80d0-35349ea60f8e","resolution":{"observed_at":"2026-08-09T14:29:56.760064Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.741403Z","title":"We can now conclude that d⋆(s, a) is also an optimal solution to the optimization problem","venue":null,"work_id":"96210f07-7700-420a-9431-a9a36f708159","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.160998Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:00ee2484bcfeb66bc92161619aec74fdd10be8ef7b1a37700a010c79d3b9eff1","observation_id":"66c5b7e5-9b3e-4384-8329-61ea7cc0d435","resolution":{"observed_at":"2026-08-09T14:29:56.746817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.728378Z","title":null,"venue":null,"work_id":"2afc3c9b-854c-4da3-a1e4-84e75c408386","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.165414Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:5a39b917767d166629ca3b2eb6dacb6b20dc890491715ec85adc62590a417194","observation_id":"58391182-f56d-4724-a0aa-f82be34e9be0","resolution":{"observed_at":"2026-08-09T14:29:56.732692Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.715113Z","title":null,"venue":null,"work_id":"b2b42336-ad27-47af-8346-ac3e8b90ef5b","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.170412Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:84b60b64b8f2991a833fe57177866e5a097e13d47d6cdcbd937874c9febc960b","observation_id":"d308fa93-ccea-416f-b041-64c91d7e25c8","resolution":{"observed_at":"2026-08-09T14:29:56.719369Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.700477Z","title":null,"venue":null,"work_id":"60a6bb75-e5c5-4dd7-8ab0-8522b3464549","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.174803Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:eca19dfd73bcdc5eb3a854a9473b7d7baa014303378dec101b6ce4f1bbe9b711","observation_id":"c44a2b88-8964-43da-bb25-398615c56402","resolution":{"observed_at":"2026-08-09T14:29:56.705293Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.685834Z","title":"The expression formulas for the primal variables xs, ds and the dual variables ωs, νs, µs where s ∈ {0, 1} are identical across all scenarios, as presented below","venue":null,"work_id":"1fc0c705-127f-4618-b2e9-aaaf90f36fc6","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.179147Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:140a2bd10a4f0e32cd2ecffdfbb4a3dd41b3a70cb66d3ea887ef837369bafd07","observation_id":"2ffd76d0-078a-47db-a71a-57600e8ecb71","resolution":{"observed_at":"2026-08-09T14:29:56.690502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.672196Z","title":"With the solution of a0, a1 given in the theorem, and in the given range of b, the range of a0 and a1 are a0 = p0, a1 ∈ [p0, p1], (97) The variable assignments are as follows","venue":null,"work_id":"5805b4d2-23b2-4a41-943e-1576f5f00a08","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.183654Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:4cd7eab5d925aacb1e3603b073346fa56a1edb59bcec43856017322ff2f42082","observation_id":"ccf79770-ec77-49fe-8075-68e8e607a78f","resolution":{"observed_at":"2026-08-09T14:29:56.676688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.658832Z","title":"(109) The variable assignments are as follows","venue":null,"work_id":"9c39f44a-4163-4f23-9e65-d0e2e5a53dc9","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.188622Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:dcc305c76ff086f6640db2b0e2f9d48e4d1e61d1edbab1f7d8863b1b0a2c8298","observation_id":"2f81fcab-d6c5-449c-9289-9b244c08dee1","resolution":{"observed_at":"2026-08-09T14:29:56.663029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.645491Z","title":null,"venue":null,"work_id":"6c1ba649-5f50-4d22-810a-7f657fbefee3","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.193465Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:b7dfb84920dbcd1d1900bd886a867787379ab6de65c8db96005f39f06e25eda9","observation_id":"b0fb653a-a7a6-4106-b34a-58b34d0472bb","resolution":{"observed_at":"2026-08-09T14:29:56.649863Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.632011Z","title":"a) Primal variable assignments: a0 = a1 = −M ( b 2 − dγ 0 p0 − dγ 1 p1) (121) c0 = d0(p0 − a0), c 1 = d1(p1 − a1)","venue":null,"work_id":"5a75812e-3681-4f6f-b501-df5928bb9144","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.198112Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:c6c0485ebda2bf0e39a92bea33bef723608605275ae453f815a2c6dadf2b78a2","observation_id":"de08cb8f-7ef1-43b3-940a-40bd9555e977","resolution":{"observed_at":"2026-08-09T14:29:56.636576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.616947Z","title":"(125) Using (88)-(91), all the primal variables are assigned","venue":null,"work_id":"8744a73c-5008-4fc1-b87c-dea862fe2e4d","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.202607Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:aabc1bafd8691508e8048cdaa4d684a35df840377c042ab302ae05ffbcd51cda","observation_id":"8ef97624-cfcb-4fc8-9388-fe8dbd0fa640","resolution":{"observed_at":"2026-08-09T14:29:56.621530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.602329Z","title":null,"venue":null,"work_id":"e259e906-75d5-4069-8605-bf2f8126056c","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.207075Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:dee41efdfbd79f481c1f9f8b4a3a36c1d088820e4a7d839afb59439ba58f89b4","observation_id":"cc265881-d290-4c3f-819a-4feaa89eaa55","resolution":{"observed_at":"2026-08-09T14:29:56.607339Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.586830Z","title":"Now let us turn our attention to the case when | 1 2 − p1| < | 1 2 − p0|, implying 1 − p1 − p0 ≥ 0","venue":null,"work_id":"ad43c746-4cf3-4bb9-863a-9e6d0e3ca028","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.212335Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:6a9b8263fc4c01e083faabeb4dbcdd5c2093943ad95b4da2df2650af296b8f2a","observation_id":"1f82d253-9836-470a-87df-605e217f0d97","resolution":{"observed_at":"2026-08-09T14:29:56.592285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.571987Z","title":"We have the following assignments","venue":null,"work_id":"7416f4c7-6690-4351-8ab9-22385b8f20a5","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.216709Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:8ddb82670c70e3da488fa98a25e8e3546f5465479de4513783c7ac80969439f1","observation_id":"b4a30c80-f9e3-4d03-a40e-9236a0985714","resolution":{"observed_at":"2026-08-09T14:29:56.577037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.556844Z","title":"(162) Using (88)-(91), all the primal variables are assigned","venue":null,"work_id":"9ddea882-dae4-460c-8eb4-c12779d4c890","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.221113Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:9d2a9ded74b3c205325682584b10da5cb94f9824d8ec5d249d01634543646532","observation_id":"bcd7d4fc-8ead-4c31-8da5-3e688972a23a","resolution":{"observed_at":"2026-08-09T14:29:56.561360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.542578Z","title":"Similarly, their intersections with the lighter green dash line give (a0, a1) = ( p0, ψ1), which is the only element in Sb′ l ; again the two functions take the same value","venue":null,"work_id":"4c82712c-4889-474f-b950-181fdd746c1a","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.225409Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:11bb06d6665aa832e9c1a6c15868e94b7fbf08cb13fff34a46fb87978059bb37","observation_id":"1a2c17eb-ac12-42bf-bdf1-6afb5fc7da97","resolution":{"observed_at":"2026-08-09T14:29:56.547285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.528144Z","title":"In other words, Φ+ decreasing in a ∈ (0, 1 2 ] and Φ− increasing in a ∈ [ 1 2 , 1)","venue":null,"work_id":"63860d40-1e78-46c7-b757-2c7cb86dab54","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.230346Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:77e415362ae5fcf5d3929c4361f1c9b27fa6e257d909558bf872a78f1b09851b","observation_id":"96ea669c-1f6a-44b6-b152-6277517e9eab","resolution":{"observed_at":"2026-08-09T14:29:56.532899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.513599Z","title":"We next prove this claim","venue":null,"work_id":"7ffb3d2f-de76-4ace-a73e-2a38e85dfc04","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.234853Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:d1ce33574eb5b077bf117122bf4c3003f5bb15de108cec597b6fdc5c48370dd9","observation_id":"3a24ad4b-87ae-4fad-a53a-a060b89e7038","resolution":{"observed_at":"2026-08-09T14:29:56.517907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T14:29:56.499469Z","title":"a′ 0 = a0′→0′ recover = a1→1 = 1 − a1 ⇒ a1 = 1 − a′ 0 (171) a′ 1 = a1′→0′ recover = a0→1 = 1 − a0 ⇒ a0 = 1 − a′ 1 (172) Similar steps for case p0 ≥ 1 2 ≥ p1","venue":null,"work_id":"6fc85e4a-e3b2-4568-bcfb-b09672087871","year":null},"citing_paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T14:29:56.239174Z"},"links":{"citing_paper":"/paper/2502.01827"},"observation_digest":"sha256:aa536bd99f43cce2c7a9fbcff987e3bdd01da7e73503d4a76560c64b7f315f19","observation_id":"2a1dada2-47ee-447b-a226-560dfabf0086","resolution":{"observed_at":"2026-08-09T14:29:56.504248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01827","last_updated":"2025-02-03T21:10:03Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T05:27:15.012373Z","submitted_at":"2025-02-03T21:10:03Z","title":"Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":2,"verified_fuzzy":33},"total_outbound_references":54},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2502.01827."}