{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5EXOC5WHI2TAA4HLOTHWOTJUE7","short_pith_number":"pith:5EXOC5WH","schema_version":"1.0","canonical_sha256":"e92ee176c746a60070eb74cf674d3427d1c2c44ed9b1c2a1c436d94aae0c7d8d","source":{"kind":"arxiv","id":"2503.09991","version":2},"attestation_state":"computed","paper":{"title":"Finite Field Multiple Access II:from Symbol-wise to Codeword-wise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qi-yue Yu, Shi-wen Lin, Ting-wei Yang","submitted_at":"2025-03-13T03:00:50Z","abstract_excerpt":"A finite-field multiple-access (FFMA) system separates users within a finite field by utilizing different element-pairs (EPs) as virtual resources. The Cartesian product of distinct EPs forms an EP code, which serves as the input to a finite-field multiplexing module (FF-MUX). This allows the FFMA technique to reorder the channel coding and multiplexing modules, enabling the superimposed signals to function as codewords that can be decoded by a channel code. This flexibility allows the FFMA system to efficiently support a large number of users with short packet traffic, addressing the finite b"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2503.09991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-03-13T03:00:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c8bde8769a7dc226a83a8adafe7249e92c7dad764a98e2927bc9c3ad7bc46c2","abstract_canon_sha256":"85eb03742136dab70e23ed3ecfb28804fa7bcf451e0d1c0794cd0756ade656cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:37.628340Z","signature_b64":"jeto/XEKGsrbsFMSyog1ViwnOZln2YHiQYyQn7m5YDK96ENTZ57ZTc0fFx0J2GLv+OW13XFwPLXwl1e4VuDMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92ee176c746a60070eb74cf674d3427d1c2c44ed9b1c2a1c436d94aae0c7d8d","last_reissued_at":"2026-07-05T11:22:37.627773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:37.627773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Field Multiple Access II:from Symbol-wise to Codeword-wise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qi-yue Yu, Shi-wen Lin, Ting-wei Yang","submitted_at":"2025-03-13T03:00:50Z","abstract_excerpt":"A finite-field multiple-access (FFMA) system separates users within a finite field by utilizing different element-pairs (EPs) as virtual resources. The Cartesian product of distinct EPs forms an EP code, which serves as the input to a finite-field multiplexing module (FF-MUX). This allows the FFMA technique to reorder the channel coding and multiplexing modules, enabling the superimposed signals to function as codewords that can be decoded by a channel code. This flexibility allows the FFMA system to efficiently support a large number of users with short packet traffic, addressing the finite b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.09991","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.09991/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.09991","created_at":"2026-07-05T11:22:37.627840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.09991v2","created_at":"2026-07-05T11:22:37.627840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.09991","created_at":"2026-07-05T11:22:37.627840+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EXOC5WHI2TA","created_at":"2026-07-05T11:22:37.627840+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EXOC5WHI2TAA4HL","created_at":"2026-07-05T11:22:37.627840+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EXOC5WH","created_at":"2026-07-05T11:22:37.627840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09865","citing_title":"A Global Coding Scheme for OFDM over Finite Fields","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7","json":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7.json","graph_json":"https://pith.science/api/pith-number/5EXOC5WHI2TAA4HLOTHWOTJUE7/graph.json","events_json":"https://pith.science/api/pith-number/5EXOC5WHI2TAA4HLOTHWOTJUE7/events.json","paper":"https://pith.science/paper/5EXOC5WH"},"agent_actions":{"view_html":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7","download_json":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7.json","view_paper":"https://pith.science/paper/5EXOC5WH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.09991&json=true","fetch_graph":"https://pith.science/api/pith-number/5EXOC5WHI2TAA4HLOTHWOTJUE7/graph.json","fetch_events":"https://pith.science/api/pith-number/5EXOC5WHI2TAA4HLOTHWOTJUE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7/action/storage_attestation","attest_author":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7/action/author_attestation","sign_citation":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7/action/citation_signature","submit_replication":"https://pith.science/pith/5EXOC5WHI2TAA4HLOTHWOTJUE7/action/replication_record"}},"created_at":"2026-07-05T11:22:37.627840+00:00","updated_at":"2026-07-05T11:22:37.627840+00:00"}