{"as_of":"2026-08-10T09:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d91a2128280d6fd89bb908883c8be775291b1ea899fd97238f62512abc655dda","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T09:41:20.444825Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2607.28363/citation-record","integrity":"/paper/2607.28363/integrity","json":"/paper/2607.28363/citation-record.json","paper":"/paper/2607.28363"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:15.934744Z","title":"Near shannon limit error- correcting coding and decoding: Turbo-codes. 1,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:15.934744Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:7a98c8afafbe4265c11c135be8950ebfec65088ff0cc4b75306d30e5b27bc83d","observation_id":"c70c3d23-eafa-4275-98b6-1245d812d4df","resolution":{"observed_at":"2026-07-31T09:41:15.934744Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:16.676826Z","title":"Guessing random additive noise decoding with symbol reliability information (SRGRAND),","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:16.676826Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:726f4626eef28c7c30fff2caa76155660ea19fdcc2509e5c5d7d47bfee4e30df","observation_id":"a17574ad-10b6-4e48-bea2-b06f263588f4","resolution":{"observed_at":"2026-07-31T09:41:16.676826Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.168489Z","title":"The vertex separation number of a graph equals its path-width,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.168489Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:96a4723fdf4c46bd69f170270bc985e2502a9bad2f55dcada02799decf54db18","observation_id":"23aefbf2-e7fd-46a1-9842-d74310c6e5cc","resolution":{"observed_at":"2026-07-31T09:41:17.168489Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.254740Z","title":"A linear time implementation of the reverse cuthill-mckee algorithm,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.254740Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:2eb106fc49e27e611cdeb654d65c9e4a094d17c0603e256cfa1013b0e2549473","observation_id":"084ec961-23d3-4dd0-aadf-695832e4fbd2","resolution":{"observed_at":"2026-07-31T09:41:17.254740Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.322210Z","title":"The evolution of the minimum degree ordering algorithm,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.322210Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:aa8dd68abfab7aad0f7b1070d8c0730737277181e6fd8937fd9c675fd43e9c85","observation_id":"e7cc919e-74fa-4d6e-9a2a-11f5db3e9d63","resolution":{"observed_at":"2026-07-31T09:41:17.322210Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.424748Z","title":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.424748Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:6ac2a298f99c50a10aa6979ac9e2421807b77adca0ea009ad5ec64a154a9864c","observation_id":"3261bf1d-6626-40e7-9d07-c7cb062b55cb","resolution":{"observed_at":"2026-07-31T09:41:17.424748Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.555900Z","title":"Triangulation of graphs-algorithms giving small total state space,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.555900Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:d9700acb3baef3a69b445c3618860d44bc2cde7f008d59a444c9cf3ec69f6cf1","observation_id":"a66ad52d-9822-4746-b34a-fbabe3744934","resolution":{"observed_at":"2026-07-31T09:41:17.555900Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.645906Z","title":"Probable inference, the law of succession, and statistical inference,","venue":null,"work_id":null,"year":1927},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.645906Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:8061698842356405c918123a8975ab9e1c5b28a7e39a46661ad457fd762285aa","observation_id":"e50d8659-41e1-4168-84df-b8383e480612","resolution":{"observed_at":"2026-07-31T09:41:17.645906Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.726345Z","title":"List Viterbi decoding algorithms with applications,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.726345Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:b3322d57b80b2973ed3a0a20bdb49ce0fc1eb29003cf80b951f0acc242944af2","observation_id":"9e359dc3-0fe3-482e-b79c-8ff9d12f47a7","resolution":{"observed_at":"2026-07-31T09:41:17.726345Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:17.815262Z","title":"If Q is banded, its upper-triangular Cholesky factor can be chosen with the same half-bandwidth","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:17.815262Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:d12becef044a380c5b321d6e7d4ca37e9ddd9ace37d15b520b7d9e9b4e79926e","observation_id":"ef49eb22-960e-42ce-b299-a64a8fc4ef95","resolution":{"observed_at":"2026-07-31T09:41:17.815262Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.004752Z","title":"Soft maximum likelihood decoding using GRAND,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.004752Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:e8e6fbba6b876542c48be00455e0beb9af9c0291833f15c6f1e7348932adb962","observation_id":"ec7b78ed-70e4-4c4b-b40e-7c52ef537a1d","resolution":{"observed_at":"2026-07-31T09:41:18.004752Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.086269Z","title":"Ordered reliability bits guessing random additive noise decoding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.086269Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:deddc6684e3cbedafeeae8c2d87e2c5d4d582950fce2647e046c016b52ede4f0","observation_id":"4c54ba9b-2bc0-4f63-bb1a-3f1a1213fb86","resolution":{"observed_at":"2026-07-31T09:41:18.086269Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.174748Z","title":"Soft-output (so) grand and iterative decoding to outperform LDPC codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.174748Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:ef5d110f06de7950acc79c560ed0a5afcbbd943731b60704e9143dfac6a09bbf","observation_id":"fcca9658-eef5-4443-85d0-e239a470cca7","resolution":{"observed_at":"2026-07-31T09:41:18.174748Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.234741Z","title":"Soft-output guessing codeword decoding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.234741Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:b51ae9524e043d4b17f1bdb3482c5fcba0a22ebf7c5a34a76d234a65927b891e","observation_id":"725aa9a0-46a1-4d4d-8a26-de6b15d411c4","resolution":{"observed_at":"2026-07-31T09:41:18.234741Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.357215Z","title":"Using channel correlation to improve decoding-ORBGRAND-AI,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.357215Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:871ae592432bcd1e105a93cffaa033f9359224b2af991cb5b44732b42352e228","observation_id":"7023f27c-fe3d-414b-86a3-adefee564c97","resolution":{"observed_at":"2026-07-31T09:41:18.357215Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.395851Z","title":"Verification of forecasts expressed in terms of probability,","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.395851Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:918e1f2ed0a63345dab9988155db1290b0e01a64831971c38b1576fef30e526e","observation_id":"8c1b7d8b-1ee3-42df-b6b4-bd271bff545d","resolution":{"observed_at":"2026-07-31T09:41:18.395851Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.494750Z","title":"On calibration of modern neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.494750Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:5ef0c44ad97efdd108a38c1c85b13cde0be8b82af2793d2199cc9e21ce0687d5","observation_id":"d99e3c4d-8c6b-4546-89f7-ae9b30d6efbc","resolution":{"observed_at":"2026-07-31T09:41:18.494750Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.577104Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.577104Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:e72caa056944c8cc8db6df30fe08ca1d2fa74a48e9a2c60baa64fb5108e8fa66","observation_id":"db6b4c09-928e-4a81-a670-e48564bbe1b6","resolution":{"observed_at":"2026-07-31T09:41:18.577104Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.634749Z","title":"Low-density parity-check codes,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.634749Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:33a41f4b928cd57f2de6d3141b5b3f5ebfc6d38326e905f04cd8f03ace7c3861","observation_id":"a2c9b1cd-1bd1-447e-90ba-abe642eae1a3","resolution":{"observed_at":"2026-07-31T09:41:18.634749Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.714743Z","title":"Factor graphs and the sum-product algorithm,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.714743Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:24fa2ee9f71d50cec5bca6c7d8ca99084e39f98f3bb5579636df01a1e4cb7ab7","observation_id":"7faa7b80-3368-476a-96cb-9eab12d6e8d6","resolution":{"observed_at":"2026-07-31T09:41:18.714743Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.814746Z","title":"Near shannon limit error- correcting coding and decoding: Turbo-codes. 1,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.814746Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:ec8f0b6a4e0d8a2f206ec767dd6aecd714969c1c8346361928786f0eeadbac72","observation_id":"ed30789c-6c15-47f4-8e9a-78bdcc58bb77","resolution":{"observed_at":"2026-07-31T09:41:18.814746Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.854747Z","title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.854747Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:9df701f083380ddd8d27d530a6706005e73673fd838d01108a93a593ae3577e3","observation_id":"08be6774-3db2-4fce-b9e8-45cd9fb2fec6","resolution":{"observed_at":"2026-07-31T09:41:18.854747Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:18.941878Z","title":"Crc-aided decoding of polar codes,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:18.941878Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:5ed57b168bf5a4d27755d81e79543962e55be13552ea9a51ae73b62567f25750","observation_id":"8ed2ef8b-e1ed-4d2f-8616-bf4f1472651e","resolution":{"observed_at":"2026-07-31T09:41:18.941878Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.076459Z","title":"List decoding of polar codes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.076459Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:4acfdcf964de451af83337b96779f31841d1e763f3355b8ee6cb773724bf0425","observation_id":"658cc1be-fd4f-4411-975d-77d4258b93d9","resolution":{"observed_at":"2026-07-31T09:41:19.076459Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.122329Z","title":"Soft-decision decoding of linear block codes based on ordered statistics,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.122329Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:1c2bd35023779f5132a121d33b482e36ae16650ec2a07e1b2c4b96537b400e7c","observation_id":"cf7f7c70-0caf-409c-b4a7-71fca5f3dfbd","resolution":{"observed_at":"2026-07-31T09:41:19.122329Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.204739Z","title":"The guesswork of ordered statistics decoding: Guesswork complexity and decoder design,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.204739Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:3ae287aa6d3920a860cae2ff0d0329381920ad5a7c9b1ec6c8dc94f8e8d03fbd","observation_id":"55f31a1b-55cc-4f44-8af0-b05282a94c77","resolution":{"observed_at":"2026-07-31T09:41:19.204739Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.314812Z","title":"Capacity-achieving guessing random additive noise decoding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.314812Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:145baae18d63af3c912622649e8880aa33b9fd24d679daf40dd0569b2abe3b24","observation_id":"fca67f04-3480-4ae0-a422-ee33aba8d79e","resolution":{"observed_at":"2026-07-31T09:41:19.314812Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.344383Z","title":"Multi-code multi-rate universal maximum likelihood decoder using GRAND,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.344383Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:04b545307aee84071d81392208783163218ab48301a3f5d405681400a21eee38","observation_id":"5fdfa8f7-9bc6-4b8e-ad1c-cb7efd16c8cd","resolution":{"observed_at":"2026-07-31T09:41:19.344383Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.435419Z","title":"A sub-0.8-pj/bit universal soft-detection decoder using ORBGRAND,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.435419Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:e69ae25b3f140460d55167632bf5862a0718d73621ffcdbfcb0d6883c619b321","observation_id":"abc52662-597f-40c8-9dc9-f0a598088455","resolution":{"observed_at":"2026-07-31T09:41:19.435419Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.484809Z","title":"A finite-blocklength analysis for ORBGRAND,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.484809Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:36a01fbce55158c620201b0e98f58fe9d24b82d96cc8fb1ab2354caf35b90e45","observation_id":"daa71284-e387-4a96-89cd-c441a679c6a8","resolution":{"observed_at":"2026-07-31T09:41:19.484809Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.579202Z","title":"Keep the bursts and ditch the interleavers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.579202Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:d69109f902d959afa76dd64d674132555b406d4cf7b6a7d5af24adc640e90ca9","observation_id":"58f70630-b81b-48f6-87e1-14751e76f4b3","resolution":{"observed_at":"2026-07-31T09:41:19.579202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.14939","last_updated":"2026-05-07T14:03:02Z","snapshot_observed_at":"2026-08-06T02:20:49.849020Z","submitted_at":"2025-10-16T17:51:02Z","title":"Decoding in the presence of ISI without interleaving -- ORBGRAND-AI","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.14939","snapshot_observed_at":"2026-07-31T09:41:19.674812Z","title":"Decoding in the presence of ISI without interleaving orbgrand ai,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.674812Z"},"links":{"cited_paper":"/paper/2510.14939","citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:f6fb15209d884ed4d0df5f13ac03d71f53d70092abc9a53ea00a34bf57dcf987","observation_id":"358f5590-c9a3-4685-a31c-bb7beea83f96","resolution":{"observed_at":"2026-07-31T09:41:19.674812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12971","last_updated":"2025-07-23T14:43:44Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:57:21Z","title":"Universal Decoding over Finite-State Additive Channels via Noise Guessing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12971","snapshot_observed_at":"2026-07-31T09:41:19.814830Z","title":"On universal decoding over discrete additive channels by noise guessing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.814830Z"},"links":{"cited_paper":"/paper/2501.12971","citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:6dc91e229afc2de3099a7931ae7999611d5aac64041f078b09e8e24bc638435d","observation_id":"e1a80813-45b5-4f89-bdd7-9fecb1a0e20e","resolution":{"observed_at":"2026-07-31T09:41:19.814830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.01813","snapshot_observed_at":"2026-07-31T09:41:19.904743Z","title":"Parallelism empowered guessing random additive noise decoding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.904743Z"},"links":{"cited_paper":"/paper/2510.01813","citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:1221b92733c141bc8e07589b3ba3769398b41251de5359fb68279d7a3dab3c43","observation_id":"b8f15caf-3299-4469-a8c7-603506c78b70","resolution":{"observed_at":"2026-07-31T09:41:19.904743Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:19.994740Z","title":"GRAND for gaussian intersymbol interference channels,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.994740Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:56f99901055f9b064c20728e74a6908302382969d7759869b3106811cd76ecf3","observation_id":"3993173e-37ac-4887-8906-a6a1dc2c9ac8","resolution":{"observed_at":"2026-07-31T09:41:19.994740Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:20.094848Z","title":"List Viterbi decoding algorithms with applications,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:20.094848Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:f158b288e7ed3e51e0ab0ede4a15741507a3075054c40050d6601b16b3ffae88","observation_id":"72ddac0d-2160-4f14-add7-21f40beb540a","resolution":{"observed_at":"2026-07-31T09:41:20.094848Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:20.274810Z","title":"Finding the k shortest paths,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:20.274810Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:c6339400c99900e25da849f586a1a7e7065d149a7fcc452190a89535ac0ae695","observation_id":"10021ed5-ca90-45a4-a740-226575f8d78c","resolution":{"observed_at":"2026-07-31T09:41:20.274810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-08-09T19:48:28.364636Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.28030","snapshot_observed_at":"2026-07-31T09:41:20.344753Z","title":"Performance analysis and optimal design of ORB-type GRAND algorithms,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:20.344753Z"},"links":{"cited_paper":"/paper/2606.28030","citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:62ffb27b6179b43cd9c7e5081016c8d4d39042a78a1ce3070de055f2f7467dfa","observation_id":"65e7d600-4619-4696-aedf-f8e491dd0042","resolution":{"observed_at":"2026-07-31T09:41:20.344753Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T09:41:20.444825Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:20.444825Z"},"links":{"citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:e72184a644471117075978bbbd462625ecf1d6734e1c8fa4d41c3dcff32af28a","observation_id":"669f1834-8af8-44e3-9e06-66b676bacfc2","resolution":{"observed_at":"2026-07-31T09:41:20.444825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":39},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2607.28363."}