{"as_of":"2026-08-14T07:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04620363ad89740de574ef6b405343411603d61cd5e4556f8b1e2e565314fd48","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:29:08.674520Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-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/2412.11091/citation-record","integrity":"/paper/2412.11091/integrity","json":"/paper/2412.11091/citation-record.json","paper":"/paper/2412.11091"},"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-11T15:29:09.712035Z","title":"Identification is easier than decoding","venue":null,"work_id":"453ae869-b3c0-48d0-87c9-6b57e3961032","year":1985},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.376389Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:b33952c8eca015f6421936073dc9cdd4d2c1fa7824030e0d78e0490c1821c99d","observation_id":"b0f98cfa-fa5b-40be-aa78-66bd48154f65","resolution":{"observed_at":"2026-08-11T15:29:09.718751Z","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-11T15:29:09.686763Z","title":"Identification via channels.IEEE Transactions on Information Theory, 35(1):15–29, 1989","venue":null,"work_id":"92bd1f37-1019-405e-9a69-fe3448d08adb","year":1989},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.382989Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:a5f7c0d08ae1c6036cc8eb51251bae46305cd4bc4e48892d400abe4ef1a0d174","observation_id":"38a12824-5b98-4172-81a2-4e2feee5e4d8","resolution":{"observed_at":"2026-08-11T15:29:09.699020Z","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-11T15:29:09.667379Z","title":"Identification in the presence of feedback-a discovery of new capacity formulas.IEEE Transactions on Information Theory, 35(1):30–36, 1989","venue":null,"work_id":"df43bfa5-79b0-48ef-9972-661cb8658c5e","year":1989},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.390841Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:233a9dca2a7b030e840fc85204a29c7c2c10eb06f2c3edfa0a57bee0e450f6c6","observation_id":"74016a3c-a63d-4e67-b265-70250c9c2309","resolution":{"observed_at":"2026-08-11T15:29:09.672336Z","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-11T15:29:09.648664Z","title":"New results in the theory of identification via channels.IEEE transactions on information theory, 38(1):14–25, 1992","venue":null,"work_id":"5f0e9296-ce26-44f9-841d-45f8402ce73a","year":1992},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.398602Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:c31e316c225664b20a706362659b71cf88d321b53b496d5bd712615c092f9543","observation_id":"0381ace8-15a2-4dbf-9236-f6c8204cc150","resolution":{"observed_at":"2026-08-11T15:29:09.655359Z","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-11T15:29:09.628120Z","title":"Approximation theory of output statistics.IEEE Transactions on Information Theory, 39(3):752–772, 1993","venue":null,"work_id":"2fd02b38-0af9-437b-a870-b967194e33e5","year":1993},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.405592Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:c16e8d0b3cc77d30e8babeff62dd8bb73d7195ccaf316e7b68bf9701bb341019","observation_id":"badc219b-fd48-4c7d-a0e4-e9986344295b","resolution":{"observed_at":"2026-08-11T15:29:09.635770Z","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-11T15:29:09.603948Z","title":"New converses in the theory of identification via channels.IEEE Transactions on Information Theory, 44(3):984–998, 1998","venue":null,"work_id":"1d039a1c-a902-4c1c-8b85-be46da67ce51","year":1998},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.411996Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:24d4b58683763fcdcb141b19830cd2a4b5f5e202f6bd574000b7eed96add07a0","observation_id":"57fc3532-5954-4c8b-b6f7-9f62ecf847b7","resolution":{"observed_at":"2026-08-11T15:29:09.612439Z","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-11T15:29:09.582172Z","title":"Minimax converse for identification via channels.IEEE Transactions on Information Theory, 68(1):25–34, 2021","venue":null,"work_id":"18663497-9fd9-4732-89d7-5f53e30993db","year":2021},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.420115Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:cb57084a7bf923c480af1cf7b182ff4227dc1920241c5eb2bf84f9351ec533b7","observation_id":"e116bd65-748f-4cb6-ab00-116b6864aec3","resolution":{"observed_at":"2026-08-11T15:29:09.590043Z","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-11T15:29:09.559691Z","title":"Springer Science & Business Media, 2002","venue":null,"work_id":"071b6588-4b84-4b8d-9145-91fb3b2588dc","year":2002},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.427866Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:691f0d5fec4eb524dc656f593544c43453bec0e3ee49a31c44c6424c86535183","observation_id":"326a8375-e379-4b09-ba44-4726e1ce3035","resolution":{"observed_at":"2026-08-11T15:29:09.568592Z","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-11T15:29:09.528318Z","title":"New directions in the theory of identification via channels.IEEE transactions on information theory, 41(4):1040–1050, 1995","venue":null,"work_id":"8f824b15-92e2-4b5d-b33e-289d970cdc04","year":1995},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.440692Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:e3ce2efd56cb7ac9ea9d83b42266d4a46fec601831f084dae38abaebb6ffc8c3","observation_id":"f597e5ae-0c76-46c5-8991-9bd55a200670","resolution":{"observed_at":"2026-08-11T15:29:09.537193Z","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":"2310.16217","last_updated":"2023-10-24T22:18:12Z","snapshot_observed_at":"2026-08-13T05:41:08.912503Z","submitted_at":"2023-10-24T22:18:12Z","title":"Information-Theoretically Secret Reed-Muller Identification with Affine Designs","version":1},"cited_work":{"arxiv_id":"2310.16217","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.16217","snapshot_observed_at":"2026-08-11T15:29:08.817895Z","title":"Information-Theoretically Secret Reed-Muller Identification with Affine Designs","venue":"cs.IT","work_id":"d210b038-ea41-4d30-9ac7-d6b4916da5c7","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.448823Z"},"links":{"cited_paper":"/paper/2310.16217","citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:18bb1a9a78eb0fcae79409ef9492ce25d1cc526a6eec9c388f92d758f08538d3","observation_id":"eb463295-d78b-481c-9648-fb9fe43e3ab0","resolution":{"observed_at":"2026-08-11T15:29:08.826331Z","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-11T15:29:09.505917Z","title":"Capacity bounds for identification with effective secrecy","venue":null,"work_id":"6f9c170e-9f8e-4197-9c37-462e9e447161","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.455485Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:0fa209120ed3c228db1b4a1d8dd55f8b7668983d80a3de02b5e787a9dff4c08e","observation_id":"9094bd19-012a-4ea8-9135-a5185d8358dd","resolution":{"observed_at":"2026-08-11T15:29:09.512263Z","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-11T15:29:09.485757Z","title":"Identification via the broadcast channel.IEEE Transactions on Information Theory, 63(6):3480–3501, 2017","venue":null,"work_id":"2c5d6910-e3bc-4915-839a-54300877c49e","year":2017},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.465312Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:6c231aa0244d321ec1406338d28055d9832e0b5d9386ddce74b7ee01d7b3618d","observation_id":"c0465270-74c0-4ace-9bc1-4b65bb81fd34","resolution":{"observed_at":"2026-08-11T15:29:09.491479Z","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-11T15:29:09.451688Z","title":"Identification over compound multiple-input multiple-output broadcast channels","venue":null,"work_id":"57f66005-2297-4dd5-8a6d-963dcb351aa5","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.473827Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:c29a87565312c45c3a660f12d8c2facdf8e0fe87ae291b483378579fb95ebaaf","observation_id":"c0db594a-3816-423c-8260-b42cbef57545","resolution":{"observed_at":"2026-08-11T15:29:09.462709Z","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-11T15:29:09.431119Z","title":"On identification via multiway channels with feedback.IEEE transactions on information theory, 37(6):1519–1526, 1991","venue":null,"work_id":"7c032ca7-dba6-41b5-9586-76c7e14d4447","year":1991},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.480081Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:fcd526d98f205cb681e756fe21cb8560320aa838eb5542a5faa18a37d0d5309f","observation_id":"c8cc5325-edce-43b5-bea4-4156e3bd5ac5","resolution":{"observed_at":"2026-08-11T15:29:09.438525Z","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-11T15:29:09.409207Z","title":"Deterministic identification over fading channels","venue":null,"work_id":"6573d1fa-7435-4603-b817-acb8b0b299b9","year":2021},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.486743Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:fd1fbcdf4a41cd2b228cf5f7675038d6dd68a5b485b7c96d787b8e5a9e119423","observation_id":"d751665b-ec13-4707-866f-746f92a77886","resolution":{"observed_at":"2026-08-11T15:29:09.416018Z","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-11T15:29:09.388015Z","title":"Identification over the gaussian channel in the presence of feedback","venue":null,"work_id":"572fb1c2-2315-4ef1-927e-6b7291a8246f","year":2021},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.492125Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:9d7023d03d739c0c17f7b77051ef7b05c7b54b1260b643252b5f157875f7c902","observation_id":"a88a6a88-97f5-4479-b3fa-edd16b3d37cf","resolution":{"observed_at":"2026-08-11T15:29:09.394177Z","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-11T15:29:09.369806Z","title":"Identification without randomization.IEEE Transactions on Information Theory, 45(7):2636–2642, 1999","venue":null,"work_id":"9d96fa0b-3366-4051-b834-ec90d32ff0bf","year":1999},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.497939Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:ee0878e6e3f4116eb8ff43c00934c16e330a10d9a7010083b8b3cfa89c32dab2","observation_id":"74becff0-4942-4072-bb2f-832bc951275d","resolution":{"observed_at":"2026-08-11T15:29:09.375231Z","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-11T15:29:09.351671Z","title":"Identification over additive noise channels in the presence of feedback","venue":null,"work_id":"285b89c7-bf6a-49df-9904-c55bf8e4aab5","year":2022},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.503452Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:aef8488d3854556fae8813e6c25854665d00556ebf6bb803a545998dd4b9603b","observation_id":"1da05499-8924-4659-bd96-5cbf82878d49","resolution":{"observed_at":"2026-08-11T15:29:09.357502Z","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-11T15:29:09.324308Z","title":"Deterministic identification over channels with power constraints.IEEE Transactions on Information Theory, 68(1):1–24, 2021","venue":null,"work_id":"8d0f3ac9-393e-437d-9b96-0988188e478d","year":2021},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.509339Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:27b0198bfafeae544f5c7c73e2d7b7f4a61a52a6d2762a5057b7614b36023a79","observation_id":"6c82c6a2-38cd-458e-84d8-1fedacbd081d","resolution":{"observed_at":"2026-08-11T15:29:09.330298Z","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-11T15:29:09.304388Z","title":"Deterministic identification for molecular communications over the poisson channel.IEEE Transactions on Molecular, Biological and Multi-Scale Communications, 2023","venue":null,"work_id":"aaa8018a-2074-49d1-a6a2-f665839520d5","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.514916Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:73162244d65444da12f0d755e6bd01e13de67e52a2b6422ad0e97ab549e83838","observation_id":"13ee4a3c-6557-476b-9b91-c4c817e5861a","resolution":{"observed_at":"2026-08-11T15:29:09.309901Z","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-11T15:29:09.286030Z","title":"Coding theorems for noisy permutation channels.IEEE Transactions on Information Theory, 66(11):6723–6748, 2020","venue":null,"work_id":"24826ca5-57a3-4d50-a550-fd08bb50348f","year":2020},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.520049Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:59220e05b24b9a4c08aefc4fdcfecc450231b112e9aee7c7e8df675129c1d281","observation_id":"7f2d52f4-b6b6-4646-850d-de0707ba8160","resolution":{"observed_at":"2026-08-11T15:29:09.292243Z","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-11T15:29:09.268559Z","title":"A theory of goal-oriented communication.Journal of the ACM (JACM), 59(2):1–65, 2012","venue":null,"work_id":"483657c2-b3be-41a4-be8c-33fdb7fcf55f","year":2012},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.525680Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:fa928847bcbdc5b3f1ce0346700808753ce11ace678e99b565c8935b2dc826cb","observation_id":"062ab209-22ae-428f-bf7e-efbac2e136be","resolution":{"observed_at":"2026-08-11T15:29:09.274692Z","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-11T15:29:09.250622Z","title":"Binary codes for packet error and packet loss correction in store and forward","venue":null,"work_id":"8dd95152-fa9f-4c0e-ae19-239ed6eeb109","year":2010},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.533019Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:989f834ff1bf7b3ca0f194682a38aaa9f7688a50f602f933ac7aa26ef6a0c35d","observation_id":"079c8ee5-b96a-45ad-a3ea-57b38bfef562","resolution":{"observed_at":"2026-08-11T15:29:09.257099Z","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-11T15:29:09.226231Z","title":"Optimal rate–delay tradeoffs and delay mitigating codes for multipath routed and network coded networks.IEEE Transactions on Information Theory, 55(12):5491–5510, 2009","venue":null,"work_id":"369efdac-c788-42f7-903d-994cbc6338b4","year":2009},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.539881Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:a9fc64e1bb81f27076b4989aa8554a945cffcdda58a8a4869c8fa16baf1c69e3","observation_id":"16648aab-26d0-4692-82e6-8b20a436df6f","resolution":{"observed_at":"2026-08-11T15:29:09.234262Z","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-11T15:29:09.197077Z","title":"Perfect codes in the discrete simplex.Designs, Codes and Cryptography, 75:81–95, 2015","venue":null,"work_id":"44fcf99d-d097-4e49-8454-6f28da8e701b","year":2015},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.547233Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:850f88474a86b2067de3cdd8651825c62a79ffa91e4dc56efc6ab199d600daf3","observation_id":"61656c9d-cc66-463e-b431-34d2d9148361","resolution":{"observed_at":"2026-08-11T15:29:09.205171Z","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-11T15:29:09.170727Z","title":"Codes in the space of multisets—coding for permutation channels with impairments.IEEE Transactions on Information Theory, 64(7):5156–5169, 2018","venue":null,"work_id":"ebf3cd75-9948-46f2-9493-996259a08aac","year":2018},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.554556Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:878584326b2bc44ba0b4fbf3e47257f443bf2bc8ad7c425e2f5508a0ef754425","observation_id":"e74f7121-dd10-46c1-8783-4130e0214987","resolution":{"observed_at":"2026-08-11T15:29:09.181136Z","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-11T15:29:09.142365Z","title":"Fundamentals of molecular information and communication science.Proceedings of the IEEE, 105(2):306–318, 2016","venue":null,"work_id":"569ca0d6-68d3-49f6-ab35-b4a159ff8915","year":2016},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.561403Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:7bf87d68ceb98c1d3d5388ee4600a15ed3c46d99e402c166999513670371470f","observation_id":"bea170e5-8907-4b2c-828a-2dcac8652596","resolution":{"observed_at":"2026-08-11T15:29:09.149145Z","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-11T15:29:09.120669Z","title":"Fundamentals of diffusion-based molecular communication in nanonetworks.Foundations and Trends® in Networking, 8(1-2):1–147, 2014","venue":null,"work_id":"02a270f8-461e-43b9-a269-5a78acc13c41","year":2014},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.571312Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:933842b5bbd08900a6d4b742e49e33edd608bc73947c8edfc92c40e79d3d07d9","observation_id":"de25a80b-9a6e-47af-af27-a01e2b901fa2","resolution":{"observed_at":"2026-08-11T15:29:09.126830Z","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":"2310.01729","last_updated":"2023-10-03T01:44:24Z","snapshot_observed_at":"2026-08-13T05:58:47.864754Z","submitted_at":"2023-10-03T01:44:24Z","title":"Error Correction for DNA Storage","version":1},"cited_work":{"arxiv_id":"2310.01729","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01729","snapshot_observed_at":"2026-08-11T15:29:08.790868Z","title":"Error Correction for DNA Storage","venue":"cs.IT","work_id":"9638bc34-1d7c-4eba-bd59-509226b43bd9","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.581758Z"},"links":{"cited_paper":"/paper/2310.01729","citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:96e77273d3fda7070d62e5922dab0c84267584a548571dfa3858d07212328402","observation_id":"31749b64-e575-4088-850b-1b321a462c25","resolution":{"observed_at":"2026-08-11T15:29:08.796882Z","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":{"arxiv_id":"2308.07793","last_updated":"2023-08-15T14:17:35Z","snapshot_observed_at":"2026-08-13T10:34:15.692703Z","submitted_at":"2023-08-15T14:17:35Z","title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions","version":1},"cited_work":{"arxiv_id":"2308.07793","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.07793","snapshot_observed_at":"2026-08-11T15:29:08.755929Z","title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions","venue":"cs.IT","work_id":"bcfbb2ac-4baf-4a04-abe9-f020fafdcc57","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.590000Z"},"links":{"cited_paper":"/paper/2308.07793","citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:cb689567a136290a62450b4088525fbd0876bf6957dbae13d2e3b7bc1ae97833","observation_id":"9b8b1739-065c-409f-b47e-dd9d4308c7fc","resolution":{"observed_at":"2026-08-11T15:29:08.764461Z","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-11T15:29:09.089221Z","title":"Information-theoretic foundations of dna data storage.Foundations and Trends® in Communications and Information Theory, 19(1):1–106, 2022","venue":null,"work_id":"65e0e4df-33ee-48f7-b32a-8849883cd41b","year":2022},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.597419Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:395a9b34e318cb593aed55aa1a2d7f6f9f3a03e9991510c95a6894b8a327bf10","observation_id":"6a7d1cb6-c8a4-4121-aced-d50ba3dd918b","resolution":{"observed_at":"2026-08-11T15:29:09.098949Z","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-11T15:29:09.068462Z","title":"Coding for thel 8-limited permutation channel.IEEE Transactions on Information Theory, 63(12):7676–7686, 2017","venue":null,"work_id":"4f5368bd-58cf-4465-95d1-57b7eb35f956","year":2017},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.603042Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:f7e8dd24196f0006421c8202d7167b7ff1869fb22f95faf63dd806e5e0a5351a","observation_id":"d4c68e5b-47eb-4287-9058-bb6e13539be2","resolution":{"observed_at":"2026-08-11T15:29:09.075524Z","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-11T15:29:09.045724Z","title":"String concatenation construction for chebyshev permutation channel codes","venue":null,"work_id":"1d8428e8-abc1-40bf-9231-6f49008a3f9a","year":2016},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.607702Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:0e9a6204d89fe0b36d252afc512950836869269d08cfeff0c16529930d21cb7f","observation_id":"5c31b580-e83f-4ed5-a346-b51b6c419f5c","resolution":{"observed_at":"2026-08-11T15:29:09.053411Z","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-11T15:29:09.024582Z","title":"Capacity of noisy permutation channels.IEEE Transactions on Information Theory, 2023","venue":null,"work_id":"f20f3a82-5baf-470f-9f38-7e5112d9637b","year":2023},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.616460Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:bca1ffd68be99cb49a19c9b15fe54bc7adb9c8217b85b98e72910cae5865511d","observation_id":"01cca7ed-29c9-47b5-8ada-178be77276d9","resolution":{"observed_at":"2026-08-11T15:29:09.031766Z","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-11T15:29:09.004686Z","title":"The bee-identification problem: Bounds on the error exponent.IEEE Transactions on Communications, 67(11):7405–7416, 2019","venue":null,"work_id":"ff39c194-8c43-4aef-9abb-6c9e5fcc1cd7","year":2019},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.623398Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:462ea0304c82a94b9d3f727e823d6c7b624cfa83700b482bd0124ec2d34cc77e","observation_id":"060b7dc3-66ed-4838-bedb-7d7ab8530525","resolution":{"observed_at":"2026-08-11T15:29:09.011624Z","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-11T15:29:08.980933Z","title":"The bee-identification error exponent with absentee bees.IEEE Transactions on Information Theory, 66(12):7602–7614, 2020","venue":null,"work_id":"a83032f8-0e11-40aa-8c69-3ac1b0b26075","year":2020},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.629961Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:13161f228165f4aaf9955598660ba254cf18d575a4cbb3143f90f8af0c257436","observation_id":"437f1429-0e07-4e47-a513-7f48b4d0fb48","resolution":{"observed_at":"2026-08-11T15:29:08.988309Z","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":"2405.09309","last_updated":"2024-09-20T07:05:35Z","snapshot_observed_at":"2026-08-13T00:07:15.698649Z","submitted_at":"2024-05-15T13:07:35Z","title":"Identification over Permutation Channels","version":3},"cited_work":{"arxiv_id":"2405.09309","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.09309","snapshot_observed_at":"2026-08-11T15:29:08.719122Z","title":"Identification over Permutation Channels","venue":"cs.IT","work_id":"8a262aed-936a-454a-92df-dcb79fd3353e","year":2024},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.635874Z"},"links":{"cited_paper":"/paper/2405.09309","citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:b7a18f34480013d74cb9303d3afac130a8caf79d45f46337ddb186824864b3a7","observation_id":"3c16ce9f-7dfa-493e-8568-0c2088839adc","resolution":{"observed_at":"2026-08-11T15:29:08.726867Z","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-11T15:29:08.948606Z","title":"Identification via binary uniform permutation channels","venue":null,"work_id":"75e3b5bc-e014-40b6-bbd4-dff150fd2d6f","year":2024},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.642475Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:10c8be59678945309978a27c92a0b04e9656262c8a49fbf69b03b9fa73e1d53f","observation_id":"c03131ef-81fc-4c05-84ab-a8d821c22f3a","resolution":{"observed_at":"2026-08-11T15:29:08.961034Z","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-11T15:29:08.926724Z","title":"Optimal quantization for distribution synthesis.IEEE Transactions on Information Theory, 62(11):6162–6172, 2016","venue":null,"work_id":"a76bf736-9eec-4611-9e98-0cbd7542b436","year":2016},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.646824Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:422cdcb5a15623599b2d350860a899fdab6574f8d27a61f9de4417e75e978e1c","observation_id":"dda20a78-95d2-407f-bf42-d37f1f3c5598","resolution":{"observed_at":"2026-08-11T15:29:08.933521Z","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-11T15:29:08.907083Z","title":"PhD thesis, Massachusetts Institute of Technology, 2022","venue":null,"work_id":"1a440561-0b40-47cb-9267-4e3264e4093d","year":2022},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.652397Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:3aa599798b7017fcffa1324c908346b40099ef0471d6aa09de1e063c0cee2f52","observation_id":"d028f578-a88b-40fb-9941-e2a126e7b32e","resolution":{"observed_at":"2026-08-11T15:29:08.911981Z","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-11T15:29:08.889815Z","title":"Some results for discrete unimodality.Journal of the American Statistical Association, 66(334):386–389, 1971","venue":null,"work_id":"89401895-d102-4b18-aa1a-7257d08366f8","year":1971},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.657446Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:db5e4dd887485a431c2edf1c81a771465271d214d509d5c29f38817d5ab47490","observation_id":"124c1427-8ab8-4983-a679-d6c6ed01dfe9","resolution":{"observed_at":"2026-08-11T15:29:08.894992Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:29:08.662666Z","title":"John Wiley & Sons, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.662666Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:1feb202503b7d1f1c6e62bb01b7278de571c6e9c9d6b20ac276caad6bf0a496f","observation_id":"00ec0230-033e-4865-881e-3bb22d8247b0","resolution":{"observed_at":"2026-08-11T15:29:08.662666Z","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-11T15:29:08.857539Z","title":"An introduction to probability theory and its applications, 1958","venue":null,"work_id":"4e72f8ec-88f0-4a0a-977c-55965fc2790e","year":1958},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.668553Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:ea383031a91dde68f9f51909c980416c90882363637a67613e7dd616819ff78c","observation_id":"f94b9a5e-f6ae-4e22-a483-5a2f3be13644","resolution":{"observed_at":"2026-08-11T15:29:08.864336Z","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-11T15:29:08.839417Z","title":"We consider two cases: Case I(t j“0,@jPrk`1 :qs) : For anypt 1,","venue":null,"work_id":"5b429801-2434-481d-b2c5-eebf1e0df7f8","year":null},"citing_paper":{"arxiv_id":"2412.11091","last_updated":"2025-06-17T07:38:37Z","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T15:29:08.674520Z"},"links":{"citing_paper":"/paper/2412.11091"},"observation_digest":"sha256:a02b3c9c36678eb8596bebd036182ce984fdd18f27e20c69c1f2b0c7eb1e4445","observation_id":"3f9fba4e-1784-448a-ac07-5634fd30962b","resolution":{"observed_at":"2026-08-11T15:29:08.844452Z","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":"2412.11091","last_updated":"2025-06-17T07:38:37Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-11T21:50:53.355131Z","submitted_at":"2024-12-15T07:22:06Z","title":"Identification Over Noisy Permutation Channels"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":39},"total_outbound_references":44},"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 14 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2412.11091."}