{"as_of":"2026-08-16T08:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a05b39f4a043799bcf636623930fa6658041b4485c5a9edecce76a873d7f147","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:25:08.518518Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T23:55:02.080802Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1707.01134","last_updated":"2018-05-22T17:55:07Z","snapshot_observed_at":"2026-08-15T21:55:21.061223Z","submitted_at":"2017-07-04T18:53:52Z","title":"Achievable Rates for Probabilistic Shaping","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.01134","snapshot_observed_at":"2026-08-14T14:25:08.518518Z","title":"Available: http://arxiv.org/abs/arXiv:1707.01134","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04205","last_updated":"2020-07-23T12:18:07Z","snapshot_observed_at":"2026-08-15T23:32:15.559342Z","submitted_at":"2019-08-09T14:18:22Z","title":"On Product Codes with Probabilistic Amplitude Shaping for High-Throughput Fiber-Optic Systems","version":4},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T14:25:08.518518Z"},"links":{"cited_paper":"/paper/1707.01134","citing_paper":"/paper/1908.04205"},"observation_digest":"sha256:b8b24136cfa11795d4861a8bb8d7171d21768513987565b381c540e3d1761394","observation_id":"d8ed3065-e2e0-441f-b866-a3db1ee6f3ec","resolution":{"observed_at":"2026-08-14T14:25:08.518518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.01134","last_updated":"2018-05-22T17:55:07Z","snapshot_observed_at":"2026-08-15T21:55:21.061223Z","submitted_at":"2017-07-04T18:53:52Z","title":"Achievable Rates for Probabilistic Shaping","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.01134","snapshot_observed_at":"2026-08-10T20:21:17.519969Z","title":"Achievable rates for probabilistic shaping,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.08871","last_updated":"2025-07-15T13:57:11Z","snapshot_observed_at":"2026-08-15T02:16:57.455569Z","submitted_at":"2025-01-15T15:40:42Z","title":"Joint Detection and Decoding: A Graph Neural Network Approach","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T20:21:17.519969Z"},"links":{"cited_paper":"/paper/1707.01134","citing_paper":"/paper/2501.08871"},"observation_digest":"sha256:5afe85362a9b2f8c4c81d038ace4bb450f8adde62d2e6ccc8c417cc31ba583f6","observation_id":"f0c7901b-c356-4024-aef7-e3baea782c92","resolution":{"observed_at":"2026-08-10T20:21:17.519969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.01134","last_updated":"2018-05-22T17:55:07Z","snapshot_observed_at":"2026-08-15T21:55:21.061223Z","submitted_at":"2017-07-04T18:53:52Z","title":"Achievable Rates for Probabilistic Shaping","version":5},"cited_work":{"arxiv_id":"1707.01134","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.01134","snapshot_observed_at":"2026-08-06T23:55:02.080802Z","title":"Achievable Rates for Probabilistic Shaping","venue":"cs.IT","work_id":"4d9947ed-818a-4a2c-9b1a-433bca1e6504","year":2017},"citing_paper":{"arxiv_id":"2506.16098","last_updated":"2025-06-19T07:35:48Z","snapshot_observed_at":"2026-08-12T14:12:09.048401Z","submitted_at":"2025-06-19T07:35:48Z","title":"End-to-End Learning of Probabilistic Constellation Shaping through Importance Sampling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:55:01.999359Z"},"links":{"cited_paper":"/paper/1707.01134","citing_paper":"/paper/2506.16098"},"observation_digest":"sha256:22191164769ecd680349ec0d111a5e6585d7fd37a6b3e827e222084efc42f6cd","observation_id":"6267066a-3b12-4e39-b4c9-ed7708069ed6","resolution":{"observed_at":"2026-08-06T23:55:02.084425Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1707.01134/citation-record","integrity":"/paper/1707.01134/integrity","json":"/paper/1707.01134/citation-record.json","paper":"/paper/1707.01134"},"outbound":[],"paper":{"arxiv_id":"1707.01134","last_updated":"2018-05-22T17:55:07Z","latest_version":5,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-15T21:55:21.061223Z","submitted_at":"2017-07-04T18:53:52Z","title":"Achievable Rates for Probabilistic Shaping"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1707.01134."}