{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K6MEYODGFDMEEXAAENFXH2VEZA","short_pith_number":"pith:K6MEYODG","schema_version":"1.0","canonical_sha256":"57984c386628d8425c00234b73eaa4c80f5bf7b28bd9e820ee66e365d284d635","source":{"kind":"arxiv","id":"1107.5066","version":1},"attestation_state":"computed","paper":{"title":"The Fighter Problem: Optimal Allocation of a Discrete Commodity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Ester Samuel-Cahn, Jay Bartroff","submitted_at":"2011-07-25T20:23:44Z","abstract_excerpt":"The Fighter problem with discrete ammunition is studied. An aircraft (fighter) equipped with $n$ anti-aircraft missiles is intercepted by enemy airplanes, the appearance of which follows a homogeneous Poisson process with known intensity. If $j$ of the $n$ missiles are spent at an encounter they destroy an enemy plane with probability $a(j)$, where $a(0) = 0 $ and $\\{a(j)\\}$ is a known, strictly increasing concave sequence, e.g., $a(j) = 1-q^j, \\; \\, 0 < q < 1$. If the enemy is not destroyed, the enemy shoots the fighter down with known probability $1-u$, where $0 \\le u \\le 1$. The goal of the"},"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":"1107.5066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-25T20:23:44Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"83000b16c37878da539d457c8ead9fe236b80e26c66a6deb03ef9f02c8bbe45d","abstract_canon_sha256":"c707478ab2fb68d27b1949ae33bcf4388b897ea4ed8a35ae2debbedbc3d042b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:53.113882Z","signature_b64":"F1NZO4X1BmJLoVXfcB2MNGySRulr3TD5DrshqfPfkfBCr0C6lNtsEGj+QrwNubhmsQIbjTKSG+CZYwA5IKeICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57984c386628d8425c00234b73eaa4c80f5bf7b28bd9e820ee66e365d284d635","last_reissued_at":"2026-05-18T04:16:53.113308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:53.113308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fighter Problem: Optimal Allocation of a Discrete Commodity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Ester Samuel-Cahn, Jay Bartroff","submitted_at":"2011-07-25T20:23:44Z","abstract_excerpt":"The Fighter problem with discrete ammunition is studied. An aircraft (fighter) equipped with $n$ anti-aircraft missiles is intercepted by enemy airplanes, the appearance of which follows a homogeneous Poisson process with known intensity. If $j$ of the $n$ missiles are spent at an encounter they destroy an enemy plane with probability $a(j)$, where $a(0) = 0 $ and $\\{a(j)\\}$ is a known, strictly increasing concave sequence, e.g., $a(j) = 1-q^j, \\; \\, 0 < q < 1$. If the enemy is not destroyed, the enemy shoots the fighter down with known probability $1-u$, where $0 \\le u \\le 1$. The goal of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5066","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":"1107.5066","created_at":"2026-05-18T04:16:53.113420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5066v1","created_at":"2026-05-18T04:16:53.113420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5066","created_at":"2026-05-18T04:16:53.113420+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6MEYODGFDME","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6MEYODGFDMEEXAA","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6MEYODG","created_at":"2026-05-18T12:26:32.869790+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/K6MEYODGFDMEEXAAENFXH2VEZA","json":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA.json","graph_json":"https://pith.science/api/pith-number/K6MEYODGFDMEEXAAENFXH2VEZA/graph.json","events_json":"https://pith.science/api/pith-number/K6MEYODGFDMEEXAAENFXH2VEZA/events.json","paper":"https://pith.science/paper/K6MEYODG"},"agent_actions":{"view_html":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA","download_json":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA.json","view_paper":"https://pith.science/paper/K6MEYODG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5066&json=true","fetch_graph":"https://pith.science/api/pith-number/K6MEYODGFDMEEXAAENFXH2VEZA/graph.json","fetch_events":"https://pith.science/api/pith-number/K6MEYODGFDMEEXAAENFXH2VEZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA/action/storage_attestation","attest_author":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA/action/author_attestation","sign_citation":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA/action/citation_signature","submit_replication":"https://pith.science/pith/K6MEYODGFDMEEXAAENFXH2VEZA/action/replication_record"}},"created_at":"2026-05-18T04:16:53.113420+00:00","updated_at":"2026-05-18T04:16:53.113420+00:00"}