{"as_of":"2026-08-11T06:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:26c0a44bd30c5f2fb2748922bc34d0dd258a03d6ed98fdc29e1fb972a92d6408","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:29:56.059057Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T01:27:31.279667Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","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-09T14:17:31.701811Z","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:7c4dbac45576c3303b648f74822b6502b6b1838e0f0ea4558a75616b208e631e","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":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","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-04T15:44:18.550787Z","title":"Perfectly secure steganography using minimum entropy coupling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.19598","last_updated":"2026-06-18T01:42:20Z","snapshot_observed_at":"2026-08-09T09:21:28.499373Z","submitted_at":"2025-09-23T21:44:54Z","title":"Efficient $\\varepsilon$-approximate minimum-entropy couplings","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T15:44:18.550787Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2509.19598"},"observation_digest":"sha256:05f8ac69b24d31dd6fdfb448929ac94f9e5fdab70576c8de7bb2603fa5a5c00f","observation_id":"2c0c1060-368d-4c26-8e2d-616b905c14dc","resolution":{"observed_at":"2026-08-04T15:44:18.550787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","submitted_at":"2022-10-24T17:40:07Z","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling","version":4},"cited_work":{"arxiv_id":"2210.14889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14889","snapshot_observed_at":"2026-07-03T01:27:31.279667Z","title":"Perfectly secure steganography using minimum entropy coupling","venue":null,"work_id":"cf9c9b02-aef1-4506-96af-663930af90ec","year":2022},"citing_paper":{"arxiv_id":"2510.12826","last_updated":"2026-04-25T22:54:37Z","snapshot_observed_at":"2026-08-09T21:13:46.129374Z","submitted_at":"2025-10-11T04:42:29Z","title":"Scheming Ability in LLM-to-LLM Strategic Interactions","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-18T07:50:30.597108Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2510.12826"},"observation_digest":"sha256:52e0fc190c43af3eff9ff95bf05d19ad4c19d2f1c65644f09cec3d972751c01a","observation_id":"01bda9e1-8b2b-40b0-b7cf-52655e8bbe4b","resolution":{"observed_at":"2026-05-18T07:51:03.875615Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","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-02T23:21:31.882236Z","title":"Zico Kolter, Jakob Foerster, and Martin Strohmeier","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.14095","last_updated":"2026-07-06T07:40:26Z","snapshot_observed_at":"2026-08-09T00:10:29.296236Z","submitted_at":"2026-02-15T11:05:18Z","title":"NEST: Nascent Encoded Steganographic Thoughts","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T23:21:31.882236Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2602.14095"},"observation_digest":"sha256:6c885b48e633aa17d72b12e484da4abc188c739feafcf5978927ce9d72c82128","observation_id":"4c44f0ef-d1e6-45ff-9b78-93137bbc0ec7","resolution":{"observed_at":"2026-08-02T23:21:31.882236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","submitted_at":"2022-10-24T17:40:07Z","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling","version":4},"cited_work":{"arxiv_id":"2210.14889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14889","snapshot_observed_at":"2026-07-03T01:27:31.279667Z","title":"Perfectly secure steganography using minimum entropy coupling","venue":null,"work_id":"cf9c9b02-aef1-4506-96af-663930af90ec","year":2022},"citing_paper":{"arxiv_id":"2604.20269","last_updated":"2026-08-06T04:26:16Z","snapshot_observed_at":"2026-08-09T23:09:40.513376Z","submitted_at":"2026-04-22T07:12:47Z","title":"Text Steganography with Dynamic Codebook and Multimodal Large Language Model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T00:46:42.469277Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2604.20269"},"observation_digest":"sha256:597e48125edaf55cf24bd5d901e4c0a2b81ca82fefe3f61fad0f37da61f16705","observation_id":"fab8d22c-3b75-425a-af6b-a108cb89cfe4","resolution":{"observed_at":"2026-05-10T00:49:48.655757Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","submitted_at":"2022-10-24T17:40:07Z","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling","version":4},"cited_work":{"arxiv_id":"2210.14889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14889","snapshot_observed_at":"2026-07-03T01:27:31.279667Z","title":"Perfectly secure steganography using minimum entropy coupling","venue":null,"work_id":"cf9c9b02-aef1-4506-96af-663930af90ec","year":2022},"citing_paper":{"arxiv_id":"2605.16229","last_updated":"2026-05-15T17:39:57Z","snapshot_observed_at":"2026-07-06T23:27:24.957966Z","submitted_at":"2026-05-15T17:39:57Z","title":"Breaking the Finite-Sample Barrier in Entropy Coupling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T18:31:01.974268Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2605.16229"},"observation_digest":"sha256:4003728a03c4575a41d0b85173948bdd92c6aa9e86a41c65a1b29a956ed927d8","observation_id":"51207954-7e66-4637-a10a-d870d13494de","resolution":{"observed_at":"2026-05-19T18:32:43.100944Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","submitted_at":"2022-10-24T17:40:07Z","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling","version":4},"cited_work":{"arxiv_id":"2210.14889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14889","snapshot_observed_at":"2026-07-03T01:27:31.279667Z","title":"Perfectly secure steganography using minimum entropy coupling","venue":null,"work_id":"cf9c9b02-aef1-4506-96af-663930af90ec","year":2022},"citing_paper":{"arxiv_id":"2605.27593","last_updated":"2026-05-26T19:06:39Z","snapshot_observed_at":"2026-07-06T23:37:16.981482Z","submitted_at":"2026-05-26T19:06:39Z","title":"Voluntary Collusion with Secret Tools in Competing LLM Agents","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T17:01:22.732390Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2605.27593"},"observation_digest":"sha256:dbbe1e73e3add2e2233992672c8a48a111b6a7e44ef4e52222b0b6facd281a31","observation_id":"950b43ea-b446-40c3-b9e8-b2bd81c2f859","resolution":{"observed_at":"2026-06-29T17:03:40.774177Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","submitted_at":"2022-10-24T17:40:07Z","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling","version":4},"cited_work":{"arxiv_id":"2210.14889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.14889","snapshot_observed_at":"2026-07-03T01:27:31.279667Z","title":"Perfectly secure steganography using minimum entropy coupling","venue":null,"work_id":"cf9c9b02-aef1-4506-96af-663930af90ec","year":2022},"citing_paper":{"arxiv_id":"2606.09135","last_updated":"2026-06-08T07:32:44Z","snapshot_observed_at":"2026-08-09T06:30:28.441868Z","submitted_at":"2026-06-08T07:32:44Z","title":"Steganography Without Modification: Hidden Communication via LLM Seeds","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T16:31:01.499103Z"},"links":{"cited_paper":"/paper/2210.14889","citing_paper":"/paper/2606.09135"},"observation_digest":"sha256:db3691c78ddf9c4e95b35f122439a5024032f62595cf332486bae5c686c62d22","observation_id":"763b2b72-a350-41ee-9891-d798021d6660","resolution":{"observed_at":"2026-07-03T01:27:31.281106Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.14889/citation-record","integrity":"/paper/2210.14889/integrity","json":"/paper/2210.14889/citation-record.json","paper":"/paper/2210.14889"},"outbound":[],"paper":{"arxiv_id":"2210.14889","last_updated":"2023-10-30T04:33:15Z","latest_version":4,"primary_category":"cs.CR","snapshot_observed_at":"2026-07-06T14:10:47.816961Z","submitted_at":"2022-10-24T17:40:07Z","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2210.14889."}