{"as_of":"2026-08-16T08:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8530ba476bba96f8a199f9682a7aff7c49d85a48480e6301562948dd1afa216a","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:13:16.760269Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.09502/citation-record","integrity":"/paper/1908.09502/integrity","json":"/paper/1908.09502/citation-record.json","paper":"/paper/1908.09502"},"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-14T11:13:17.057780Z","title":"Commun., 1998, 46, (8), pp","venue":null,"work_id":"b8bf40c5-6f8f-455d-9513-3c6f037cdf4f","year":1998},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.639337Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:5364a8cfdcaece3f65b105fcc57d766383de07ef03db65c819d8739200ef965f","observation_id":"750700bf-c918-4ac9-a37a-06681fe270df","resolution":{"observed_at":"2026-08-14T11:13:17.061015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:17.047778Z","title":null,"venue":null,"work_id":"4522f0c9-6a86-4630-ae19-fb4a1f2c7b6e","year":2019},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.718115Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:267f0c460a6aa52fd0c850a5e31ae701cc24bcb6869e6c33c914963aacb15b57","observation_id":"21c787cb-9b2c-4dae-ab1d-cf86dae1c6cc","resolution":{"observed_at":"2026-08-14T11:13:17.050982Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:17.036142Z","title":"Optics, 2016, 18, (6), pp","venue":null,"work_id":"1963e4d4-29a6-4b4f-878b-e3532f3ea1ab","year":2016},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.721823Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:465274b08baea36f6e376e5070ab5a800a5b76362aa2c24cf69488f9f73ff837","observation_id":"021505fd-6e48-4aa3-b5de-356894321eed","resolution":{"observed_at":"2026-08-14T11:13:17.040359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:17.024979Z","title":"M., Kschischang, F","venue":null,"work_id":"ce62edd3-8c11-40fb-802e-939b9ebd1eb3","year":2017},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.725089Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:88d74cbdae7c63f79bd3fcd8fefbd9aed479de81a74112912551ebf3d6e09e2c","observation_id":"e97d2c97-679b-461d-9b8a-a051c254cbdc","resolution":{"observed_at":"2026-08-14T11:13:17.028786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:17.013532Z","title":"R.: ‘Low-complexity concatenated LDPC-staircase codes’, IEEE/OSA J","venue":null,"work_id":"e2f92283-d181-4ea7-adde-9ebe017cb8b6","year":2018},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.728211Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:fc48e9821b674342b6966770360e288e30747df9c8dbec3729549aed0e3479f2","observation_id":"3c642618-76e8-40f1-841f-425973520dcf","resolution":{"observed_at":"2026-08-14T11:13:17.017206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:17.001565Z","title":null,"venue":null,"work_id":"06da92b8-82da-43d7-8299-9cad1b4d23bc","year":2018},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.732309Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:bf2f9f119e98917000de901729e63a858b9aba3e451e6f0ed4306aeaf95a9468","observation_id":"03ac2e43-fdd2-42a8-a5de-86fb3e206ba9","resolution":{"observed_at":"2026-08-14T11:13:17.005882Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.03575","last_updated":"2019-09-19T07:58:30Z","snapshot_observed_at":"2026-08-14T17:18:34.187189Z","submitted_at":"2019-02-10T11:20:41Z","title":"Binary Message Passing Decoding of Product-like Codes","version":2},"cited_work":{"arxiv_id":"1902.03575","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.03575","snapshot_observed_at":"2026-08-14T11:13:16.797586Z","title":"Binary Message Passing Decoding of Product-like Codes","venue":"cs.IT","work_id":"eacea22a-1469-4eb3-a0da-eda5e61756e0","year":2019},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.736374Z"},"links":{"cited_paper":"/paper/1902.03575","citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:7857005a478f60424079b3e05291755c3ed040083d41cac80ea20dc5d3199cd2","observation_id":"6e394bc6-ca50-4150-b595-2e2b9ce678b2","resolution":{"observed_at":"2026-08-14T11:13:16.803017Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.01178","last_updated":"2019-02-04T13:48:41Z","snapshot_observed_at":"2026-08-14T17:21:23.888854Z","submitted_at":"2019-02-04T13:48:41Z","title":"Improved Decoding of Staircase Codes: The Soft-aided Bit-marking (SABM) Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.01178","snapshot_observed_at":"2026-08-14T11:13:16.739862Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.739862Z"},"links":{"cited_paper":"/paper/1902.01178","citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:90a0eea6c136559d3727a17eda43ab1240e8ea236b0bdf98525e27427b630cc2","observation_id":"2c8af354-e9c4-4ec9-9a8d-7b0c9e120f69","resolution":{"observed_at":"2026-08-14T11:13:16.739862Z","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-14T11:13:16.989635Z","title":"53rd Annu","venue":null,"work_id":"20a65b09-20c7-472f-98bb-519e3533c95d","year":2019},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.743036Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:07a5e07cb56d79d8ad034d5276c99ab08104bc7349f29d0d501b313268ce4779","observation_id":"985e145f-c98b-41e6-ad36-30d4b3de721b","resolution":{"observed_at":"2026-08-14T11:13:16.993722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:16.978745Z","title":"Optical Fiber Commun","venue":null,"work_id":"3c771281-b7a2-4d0b-a407-e696b8c08814","year":2019},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.746155Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:7c5e072f86d6f3adfa4bd18d099738643bab00d92702b5fb8da056672aa92f9c","observation_id":"e38f618a-c4e3-44ef-bd64-0d6df92d3ccc","resolution":{"observed_at":"2026-08-14T11:13:16.982284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:16.966013Z","title":"D., Narayanan, K","venue":null,"work_id":"a71e8118-88d9-431c-aaed-0b7d69e81a85","year":2017},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.748630Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:ba31b521dddfe7924056f3b961b0f5beef0a16f8abaf23553231600e89d1f17b","observation_id":"3ac7c65e-3b8e-4e25-ba39-86be80d93e9d","resolution":{"observed_at":"2026-08-14T11:13:16.970264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:16.954525Z","title":"M., Kschischang, F","venue":null,"work_id":"0663066d-5ef8-4c37-afb8-629dfecd29e2","year":2014},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.751625Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:2a5671a3ac78cdf2d44365131200a63d8b0ca294acafb36fc3a6d3039361ece1","observation_id":"a106ca14-0295-4bfa-bfbb-428b4c9b1d2e","resolution":{"observed_at":"2026-08-14T11:13:16.958413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:16.942983Z","title":null,"venue":null,"work_id":"e67d5d2c-f4ba-45f9-9bb0-b8f489b80d52","year":2017},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.754394Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:71d47a2a1d36bd92bf6d00be3df74c467ad536a6118b770586bf48c25e396547","observation_id":"84f1da48-2897-4cdb-9750-db3b1dfbfef6","resolution":{"observed_at":"2026-08-14T11:13:16.946976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:16.821530Z","title":"D.: ‘Approaching miscorrection- free performance of product codes with anchor decod- ing’,IEEE Trans","venue":null,"work_id":"88e1b4b1-0e83-4018-b05a-e020602057d5","year":2018},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.757601Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:b4790a7453a38476e6f943cbf32c25d32ff987584a2c020068167c68f935ce12","observation_id":"a35eee46-0bb0-4cc8-b4de-c53ebee5aba3","resolution":{"observed_at":"2026-08-14T11:13:16.933185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:13:16.810594Z","title":"P., Farhood, A., Hunt, A., et al.: ‘Staircase codes: FEC for 100 Gb/s OTN’, IEEE/OSA J","venue":null,"work_id":"5f9c8589-0990-454f-bfa4-7b54aec14974","year":2012},"citing_paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:13:16.760269Z"},"links":{"citing_paper":"/paper/1908.09502"},"observation_digest":"sha256:8435c4444e84154cb6eebbf74de426164934811268a6af9a01216da051ace3f6","observation_id":"948c984f-96ee-40f9-bd0e-592a37633772","resolution":{"observed_at":"2026-08-14T11:13:16.814093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09502","last_updated":"2019-08-26T07:30:52Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T07:04:44.444001Z","submitted_at":"2019-08-26T07:30:52Z","title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":15},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:1908.09502."}