{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H7BRGWPQZLSPKDEKMYVDW5SVKC","short_pith_number":"pith:H7BRGWPQ","schema_version":"1.0","canonical_sha256":"3fc31359f0cae4f50c8a662a3b765550b78b10d850be1524304d04c8d271e6ba","source":{"kind":"arxiv","id":"1805.07069","version":1},"attestation_state":"computed","paper":{"title":"Multifunction Cognitive Radar Task Scheduling Using Monte Carlo Tree Search and Policy Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mahdi Shaghaghi, Raviraj S. Adve, Zhen Ding","submitted_at":"2018-05-18T06:58:16Z","abstract_excerpt":"A modern radar may be designed to perform multiple functions, such as surveillance, tracking, and fire control. Each function requires the radar to execute a number of transmit-receive tasks. A radar resource management (RRM) module makes decisions on parameter selection, prioritization, and scheduling of such tasks. RRM becomes especially challenging in overload situations, where some tasks may need to be delayed or even dropped. In general, task scheduling is an NP-hard problem. In this work, we develop the branch-and-bound (B&B) method which obtains the optimal solution but at exponential c"},"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":"1805.07069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-18T06:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"62f55ee304124653c2e1d2029480d64be6900b518aaf0a3a7f9f1a81383a0e15","abstract_canon_sha256":"28a991dd4151f337c879259b7b78046f05c6cfd1863d3ffbd621e29ed66366fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.150822Z","signature_b64":"ir2FT5AUTUPLBs/fbFpn8MxN4KvtAguOSwhz1LgmWRT3jwoz6DoNZOYuy2Vrel3ik0e/Alq6Zqzu+GgRCQRLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fc31359f0cae4f50c8a662a3b765550b78b10d850be1524304d04c8d271e6ba","last_reissued_at":"2026-05-18T00:15:41.150114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.150114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multifunction Cognitive Radar Task Scheduling Using Monte Carlo Tree Search and Policy Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mahdi Shaghaghi, Raviraj S. Adve, Zhen Ding","submitted_at":"2018-05-18T06:58:16Z","abstract_excerpt":"A modern radar may be designed to perform multiple functions, such as surveillance, tracking, and fire control. Each function requires the radar to execute a number of transmit-receive tasks. A radar resource management (RRM) module makes decisions on parameter selection, prioritization, and scheduling of such tasks. RRM becomes especially challenging in overload situations, where some tasks may need to be delayed or even dropped. In general, task scheduling is an NP-hard problem. In this work, we develop the branch-and-bound (B&B) method which obtains the optimal solution but at exponential c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07069","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":"1805.07069","created_at":"2026-05-18T00:15:41.150224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07069v1","created_at":"2026-05-18T00:15:41.150224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07069","created_at":"2026-05-18T00:15:41.150224+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7BRGWPQZLSP","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7BRGWPQZLSPKDEK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7BRGWPQ","created_at":"2026-05-18T12:32:28.185984+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/H7BRGWPQZLSPKDEKMYVDW5SVKC","json":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC.json","graph_json":"https://pith.science/api/pith-number/H7BRGWPQZLSPKDEKMYVDW5SVKC/graph.json","events_json":"https://pith.science/api/pith-number/H7BRGWPQZLSPKDEKMYVDW5SVKC/events.json","paper":"https://pith.science/paper/H7BRGWPQ"},"agent_actions":{"view_html":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC","download_json":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC.json","view_paper":"https://pith.science/paper/H7BRGWPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07069&json=true","fetch_graph":"https://pith.science/api/pith-number/H7BRGWPQZLSPKDEKMYVDW5SVKC/graph.json","fetch_events":"https://pith.science/api/pith-number/H7BRGWPQZLSPKDEKMYVDW5SVKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC/action/storage_attestation","attest_author":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC/action/author_attestation","sign_citation":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC/action/citation_signature","submit_replication":"https://pith.science/pith/H7BRGWPQZLSPKDEKMYVDW5SVKC/action/replication_record"}},"created_at":"2026-05-18T00:15:41.150224+00:00","updated_at":"2026-05-18T00:15:41.150224+00:00"}