{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:37HKMH7652L2N4IZEYEUAGWDKF","short_pith_number":"pith:37HKMH76","canonical_record":{"source":{"id":"1210.1139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T15:12:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac2403187483e950eaf243b244a30d0801a625b66b2c47e18d81ca9ed9a07eb5","abstract_canon_sha256":"675ff633cadd6450ac61d0371706d1bf1ea5e980712b73275c4710597465f84d"},"schema_version":"1.0"},"canonical_sha256":"dfcea61ffeee97a6f1192609401ac351525d21a6f9f879df537aae6bc680f57c","source":{"kind":"arxiv","id":"1210.1139","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1139","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1139v2","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1139","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"37HKMH7652L2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"37HKMH7652L2N4IZ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"37HKMH76","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:37HKMH7652L2N4IZEYEUAGWDKF","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T15:12:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac2403187483e950eaf243b244a30d0801a625b66b2c47e18d81ca9ed9a07eb5","abstract_canon_sha256":"675ff633cadd6450ac61d0371706d1bf1ea5e980712b73275c4710597465f84d"},"schema_version":"1.0"},"canonical_sha256":"dfcea61ffeee97a6f1192609401ac351525d21a6f9f879df537aae6bc680f57c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:45.343480Z","signature_b64":"c94ZUHoc880c2WsI9XK4VDOun5enfA7w4xonlbGoBc6HsTCbexo5LCqVyGinHQtMGlLe9NwXiA920RijAhIECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfcea61ffeee97a6f1192609401ac351525d21a6f9f879df537aae6bc680f57c","last_reissued_at":"2026-05-18T03:15:45.342771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:45.342771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1139","source_version":2,"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-18T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQtz2MI2lLpzTpNlrrJv8oReRq/qDCKffiUAgNDhcROi4xvdFGUZBaWPmbpOjDphB+FP+t2xqswGbFAynLr1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:20:12.217409Z"},"content_sha256":"40d336fe0822d24bab4059bb169cbfce271c8f399e3906c92f6e0cc6aee08c47","schema_version":"1.0","event_id":"sha256:40d336fe0822d24bab4059bb169cbfce271c8f399e3906c92f6e0cc6aee08c47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:37HKMH7652L2N4IZEYEUAGWDKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-Layer Scheduling in Multi-user System with Delay and Secrecy Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Wang, Pengfei Huang, Xudong Wang","submitted_at":"2012-10-03T15:12:27Z","abstract_excerpt":"Recently, physical layer security based approaches have drawn considerable attentions and are envisaged to provide secure communications in the wireless networks. However, most existing literatures only focus on the physical layer. Thus, how to design an effective transmission scheme which also considers the requirements from the upper layers is still an unsolved problem. We consider such cross-layer resource allocation problem in the multi-user downlink environment for both having instantaneous and partial eavesdropping channel information scenarios. The problem is first formulated in a new s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1139","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":""},"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-05-18T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sLUeFkHbSerjM6nfaov9w6KDHSF4ZzV3ADB5OIPki2FGx0Fciexhu/RbKaCMgrgH5vwBMm+sXPadgFnwz2rcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:20:12.217765Z"},"content_sha256":"7a189d839e225db8e308335e4bb6a8bc11798cd2be1fcba11b906f0dc587e1ad","schema_version":"1.0","event_id":"sha256:7a189d839e225db8e308335e4bb6a8bc11798cd2be1fcba11b906f0dc587e1ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37HKMH7652L2N4IZEYEUAGWDKF/bundle.json","state_url":"https://pith.science/pith/37HKMH7652L2N4IZEYEUAGWDKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37HKMH7652L2N4IZEYEUAGWDKF/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-26T02:20:12Z","links":{"resolver":"https://pith.science/pith/37HKMH7652L2N4IZEYEUAGWDKF","bundle":"https://pith.science/pith/37HKMH7652L2N4IZEYEUAGWDKF/bundle.json","state":"https://pith.science/pith/37HKMH7652L2N4IZEYEUAGWDKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37HKMH7652L2N4IZEYEUAGWDKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:37HKMH7652L2N4IZEYEUAGWDKF","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":"675ff633cadd6450ac61d0371706d1bf1ea5e980712b73275c4710597465f84d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T15:12:27Z","title_canon_sha256":"ac2403187483e950eaf243b244a30d0801a625b66b2c47e18d81ca9ed9a07eb5"},"schema_version":"1.0","source":{"id":"1210.1139","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1139","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1139v2","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1139","created_at":"2026-05-18T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"37HKMH7652L2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"37HKMH7652L2N4IZ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"37HKMH76","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:7a189d839e225db8e308335e4bb6a8bc11798cd2be1fcba11b906f0dc587e1ad","target":"graph","created_at":"2026-05-18T03:15:45Z","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"},"paper":{"abstract_excerpt":"Recently, physical layer security based approaches have drawn considerable attentions and are envisaged to provide secure communications in the wireless networks. However, most existing literatures only focus on the physical layer. Thus, how to design an effective transmission scheme which also considers the requirements from the upper layers is still an unsolved problem. We consider such cross-layer resource allocation problem in the multi-user downlink environment for both having instantaneous and partial eavesdropping channel information scenarios. The problem is first formulated in a new s","authors_text":"Jun Wang, Pengfei Huang, Xudong Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T15:12:27Z","title":"Cross-Layer Scheduling in Multi-user System with Delay and Secrecy Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1139","kind":"arxiv","version":2},"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:40d336fe0822d24bab4059bb169cbfce271c8f399e3906c92f6e0cc6aee08c47","target":"record","created_at":"2026-05-18T03:15:45Z","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":"675ff633cadd6450ac61d0371706d1bf1ea5e980712b73275c4710597465f84d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T15:12:27Z","title_canon_sha256":"ac2403187483e950eaf243b244a30d0801a625b66b2c47e18d81ca9ed9a07eb5"},"schema_version":"1.0","source":{"id":"1210.1139","kind":"arxiv","version":2}},"canonical_sha256":"dfcea61ffeee97a6f1192609401ac351525d21a6f9f879df537aae6bc680f57c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfcea61ffeee97a6f1192609401ac351525d21a6f9f879df537aae6bc680f57c","first_computed_at":"2026-05-18T03:15:45.342771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:45.342771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c94ZUHoc880c2WsI9XK4VDOun5enfA7w4xonlbGoBc6HsTCbexo5LCqVyGinHQtMGlLe9NwXiA920RijAhIECw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:45.343480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1139","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40d336fe0822d24bab4059bb169cbfce271c8f399e3906c92f6e0cc6aee08c47","sha256:7a189d839e225db8e308335e4bb6a8bc11798cd2be1fcba11b906f0dc587e1ad"],"state_sha256":"0aca80de4795c562a8be6376653484c4e9f4e864c308e176d8056cc7fb18b50b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6o3qj6YX6dHRNbGmBagAGlxlmC2MK7wVJfJsboamRYLqS+nZawnM5SElGIqPhWtrrk5bHMTELz38EE19LvfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:20:12.219890Z","bundle_sha256":"5231b8d54406a11747f324f158349e27c81b29d225718ec724cbe887fa2fd55c"}}