{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WJWQ7ERBTWUGWVBDJFODQRH625","short_pith_number":"pith:WJWQ7ERB","schema_version":"1.0","canonical_sha256":"b26d0f92219da86b5423495c3844fed75a448d7d807e5559ac05a649fa82c609","source":{"kind":"arxiv","id":"2011.03232","version":2},"attestation_state":"computed","paper":{"title":"Hybrid Multicast/Unicast Design in NOMA-based Vehicular Caching System with Supplementary Material","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojie Chen, Hua Yu, Miaowen Wen, Xinyue Pei, Yingyang Chen","submitted_at":"2020-11-06T08:34:54Z","abstract_excerpt":"In this paper, we investigate a hybrid multicast/ unicast scheme for a multiple-input single-output cache-aided non-orthogonal multiple access (NOMA) vehicular scenario in the face of rapidly fluctuating vehicular wireless channels. Considering a more practical situation, imperfect channel state information is taking into account. In this paper, we formulate an optimization problem to maximize the unicast sum rate under the constraints of the peak power, the peak backhaul, the minimum unicast rate, and the maximum multicast outage probability. To solve the formulated non-convex problem, a lowe"},"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":"2011.03232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-06T08:34:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63db3e3354180c12ee4fd2b894094e3fe99b8d9f26f625d81f1c255f5894334e","abstract_canon_sha256":"276bab718ed8ec2ba060c5be1046720a7584f28d61ec1955d2987a94025cb180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:22.942532Z","signature_b64":"173HekkcsrsrmkKZmx1ezim0g3FhwpwXY6UK7WgrYzjbJer9q/KH9Yeh7vHvwOTaTmR4A9q+pErgIUYo9RV/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26d0f92219da86b5423495c3844fed75a448d7d807e5559ac05a649fa82c609","last_reissued_at":"2026-07-05T01:53:22.942154Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:22.942154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Multicast/Unicast Design in NOMA-based Vehicular Caching System with Supplementary Material","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojie Chen, Hua Yu, Miaowen Wen, Xinyue Pei, Yingyang Chen","submitted_at":"2020-11-06T08:34:54Z","abstract_excerpt":"In this paper, we investigate a hybrid multicast/ unicast scheme for a multiple-input single-output cache-aided non-orthogonal multiple access (NOMA) vehicular scenario in the face of rapidly fluctuating vehicular wireless channels. Considering a more practical situation, imperfect channel state information is taking into account. In this paper, we formulate an optimization problem to maximize the unicast sum rate under the constraints of the peak power, the peak backhaul, the minimum unicast rate, and the maximum multicast outage probability. To solve the formulated non-convex problem, a lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03232","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/2011.03232/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":"2011.03232","created_at":"2026-07-05T01:53:22.942210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.03232v2","created_at":"2026-07-05T01:53:22.942210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03232","created_at":"2026-07-05T01:53:22.942210+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJWQ7ERBTWUG","created_at":"2026-07-05T01:53:22.942210+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJWQ7ERBTWUGWVBD","created_at":"2026-07-05T01:53:22.942210+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJWQ7ERB","created_at":"2026-07-05T01:53:22.942210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20234","citing_title":"Validating Generative Agent-Based Models for Logistics and Supply Chain Management Research","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625","json":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625.json","graph_json":"https://pith.science/api/pith-number/WJWQ7ERBTWUGWVBDJFODQRH625/graph.json","events_json":"https://pith.science/api/pith-number/WJWQ7ERBTWUGWVBDJFODQRH625/events.json","paper":"https://pith.science/paper/WJWQ7ERB"},"agent_actions":{"view_html":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625","download_json":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625.json","view_paper":"https://pith.science/paper/WJWQ7ERB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.03232&json=true","fetch_graph":"https://pith.science/api/pith-number/WJWQ7ERBTWUGWVBDJFODQRH625/graph.json","fetch_events":"https://pith.science/api/pith-number/WJWQ7ERBTWUGWVBDJFODQRH625/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625/action/storage_attestation","attest_author":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625/action/author_attestation","sign_citation":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625/action/citation_signature","submit_replication":"https://pith.science/pith/WJWQ7ERBTWUGWVBDJFODQRH625/action/replication_record"}},"created_at":"2026-07-05T01:53:22.942210+00:00","updated_at":"2026-07-05T01:53:22.942210+00:00"}