{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7QP4ZLRX2B7HWKNESZ2XH4QDSU","short_pith_number":"pith:7QP4ZLRX","canonical_record":{"source":{"id":"1101.6030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-31T17:19:40Z","cross_cats_sorted":["cs.CR","cs.IT","cs.SY","math.IT","math.OC"],"title_canon_sha256":"434b60257665f3c00c92dfa93a7ed68c59e845e6c0f202029a93a37555630f18","abstract_canon_sha256":"e39528964e1d651a8477466352e9ae20ca8b3001338256afe28e6f84b496afda"},"schema_version":"1.0"},"canonical_sha256":"fc1fccae37d07e7b29a4967573f203950d6e231ec9546d22123d95617200acd7","source":{"kind":"arxiv","id":"1101.6030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.6030","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.6030v1","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.6030","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"7QP4ZLRX2B7H","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7QP4ZLRX2B7HWKNE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7QP4ZLRX","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7QP4ZLRX2B7HWKNESZ2XH4QDSU","target":"record","payload":{"canonical_record":{"source":{"id":"1101.6030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-31T17:19:40Z","cross_cats_sorted":["cs.CR","cs.IT","cs.SY","math.IT","math.OC"],"title_canon_sha256":"434b60257665f3c00c92dfa93a7ed68c59e845e6c0f202029a93a37555630f18","abstract_canon_sha256":"e39528964e1d651a8477466352e9ae20ca8b3001338256afe28e6f84b496afda"},"schema_version":"1.0"},"canonical_sha256":"fc1fccae37d07e7b29a4967573f203950d6e231ec9546d22123d95617200acd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.680474Z","signature_b64":"GheZ4vpDh7KfbS4YfaSswNVSVnbCcJlfmc3jCiKoW8RTphd+X2j6gtsUVwMX9QBAnzZ34YtpLUyspZxzzRZSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc1fccae37d07e7b29a4967573f203950d6e231ec9546d22123d95617200acd7","last_reissued_at":"2026-05-18T02:22:41.679993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.679993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.6030","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-05-18T02:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+fks8ihXWFae9NX82mfCC0yGVCxG1cpj51FulkaFWGfBjzCD6S057XR8E7CrPuz6juNb1SZFKl1GWH828gvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:36:05.919030Z"},"content_sha256":"b103d19140537df54c2124824341f6689c0a1a1cdd7f1440f33aca1b50fc8fd2","schema_version":"1.0","event_id":"sha256:b103d19140537df54c2124824341f6689c0a1a1cdd7f1440f33aca1b50fc8fd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7QP4ZLRX2B7HWKNESZ2XH4QDSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","cs.SY","math.IT","math.OC"],"primary_cat":"cs.GT","authors_text":"Ali Khanafer, Sourabh Bhattacharya, Tamer Ba\\c{s}ar","submitted_at":"2011-01-31T17:19:40Z","abstract_excerpt":"In this work, we study the problem of power allocation in teams. Each team consists of two agents who try to split their available power between the tasks of communication and jamming the nodes of the other team. The agents have constraints on their total energy and instantaneous power usage. The cost function is the difference between the rates of erroneously transmitted bits of each team. We model the problem as a zero-sum differential game between the two teams and use {\\it{Isaacs'}} approach to obtain the necessary conditions for the optimal trajectories. This leads to a continuous-kernel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.6030","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"},"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-18T02:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6Cc+NlaPRCc4uk3t6MRm+mA/7aJ975xgBa6VW6V1444se5pvFQCvuQ2Cs/R2aFaP7ME5V0ncGprFt74kJHiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:36:05.919406Z"},"content_sha256":"e157b570152f72462810c44285a174b96c4cb413cf67b9964e91f220a6b32f14","schema_version":"1.0","event_id":"sha256:e157b570152f72462810c44285a174b96c4cb413cf67b9964e91f220a6b32f14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QP4ZLRX2B7HWKNESZ2XH4QDSU/bundle.json","state_url":"https://pith.science/pith/7QP4ZLRX2B7HWKNESZ2XH4QDSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QP4ZLRX2B7HWKNESZ2XH4QDSU/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-06-22T10:36:05Z","links":{"resolver":"https://pith.science/pith/7QP4ZLRX2B7HWKNESZ2XH4QDSU","bundle":"https://pith.science/pith/7QP4ZLRX2B7HWKNESZ2XH4QDSU/bundle.json","state":"https://pith.science/pith/7QP4ZLRX2B7HWKNESZ2XH4QDSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QP4ZLRX2B7HWKNESZ2XH4QDSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7QP4ZLRX2B7HWKNESZ2XH4QDSU","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":"e39528964e1d651a8477466352e9ae20ca8b3001338256afe28e6f84b496afda","cross_cats_sorted":["cs.CR","cs.IT","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-31T17:19:40Z","title_canon_sha256":"434b60257665f3c00c92dfa93a7ed68c59e845e6c0f202029a93a37555630f18"},"schema_version":"1.0","source":{"id":"1101.6030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.6030","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.6030v1","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.6030","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"7QP4ZLRX2B7H","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7QP4ZLRX2B7HWKNE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7QP4ZLRX","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:e157b570152f72462810c44285a174b96c4cb413cf67b9964e91f220a6b32f14","target":"graph","created_at":"2026-05-18T02:22:41Z","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":"In this work, we study the problem of power allocation in teams. Each team consists of two agents who try to split their available power between the tasks of communication and jamming the nodes of the other team. The agents have constraints on their total energy and instantaneous power usage. The cost function is the difference between the rates of erroneously transmitted bits of each team. We model the problem as a zero-sum differential game between the two teams and use {\\it{Isaacs'}} approach to obtain the necessary conditions for the optimal trajectories. This leads to a continuous-kernel ","authors_text":"Ali Khanafer, Sourabh Bhattacharya, Tamer Ba\\c{s}ar","cross_cats":["cs.CR","cs.IT","cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-31T17:19:40Z","title":"Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.6030","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:b103d19140537df54c2124824341f6689c0a1a1cdd7f1440f33aca1b50fc8fd2","target":"record","created_at":"2026-05-18T02:22:41Z","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":"e39528964e1d651a8477466352e9ae20ca8b3001338256afe28e6f84b496afda","cross_cats_sorted":["cs.CR","cs.IT","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-31T17:19:40Z","title_canon_sha256":"434b60257665f3c00c92dfa93a7ed68c59e845e6c0f202029a93a37555630f18"},"schema_version":"1.0","source":{"id":"1101.6030","kind":"arxiv","version":1}},"canonical_sha256":"fc1fccae37d07e7b29a4967573f203950d6e231ec9546d22123d95617200acd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc1fccae37d07e7b29a4967573f203950d6e231ec9546d22123d95617200acd7","first_computed_at":"2026-05-18T02:22:41.679993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:41.679993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GheZ4vpDh7KfbS4YfaSswNVSVnbCcJlfmc3jCiKoW8RTphd+X2j6gtsUVwMX9QBAnzZ34YtpLUyspZxzzRZSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:41.680474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.6030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b103d19140537df54c2124824341f6689c0a1a1cdd7f1440f33aca1b50fc8fd2","sha256:e157b570152f72462810c44285a174b96c4cb413cf67b9964e91f220a6b32f14"],"state_sha256":"9f3ec656b10e792f320e598c5e312d30f6f2799cd455036878f62706efdb6773"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krqJaP6AGbBnsrRpFPWe9Lt4Jylg5d/n+yAL56eW0ktGAs237voFBzNO9vcGybX9inb1Pp4E29UlSJ3t3uHMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:36:05.921477Z","bundle_sha256":"fde12f17a2dc62885d896326b6a2c5c60326a5c66a5a54f3fb099267cdc839bd"}}