{"as_of":"2026-08-12T21:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96c4801c422737a2df7497d6791ee384c5c8409646d2eed8ef1bfa3708023716","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:03:52.828570Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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.12924/citation-record","integrity":"/paper/2506.12924/integrity","json":"/paper/2506.12924/citation-record.json","paper":"/paper/2506.12924"},"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-07T01:04:00.086056Z","title":"Abdel-Ghaffar, R","venue":null,"work_id":"2469a36b-39f0-4054-82ae-a287692b2669","year":1986},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:49.594759Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:daf8ab40c74072f39e7e0d1488dd0d12fd4e0e8157318dd038a584d9c6e7953d","observation_id":"f0d3f52b-d057-4965-aab4-954419b60c91","resolution":{"observed_at":"2026-08-07T01:04:00.166773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:59.947509Z","title":null,"venue":null,"work_id":"4367fa6b-6ece-4c74-9951-eecd9b7b933a","year":1988},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:49.673623Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:75a8cbeaf9f4a8cc874066e5b4eb07aed9ed8d55cb98cbfe701c11c5e810abff","observation_id":"e5711cd5-55af-47d5-965d-0b2fab8b2287","resolution":{"observed_at":"2026-08-07T01:04:00.013471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:59.778629Z","title":"Abu-Sini and E","venue":null,"work_id":"9f6ce60c-ec1b-4e79-ad0a-eee522d400d0","year":2021},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:49.771607Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:f1475c98627164fa546f5a633a4e2b9ad43421d129c20b037e31e3422862ee39","observation_id":"cec12dd8-bb41-4e7b-86e3-63c50d04324e","resolution":{"observed_at":"2026-08-07T01:03:59.850414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:59.645127Z","title":"Ahlswede, N","venue":null,"work_id":"1f1ee807-c038-454e-94df-0c17ce9a21d0","year":1992},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:49.858205Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:8a7ddd3f8d812046a691e08e9fb16f7c4fbe49ab68463592984ce5f8ad20ec46","observation_id":"e4f8920f-271d-4b31-ad4a-8b9f31f55b8e","resolution":{"observed_at":"2026-08-07T01:03:59.710662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:59.473482Z","title":"Ahlswede and L","venue":null,"work_id":"3dca4019-f74b-4fbc-b218-f62840b552b5","year":1998},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:49.957094Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:be289dd448336ca32b010aac0d4420a8e1ed1c4c99980615dadc897eb66f5e1f","observation_id":"90bdea74-16c1-4f61-8f4c-5f806f9bdfd8","resolution":{"observed_at":"2026-08-07T01:03:59.564300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:59.327931Z","title":"Blaum, P","venue":null,"work_id":"a1685148-5412-4d26-b7af-5a3718482df6","year":1988},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.051304Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:d0c068b7c15bcc4624ad3646b1a5cd31c902e7c8d9e1506817d82233ba446cce","observation_id":"564938bc-081e-4389-b52d-76a93703a414","resolution":{"observed_at":"2026-08-07T01:03:59.390815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:59.198410Z","title":null,"venue":null,"work_id":"4cbac414-0c34-4489-a4b1-65d2fd8089b4","year":2021},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.161030Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:b254ed53c19e940eaa84e988c361b5de11c2cfec72b6cc46db248429f2bf90c7","observation_id":"4c08a3ee-89b4-4f74-9e29-b7a6036396cd","resolution":{"observed_at":"2026-08-07T01:03:59.251980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10026","last_updated":"2023-12-15T18:46:48Z","snapshot_observed_at":"2026-08-09T21:10:55.220532Z","submitted_at":"2023-12-15T18:46:48Z","title":"A new lower bound for sphere packing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10026","snapshot_observed_at":"2026-08-07T01:03:50.282301Z","title":"Campos, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.282301Z"},"links":{"cited_paper":"/paper/2312.10026","citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:7f50d18b86741899513d6cc8a1c07d32a5487b10afe5871655ea062560dcad24","observation_id":"b25fe724-b028-4dbd-831a-dd9ddb93b607","resolution":{"observed_at":"2026-08-07T01:03:50.282301Z","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-07T01:03:59.013032Z","title":null,"venue":null,"work_id":"65db7cb5-a9b3-42ea-943c-05bee91ee7fc","year":2018},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.379747Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:1e25a417bdbf90e6ecaa7b9996615ceacb6cb224f9bf02fcd534f40605bcde83","observation_id":"8d9b1364-aedc-4bbb-8642-dfd6095cc799","resolution":{"observed_at":"2026-08-07T01:03:59.082746Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:58.696993Z","title":null,"venue":null,"work_id":"31e03f36-6ed7-4fdd-a646-6ddba7ad0967","year":2006},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.446347Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:047e998470e5f2e617be9c9eaad69964d4595d80e3b36cac7b21fbc05971ac6d","observation_id":"d432d35d-34ed-400e-a4b8-b8854a8b03d8","resolution":{"observed_at":"2026-08-07T01:03:58.897587Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:58.440988Z","title":null,"venue":null,"work_id":"02f334d7-9806-4220-856f-abb531c6f65f","year":1992},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.531439Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:e2ea135df0b85e8bac12e2f71676aecd173fa57025c7e7e13b17a2aeee10f295","observation_id":"49244f7a-9b45-406e-8cda-557f57dbb3c5","resolution":{"observed_at":"2026-08-07T01:03:58.545663Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:58.119046Z","title":null,"venue":null,"work_id":"1af04015-19e3-4ec4-9794-e64b139e095d","year":2001},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.623425Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:dd755c939d8af4dd84db2c2d4c6c9a8a75f22a66233ac1b1bd8479ebf6ea56bf","observation_id":"a6794289-b05b-4c5b-a01e-cb9ed68d7a2a","resolution":{"observed_at":"2026-08-07T01:03:58.252460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:57.833769Z","title":"Frankl and Z","venue":null,"work_id":"3dbc80a4-943f-48a1-92eb-487caa884e89","year":1980},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.702551Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:9400cf091426ff68e765bb49bb50fd9361869382e54eb38dac35bbfe5d4d85d9","observation_id":"114b8893-df57-4411-a461-201e92a8ab98","resolution":{"observed_at":"2026-08-07T01:03:57.974860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:50.774495Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.774495Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:977417a0f6f84e19d628af490dd4ba24a2cc6a1b1567e49e9ac0640c62cec947","observation_id":"8646fd1f-514b-4a5d-bf25-8f886515dd7c","resolution":{"observed_at":"2026-08-07T01:03:50.774495Z","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-07T01:03:57.402721Z","title":"Huang, O","venue":null,"work_id":"aec53bc7-e5de-4c40-8f6d-d4afa83a3752","year":2020},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.878287Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:873bda9afaaa823b4365853e981ac20ce626b14f0e0ffc1b161334603e27f7e2","observation_id":"912651c9-9d51-484e-af0e-a8a93a39fa8e","resolution":{"observed_at":"2026-08-07T01:03:57.638662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:57.013406Z","title":null,"venue":null,"work_id":"c4e1039f-efc2-4b5e-a92a-2561bd31a306","year":null},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:50.959697Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:a36185d9560773e9d00d304c95e46008d8cb4394d6be223bdb57edae0794f888","observation_id":"965d2cb2-e243-496d-ac40-bd2056e1d6bd","resolution":{"observed_at":"2026-08-07T01:03:57.181070Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:56.688747Z","title":"Junnila, T","venue":null,"work_id":"2968b55f-33d5-4069-89a1-dba78acc9cc1","year":2021},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.014138Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:338d13e91881512431f3a19efaec708062f70af568f9d6ae4279e2cefd5b2882","observation_id":"418f73d1-da88-4f14-9a57-31fecf2c8178","resolution":{"observed_at":"2026-08-07T01:03:56.807722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:56.405176Z","title":"Junnila, T","venue":null,"work_id":"5f09326c-1f7b-40e2-a37a-317ce160cf9c","year":2025},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.104014Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:5820ef455667a23a523d3ee69847004e0649c7dd50a168d18312f6db376c2e74","observation_id":"327ea618-31f6-478c-ad28-1bdb0cb0731f","resolution":{"observed_at":"2026-08-07T01:03:56.525491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:56.113377Z","title":null,"venue":null,"work_id":"771ae4f9-0984-4739-a2be-01e00a3c6d30","year":1996},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.188485Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:056cd4067a47c9081b0d9af7491a0e9c4b33dc27bd75f4f2f87f46adf438a13e","observation_id":"e784f062-76ad-4289-971d-6f8a239cd950","resolution":{"observed_at":"2026-08-07T01:03:56.226079Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:51.295643Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.295643Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:e2f12592771e0303f72546080aafeed579f19b7ca75159596f515cea317729d2","observation_id":"0fd3a1de-b813-4ab1-8fdb-9385043da419","resolution":{"observed_at":"2026-08-07T01:03:51.295643Z","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-07T01:03:55.727475Z","title":null,"venue":null,"work_id":"2a93ed34-3cfa-477a-9b37-d3e881587936","year":1993},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.403086Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:3cb45ac0f1f0b0b0685cc00da8b131c7e9677febaf91e2cb3a990a91a44a209e","observation_id":"c3826c17-6b84-4983-bd69-8d77e2be830a","resolution":{"observed_at":"2026-08-07T01:03:55.941947Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:55.501813Z","title":null,"venue":null,"work_id":"fc36c1f0-436d-4e46-a2a6-606e7bf6acd5","year":2001},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.474784Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:b6a34b8ae2a7f3a7d4a6ff9264b6163e000d1425ea742e190c4c0fede273cb3f","observation_id":"f5fde7cd-26a1-4fa1-9d4b-a5db3024363f","resolution":{"observed_at":"2026-08-07T01:03:55.583818Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:55.374449Z","title":null,"venue":null,"work_id":"d12d253b-4c0d-4e36-ad7d-e8075254aa9a","year":2001},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.576212Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:29cc7c7a60d04fa8b8f6ba6615a2918ecd2b4cbcd3095b70f183b766706f9132","observation_id":"ba1f89b4-0163-4df6-9997-c30a7120365d","resolution":{"observed_at":"2026-08-07T01:03:55.438183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:55.192812Z","title":null,"venue":null,"work_id":"4bbbf070-d0a9-4fea-b22d-2b2c9e983af4","year":1993},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.659832Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:bde546fd9c834a0324d05cc508b1c1008c83c7b4f2ce5cda04ce6b6feaefbee6","observation_id":"7b992605-22c1-4e96-93ad-b6cb487f07ef","resolution":{"observed_at":"2026-08-07T01:03:55.297172Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:55.033406Z","title":"Liu and C","venue":null,"work_id":"16fd2953-f5ed-4449-9977-5aeca52678d1","year":2025},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.791052Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:713530a382a26592366e5e514175dbe0319a17eabe6f7392abc9d72be75a7283","observation_id":"fa965152-39b9-4cc4-89c8-0ba0ad8a81cb","resolution":{"observed_at":"2026-08-07T01:03:55.094456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:54.855788Z","title":null,"venue":null,"work_id":"46cb241c-6926-460a-9604-7130124cc784","year":1978},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.876373Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:3f4704951e1ab37f76f1082928d6affe46c802a825201b6d0d662989f967569f","observation_id":"35c9bddd-6452-4c1a-9c30-0cb495d70f03","resolution":{"observed_at":"2026-08-07T01:03:54.934722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:54.687622Z","title":null,"venue":null,"work_id":"402cc976-882b-481d-8f26-f2474e3a947f","year":2022},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:51.962001Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:ae82edcc42753ff87d2bc6a334ca8d0bca91ca8e52ef22d3924244579dc00346","observation_id":"41c9cddd-081b-45dd-9c5b-4282fec539d9","resolution":{"observed_at":"2026-08-07T01:03:54.753769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:54.454526Z","title":"Sabary, H","venue":null,"work_id":"1451733e-40ff-4c81-8406-3ae01c5a63de","year":2024},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.026305Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:c867e59b66e88577b44d64e1818175a65ff6109a52b5ab16c394fd1f348d15e8","observation_id":"24af38e8-726a-4b20-8920-35224b2b9b41","resolution":{"observed_at":"2026-08-07T01:03:54.597560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:54.144575Z","title":"Sun and G","venue":null,"work_id":"7b10f5f1-9fff-40d9-86dc-80873a6f76d6","year":2023},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.092110Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:f04be2047650f837b773d4c8dc773ef4efe147bd2c63371037a71ea92ec5fd24","observation_id":"8bf2dd4f-f6ee-4120-8b22-58df2067f248","resolution":{"observed_at":"2026-08-07T01:03:54.310986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:53.954548Z","title":null,"venue":null,"work_id":"ea73ae19-14b6-4c5c-8ab3-38b04e02d3c5","year":2023},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.175756Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:ad97d6f13627416fcbe20a711426cc3d681210c96f8d53c890f87d3aa7c4a9f8","observation_id":"e208e167-ae18-404c-8e3d-3d6c7c524715","resolution":{"observed_at":"2026-08-07T01:03:54.014806Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:53.782693Z","title":"Van Overveld","venue":null,"work_id":"f6e38a29-bb0a-4778-bf5c-986c7708b0b4","year":1987},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.263749Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:9c62efc34e6d8bc48888d90550eafa55b0a6531ab0905868a1d5ec95014c8eee","observation_id":"d3a9ba3d-79f0-4940-bf92-8bf6120155d6","resolution":{"observed_at":"2026-08-07T01:03:53.843401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:53.603113Z","title":"Wei and M","venue":null,"work_id":"d7b3438c-8b0e-4f76-a7d0-34f1956f07a7","year":2022},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.360981Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:4f3edb024eae0036797061d75374137abc051d3c89f4659f34c87894bdba09d2","observation_id":"7a6d4f45-19c6-4cc5-9393-b90c5be681e3","resolution":{"observed_at":"2026-08-07T01:03:53.694866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:53.411421Z","title":"Wei and M","venue":null,"work_id":"55544cf3-4acf-4dd8-8e78-240c782d5f78","year":2022},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.446701Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:b4aed982a281d5c4ef9366edac44f060aad602105059e90054f14d7e4dde9f27","observation_id":"60edffeb-bb6d-4c2c-8552-5b07b0b0a4db","resolution":{"observed_at":"2026-08-07T01:03:53.517553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:53.245639Z","title":"Yaakobi and J","venue":null,"work_id":"4ca0ba35-fbe0-4f26-b407-542633b9aacb","year":2019},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.548056Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:075abcd3ac47baea6a911307bfff9561930239cbc6a171bf079636b1bf060781","observation_id":"09b2735e-1585-4f1d-8a05-d7d04dd44a78","resolution":{"observed_at":"2026-08-07T01:03:53.311055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:53.126487Z","title":null,"venue":null,"work_id":"708f585f-f9a1-4193-bf9c-da22ed7f972d","year":2023},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.615763Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:085019ddee6ec8a4768d082ab50481f01db293f8e627796c783c23e3f2e788fe","observation_id":"16cb5af3-8a42-4b50-b195-e2d108913a8a","resolution":{"observed_at":"2026-08-07T01:03:53.179413Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T01:03:52.727376Z","title":"Yehezkeally and M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.727376Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:bb09fd38a2b54cf423f997b5683fa27ca61820fc139830ef6127aeb2a44a1967","observation_id":"13a335f9-bfd0-45b2-a66e-92db9eb95670","resolution":{"observed_at":"2026-08-07T01:03:52.727376Z","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-07T01:03:52.948642Z","title":"Yehezkeally and M","venue":null,"work_id":"1ebb3e15-54da-48d4-82e7-4577d87d2532","year":2021},"citing_paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:52.828570Z"},"links":{"citing_paper":"/paper/2506.12924"},"observation_digest":"sha256:bdd7273dcbc65b47e25e7d2cf500ea1705f4e6c75ee597fd119ead094ff51667","observation_id":"042aabcf-d80a-4a57-92e9-2cd26e76d312","resolution":{"observed_at":"2026-08-07T01:03:53.032665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.12924","last_updated":"2025-06-15T17:49:35Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T06:57:55.102761Z","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":37},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2506.12924."}