{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A3ACTHFFTNCRWSOYYCMBK6M33O","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":"c86adda7096a65955783f42b896b1355052a3030cbc96f6135d29ab16d0197d0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-06-11T17:05:46Z","title_canon_sha256":"3aa88369f7e7deafa6b51b6a57bffaf795af08bb31ee16cfe134d55cf9d0e08a"},"schema_version":"1.0","source":{"id":"2606.13582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13582","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13582v1","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13582","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"A3ACTHFFTNCR","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_16","alias_value":"A3ACTHFFTNCRWSOY","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_8","alias_value":"A3ACTHFF","created_at":"2026-06-12T01:10:11Z"}],"graph_snapshots":[{"event_id":"sha256:b447f135ed21a384901cec9dc4b3bfe519493d01e49683ae50cff16dfb2e7745","target":"graph","created_at":"2026-06-12T01:10:11Z","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/2606.13582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate a secure integrated sensing and communication (ISAC) system in which multiple communication users (CUs) coexist with multiple untrusted sensing users (SUs) that may eavesdrop on the confidential information intended for the CUs. To promote security fairness among users, we formulate a max-min secrecy rate optimization problem subject to a transmit power budget and sensing quality requirements characterized by beampattern matching error constraints. The resulting design problem is highly non-convex due to the secrecy rate expressions and non-convex sensing constrai","authors_text":"Dang Y Hoang, Hoang-Lai Pham, Thanh-Nha To, Trung Quang Pham, Tuan Anh Pham","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-06-11T17:05:46Z","title":"Max-Min Secrecy Rate Optimization for Secure ISAC Networks: Global Optimization and Low-Complexity Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13582","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:533189564d0b9ee436273665c500da3bcebd4fa59f92b4b7ad4635b6cca6aab8","target":"record","created_at":"2026-06-12T01:10:11Z","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":"c86adda7096a65955783f42b896b1355052a3030cbc96f6135d29ab16d0197d0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-06-11T17:05:46Z","title_canon_sha256":"3aa88369f7e7deafa6b51b6a57bffaf795af08bb31ee16cfe134d55cf9d0e08a"},"schema_version":"1.0","source":{"id":"2606.13582","kind":"arxiv","version":1}},"canonical_sha256":"06c0299ca59b451b49d8c09815799bdb85c7e0225eda188d3d11842435b778ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06c0299ca59b451b49d8c09815799bdb85c7e0225eda188d3d11842435b778ce","first_computed_at":"2026-06-12T01:10:11.486511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:10:11.486511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+l/hxLGII5C0/gP97EOYhT4BMMvgnU6ikb3b9vpnoEyoQ1uF2H+5N0NQrO2VtrQiLQU2AiWblpZSl6dozp6zAg==","signature_status":"signed_v1","signed_at":"2026-06-12T01:10:11.487357Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:533189564d0b9ee436273665c500da3bcebd4fa59f92b4b7ad4635b6cca6aab8","sha256:b447f135ed21a384901cec9dc4b3bfe519493d01e49683ae50cff16dfb2e7745"],"state_sha256":"2a1d6ca65c09a30ba222a4bf037a647fb3ec28899c449efcbd67ca3835300290"}