{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:32OLSDNOMJ44ND3ZH6GIB7CZ35","short_pith_number":"pith:32OLSDNO","canonical_record":{"source":{"id":"2406.05747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T11:45:02Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"8834f9abf21a4e09b2559c6a8ff5d93c5d649a569aafa05f4efbecd997882ba1","abstract_canon_sha256":"9ed9bc410b87efddb2dba04d23a15c5e87dd77abe9b6012de659c58e0fcd0f06"},"schema_version":"1.0"},"canonical_sha256":"de9cb90dae6279c68f793f8c80fc59df7e66da5f0b49685ffe1896f37dca5dcb","source":{"kind":"arxiv","id":"2406.05747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05747","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05747v1","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05747","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"pith_short_12","alias_value":"32OLSDNOMJ44","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"pith_short_16","alias_value":"32OLSDNOMJ44ND3Z","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"pith_short_8","alias_value":"32OLSDNO","created_at":"2026-07-05T08:29:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:32OLSDNOMJ44ND3ZH6GIB7CZ35","target":"record","payload":{"canonical_record":{"source":{"id":"2406.05747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T11:45:02Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"8834f9abf21a4e09b2559c6a8ff5d93c5d649a569aafa05f4efbecd997882ba1","abstract_canon_sha256":"9ed9bc410b87efddb2dba04d23a15c5e87dd77abe9b6012de659c58e0fcd0f06"},"schema_version":"1.0"},"canonical_sha256":"de9cb90dae6279c68f793f8c80fc59df7e66da5f0b49685ffe1896f37dca5dcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:33.174928Z","signature_b64":"XL6pDqqp3pbtAkLLvWGgAS81/eyl9l72q+0IzrYmOXYEOyIbW5iLlkXRk8iD6iJNuRkk7HhtAFXFdLz/JJW7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de9cb90dae6279c68f793f8c80fc59df7e66da5f0b49685ffe1896f37dca5dcb","last_reissued_at":"2026-07-05T08:29:33.174515Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:33.174515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.05747","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-07-05T08:29:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eEtnGEUOsLmjQtWbdwrRhfDnDW9LAWXJRcz2EH5xSxBOdiW4BsWvpAEgMrDedxsK7uRxtviy4PIoq8gPHT+vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:37:32.616429Z"},"content_sha256":"ff23781564433b38fc95d6d3ffedda9f82c74573f9bc9de21a8fa52ec3a71a1b","schema_version":"1.0","event_id":"sha256:ff23781564433b38fc95d6d3ffedda9f82c74573f9bc9de21a8fa52ec3a71a1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:32OLSDNOMJ44ND3ZH6GIB7CZ35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rapid Optimization of Superposition Codes for Multi-Hop NOMA MANETs via Deep Unfolding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Nir Shlezinger, Tomer Alter","submitted_at":"2024-06-09T11:45:02Z","abstract_excerpt":"Various communication technologies are expected to utilize mobile ad hoc networks (MANETs). By combining MANETs with non-orthogonal multiple access (NOMA) communications, one can support scalable, spectrally efficient, and flexible network topologies. To achieve these benefits of NOMA MANETs, one should determine the transmission protocol, particularly the superposition code. However, the latter involves lengthy optimization that has to be repeated when the topology changes. In this work, we propose an algorithm for rapidly optimizing superposition codes in multi-hop NOMA MANETs. To achieve re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05747","kind":"arxiv","version":1},"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/2406.05747/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:29:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vILR9+iTx77d0CtNKTfJCFHFcXS3sYVWXXaDel8Ue8MGdhoCUY2v6/UBNNgYapHPPdFrWt0MTWKvtsBEelfDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:37:32.616976Z"},"content_sha256":"23a55d31f447b9a64d82f3e014518f10cd7d8f0b8cf0fbb6ce9053e37c414857","schema_version":"1.0","event_id":"sha256:23a55d31f447b9a64d82f3e014518f10cd7d8f0b8cf0fbb6ce9053e37c414857"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32OLSDNOMJ44ND3ZH6GIB7CZ35/bundle.json","state_url":"https://pith.science/pith/32OLSDNOMJ44ND3ZH6GIB7CZ35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32OLSDNOMJ44ND3ZH6GIB7CZ35/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-08-07T07:37:32Z","links":{"resolver":"https://pith.science/pith/32OLSDNOMJ44ND3ZH6GIB7CZ35","bundle":"https://pith.science/pith/32OLSDNOMJ44ND3ZH6GIB7CZ35/bundle.json","state":"https://pith.science/pith/32OLSDNOMJ44ND3ZH6GIB7CZ35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32OLSDNOMJ44ND3ZH6GIB7CZ35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:32OLSDNOMJ44ND3ZH6GIB7CZ35","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":"9ed9bc410b87efddb2dba04d23a15c5e87dd77abe9b6012de659c58e0fcd0f06","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T11:45:02Z","title_canon_sha256":"8834f9abf21a4e09b2559c6a8ff5d93c5d649a569aafa05f4efbecd997882ba1"},"schema_version":"1.0","source":{"id":"2406.05747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05747","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05747v1","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05747","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"pith_short_12","alias_value":"32OLSDNOMJ44","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"pith_short_16","alias_value":"32OLSDNOMJ44ND3Z","created_at":"2026-07-05T08:29:33Z"},{"alias_kind":"pith_short_8","alias_value":"32OLSDNO","created_at":"2026-07-05T08:29:33Z"}],"graph_snapshots":[{"event_id":"sha256:23a55d31f447b9a64d82f3e014518f10cd7d8f0b8cf0fbb6ce9053e37c414857","target":"graph","created_at":"2026-07-05T08:29:33Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.05747/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Various communication technologies are expected to utilize mobile ad hoc networks (MANETs). By combining MANETs with non-orthogonal multiple access (NOMA) communications, one can support scalable, spectrally efficient, and flexible network topologies. To achieve these benefits of NOMA MANETs, one should determine the transmission protocol, particularly the superposition code. However, the latter involves lengthy optimization that has to be repeated when the topology changes. In this work, we propose an algorithm for rapidly optimizing superposition codes in multi-hop NOMA MANETs. To achieve re","authors_text":"Nir Shlezinger, Tomer Alter","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T11:45:02Z","title":"Rapid Optimization of Superposition Codes for Multi-Hop NOMA MANETs via Deep Unfolding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05747","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ff23781564433b38fc95d6d3ffedda9f82c74573f9bc9de21a8fa52ec3a71a1b","target":"record","created_at":"2026-07-05T08:29:33Z","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":"9ed9bc410b87efddb2dba04d23a15c5e87dd77abe9b6012de659c58e0fcd0f06","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-09T11:45:02Z","title_canon_sha256":"8834f9abf21a4e09b2559c6a8ff5d93c5d649a569aafa05f4efbecd997882ba1"},"schema_version":"1.0","source":{"id":"2406.05747","kind":"arxiv","version":1}},"canonical_sha256":"de9cb90dae6279c68f793f8c80fc59df7e66da5f0b49685ffe1896f37dca5dcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de9cb90dae6279c68f793f8c80fc59df7e66da5f0b49685ffe1896f37dca5dcb","first_computed_at":"2026-07-05T08:29:33.174515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:29:33.174515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XL6pDqqp3pbtAkLLvWGgAS81/eyl9l72q+0IzrYmOXYEOyIbW5iLlkXRk8iD6iJNuRkk7HhtAFXFdLz/JJW7DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:29:33.174928Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.05747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff23781564433b38fc95d6d3ffedda9f82c74573f9bc9de21a8fa52ec3a71a1b","sha256:23a55d31f447b9a64d82f3e014518f10cd7d8f0b8cf0fbb6ce9053e37c414857"],"state_sha256":"886fd54057e5a559edae146d30dd6b03e0ae96d6b034b013a6230a2e980fefb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/LsdkRO1xm43kP3HyXUn62NP1dpnvSGXuOrM3rup11aNGBRbhpP/X01g1anQQ0ojBpubdOuOJo9k/Ff+G9bBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:37:32.622609Z","bundle_sha256":"9acc305e2c3c00eef803e734492a74ec5ca2a470dbb4e32865de5a0e92082a66"}}