{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:45QZRB3NCVWH2MPOVGGIZ37OE7","short_pith_number":"pith:45QZRB3N","canonical_record":{"source":{"id":"2605.16144","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-15T16:24:40Z","cross_cats_sorted":["cs.MA","cs.NI"],"title_canon_sha256":"dcdc387c02c1c7a2ed878443f4cddc4deda06617974a6a4e0fcd0adba2e1b7e0","abstract_canon_sha256":"f0bc79865cda9750960742c04a9605ca72bfc88bff54d69ebcf49fe180637151"},"schema_version":"1.0"},"canonical_sha256":"e76198876d156c7d31eea98c8cefee27f8478e039d09c0c5c699a6f4c9c4bc99","source":{"kind":"arxiv","id":"2605.16144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16144","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16144v1","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16144","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"pith_short_12","alias_value":"45QZRB3NCVWH","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"pith_short_16","alias_value":"45QZRB3NCVWH2MPO","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"pith_short_8","alias_value":"45QZRB3N","created_at":"2026-05-20T00:01:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:45QZRB3NCVWH2MPOVGGIZ37OE7","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16144","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-15T16:24:40Z","cross_cats_sorted":["cs.MA","cs.NI"],"title_canon_sha256":"dcdc387c02c1c7a2ed878443f4cddc4deda06617974a6a4e0fcd0adba2e1b7e0","abstract_canon_sha256":"f0bc79865cda9750960742c04a9605ca72bfc88bff54d69ebcf49fe180637151"},"schema_version":"1.0"},"canonical_sha256":"e76198876d156c7d31eea98c8cefee27f8478e039d09c0c5c699a6f4c9c4bc99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:54.894140Z","signature_b64":"Z/jPbBEYV3PYPDs5j8s0M0P4FIdLkOxKN4iLO0Ez6XuqTLPzBXkxtEGsgRxsyjpxwtK7+SVDpIdMwIdFnRAMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e76198876d156c7d31eea98c8cefee27f8478e039d09c0c5c699a6f4c9c4bc99","last_reissued_at":"2026-05-20T00:01:54.893382Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:54.893382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16144","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPlJamI/YeCAPGqm74ndGgGYQwS/4BirGR4GDPUhBZn7rla1Fa0JS/92LkLCVhkI6cRKiYC2Ve3wvKmUiN6bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:39:43.848939Z"},"content_sha256":"e28fc9c36dd72b3ca25f3b3f17688e3a5ffdb2c9154d49cd06e3d91a850ebddb","schema_version":"1.0","event_id":"sha256:e28fc9c36dd72b3ca25f3b3f17688e3a5ffdb2c9154d49cd06e3d91a850ebddb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:45QZRB3NCVWH2MPOVGGIZ37OE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MAxLM: Multi-Agent Language Model-Based Scheduling and Resource Allocation in MU-MIMO-OFDMA-Enabled Wireless Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A multi-agent system using pretrained language models optimizes scheduling and resource allocation to increase uplink throughput in MU-MIMO-OFDMA wireless networks.","cross_cats":["cs.MA","cs.NI"],"primary_cat":"eess.SP","authors_text":"Adnan Quadri, Hongxiang Li","submitted_at":"2026-05-15T16:24:40Z","abstract_excerpt":"Wireless networks support multi-user (MU) communication with multiple-input multiple-output (MIMO) and orthogonal frequency-division multiple access (OFDMA) technologies. In the joint MU-MIMO-OFDMA-enabled transmission mode, network throughput can be significantly increased by effectively utilizing the multi-channel resources to schedule numerous wireless users/stations (STAs) simultaneously. In this paper, we study ways to optimize the user scheduling and resource allocation (SRA) for the UL scheduled access (UL-SA) of a joint MU-MIMO-OFDMA-enabled wireless local area network (WLAN). In parti"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Numerical results confirm that our proposed technique achieves higher UL-SA throughput than the benchmark techniques.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that a general pretrained language model, without domain-specific fine-tuning or explicit mathematical modeling of the wireless channel, can reliably produce near-optimal scheduling decisions across varying numbers of stations and antenna configurations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A multi-agent language model approach delivers higher uplink throughput than benchmarks for scheduling and resource allocation in MU-MIMO-OFDMA WLANs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A multi-agent system using pretrained language models optimizes scheduling and resource allocation to increase uplink throughput in MU-MIMO-OFDMA wireless networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"febc7c6ab7c9a83afa6ce35d5099149ed7c8b1e585fc57993ec5f05d0aa30a8e"},"source":{"id":"2605.16144","kind":"arxiv","version":1},"verdict":{"id":"fbca9914-c764-492a-8125-a0f9ad66612b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:37:24.551513Z","strongest_claim":"Numerical results confirm that our proposed technique achieves higher UL-SA throughput than the benchmark techniques.","one_line_summary":"A multi-agent language model approach delivers higher uplink throughput than benchmarks for scheduling and resource allocation in MU-MIMO-OFDMA WLANs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that a general pretrained language model, without domain-specific fine-tuning or explicit mathematical modeling of the wireless channel, can reliably produce near-optimal scheduling decisions across varying numbers of stations and antenna configurations.","pith_extraction_headline":"A multi-agent system using pretrained language models optimizes scheduling and resource allocation to increase uplink throughput in MU-MIMO-OFDMA wireless networks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16144/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:23.226684Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:51:59.469549Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T18:22:03.531211Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:31.047542Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.450740Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ef6d84f817473c6bc736399db9fed1f8826e0a1e441e00bfaf655a3dff91db19"},"references":{"count":15,"sample":[{"doi":"","year":2021,"title":"R. Zhang, K. Xiong, Y. Lu, B. Gao, P. Fan, and K. B. Letaief, ‘‘Joint coordinated beamforming and power splitting ratio optimization in mu-miso swipt-enabled hetnets: A multi- agent ddqn-based approac","work_id":"6e8b510d-ec1d-4a6d-bf19-26a72512fec5","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"A. Quadri and H. Li, ‘‘Resource allocation using deep learning in uplink 802.11 ax networks,’’ in GLOBECOM 2023-2023 IEEE Global Communications Conference. IEEE, 2023, pp. 4020–4025","work_id":"9b8566f5-be2d-47c6-a07e-feb9b75e3209","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"R. Balakrishnan, K. Sankhe, V. S. Somayazulu, R. Van- nithamby, and J. Sydir, ‘‘Deep reinforcement learning based traffic-and channel-aware ofdma resource allocation,’’ in 2019 IEEE Global Communicatio","work_id":"b762d8b9-5b27-4a70-bcb3-7b5217af9995","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Y. S. Nasir and D. Guo, ‘‘Multi-agent deep reinforcement learning for dynamic power allocation in wireless networks,’’ IEEE Journal on Selected Areas in Communications, vol. 37, no. 10, pp. 2239–2250,","work_id":"5e555e0d-1737-4cb7-8944-4226236a2397","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"N. Naderializadeh, J. J. Sydir, M. Simsek, and H. Nikopour, ‘‘Resource management in wireless networks via multi-agent deep reinforcement learning,’’ IEEE Transactions on Wireless Communications, vol.","work_id":"e8a4fffc-0929-4c34-9f60-7e3c2141d49a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"b97fa0b62766470d60817bdd79446136a0924d65853b420c6cc95c5a10d2b34e","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ce86e8c4f41d51c98d7ddf1616a55d1eca29bdad5d5dcabdd948ba96a2f93b13"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"fbca9914-c764-492a-8125-a0f9ad66612b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCbzQDtoA2aU1lG1uvZl+kxEElj3DjlM8TBI0Za6UCUvLGYRx8QGt6irIPT9b444pG/8nkLQ+kQUM0QuaoQ9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:39:43.850085Z"},"content_sha256":"ded71d495edfb27c21c4559dee9aa5433d7526213ed12be948998818eabb9d82","schema_version":"1.0","event_id":"sha256:ded71d495edfb27c21c4559dee9aa5433d7526213ed12be948998818eabb9d82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45QZRB3NCVWH2MPOVGGIZ37OE7/bundle.json","state_url":"https://pith.science/pith/45QZRB3NCVWH2MPOVGGIZ37OE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45QZRB3NCVWH2MPOVGGIZ37OE7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:39:43Z","links":{"resolver":"https://pith.science/pith/45QZRB3NCVWH2MPOVGGIZ37OE7","bundle":"https://pith.science/pith/45QZRB3NCVWH2MPOVGGIZ37OE7/bundle.json","state":"https://pith.science/pith/45QZRB3NCVWH2MPOVGGIZ37OE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45QZRB3NCVWH2MPOVGGIZ37OE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:45QZRB3NCVWH2MPOVGGIZ37OE7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0bc79865cda9750960742c04a9605ca72bfc88bff54d69ebcf49fe180637151","cross_cats_sorted":["cs.MA","cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-15T16:24:40Z","title_canon_sha256":"dcdc387c02c1c7a2ed878443f4cddc4deda06617974a6a4e0fcd0adba2e1b7e0"},"schema_version":"1.0","source":{"id":"2605.16144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16144","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16144v1","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16144","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"pith_short_12","alias_value":"45QZRB3NCVWH","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"pith_short_16","alias_value":"45QZRB3NCVWH2MPO","created_at":"2026-05-20T00:01:54Z"},{"alias_kind":"pith_short_8","alias_value":"45QZRB3N","created_at":"2026-05-20T00:01:54Z"}],"graph_snapshots":[{"event_id":"sha256:ded71d495edfb27c21c4559dee9aa5433d7526213ed12be948998818eabb9d82","target":"graph","created_at":"2026-05-20T00:01:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Numerical results confirm that our proposed technique achieves higher UL-SA throughput than the benchmark techniques."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that a general pretrained language model, without domain-specific fine-tuning or explicit mathematical modeling of the wireless channel, can reliably produce near-optimal scheduling decisions across varying numbers of stations and antenna configurations."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A multi-agent language model approach delivers higher uplink throughput than benchmarks for scheduling and resource allocation in MU-MIMO-OFDMA WLANs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A multi-agent system using pretrained language models optimizes scheduling and resource allocation to increase uplink throughput in MU-MIMO-OFDMA wireless networks."}],"snapshot_sha256":"febc7c6ab7c9a83afa6ce35d5099149ed7c8b1e585fc57993ec5f05d0aa30a8e"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ce86e8c4f41d51c98d7ddf1616a55d1eca29bdad5d5dcabdd948ba96a2f93b13"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:23.226684Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:51:59.469549Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T18:22:03.531211Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:31.047542Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.450740Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16144/integrity.json","findings":[],"snapshot_sha256":"ef6d84f817473c6bc736399db9fed1f8826e0a1e441e00bfaf655a3dff91db19","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Wireless networks support multi-user (MU) communication with multiple-input multiple-output (MIMO) and orthogonal frequency-division multiple access (OFDMA) technologies. In the joint MU-MIMO-OFDMA-enabled transmission mode, network throughput can be significantly increased by effectively utilizing the multi-channel resources to schedule numerous wireless users/stations (STAs) simultaneously. In this paper, we study ways to optimize the user scheduling and resource allocation (SRA) for the UL scheduled access (UL-SA) of a joint MU-MIMO-OFDMA-enabled wireless local area network (WLAN). In parti","authors_text":"Adnan Quadri, Hongxiang Li","cross_cats":["cs.MA","cs.NI"],"headline":"A multi-agent system using pretrained language models optimizes scheduling and resource allocation to increase uplink throughput in MU-MIMO-OFDMA wireless networks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-15T16:24:40Z","title":"MAxLM: Multi-Agent Language Model-Based Scheduling and Resource Allocation in MU-MIMO-OFDMA-Enabled Wireless Networks"},"references":{"count":15,"internal_anchors":0,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. Zhang, K. Xiong, Y. Lu, B. Gao, P. Fan, and K. B. Letaief, ‘‘Joint coordinated beamforming and power splitting ratio optimization in mu-miso swipt-enabled hetnets: A multi- agent ddqn-based approac","work_id":"6e8b510d-ec1d-4a6d-bf19-26a72512fec5","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A. Quadri and H. Li, ‘‘Resource allocation using deep learning in uplink 802.11 ax networks,’’ in GLOBECOM 2023-2023 IEEE Global Communications Conference. IEEE, 2023, pp. 4020–4025","work_id":"9b8566f5-be2d-47c6-a07e-feb9b75e3209","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"R. Balakrishnan, K. Sankhe, V. S. Somayazulu, R. Van- nithamby, and J. Sydir, ‘‘Deep reinforcement learning based traffic-and channel-aware ofdma resource allocation,’’ in 2019 IEEE Global Communicatio","work_id":"b762d8b9-5b27-4a70-bcb3-7b5217af9995","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Y. S. Nasir and D. Guo, ‘‘Multi-agent deep reinforcement learning for dynamic power allocation in wireless networks,’’ IEEE Journal on Selected Areas in Communications, vol. 37, no. 10, pp. 2239–2250,","work_id":"5e555e0d-1737-4cb7-8944-4226236a2397","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"N. Naderializadeh, J. J. Sydir, M. Simsek, and H. Nikopour, ‘‘Resource management in wireless networks via multi-agent deep reinforcement learning,’’ IEEE Transactions on Wireless Communications, vol.","work_id":"e8a4fffc-0929-4c34-9f60-7e3c2141d49a","year":2021}],"snapshot_sha256":"b97fa0b62766470d60817bdd79446136a0924d65853b420c6cc95c5a10d2b34e"},"source":{"id":"2605.16144","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:37:24.551513Z","id":"fbca9914-c764-492a-8125-a0f9ad66612b","model_set":{"reader":"grok-4.3"},"one_line_summary":"A multi-agent language model approach delivers higher uplink throughput than benchmarks for scheduling and resource allocation in MU-MIMO-OFDMA WLANs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A multi-agent system using pretrained language models optimizes scheduling and resource allocation to increase uplink throughput in MU-MIMO-OFDMA wireless networks.","strongest_claim":"Numerical results confirm that our proposed technique achieves higher UL-SA throughput than the benchmark techniques.","weakest_assumption":"The assumption that a general pretrained language model, without domain-specific fine-tuning or explicit mathematical modeling of the wireless channel, can reliably produce near-optimal scheduling decisions across varying numbers of stations and antenna configurations."}},"verdict_id":"fbca9914-c764-492a-8125-a0f9ad66612b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e28fc9c36dd72b3ca25f3b3f17688e3a5ffdb2c9154d49cd06e3d91a850ebddb","target":"record","created_at":"2026-05-20T00:01:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f0bc79865cda9750960742c04a9605ca72bfc88bff54d69ebcf49fe180637151","cross_cats_sorted":["cs.MA","cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-05-15T16:24:40Z","title_canon_sha256":"dcdc387c02c1c7a2ed878443f4cddc4deda06617974a6a4e0fcd0adba2e1b7e0"},"schema_version":"1.0","source":{"id":"2605.16144","kind":"arxiv","version":1}},"canonical_sha256":"e76198876d156c7d31eea98c8cefee27f8478e039d09c0c5c699a6f4c9c4bc99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e76198876d156c7d31eea98c8cefee27f8478e039d09c0c5c699a6f4c9c4bc99","first_computed_at":"2026-05-20T00:01:54.893382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:54.893382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z/jPbBEYV3PYPDs5j8s0M0P4FIdLkOxKN4iLO0Ez6XuqTLPzBXkxtEGsgRxsyjpxwtK7+SVDpIdMwIdFnRAMDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:54.894140Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e28fc9c36dd72b3ca25f3b3f17688e3a5ffdb2c9154d49cd06e3d91a850ebddb","sha256:ded71d495edfb27c21c4559dee9aa5433d7526213ed12be948998818eabb9d82"],"state_sha256":"f8927068466a68b97e2735a7e5ed2e3ad3b83837a02c8819ad5dd54ffd0032d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+2dKKlX4ljvg/JT2qp2rCJhphU1gUT8nFNx/2zGwow9WEo1cBb3uUGYCF3cNPNilaY4yqS4ecZ/64YbwsD/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:39:43.853808Z","bundle_sha256":"331d8eacae536d6e98c77605ad1bbc8642d06ed77e635792c570a69fdbe81507"}}