{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NAJJJWJZYUTE7U3KTXTDWJR5WV","short_pith_number":"pith:NAJJJWJZ","canonical_record":{"source":{"id":"2504.04122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-05T09:40:11Z","cross_cats_sorted":[],"title_canon_sha256":"0ecc57aeda502eb2eef0ecdee47d0e813c5aeeeb9af7339e7cdc17f2b113e17f","abstract_canon_sha256":"a341e7985641e041e3d8f1a393c4a9d14abb3cdbc223f5d62b3350199cb06346"},"schema_version":"1.0"},"canonical_sha256":"681294d939c5264fd36a9de63b263db571e902dd982d3d410de40a064ab0b352","source":{"kind":"arxiv","id":"2504.04122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04122","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04122v1","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04122","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"pith_short_12","alias_value":"NAJJJWJZYUTE","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"pith_short_16","alias_value":"NAJJJWJZYUTE7U3K","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"pith_short_8","alias_value":"NAJJJWJZ","created_at":"2026-07-05T10:44:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NAJJJWJZYUTE7U3KTXTDWJR5WV","target":"record","payload":{"canonical_record":{"source":{"id":"2504.04122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-05T09:40:11Z","cross_cats_sorted":[],"title_canon_sha256":"0ecc57aeda502eb2eef0ecdee47d0e813c5aeeeb9af7339e7cdc17f2b113e17f","abstract_canon_sha256":"a341e7985641e041e3d8f1a393c4a9d14abb3cdbc223f5d62b3350199cb06346"},"schema_version":"1.0"},"canonical_sha256":"681294d939c5264fd36a9de63b263db571e902dd982d3d410de40a064ab0b352","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:54.391811Z","signature_b64":"Mo6cj6PpBCpckzEw+IumzESmS4xE5bnS6u/9F3jKdUULcI3UTZqasgEt/18Q9aWwU/+AyeKXI6CtcUuSPTyBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"681294d939c5264fd36a9de63b263db571e902dd982d3d410de40a064ab0b352","last_reissued_at":"2026-07-05T10:44:54.391397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:54.391397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.04122","source_version":1,"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-07-05T10:44:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMTMmhvamSU97pp7LblR3K0RpkrWx1vl4NRLJ8MFlf+d4ouQC4R1TCn5pFZXgQfUywWJPShX55ii0PzeqBgCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:04:06.740122Z"},"content_sha256":"8db6c85e63993021302c4f87589d95496373ce211bbf4e90107e2274004fbd6e","schema_version":"1.0","event_id":"sha256:8db6c85e63993021302c4f87589d95496373ce211bbf4e90107e2274004fbd6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NAJJJWJZYUTE7U3KTXTDWJR5WV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Primal-Dual Gradient Descent Approach to the Connectivity Constrained Sensor Coverage Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christopher Brinton, Jong Gwang Kim, Mathias Bock Agerman, Shreyas Sundaram, Ziqiao Zhang","submitted_at":"2025-04-05T09:40:11Z","abstract_excerpt":"Sensor networks play a critical role in many situational awareness applications. In this paper, we study the problem of determining sensor placements to balance coverage and connectivity objectives over a target region. Leveraging algebraic graph theory, we formulate a novel optimization problem to maximize sensor coverage over a spatial probability density of event likelihoods while adhering to connectivity constraints. To handle the resulting non-convexity under constraints, we develop an augmented Lagrangian-based gradient descent algorithm inspired by recent approaches to efficiently ident"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04122","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/2504.04122/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"},"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-07-05T10:44:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3xBjSdtdg90UykpAbNlLpFHcXSod3BHIgzdUmajHuBcOTmM1dDP2rjr2yjiUB6gawoydZwTdmLQ2KtxQ0wFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:04:06.740613Z"},"content_sha256":"fe072f9af2118f36d93585c4c80ab6a38e3994e4b1b71787f92c40795c4b9501","schema_version":"1.0","event_id":"sha256:fe072f9af2118f36d93585c4c80ab6a38e3994e4b1b71787f92c40795c4b9501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAJJJWJZYUTE7U3KTXTDWJR5WV/bundle.json","state_url":"https://pith.science/pith/NAJJJWJZYUTE7U3KTXTDWJR5WV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAJJJWJZYUTE7U3KTXTDWJR5WV/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-08-23T22:04:06Z","links":{"resolver":"https://pith.science/pith/NAJJJWJZYUTE7U3KTXTDWJR5WV","bundle":"https://pith.science/pith/NAJJJWJZYUTE7U3KTXTDWJR5WV/bundle.json","state":"https://pith.science/pith/NAJJJWJZYUTE7U3KTXTDWJR5WV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAJJJWJZYUTE7U3KTXTDWJR5WV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NAJJJWJZYUTE7U3KTXTDWJR5WV","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":"a341e7985641e041e3d8f1a393c4a9d14abb3cdbc223f5d62b3350199cb06346","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-05T09:40:11Z","title_canon_sha256":"0ecc57aeda502eb2eef0ecdee47d0e813c5aeeeb9af7339e7cdc17f2b113e17f"},"schema_version":"1.0","source":{"id":"2504.04122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04122","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04122v1","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04122","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"pith_short_12","alias_value":"NAJJJWJZYUTE","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"pith_short_16","alias_value":"NAJJJWJZYUTE7U3K","created_at":"2026-07-05T10:44:54Z"},{"alias_kind":"pith_short_8","alias_value":"NAJJJWJZ","created_at":"2026-07-05T10:44:54Z"}],"graph_snapshots":[{"event_id":"sha256:fe072f9af2118f36d93585c4c80ab6a38e3994e4b1b71787f92c40795c4b9501","target":"graph","created_at":"2026-07-05T10:44:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.04122/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sensor networks play a critical role in many situational awareness applications. In this paper, we study the problem of determining sensor placements to balance coverage and connectivity objectives over a target region. Leveraging algebraic graph theory, we formulate a novel optimization problem to maximize sensor coverage over a spatial probability density of event likelihoods while adhering to connectivity constraints. To handle the resulting non-convexity under constraints, we develop an augmented Lagrangian-based gradient descent algorithm inspired by recent approaches to efficiently ident","authors_text":"Christopher Brinton, Jong Gwang Kim, Mathias Bock Agerman, Shreyas Sundaram, Ziqiao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-05T09:40:11Z","title":"A Primal-Dual Gradient Descent Approach to the Connectivity Constrained Sensor Coverage Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04122","kind":"arxiv","version":1},"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:8db6c85e63993021302c4f87589d95496373ce211bbf4e90107e2274004fbd6e","target":"record","created_at":"2026-07-05T10:44:54Z","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":"a341e7985641e041e3d8f1a393c4a9d14abb3cdbc223f5d62b3350199cb06346","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-05T09:40:11Z","title_canon_sha256":"0ecc57aeda502eb2eef0ecdee47d0e813c5aeeeb9af7339e7cdc17f2b113e17f"},"schema_version":"1.0","source":{"id":"2504.04122","kind":"arxiv","version":1}},"canonical_sha256":"681294d939c5264fd36a9de63b263db571e902dd982d3d410de40a064ab0b352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"681294d939c5264fd36a9de63b263db571e902dd982d3d410de40a064ab0b352","first_computed_at":"2026-07-05T10:44:54.391397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:54.391397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mo6cj6PpBCpckzEw+IumzESmS4xE5bnS6u/9F3jKdUULcI3UTZqasgEt/18Q9aWwU/+AyeKXI6CtcUuSPTyBAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:54.391811Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.04122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8db6c85e63993021302c4f87589d95496373ce211bbf4e90107e2274004fbd6e","sha256:fe072f9af2118f36d93585c4c80ab6a38e3994e4b1b71787f92c40795c4b9501"],"state_sha256":"8566be8702cbe8a749ca2c90e2560762f01801c7d084de3af27b72998cc26489"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6QrZie3W/nu/W+Z2CgO3C1rtdW0lUNsnR2+TQ3S7wLcgXVp4AX3aetoQI3mFwK4JIGkEPKKy537VbPiAFYlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:04:06.745052Z","bundle_sha256":"25b3a20bb751b61f83b2618429dcede985b6c440e9603d166c9d0fc32e07fda5"}}