{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JWQJEUDGC3LJ4FTRSDUAAN3A6M","short_pith_number":"pith:JWQJEUDG","schema_version":"1.0","canonical_sha256":"4da092506616d69e167190e8003760f30af6ecbc9c079acbc35f28a1b6a67519","source":{"kind":"arxiv","id":"1901.03614","version":1},"attestation_state":"computed","paper":{"title":"Jammer-Assisted Resource Allocation in Secure OFDMA With Untrusted Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Jindal, Ravikant Saini, Swades De","submitted_at":"2019-01-11T15:29:12Z","abstract_excerpt":"In this paper, we consider the problem of resource allocation in the orthogonal frequency division multiple access system with single source and M untrusted users in presence of a friendly jammer. The jammer is used to improve either the weighted sum secure rate or the overall system fairness. The formulated optimization problem in both the cases is a mixed integer non-linear programming problem, belonging to the class of NP-hard. In the sum secure rate maximization scenario, we decouple the problem and first obtain the subcarrier allocation at source and the decision for jammer power utilizat"},"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":"1901.03614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-11T15:29:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ef45736ed75f9f73fa0ede7481a36ad4e2083a70966e10efa2ad1a475b75fa4","abstract_canon_sha256":"c62e55c96472c33c8066a179cf484f1acc1c508eaf14734e16a67328d5e7dbcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.836722Z","signature_b64":"ur93zBkdognBSMDuRMLHh0w/dRF+PXJLmRr8zNvWtJYdUTDhiHxc1bucicG2N+w+/7zCBk7iv3OzlpOau4U9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da092506616d69e167190e8003760f30af6ecbc9c079acbc35f28a1b6a67519","last_reissued_at":"2026-05-17T23:56:30.836268Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.836268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jammer-Assisted Resource Allocation in Secure OFDMA With Untrusted Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Jindal, Ravikant Saini, Swades De","submitted_at":"2019-01-11T15:29:12Z","abstract_excerpt":"In this paper, we consider the problem of resource allocation in the orthogonal frequency division multiple access system with single source and M untrusted users in presence of a friendly jammer. The jammer is used to improve either the weighted sum secure rate or the overall system fairness. The formulated optimization problem in both the cases is a mixed integer non-linear programming problem, belonging to the class of NP-hard. In the sum secure rate maximization scenario, we decouple the problem and first obtain the subcarrier allocation at source and the decision for jammer power utilizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03614","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":""},"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":"1901.03614","created_at":"2026-05-17T23:56:30.836365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03614v1","created_at":"2026-05-17T23:56:30.836365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03614","created_at":"2026-05-17T23:56:30.836365+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWQJEUDGC3LJ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWQJEUDGC3LJ4FTR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWQJEUDG","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M","json":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M.json","graph_json":"https://pith.science/api/pith-number/JWQJEUDGC3LJ4FTRSDUAAN3A6M/graph.json","events_json":"https://pith.science/api/pith-number/JWQJEUDGC3LJ4FTRSDUAAN3A6M/events.json","paper":"https://pith.science/paper/JWQJEUDG"},"agent_actions":{"view_html":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M","download_json":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M.json","view_paper":"https://pith.science/paper/JWQJEUDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03614&json=true","fetch_graph":"https://pith.science/api/pith-number/JWQJEUDGC3LJ4FTRSDUAAN3A6M/graph.json","fetch_events":"https://pith.science/api/pith-number/JWQJEUDGC3LJ4FTRSDUAAN3A6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M/action/storage_attestation","attest_author":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M/action/author_attestation","sign_citation":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M/action/citation_signature","submit_replication":"https://pith.science/pith/JWQJEUDGC3LJ4FTRSDUAAN3A6M/action/replication_record"}},"created_at":"2026-05-17T23:56:30.836365+00:00","updated_at":"2026-05-17T23:56:30.836365+00:00"}