{"as_of":"2026-08-09T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa7adda4cc743ca37c4e080a8b7e92a0d4c8445604d5fe173325c470dcbdd348","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:00:19.315427Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T05:51:24.312475Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.09991","last_updated":"2025-06-17T12:07:53Z","snapshot_observed_at":"2026-08-07T17:08:19.237078Z","submitted_at":"2025-03-13T03:00:50Z","title":"Finite Field Multiple Access II:from Symbol-wise to Codeword-wise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09991","snapshot_observed_at":"2026-08-07T06:00:19.315427Z","title":"Finite field multiple access II: From symbol-wise to codeword-wise,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06796","last_updated":"2025-06-07T13:36:41Z","snapshot_observed_at":"2026-08-09T03:23:12.263671Z","submitted_at":"2025-06-07T13:36:41Z","title":"Polarized Element-pair Code Based FFMA over a Gaussian Multiple-access Channel","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T06:00:19.315427Z"},"links":{"cited_paper":"/paper/2503.09991","citing_paper":"/paper/2506.06796"},"observation_digest":"sha256:be44fa70fe902ffc70875fe70c13b9f53055e6969fb3eb703da489360fa387c1","observation_id":"153a4c6e-b727-4458-b0b4-8424c16eb72a","resolution":{"observed_at":"2026-08-07T06:00:19.315427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09991","last_updated":"2025-06-17T12:07:53Z","snapshot_observed_at":"2026-08-07T17:08:19.237078Z","submitted_at":"2025-03-13T03:00:50Z","title":"Finite Field Multiple Access II:from Symbol-wise to Codeword-wise","version":2},"cited_work":{"arxiv_id":"2503.09991","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.09991","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finite Field Mul- tiple Access II: from Symbol-wise to Codeword-wise","venue":null,"work_id":"11902921-d07c-49c0-8ffb-8db5776c9c58","year":2025},"citing_paper":{"arxiv_id":"2605.09865","last_updated":"2026-05-11T01:49:59Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-11T01:49:59Z","title":"A Global Coding Scheme for OFDM over Finite Fields","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T04:54:03.970085Z"},"links":{"cited_paper":"/paper/2503.09991","citing_paper":"/paper/2605.09865"},"observation_digest":"sha256:0a58feb1a3870300782c994f67e26ab3ef241b2f517ec0a0695d5984f7036b07","observation_id":"2a70f583-8235-4e16-a3f7-929518db6479","resolution":{"observed_at":"2026-05-12T05:51:24.315233Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.09991/citation-record","integrity":"/paper/2503.09991/integrity","json":"/paper/2503.09991/citation-record.json","paper":"/paper/2503.09991"},"outbound":[],"paper":{"arxiv_id":"2503.09991","last_updated":"2025-06-17T12:07:53Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T17:08:19.237078Z","submitted_at":"2025-03-13T03:00:50Z","title":"Finite Field Multiple Access II:from Symbol-wise to Codeword-wise"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.09991."}