{"as_of":"2026-08-19T07:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e885214829acd4e5533e89f38de76fc9675d91115be07813782d54d5e1a2625","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:03:34.982910Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2501.12834/citation-record","integrity":"/paper/2501.12834/integrity","json":"/paper/2501.12834/citation-record.json","paper":"/paper/2501.12834"},"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-10T17:03:35.375310Z","title":"A mathematical theory of communication,","venue":null,"work_id":"8ec4bf54-c362-4c24-b625-3785cbc80973","year":1948},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.804915Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:00231e8e623fef461debc94b8e4412724689f26478a38b6c4cbc431a42e154f6","observation_id":"4bce768d-e2b6-460f-950b-ed792c27a168","resolution":{"observed_at":"2026-08-10T17:03:35.384300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T17:03:35.265037Z","title":"Sequential decoding for reliable com munication,","venue":null,"work_id":"5698b335-3f4b-4a5c-9815-251dab5a6df0","year":1957},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.872071Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:57d2db7e07fe466c2829f3a987b093d543c202c99dbf21d7d4cdd450aca72e9e","observation_id":"23696a7e-f4e9-4a15-b5fc-47999a12cc51","resolution":{"observed_at":"2026-08-10T17:03:35.312415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T17:03:35.186392Z","title":"Information theory and reliable commun ication,","venue":null,"work_id":"c0f8567c-e39d-4812-bb96-96187bf51550","year":1968},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.937260Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:ae1e07ed0d8542a39bf9610d5c29147ae6eb54b22dd3378bd7b83224abde0f70","observation_id":"3534c914-9a84-40c9-b656-5d4606071b4b","resolution":{"observed_at":"2026-08-10T17:03:35.211317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:03:34.943688Z","title":"Channel polarization: A method for construc ting capacity- achieving codes for symmetric binary-input memoryless cha nnels,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.943688Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:d6e1047701df80cd7dc531ec4c38aa27eb4033aa3b909885e6646a69f5d10578","observation_id":"df1f93a1-25be-4ad8-b9a7-d1cc902cce34","resolution":{"observed_at":"2026-08-10T17:03:34.943688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.09594","last_updated":"2019-09-09T16:15:56Z","snapshot_observed_at":"2026-08-14T11:04:37.031374Z","submitted_at":"2019-08-26T11:05:47Z","title":"From sequential decoding to channel polarization and back again","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09594","snapshot_observed_at":"2026-08-10T17:03:34.949030Z","title":"From sequential decoding to channel polariz ation and back again,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.949030Z"},"links":{"cited_paper":"/paper/1908.09594","citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:3e8ac88b336cec9edd6e6b101da0b5868a24a9fdf9f89b2af0f1b52adf7b55da","observation_id":"9bb3853c-114e-4326-b761-7f3f9d49f359","resolution":{"observed_at":"2026-08-10T17:03:34.949030Z","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-10T17:03:35.122295Z","title":"V ariational quantum algorithms,","venue":null,"work_id":"4ee82876-92e9-4578-bbe5-2f4b4f86ad28","year":2020},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.954503Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:15ba91d5a98cfc0c1306fc334e3d06adfd5247aa3292cd5f33a5c10dacf13886","observation_id":"34a9f58a-8476-45d3-9b1a-c0f725c3a18f","resolution":{"observed_at":"2026-08-10T17:03:35.126527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T17:03:35.107542Z","title":"A quantum approx imate optimization algorithm,","venue":null,"work_id":"b4a582c7-b214-409c-90a7-dcf2fdd15687","year":2014},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.960132Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:830b9f75ed239e3c98bd041d65968de574ed96539204853c29d2543750259734","observation_id":"3c6d8a8c-685f-4793-9e6a-d66c2129319a","resolution":{"observed_at":"2026-08-10T17:03:35.112437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T17:03:35.092654Z","title":"Procedures of sequential decoding,","venue":null,"work_id":"bffffeab-2fd1-4354-814f-8f9544cf1f73","year":1975},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.964834Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:20f727936489601cf7763804c4ceeee8e53e769de5c48cbd8ca7cd787e00e81f","observation_id":"2077ed1c-0d47-4cb5-bdfa-754f1c8c7f53","resolution":{"observed_at":"2026-08-10T17:03:35.096931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T17:03:35.076368Z","title":"Fast sequential decoding algorithm using a stack,","venue":null,"work_id":"2e3c7f3a-9aa8-498b-8f8b-e9bcff32ea57","year":1969},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.969178Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:67ce286be345827bf7a3543d8df627b05cd83e4631dcbde32942a31b392f0a01","observation_id":"a0366228-67ef-4733-9c5e-b9ee444a0ea0","resolution":{"observed_at":"2026-08-10T17:03:35.082132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:03:34.973955Z","title":"Channel coding rate in the finite blocklength regime,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.973955Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:7d3865ed64e4e05399938a774b553c6f5f33f72c005c6b664d1e3164e0c715f3","observation_id":"795ed680-3100-4792-a675-36f1e3167482","resolution":{"observed_at":"2026-08-10T17:03:34.973955Z","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-10T17:03:35.049216Z","title":"Capacity-achieving guessing random additive noise decoding,","venue":null,"work_id":"9b53a6c0-769d-4521-97b1-cf856ca38a9c","year":2019},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.978551Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:7416686b242541959d24ecead239f9c2d45be92ef0548452f86a3df2c169cda4","observation_id":"de12547d-eea7-4d84-913f-43533dbb78fd","resolution":{"observed_at":"2026-08-10T17:03:35.054108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T17:03:35.030390Z","title":"Random sta ircase generator matrix codes,","venue":null,"work_id":"a68eabb5-a4d4-4bfe-99b7-f02bf5b806ab","year":2024},"citing_paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:03:34.982910Z"},"links":{"citing_paper":"/paper/2501.12834"},"observation_digest":"sha256:6504c5d5bc8d41e3514cd8f0088ad9c23d0cb83fe6a310c797ed5e0759f41832","observation_id":"bb8a8a25-2ac8-4768-893d-ed1f77a65a34","resolution":{"observed_at":"2026-08-10T17:03:35.037317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.12834","last_updated":"2025-01-22T12:20:55Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T05:41:48.480455Z","submitted_at":"2025-01-22T12:20:55Z","title":"The Optimization of Random Tree Codes for Limited Computational Resources"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":12},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2501.12834."}