{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NO3Z3VNMULIG6CIBE6HAIBKTLR","short_pith_number":"pith:NO3Z3VNM","canonical_record":{"source":{"id":"1511.03414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T08:23:36Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9b35b65df3a14249b3f3efcbd6b0dd6caa2b7d40cd1d1c3adce80f7fa80f5976","abstract_canon_sha256":"2a3b64be87db46fae80fce33870a112b10d75818f39dcc98fcb7f1d237a466ef"},"schema_version":"1.0"},"canonical_sha256":"6bb79dd5aca2d06f0901278e0405535c6c2c8a282022c5c9797bd4c51b4908b0","source":{"kind":"arxiv","id":"1511.03414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03414","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03414v1","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03414","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"NO3Z3VNMULIG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NO3Z3VNMULIG6CIB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NO3Z3VNM","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NO3Z3VNMULIG6CIBE6HAIBKTLR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.03414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T08:23:36Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9b35b65df3a14249b3f3efcbd6b0dd6caa2b7d40cd1d1c3adce80f7fa80f5976","abstract_canon_sha256":"2a3b64be87db46fae80fce33870a112b10d75818f39dcc98fcb7f1d237a466ef"},"schema_version":"1.0"},"canonical_sha256":"6bb79dd5aca2d06f0901278e0405535c6c2c8a282022c5c9797bd4c51b4908b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.696598Z","signature_b64":"sGsDPolhKhNIUQIHYtuOT9hYKdup0UScF0VV3oI1BzR7TYfqLbMTest3Isqn862vQGuVsITq4h7G8zsJHiLODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb79dd5aca2d06f0901278e0405535c6c2c8a282022c5c9797bd4c51b4908b0","last_reissued_at":"2026-05-18T00:33:32.695893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.695893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.03414","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-05-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Bbd4EcHXu600aSoZH7petXu/15+7CQRSkTjdSTlmD4MMWjUEglZW+7oS4/PdK0Es0oJByNmjrn7IbpIvbx2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:14:01.377979Z"},"content_sha256":"f0fd130437407b39726f203325c357a5684ad29197aea1fb65733aaa8199de88","schema_version":"1.0","event_id":"sha256:f0fd130437407b39726f203325c357a5684ad29197aea1fb65733aaa8199de88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NO3Z3VNMULIG6CIBE6HAIBKTLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A dynamic state transition algorithm with application to sensor network localization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Xiaojun Zhou","submitted_at":"2015-11-11T08:23:36Z","abstract_excerpt":"The sensor network localization (SNL) problem is to reconstruct the positions of all the sensors in a network with the given distance between pairs of sensors and within the radio range between them. It is proved that the computational complexity of the SNL problem is NP-hard, and semi-definite programming or second-order cone programming relaxation methods are only able to solve some special problems of this kind. In this study, a stochastic global optimization method called the state transition algorithm is introduced to solve the SNL problem without additional assumptions and conditions of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03414","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"},"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-05-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EIvI89lYJLXYw7DTXBPTIdZN+VUdZJiprolROWJsBGZz3j9uN4A9idcdpLYQT1RcOcJFckGFfotmBqB5x+XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:14:01.378719Z"},"content_sha256":"aee7f7ea57f650022eda634e76be1cdcd2bb2d1338487091e5829e48d0671c94","schema_version":"1.0","event_id":"sha256:aee7f7ea57f650022eda634e76be1cdcd2bb2d1338487091e5829e48d0671c94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NO3Z3VNMULIG6CIBE6HAIBKTLR/bundle.json","state_url":"https://pith.science/pith/NO3Z3VNMULIG6CIBE6HAIBKTLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NO3Z3VNMULIG6CIBE6HAIBKTLR/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-06-08T20:14:01Z","links":{"resolver":"https://pith.science/pith/NO3Z3VNMULIG6CIBE6HAIBKTLR","bundle":"https://pith.science/pith/NO3Z3VNMULIG6CIBE6HAIBKTLR/bundle.json","state":"https://pith.science/pith/NO3Z3VNMULIG6CIBE6HAIBKTLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NO3Z3VNMULIG6CIBE6HAIBKTLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NO3Z3VNMULIG6CIBE6HAIBKTLR","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":"2a3b64be87db46fae80fce33870a112b10d75818f39dcc98fcb7f1d237a466ef","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T08:23:36Z","title_canon_sha256":"9b35b65df3a14249b3f3efcbd6b0dd6caa2b7d40cd1d1c3adce80f7fa80f5976"},"schema_version":"1.0","source":{"id":"1511.03414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03414","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03414v1","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03414","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"NO3Z3VNMULIG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NO3Z3VNMULIG6CIB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NO3Z3VNM","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:aee7f7ea57f650022eda634e76be1cdcd2bb2d1338487091e5829e48d0671c94","target":"graph","created_at":"2026-05-18T00:33:32Z","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"},"paper":{"abstract_excerpt":"The sensor network localization (SNL) problem is to reconstruct the positions of all the sensors in a network with the given distance between pairs of sensors and within the radio range between them. It is proved that the computational complexity of the SNL problem is NP-hard, and semi-definite programming or second-order cone programming relaxation methods are only able to solve some special problems of this kind. In this study, a stochastic global optimization method called the state transition algorithm is introduced to solve the SNL problem without additional assumptions and conditions of ","authors_text":"Xiaojun Zhou","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T08:23:36Z","title":"A dynamic state transition algorithm with application to sensor network localization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03414","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:f0fd130437407b39726f203325c357a5684ad29197aea1fb65733aaa8199de88","target":"record","created_at":"2026-05-18T00:33:32Z","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":"2a3b64be87db46fae80fce33870a112b10d75818f39dcc98fcb7f1d237a466ef","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T08:23:36Z","title_canon_sha256":"9b35b65df3a14249b3f3efcbd6b0dd6caa2b7d40cd1d1c3adce80f7fa80f5976"},"schema_version":"1.0","source":{"id":"1511.03414","kind":"arxiv","version":1}},"canonical_sha256":"6bb79dd5aca2d06f0901278e0405535c6c2c8a282022c5c9797bd4c51b4908b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bb79dd5aca2d06f0901278e0405535c6c2c8a282022c5c9797bd4c51b4908b0","first_computed_at":"2026-05-18T00:33:32.695893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:32.695893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sGsDPolhKhNIUQIHYtuOT9hYKdup0UScF0VV3oI1BzR7TYfqLbMTest3Isqn862vQGuVsITq4h7G8zsJHiLODg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:32.696598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0fd130437407b39726f203325c357a5684ad29197aea1fb65733aaa8199de88","sha256:aee7f7ea57f650022eda634e76be1cdcd2bb2d1338487091e5829e48d0671c94"],"state_sha256":"2525ab587388f87505f2f6f06d63086193d104263fae387d47edc17305deed8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UR1AZGZQwi1e78mW1zFbjfKCfhzFxHMDr59rZQQ/g6DAnClTaPYQsm8MBZmyWSZnFa2henxT4mhvH2c54bd8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:14:01.382767Z","bundle_sha256":"b534617a0759c10ad0540978a719dd8b292faab231c249b8f9359ca75667db53"}}