{"as_of":"2026-08-04T06:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40b40c992024a6a776059988a6fc4ae4b6171a49e165e7115e43716c24dbb002","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T21:26:24.624009Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T12:29:05.007265Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.07365","snapshot_observed_at":"2026-08-01T12:29:05.007265Z","title":"Kanchi, Tunneling-Augmented Simulated An- nealing for Short-Block LDPC Code Construc- tion (2026), arXiv:2604.07365","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19574","last_updated":"2026-07-21T21:01:37Z","snapshot_observed_at":"2026-08-01T12:28:56.835179Z","submitted_at":"2026-07-21T21:01:37Z","title":"Quantum codes from classical annealing","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T12:29:05.007265Z"},"links":{"cited_paper":"/paper/2604.07365","citing_paper":"/paper/2607.19574"},"observation_digest":"sha256:b46df3a6a1db8eb3fbf6b30a11d0501c34c6d39b9f3acb5eb78079a81b546278","observation_id":"c1e06582-a306-4b33-94f2-27e7d1b17bcc","resolution":{"observed_at":"2026-08-01T12:29:05.007265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.07365/citation-record","integrity":"/paper/2604.07365/integrity","json":"/paper/2604.07365/citation-record.json","paper":"/paper/2604.07365"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimization by simulated annealing","venue":null,"work_id":"b9ef1d82-d150-48b2-ba46-ec29a551ebd6","year":1983},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:129de95ff2f670cb57474dff863080f7f1d88c831275f0cc54e343a66bef61ed","observation_id":"9566ba50-3687-45d2-b6a9-18e689c7a734","resolution":{"observed_at":"2026-05-13T21:28:18.742419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Quantum annealing in the transverse ising model","venue":null,"work_id":"17472d47-f9ee-4e5f-9137-69e840462153","year":1998},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:1792d32cf28010ab5595cf7f1e21ca47879c74daaaa00425faaa45af9be3a2b4","observation_id":"91ea5b96-be69-4026-89d4-d89386e97eae","resolution":{"observed_at":"2026-05-13T21:28:18.738010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Quantum annealing by the path-integral monte carlo method: The two-dimensional random ising model","venue":null,"work_id":"9354f1a2-93de-41ab-9aa7-58e5dc987074","year":2002},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:73fe7aea0488d47fb6da5ec42ced63b6ff56d42855db5015a1420b0cb24a167e","observation_id":"d7018234-ffbf-4c41-9efb-6b1fe6ac8d7b","resolution":{"observed_at":"2026-05-13T21:28:18.740083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-10T06:46:52.542371Z","title":"Low-density parity-check codes","venue":null,"work_id":"8e405531-423e-45d4-9f5c-76759ff19377","year":1962},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:62e3298c4f0a69529314693b3f90e7351c6d9fbe3f46bb203fe8e02e5836bcac","observation_id":"a93d821d-e2a2-406e-a276-b9550037950d","resolution":{"observed_at":"2026-05-13T21:28:18.744607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Good error-correcting codes based on very sparse matrices","venue":null,"work_id":"af60636d-c2ec-43f8-812d-a8336d18cdb1","year":1999},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:3a1f6ef1e350f8d65e39d451f9c0ccc38847a4cacf823f62afddd44e9fadc4e3","observation_id":"7322ed24-8db2-436a-a72c-dfc4f4d3a0b5","resolution":{"observed_at":"2026-05-13T21:28:18.746677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Richardson and R","venue":null,"work_id":"64808a51-eb6f-43f8-8997-a12f9aa5f2f6","year":2008},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:dd11ba20329ef66bf3ca410e4205011198830bce7c8b50676c1d0b0444434f8a","observation_id":"aa0bf712-cce3-42c9-b511-6e0509721ace","resolution":{"observed_at":"2026-05-13T21:28:18.748596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Regular and irregular progressive edge-growth tanner graphs","venue":null,"work_id":"8e22eeb5-3e8c-40f1-b6e4-009ee8cc1125","year":2005},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:db91b24cd3f12f4865a8a803c36a8ba9202ae0dc842c3eef1e975439ba7353a7","observation_id":"de0c87e1-d2e7-4af8-b2b3-04bff0fa9752","resolution":{"observed_at":"2026-05-13T21:28:18.750605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Decoder-optimized progressive edge growth algorithms for the construction of LDPC codes with low error floors","venue":null,"work_id":"06a8cbd2-b471-4356-8346-0c0d98ea299f","year":2007},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:a617e5299f844ec78e15b84738a40b0a5a48cdab902da68f7a4c6591b4dddfc6","observation_id":"12d28ce1-d27f-4691-9a02-c89d7ce71a67","resolution":{"observed_at":"2026-05-13T21:28:18.752774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Improved construction of irregular progressive edge-growth tanner graphs for low-density parity-check codes","venue":null,"work_id":"6d591799-dddd-4025-97a9-c1b23b129a05","year":2007},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:b652a1fc7d3b7e53bf039b7505213a112a02bd9066637c666b7e447fa056b12d","observation_id":"fd43932a-682c-425f-9876-a92d7af11513","resolution":{"observed_at":"2026-05-13T21:28:18.756035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Construction of short block length irregular low-density parity-check codes","venue":null,"work_id":"7948ca18-2dd5-44a1-849b-81d482d66d41","year":2004},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:eb7417b39813d48063c1daac70e79a490eaec49bc1f6364c51b847105e0981d6","observation_id":"1be9a1fe-ce55-402c-9996-0ca109b3bf58","resolution":{"observed_at":"2026-05-13T21:28:18.729162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"High performance short-block binary regular LDPC codes","venue":null,"work_id":"781c0c62-ec1b-4aee-88fb-755e80a5c379","year":2018},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:eda9432873b70639a320b27bbb336a577122a924471aae993b7e25b1a153c000","observation_id":"c9752b8f-b7b9-4afc-8129-f0c02d8e5d39","resolution":{"observed_at":"2026-05-13T21:28:18.731445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Finite-length analysis of low-density parity-check codes on the binary erasure channel","venue":null,"work_id":"e8417db9-895b-47df-9c31-2de3fa18eaee","year":2002},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:db67ace10f43d51ea8347672a33bac447bcd5fd26ef9d3828b62fe8f2bc6e7fe","observation_id":"d6c92b6a-b45a-4f57-9167-7a38df0de38e","resolution":{"observed_at":"2026-05-13T21:28:18.733483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes","venue":null,"work_id":"7774217d-3a59-4d45-a933-6e967b3c60a2","year":2010},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:b53e86c0012b74ba32936f5e7df63424275eb2c181ef090a12382427fb3ab6fe","observation_id":"5e9eee4b-686c-487a-aa6d-3e545c9582dd","resolution":{"observed_at":"2026-05-13T21:28:18.724488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Error floors of LDPC codes","venue":null,"work_id":"336b8d70-a8f8-42da-8b72-1f7a11b2ef16","year":2003},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:462e951b8c46c36b1ebbe4c79488594fef8a259df01befbde48aa4a0307f0fc1","observation_id":"07a8b7b9-3019-4d82-aa43-d6c772fb096f","resolution":{"observed_at":"2026-05-13T21:28:18.717739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Constructing LDPC codes with any desired girth","venue":null,"work_id":"efd16b2a-2ff1-4409-bfed-20356206f68c","year":2021},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:aba9d86223c5372a42b6dcebc7acb6c066c93f00f6898a154a949e8decfbd9c4","observation_id":"76aaa687-a39b-45bd-ad78-251a26e48b6b","resolution":{"observed_at":"2026-05-13T21:28:18.720128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Construction of short LDPC codes by integer programming","venue":null,"work_id":"dd254638-ba4d-401b-bae7-b0a2949cfc7d","year":2007},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:4e3f4f44e5d8ccf74751f2ad882550da0572d64ce9c8e0bdb18a571eb2aa11fe","observation_id":"619a0fc2-cb0f-4a72-9ae3-0e493a7d072f","resolution":{"observed_at":"2026-05-13T21:28:18.713665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Optimal design of LDPC codes using differential evolution","venue":null,"work_id":"47ae4d09-4182-4f1a-9ac4-0e13f155be0b","year":2007},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:dbd3a7e688597f6e14e242004a0141db72c83f7865a163167a654def1a26601e","observation_id":"0d5c8067-ed06-4e92-8b32-4942dd5c00d2","resolution":{"observed_at":"2026-05-13T21:28:18.711260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Design of efficiently encodable moderate-length high-rate irregular LDPC codes","venue":null,"work_id":"afa6222e-cfa4-4ca3-bdb5-1893b5e85cd5","year":2004},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:c8b8e513046b1a4d7c68bb86bb4d74d06aad8c7ad10c28bdd8933874082c66ed","observation_id":"493861c1-afde-47a2-8e48-e4fd7ec846d2","resolution":{"observed_at":"2026-05-13T21:28:18.715986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A quantum approximate optimization algorithm","venue":null,"work_id":"0172106c-4ff5-454c-854c-4551efb13416","year":2014},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:ab1acbf7b239709bfb01fff3160ce1a9c748e78e67b276f5f75344f791f6fbdb","observation_id":"011bec0b-9074-4fb8-a59c-5146620c52b9","resolution":{"observed_at":"2026-05-13T21:28:18.722423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-08T21:15:39.955774Z","title":"Ising formulations of many NP problems","venue":null,"work_id":"24ba4bef-de46-41bf-a1b5-db12e70ff840","year":2014},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:fddc6ef90440313db629df70d24b9264d80716e009997813e14fb82c524a37b9","observation_id":"3fb1f885-4607-40b3-bed5-95813264efc4","resolution":{"observed_at":"2026-05-13T21:28:18.726622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Towards quantum belief propagation for LDPC decoding in wireless networks","venue":null,"work_id":"a357b6a1-9f4e-44ee-a388-6547954bd903","year":2020},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:af20d3f33840f209aa29340b652dea5631498a6f31c2cbc6fc3fefb866149342","observation_id":"b3b289fa-da87-4723-831e-9ded95cf08bf","resolution":{"observed_at":"2026-05-13T21:28:18.735505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Quantum computing in the RAN with Qu4Fec","venue":null,"work_id":"ad857086-06bc-4b87-ba80-5b7c43804527","year":2025},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:0804b76d3e17091f465aada5daacda847fc0ac7bc69e418942064d4960028f59","observation_id":"264096d6-22ac-4804-b01c-18072c492abc","resolution":{"observed_at":"2026-05-13T21:28:18.708483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"5g wireless network slicing for eMBB, URLLC, and mMTC: A communication-theoretic view","venue":null,"work_id":"2d7c35b5-5708-4130-9c7f-723b18b9f3d8","year":2018},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:1c0c9efbd75dba9e0eb702aca7381237ebd964365d28c550ca84803f6748363f","observation_id":"79b0d691-9a73-4015-aca7-7c8e8e2b88e9","resolution":{"observed_at":"2026-05-13T21:28:18.706201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Toward massive, ultra- reliable, and low-latency wireless communication with short packets","venue":null,"work_id":"5e7ea4fa-041d-400b-8f4d-13af2d126d44","year":2016},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:21f5efce6cf01d2ca658f13317d38f71432e0eeec52704fc93804923df63ff26","observation_id":"23ac2826-283e-41ed-b3aa-b472af489057","resolution":{"observed_at":"2026-05-13T21:28:18.703944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Satellite communications supporting internet of remote things","venue":null,"work_id":"774ff64c-9132-4715-8fdf-47b26276138f","year":2016},"citing_paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:24.624009Z"},"links":{"citing_paper":"/paper/2604.07365"},"observation_digest":"sha256:4eea685040eb732f022a4c5ebd56a42bf730f544824436f0d2cc364314623cb7","observation_id":"8aa7e980-3030-4c4b-8c9f-9ffc053b1325","resolution":{"observed_at":"2026-05-13T21:28:18.701686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.07365","last_updated":"2026-04-01T23:35:43Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-01T23:35:43Z","title":"Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":25},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2604.07365."}