{"as_of":"2026-08-08T00:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ce68526283d9a58a1058c9e86c3f16d45b6d36ca9fac407b0f6d2b1fb1519d9","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:47:52.011807Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.01747/citation-record","integrity":"/paper/2506.01747/integrity","json":"/paper/2506.01747/citation-record.json","paper":"/paper/2506.01747"},"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-07T11:48:08.103506Z","title":"The rate-distortion function for source coding with side information at the decoder,","venue":null,"work_id":"8f2d51b6-cab4-487d-bdf1-826dff9773b7","year":1976},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:03.035091Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:23c4f03e605eb7146828138af953a81f00597554899cc91705b60331d723b785","observation_id":"8064b234-2412-49ae-bd5e-150da7268737","resolution":{"observed_at":"2026-08-07T11:48:08.153720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:08.018326Z","title":"Quantization,","venue":null,"work_id":"a12661a3-1271-4b2c-b887-070065843408","year":1998},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.555823Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:9bd8993a5ba1c5ea418c4c58783a5228873eb5c32760caad87291fa0fdec292d","observation_id":"7762ec3d-8592-4950-893f-8db48070f180","resolution":{"observed_at":"2026-08-07T11:48:08.058875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.921724Z","title":"6g networks: Beyond shannon towards semantic and goal-oriented communications,","venue":null,"work_id":"40c9d60b-e606-4139-a04c-ca94ca08566d","year":2021},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.644244Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:47fa1aea6f65e66d663823f69f2893f54cc1ce0653e258080e24c3eee63be932","observation_id":"11808217-c5c8-484b-88c1-a851a4621075","resolution":{"observed_at":"2026-08-07T11:48:07.976627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.832156Z","title":"A rate distortion approach to goal-oriented communication,","venue":null,"work_id":"22225097-d3fe-4415-a60c-ce02b7b0bcb3","year":2022},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.692673Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:d4981756846b5480828dbc664933d12c57ec2b4fe189924879036737d1a8e6de","observation_id":"29eb24c5-bcaa-44c1-a9b1-5f51c1818d77","resolution":{"observed_at":"2026-08-07T11:48:07.873527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.738782Z","title":"Goal- oriented quantization: Analysis, design, and application to resource allocation,","venue":null,"work_id":"8eedd4b9-a3a6-44c6-9347-c0469eaca271","year":2022},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.759893Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:8eb814ce680e145393d81f881d850384bc606b70ef183211617413c2517c1871","observation_id":"5b07a7a0-9755-4822-9e1c-64ad91067a19","resolution":{"observed_at":"2026-08-07T11:48:07.778910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.646584Z","title":"Embedded sensor systems for health–a step towards personalized health,","venue":null,"work_id":"388d087c-811b-4de6-8a04-cb34a40131c8","year":2018},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.814534Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:04286eca4b33e214118c9c33029e2355ae0a95cb0e31baf5231125be460fb96d","observation_id":"ee753dbe-bf33-4520-98ff-1e51893edf7c","resolution":{"observed_at":"2026-08-07T11:48:07.681037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.550524Z","title":"On the detection capabilities of underwater distributed acoustic sensing,","venue":null,"work_id":"1543765d-f51a-46e7-a2db-6787fb168526","year":2021},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.923653Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:d7ad065014ec847731d954866d0b92a33c1a65d168b2a172711628fc066e81bd","observation_id":"ea2ce18b-147b-4309-8476-275680bf0275","resolution":{"observed_at":"2026-08-07T11:48:07.595349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.466098Z","title":"Distributed and collaborative system to improve traf- fic conditions using fuzzy logic and v2x communications,","venue":null,"work_id":"3f033e10-2930-4457-be1c-6a8688650d04","year":2024},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.991979Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:76fe5dd49aba2e55c82988ed5bf7f89ac8997b807c994b57664cd308b3f10305","observation_id":"80304c5d-2fc0-4c85-ba2a-f5841a3e7718","resolution":{"observed_at":"2026-08-07T11:48:07.503630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.365657Z","title":"Hypothesis testing with communication constraints,","venue":null,"work_id":"34a40a94-5e13-4886-b664-127ecc51da9f","year":1986},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.050066Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:c3d661fb8a7ed43a25d4c8a584c9f643acc8ca611a787c15c51d4f9e6ada6168","observation_id":"55af3313-4d19-44f6-8b8a-72b38019d8b0","resolution":{"observed_at":"2026-08-07T11:48:07.416166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.261913Z","title":"Hypothesis Testing with Multiterminal Data Compression,","venue":null,"work_id":"18bb53c9-0f07-48e9-b086-da82d3df2a73","year":1987},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.080137Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:4e9bf59ffb6cb63991e3c374eaa30a82637775ed2dafb3d2bb58e5efaafe7138","observation_id":"aefd7c43-b3d8-4ca8-bdab-9dd1769280ad","resolution":{"observed_at":"2026-08-07T11:48:07.315566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.178759Z","title":"Statistical inference under multiterminal data compression,","venue":null,"work_id":"b8ffea53-5606-4f37-a7f0-2dbf1412f4be","year":1998},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.155869Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:3687b92b22fd90a33ab538c1f91b1241e3a9b213905de919ff166bc11b14e70e","observation_id":"f9a38e71-f0a8-479d-afba-3929a01295c9","resolution":{"observed_at":"2026-08-07T11:48:07.217041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:07.126243Z","title":"Error bound of hypothesis testing with data compression,","venue":null,"work_id":"74e1a43c-4a8a-4aa7-bd24-cd45b2a8416d","year":1994},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.211678Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:367ad79fb247727d276bbc3e8d12052a3d8b0f201fbd464e09f2d2b3a33eb857","observation_id":"673cf191-948e-477d-8302-6af2ea45e9a3","resolution":{"observed_at":"2026-08-07T11:48:07.146087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:06.436931Z","title":"On the neces- sity of binning for the distributed hypothesis testing problem,","venue":null,"work_id":"069ea689-c3f1-4023-9a89-652cd88846b6","year":2015},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.272412Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:64cc41065706462148125ee67c11d453a4fa96440186788adecc82f76cac7bc7","observation_id":"f6043647-f1b6-41a9-b9e6-40be85af3ff6","resolution":{"observed_at":"2026-08-07T11:48:07.041292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:06.360822Z","title":"An information- spectrum approach to distributed hypothesis testing for general sources,","venue":null,"work_id":"69dd0589-1ebb-4dbf-87ec-f805ececba93","year":2024},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.329926Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:227ad0d03093e77ad7a0749576bafa45fa8fc0e46eaba7699c04613e386929d8","observation_id":"19ba3fdf-6e07-49da-b0a7-a0460339bdb7","resolution":{"observed_at":"2026-08-07T11:48:06.392243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14499","last_updated":"2025-08-25T09:50:05Z","snapshot_observed_at":"2026-07-06T15:46:36.421593Z","submitted_at":"2023-06-26T08:18:02Z","title":"Improved Random-Binning Exponent for Distributed Hypothesis Testing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14499","snapshot_observed_at":"2026-08-07T11:47:50.387151Z","title":"Improved random-binning exponent for distributed hypothesis testing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.387151Z"},"links":{"cited_paper":"/paper/2306.14499","citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:fc7103aac506a4ae9aca75a31be0b205b2fe097d05acffa167f1ff6873fdd1ae","observation_id":"c333e48c-b2ef-4588-9c86-3190e0fbc4c8","resolution":{"observed_at":"2026-08-07T11:47:50.387151Z","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-07T11:48:06.252787Z","title":"Distributed hypothesis testing over dis- crete memoryless channels,","venue":null,"work_id":"c101fe72-37f2-4794-84e1-fd1009d90945","year":2019},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.432288Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:8515c650605caaced11aeb4ffda5311f9621ffdff2423935fe9940b351737537","observation_id":"36a614c7-701c-4e32-a969-33d8f5df03e5","resolution":{"observed_at":"2026-08-07T11:48:06.307607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:06.133979Z","title":"Distributed hypothesis testing over multi-access channels,","venue":null,"work_id":"a5a9ff01-c4f0-4e7f-b9eb-15c41dec43bf","year":2018},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.479796Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:0e5da4056966f9714d3b5badd03e9a40eab59db32a5f3043c767c9d073f8778e","observation_id":"af14cf70-8171-4cc7-9a8a-d6f670e25d70","resolution":{"observed_at":"2026-08-07T11:48:06.184872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:06.039973Z","title":"Hypothesis testing over the two-hop relay network,","venue":null,"work_id":"3cb00794-837f-40e7-80f4-857b97e7ffaf","year":2019},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.528472Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:698c4295132028e6184c4553fb42c4d8e51d2b439f31f9853cc09835a2838dd8","observation_id":"5ddc381e-7cdc-49ff-8367-f2e608cb0f96","resolution":{"observed_at":"2026-08-07T11:48:06.075898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.938424Z","title":"Multiterminal detection with zero- rate data compression,","venue":null,"work_id":"b0816099-d9ad-4a81-81bb-cbc7ade9146c","year":1992},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.579699Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:11337dba50d28d5c165e255bac6aabfc6e6ff5bf82fa6588892ac4eafe8631b8","observation_id":"e5ff9f73-76c8-4046-9de6-e41e27645ad3","resolution":{"observed_at":"2026-08-07T11:48:05.983573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.862338Z","title":"Exponential-type error probabilities for multiterminal hypothesis testing,","venue":null,"work_id":"c5bc3a25-693b-402d-8b3b-f5b8db35927d","year":2006},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.633361Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:67e4d08db9b85369848131e8d9b850f0e74b96de8f249767e0fb5cdca290255b","observation_id":"3baecf9c-34b0-4977-a7e2-aa894d35c3be","resolution":{"observed_at":"2026-08-07T11:48:05.891668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.744447Z","title":"Statistical inference under multiterminal rate restrictions: A differential geometric approach,","venue":null,"work_id":"861dd244-ef7c-4810-89d3-666245d4703e","year":1989},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.671061Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:d6c1379d49cbdd546d65ae051aa4351900a47a1b647831c21a1ab8fa3e94c073","observation_id":"8e1119c1-925c-40c9-8dfa-28819d8642ab","resolution":{"observed_at":"2026-08-07T11:48:05.790892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.632735Z","title":"Neyman–pearson test for zero-rate multiterminal hypoth- esis testing,","venue":null,"work_id":"bdeb4b25-7591-4e90-af18-db93e3daba38","year":2017},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.721131Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:0768e77ac0e75b2a88b71177dd2cf80ceb863814b46cbc261839e4b8e460208b","observation_id":"c63ded51-bd75-4e46-8985-92a4c6339ebb","resolution":{"observed_at":"2026-08-07T11:48:05.683045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00310","last_updated":"2017-12-31T16:29:01Z","snapshot_observed_at":"2026-07-06T06:16:43.550293Z","submitted_at":"2017-12-31T16:29:01Z","title":"On Binary Distributed Hypothesis Testing","version":1},"cited_work":{"arxiv_id":"1801.00310","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.00310","snapshot_observed_at":"2026-08-07T11:47:52.132464Z","title":"On Binary Distributed Hypothesis Testing","venue":"cs.IT","work_id":"3fd9e49a-f73f-443c-8991-4877eee08ef5","year":2017},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.777564Z"},"links":{"cited_paper":"/paper/1801.00310","citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:cd88396faa9f2e9b0859e6e85d808cf1664a192e018ba91c2a1e74d2b8af6358","observation_id":"99322efd-fcdd-4ff9-91a3-98a84e5256a9","resolution":{"observed_at":"2026-08-07T11:47:52.181911Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.550028Z","title":"Binary quantization using belief propagation with decimation over factor graphs of LDGM codes,","venue":null,"work_id":"3b7ea0bc-dccd-43b1-a45f-26ef4168db3b","year":2007},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.853362Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:8bcbdf7af3ac22f2749829efc5b8383452f44a79e2756f3a3c2d5fcc75c61099","observation_id":"c87381ec-1d12-43c4-980c-60f4f7367539","resolution":{"observed_at":"2026-08-07T11:48:05.592851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.454174Z","title":"Distributed source coding for sensor networks,","venue":null,"work_id":"4f927916-a35b-4a97-9526-2f61c2466af9","year":2004},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.885418Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:da7bb23c71ac813850518af718e9ac4638822ec66462b49f9d2f25e3606633b3","observation_id":"9ee136fb-c5ab-4c2a-88c1-7e82734fd0a0","resolution":{"observed_at":"2026-08-07T11:48:05.497070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.353045Z","title":"Compression of binary sources with side information at the decoder using LDPC codes,","venue":null,"work_id":"3c7e2cb8-7f33-486e-a5e8-13f121bbbcee","year":2002},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.919383Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:46b0abf07af811f011b378b62ba3a4fb8a4d713c6c9dfcd0f300e89e63b088eb","observation_id":"41247783-8bc2-4641-9e84-72a26e710ec1","resolution":{"observed_at":"2026-08-07T11:48:05.399598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.252406Z","title":"Improved decoding for binary source coding with coded side information,","venue":null,"work_id":"2fe76d1a-4e85-4ce1-92c8-9ee11915ebbc","year":2013},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.960994Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:ecdfcee679d3f98bcc261b771f446f9b0e8f45613a0d7991f2cb3b50497f9436","observation_id":"d7db0a3b-55cd-476a-b6f4-ebbb05d3be3c","resolution":{"observed_at":"2026-08-07T11:48:05.279919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.165340Z","title":"Optimized rate-adaptive protograph-based LDPC codes for source coding with side information,","venue":null,"work_id":"700d86a8-3300-4589-8923-aee8d98c04d1","year":2019},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.047011Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:e6584961c0e1c72287e9413b5045f9b0258e02c905956fb37f7fec756e7cb3da","observation_id":"72e775bd-95ad-46d5-b875-e0213b65289f","resolution":{"observed_at":"2026-08-07T11:48:05.191289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:05.066562Z","title":"Low-density graph codes that are optimal for binning and coding with side information,","venue":null,"work_id":"4dd4185d-e629-49ec-9646-3260ad9c3077","year":2009},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.135617Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:2816073276931b9125b3e2169eeec703d74961acaf9684531902910a00ad9805","observation_id":"7fa3b610-20f6-4582-b2f2-ffb8fd2a290e","resolution":{"observed_at":"2026-08-07T11:48:05.111914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.982899Z","title":"A coding theorem for lossy data com- pression by LDPC codes,","venue":null,"work_id":"8eb72139-e514-4ee4-a3ea-b9a4ac5266c5","year":2003},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.228905Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:5c5e50ea6bfc7bfedd39a2124c7bfd10dbacca26e1c9be14c06e8f72025b8ded","observation_id":"7a01ac1b-814d-4720-9c9e-639629bdef7f","resolution":{"observed_at":"2026-08-07T11:48:05.011405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.879328Z","title":"Lossy source compres- sion using low-density generator matrix codes: Analysis and algorithms,","venue":null,"work_id":"e3207f65-6060-4f72-bd4e-6bf07390b830","year":2010},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.323334Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:5baeec02ba441515ebac92f054146cdf567058bca781a4984048f3622ae6895a","observation_id":"61b5e8ff-bcb7-495e-b937-bab3c605ddb4","resolution":{"observed_at":"2026-08-07T11:48:04.924242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.802632Z","title":"Lossy source coding using belief prop- agation and soft-decimation over LDGM codes,","venue":null,"work_id":"a958feea-32fc-4c97-9615-598fc8c0e952","year":2010},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.443015Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:6b583ddf8d543113b7b0cba8a34655b1554efcb05e4e79ca63d36822fca1fb37","observation_id":"5011a3df-69e2-4015-979b-e8d89afa6962","resolution":{"observed_at":"2026-08-07T11:48:04.829785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.748008Z","title":"Binary Wyner–Ziv code design based on compound LDGM–LDPC structures,","venue":null,"work_id":"dcca04ac-28e5-45c5-8530-bdcce2e61b02","year":2018},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.550076Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:0195fbbfdd62d561b69859872b941213d79c8499378c88c53ebdaab46b4f4445","observation_id":"23ceb901-9996-4cbe-8aa8-daded544be0b","resolution":{"observed_at":"2026-08-07T11:48:04.764744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.695850Z","title":"Transmission of noisy information to a noisy receiver with minimum distortion,","venue":null,"work_id":"1c192fc2-2c62-432b-b962-ef09409a6d0a","year":1970},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.598018Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:937c725aa77c32d8a36a6d1eeb7862ee05872a4d3f89178bf88eecfad5c7d274","observation_id":"02927c2c-513d-4439-a727-2c28b45a4795","resolution":{"observed_at":"2026-08-07T11:48:04.715411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.627398Z","title":"A rate-distortion framework for characterizing semantic information,","venue":null,"work_id":"9a7ba3c7-687e-4a2e-8437-0fe809686ce3","year":2021},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.749812Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:116567248ee3e19ac673c515dbfcba4cebe6fcb0fa890736e72ab8d855ac5e4a","observation_id":"18f8a937-dd33-40f3-afda-c0963350485d","resolution":{"observed_at":"2026-08-07T11:48:04.649837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.548730Z","title":"Distributed Binary Detection with Lossy Data Compression,","venue":null,"work_id":"25cf485d-9833-4452-912c-ca4a2fcd1df0","year":2017},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.786259Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:aa4ca7cf344520b4f2f9401bfb5e0f84295a87618fa04b901f47b6ede7fa929a","observation_id":"1d4585ed-a7d2-41d7-831c-217643627658","resolution":{"observed_at":"2026-08-07T11:48:04.578979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.480820Z","title":"On the optimality of binning for distributed hypothesis testing,","venue":null,"work_id":"c81a2ed7-484d-402d-83eb-8c6cb8b5f1fd","year":2012},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.814358Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:dfc6a4ed940a81b722a919e0d03cdc37e182011dba400b45af7bb4676964b5cf","observation_id":"4c86251c-b83a-447d-b175-43b7bc58fe4b","resolution":{"observed_at":"2026-08-07T11:48:04.501095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.420788Z","title":null,"venue":null,"work_id":"f6e9cb9f-914e-4cff-96ef-b9f92697e420","year":2005},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.838898Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:6f1381a9eda10cc507cf3af9fb4afee5293a86c75517f05cef2077c23f0b4479","observation_id":"739ba4e0-38c5-4484-9658-6b8854ac8a98","resolution":{"observed_at":"2026-08-07T11:48:04.442133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.381972Z","title":"Information embedding codes on graphs with iterative encoding and decoding,","venue":null,"work_id":"0d5f205e-d5a0-40fe-a01c-592b862bedcd","year":2006},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.887785Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:fb59dd41f039d02ab63a49d284dffbbda9cb19578e760716e5be5b9cb9688e17","observation_id":"3e545f2b-d300-4f9c-bb2b-e3578fdb63f7","resolution":{"observed_at":"2026-08-07T11:48:04.395408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.327932Z","title":"Richardson and R","venue":null,"work_id":"e9c89fd3-8dd3-4f79-8871-2192ee498f6b","year":2008},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.928739Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:1bbded3f7bfd92bb2fd46cf8eaeec06a85946a2ce40298dcaceaeee63199c9c1","observation_id":"5409ae96-cb16-4d1e-86ec-82b29cc16438","resolution":{"observed_at":"2026-08-07T11:48:04.349851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:48:04.288949Z","title":"Ryan and S","venue":null,"work_id":"edee516c-80b6-4fed-883e-c6fb992dde7f","year":2009},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:51.972115Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:f9c5edebe17b60001cb3f4d955afba2e6ca9890a4217200bcc1ea690573eac43","observation_id":"f1fced52-d4a7-47ad-a1db-73ec1f57085a","resolution":{"observed_at":"2026-08-07T11:48:04.299573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:47:52.338635Z","title":"Covering codes as near-optimal quantizers for distributed hypothesis testing against independence,","venue":null,"work_id":"f8be2a17-628d-4d03-94e7-d2d760c0f94c","year":2024},"citing_paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:52.011807Z"},"links":{"citing_paper":"/paper/2506.01747"},"observation_digest":"sha256:7e24384284632c87c408e4ca7febf14d3ccc699c3836014fd0df25a66cec2684","observation_id":"d3947680-8535-4416-b102-d8539d347194","resolution":{"observed_at":"2026-08-07T11:48:04.254093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01747","last_updated":"2025-06-02T14:53:56Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T11:32:09.246685Z","submitted_at":"2025-06-02T14:53:56Z","title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":39},"total_outbound_references":42},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2506.01747."}