{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AGU44I6X2B7PSNSAMS6SJ7YEQE","short_pith_number":"pith:AGU44I6X","canonical_record":{"source":{"id":"1502.04676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-02-16T19:33:21Z","cross_cats_sorted":[],"title_canon_sha256":"2a14803d07fe0c3c84ea911baae59221545340ed7cdff31ce825701226cec251","abstract_canon_sha256":"5a49a63603ab825a0bffa488d8731c96266af3568de16b0e27579de9f73367a3"},"schema_version":"1.0"},"canonical_sha256":"01a9ce23d7d07ef9364064bd24ff048115b27f5e7c0d7bff738c60ffd69d3eea","source":{"kind":"arxiv","id":"1502.04676","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04676","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04676v2","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04676","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"AGU44I6X2B7P","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGU44I6X2B7PSNSA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGU44I6X","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AGU44I6X2B7PSNSAMS6SJ7YEQE","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-02-16T19:33:21Z","cross_cats_sorted":[],"title_canon_sha256":"2a14803d07fe0c3c84ea911baae59221545340ed7cdff31ce825701226cec251","abstract_canon_sha256":"5a49a63603ab825a0bffa488d8731c96266af3568de16b0e27579de9f73367a3"},"schema_version":"1.0"},"canonical_sha256":"01a9ce23d7d07ef9364064bd24ff048115b27f5e7c0d7bff738c60ffd69d3eea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:51.211644Z","signature_b64":"8ZFwTBea/KAOZw1sH0a6Mg65/DIQZLtcuJneOtV4kQQjyYXS1yb1vT6o42h2UnTUudBzkHH+qeF4APSQ17yOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01a9ce23d7d07ef9364064bd24ff048115b27f5e7c0d7bff738c60ffd69d3eea","last_reissued_at":"2026-05-18T02:17:51.211142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:51.211142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04676","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-18T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U37wNAFOdduUrKP85eOyF/MqNlji4L/KkO4RzAbrPmtg7Af/YZLsQ9carxv80AqjfP7b0MYCR/DfTGxs/f6IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:17:01.242682Z"},"content_sha256":"cce0021d02ad04e5a0d39509a71747cbc6b242d47bb7a520d8b975c49bf2b5c1","schema_version":"1.0","event_id":"sha256:cce0021d02ad04e5a0d39509a71747cbc6b242d47bb7a520d8b975c49bf2b5c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AGU44I6X2B7PSNSAMS6SJ7YEQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Scanning Bandwidth Strategy Incorporating Uncertainty about Adversary's Characteristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Andrey Garnaev, Wade Trappe","submitted_at":"2015-02-16T19:33:21Z","abstract_excerpt":"In this paper we investigate the problem of designing a spectrum scanning strategy to detect an intelligent Invader who wants to utilize spectrum undetected for his/her unapproved purposes. To deal with this problem we model the situation as two games, between a Scanner and an Invader, and solve them sequentially. The first game is formulated to design the optimal (in maxmin sense) scanning algorithm, while the second one allows one to find the optimal values of the parameters for the algorithm depending on parameters of the network. These games provide solutions for two dilemmas that the riva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04676","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-18T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pH8dSTCRItp2wTi2ZvjADLNbRJu6c6ZKZr1qbmWrcpaZHJCdI2+8k5AoHsnQkUMG50u6jgGWgMCygMahbzZUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:17:01.243034Z"},"content_sha256":"100cf927d83c79a2178f56e06869134b41a38865a69142b633ec84d54ee668e5","schema_version":"1.0","event_id":"sha256:100cf927d83c79a2178f56e06869134b41a38865a69142b633ec84d54ee668e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGU44I6X2B7PSNSAMS6SJ7YEQE/bundle.json","state_url":"https://pith.science/pith/AGU44I6X2B7PSNSAMS6SJ7YEQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGU44I6X2B7PSNSAMS6SJ7YEQE/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-22T15:17:01Z","links":{"resolver":"https://pith.science/pith/AGU44I6X2B7PSNSAMS6SJ7YEQE","bundle":"https://pith.science/pith/AGU44I6X2B7PSNSAMS6SJ7YEQE/bundle.json","state":"https://pith.science/pith/AGU44I6X2B7PSNSAMS6SJ7YEQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGU44I6X2B7PSNSAMS6SJ7YEQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AGU44I6X2B7PSNSAMS6SJ7YEQE","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":"5a49a63603ab825a0bffa488d8731c96266af3568de16b0e27579de9f73367a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-02-16T19:33:21Z","title_canon_sha256":"2a14803d07fe0c3c84ea911baae59221545340ed7cdff31ce825701226cec251"},"schema_version":"1.0","source":{"id":"1502.04676","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04676","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04676v2","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04676","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"AGU44I6X2B7P","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGU44I6X2B7PSNSA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGU44I6X","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:100cf927d83c79a2178f56e06869134b41a38865a69142b633ec84d54ee668e5","target":"graph","created_at":"2026-05-18T02:17:51Z","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 paper we investigate the problem of designing a spectrum scanning strategy to detect an intelligent Invader who wants to utilize spectrum undetected for his/her unapproved purposes. To deal with this problem we model the situation as two games, between a Scanner and an Invader, and solve them sequentially. The first game is formulated to design the optimal (in maxmin sense) scanning algorithm, while the second one allows one to find the optimal values of the parameters for the algorithm depending on parameters of the network. These games provide solutions for two dilemmas that the riva","authors_text":"Andrey Garnaev, Wade Trappe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-02-16T19:33:21Z","title":"Optimal Scanning Bandwidth Strategy Incorporating Uncertainty about Adversary's Characteristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04676","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:cce0021d02ad04e5a0d39509a71747cbc6b242d47bb7a520d8b975c49bf2b5c1","target":"record","created_at":"2026-05-18T02:17:51Z","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":"5a49a63603ab825a0bffa488d8731c96266af3568de16b0e27579de9f73367a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-02-16T19:33:21Z","title_canon_sha256":"2a14803d07fe0c3c84ea911baae59221545340ed7cdff31ce825701226cec251"},"schema_version":"1.0","source":{"id":"1502.04676","kind":"arxiv","version":2}},"canonical_sha256":"01a9ce23d7d07ef9364064bd24ff048115b27f5e7c0d7bff738c60ffd69d3eea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01a9ce23d7d07ef9364064bd24ff048115b27f5e7c0d7bff738c60ffd69d3eea","first_computed_at":"2026-05-18T02:17:51.211142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:51.211142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ZFwTBea/KAOZw1sH0a6Mg65/DIQZLtcuJneOtV4kQQjyYXS1yb1vT6o42h2UnTUudBzkHH+qeF4APSQ17yOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:51.211644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04676","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cce0021d02ad04e5a0d39509a71747cbc6b242d47bb7a520d8b975c49bf2b5c1","sha256:100cf927d83c79a2178f56e06869134b41a38865a69142b633ec84d54ee668e5"],"state_sha256":"47c4c0615802b0d6dbad78b6143b8dd6195a1d5216d270ca162ac1d57accc39e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RYx7rCuDLl1J8MxS0tY6mKNTJGN38pMNLV5yJw/TXVsXGdWj1IyN31mO3E9nHokbYbw3OtS7WSFKv2+szjQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T15:17:01.245074Z","bundle_sha256":"330e20d65c64346d2f29003604196701a5dd16fa5d8383f3173c82102993b9e5"}}