{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BD5AQBNYSZ2NZZHUCCFZ3QME2C","short_pith_number":"pith:BD5AQBNY","schema_version":"1.0","canonical_sha256":"08fa0805b89674dce4f4108b9dc184d0b00bf3d9563c846f1bdd07190f1061ec","source":{"kind":"arxiv","id":"1911.08799","version":1},"attestation_state":"computed","paper":{"title":"Solving Online Threat Screening Games using Constrained Action Space Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Andrew Perrault, Arunesh Sinha, Milind Tambe, Pradeep Varakantham, Sanket Shah","submitted_at":"2019-11-20T10:15:07Z","abstract_excerpt":"Large-scale screening for potential threats with limited resources and capacity for screening is a problem of interest at airports, seaports, and other ports of entry. Adversaries can observe screening procedures and arrive at a time when there will be gaps in screening due to limited resource capacities. To capture this game between ports and adversaries, this problem has been previously represented as a Stackelberg game, referred to as a Threat Screening Game (TSG). Given the significant complexity associated with solving TSGs and uncertainty in arrivals of customers, existing work has assum"},"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":"1911.08799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-11-20T10:15:07Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"40728b7672da56897f04d6bbc6b842ba9695dca31f707af6f47a5b730deba5d5","abstract_canon_sha256":"2c817c1695296ed5f6a2c520a2391ed3db223f9c205a09bfd47ec96d7b01b9c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:45.841467Z","signature_b64":"EZy+0Luc0wDzHbIKTdCriawSi51B7jOvSEzuWMOY8vUcRcC83/bAsv5077IWyoafWTWv9eRHNMbz9HgVMyV5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08fa0805b89674dce4f4108b9dc184d0b00bf3d9563c846f1bdd07190f1061ec","last_reissued_at":"2026-07-05T00:20:45.840834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:45.840834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Online Threat Screening Games using Constrained Action Space Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Andrew Perrault, Arunesh Sinha, Milind Tambe, Pradeep Varakantham, Sanket Shah","submitted_at":"2019-11-20T10:15:07Z","abstract_excerpt":"Large-scale screening for potential threats with limited resources and capacity for screening is a problem of interest at airports, seaports, and other ports of entry. Adversaries can observe screening procedures and arrive at a time when there will be gaps in screening due to limited resource capacities. To capture this game between ports and adversaries, this problem has been previously represented as a Stackelberg game, referred to as a Threat Screening Game (TSG). Given the significant complexity associated with solving TSGs and uncertainty in arrivals of customers, existing work has assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08799","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.08799/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.08799","created_at":"2026-07-05T00:20:45.840915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.08799v1","created_at":"2026-07-05T00:20:45.840915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08799","created_at":"2026-07-05T00:20:45.840915+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD5AQBNYSZ2N","created_at":"2026-07-05T00:20:45.840915+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD5AQBNYSZ2NZZHU","created_at":"2026-07-05T00:20:45.840915+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD5AQBNY","created_at":"2026-07-05T00:20:45.840915+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/BD5AQBNYSZ2NZZHUCCFZ3QME2C","json":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C.json","graph_json":"https://pith.science/api/pith-number/BD5AQBNYSZ2NZZHUCCFZ3QME2C/graph.json","events_json":"https://pith.science/api/pith-number/BD5AQBNYSZ2NZZHUCCFZ3QME2C/events.json","paper":"https://pith.science/paper/BD5AQBNY"},"agent_actions":{"view_html":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C","download_json":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C.json","view_paper":"https://pith.science/paper/BD5AQBNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.08799&json=true","fetch_graph":"https://pith.science/api/pith-number/BD5AQBNYSZ2NZZHUCCFZ3QME2C/graph.json","fetch_events":"https://pith.science/api/pith-number/BD5AQBNYSZ2NZZHUCCFZ3QME2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C/action/storage_attestation","attest_author":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C/action/author_attestation","sign_citation":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C/action/citation_signature","submit_replication":"https://pith.science/pith/BD5AQBNYSZ2NZZHUCCFZ3QME2C/action/replication_record"}},"created_at":"2026-07-05T00:20:45.840915+00:00","updated_at":"2026-07-05T00:20:45.840915+00:00"}