{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HAIJPKBWD3OEV7F5OEVJSD6UT5","short_pith_number":"pith:HAIJPKBW","schema_version":"1.0","canonical_sha256":"381097a8361edc4afcbd712a990fd49f7b20b249ef6c9681398436685d0bd8ae","source":{"kind":"arxiv","id":"2411.17942","version":1},"attestation_state":"computed","paper":{"title":"Efficient Mathematical Programming Formulation and Algorithmic Framework for Optimal Camera Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin D. Leibowicz, Raghu Bollapragada, Yash Kumar","submitted_at":"2024-11-26T23:33:54Z","abstract_excerpt":"Optimal camera placement plays a crucial role in applications such as surveillance, environmental monitoring, and infrastructure inspection. Even highly abstracted versions of this problem are NP-hard due to the high-dimensional continuous domain of camera configurations (i.e., positions and orientations) and difficulties in efficiently and accurately calculating camera coverage. In this paper, we present a novel framework for optimal camera placement that uses integer programming and adaptive sampling strategies to maximize coverage, given a limited camera budget. We develop a modified maximu"},"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":"2411.17942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-26T23:33:54Z","cross_cats_sorted":[],"title_canon_sha256":"94d5af9cea7a735516580e0714433f23e029b26f68447e0b167ea41e3ce10b70","abstract_canon_sha256":"90dda6f672dfaeeca9460dbebdbecf8d9256f6516123a87860f2e278217a2266"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:09.240843Z","signature_b64":"m6pp+nSghBv4tIgu004OiS+XqOYSULl8X+CUqvW6C+ty1cCIAML5HDqQXDPVxGDxSvD9oRNIyE/qALdRDHqjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"381097a8361edc4afcbd712a990fd49f7b20b249ef6c9681398436685d0bd8ae","last_reissued_at":"2026-07-05T09:41:09.240420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:09.240420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Mathematical Programming Formulation and Algorithmic Framework for Optimal Camera Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin D. Leibowicz, Raghu Bollapragada, Yash Kumar","submitted_at":"2024-11-26T23:33:54Z","abstract_excerpt":"Optimal camera placement plays a crucial role in applications such as surveillance, environmental monitoring, and infrastructure inspection. Even highly abstracted versions of this problem are NP-hard due to the high-dimensional continuous domain of camera configurations (i.e., positions and orientations) and difficulties in efficiently and accurately calculating camera coverage. In this paper, we present a novel framework for optimal camera placement that uses integer programming and adaptive sampling strategies to maximize coverage, given a limited camera budget. We develop a modified maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17942","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/2411.17942/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":"2411.17942","created_at":"2026-07-05T09:41:09.240486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17942v1","created_at":"2026-07-05T09:41:09.240486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17942","created_at":"2026-07-05T09:41:09.240486+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAIJPKBWD3OE","created_at":"2026-07-05T09:41:09.240486+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAIJPKBWD3OEV7F5","created_at":"2026-07-05T09:41:09.240486+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAIJPKBW","created_at":"2026-07-05T09:41:09.240486+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/HAIJPKBWD3OEV7F5OEVJSD6UT5","json":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5.json","graph_json":"https://pith.science/api/pith-number/HAIJPKBWD3OEV7F5OEVJSD6UT5/graph.json","events_json":"https://pith.science/api/pith-number/HAIJPKBWD3OEV7F5OEVJSD6UT5/events.json","paper":"https://pith.science/paper/HAIJPKBW"},"agent_actions":{"view_html":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5","download_json":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5.json","view_paper":"https://pith.science/paper/HAIJPKBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17942&json=true","fetch_graph":"https://pith.science/api/pith-number/HAIJPKBWD3OEV7F5OEVJSD6UT5/graph.json","fetch_events":"https://pith.science/api/pith-number/HAIJPKBWD3OEV7F5OEVJSD6UT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5/action/storage_attestation","attest_author":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5/action/author_attestation","sign_citation":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5/action/citation_signature","submit_replication":"https://pith.science/pith/HAIJPKBWD3OEV7F5OEVJSD6UT5/action/replication_record"}},"created_at":"2026-07-05T09:41:09.240486+00:00","updated_at":"2026-07-05T09:41:09.240486+00:00"}