{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OAHKBOUMHB5434IJWIMHGAUVK7","short_pith_number":"pith:OAHKBOUM","canonical_record":{"source":{"id":"1801.03266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T08:30:13Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"3915aa9693f888ac159aa79976f6e232c32af0216e6eb80b6579824a90bc655c","abstract_canon_sha256":"8426ac4cc4174308a19adaa61b3a9735a18a698cf3b84add84aa044b08728e3d"},"schema_version":"1.0"},"canonical_sha256":"700ea0ba8c387bcdf109b21873029557f14c865cc6fd4bc56a4a1262042db46c","source":{"kind":"arxiv","id":"1801.03266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03266","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03266v1","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03266","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"OAHKBOUMHB54","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OAHKBOUMHB5434IJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OAHKBOUM","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OAHKBOUMHB5434IJWIMHGAUVK7","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T08:30:13Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"3915aa9693f888ac159aa79976f6e232c32af0216e6eb80b6579824a90bc655c","abstract_canon_sha256":"8426ac4cc4174308a19adaa61b3a9735a18a698cf3b84add84aa044b08728e3d"},"schema_version":"1.0"},"canonical_sha256":"700ea0ba8c387bcdf109b21873029557f14c865cc6fd4bc56a4a1262042db46c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:17.570394Z","signature_b64":"kUMYAa4JVmP4XgkutdYZbEvRUXgySLks1K6M4VgiJjnqwXe0LzkALsTFGhpGjh36TX0tfP+U07QfMjumK6M3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"700ea0ba8c387bcdf109b21873029557f14c865cc6fd4bc56a4a1262042db46c","last_reissued_at":"2026-05-18T00:26:17.569755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:17.569755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03266","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:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isrpoofAgkRx/Ei4R/NPHB++u+/ulYkG1oNeQw3Cq0El2Zgd7CPhlpvV3l+BJpHwJ4mGCszDoVCphbigmhJDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:38.715818Z"},"content_sha256":"d55e8aa9e3c39b8670032d107b05357625b5a9b9959f6705f3b62a5c44a13447","schema_version":"1.0","event_id":"sha256:d55e8aa9e3c39b8670032d107b05357625b5a9b9959f6705f3b62a5c44a13447"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OAHKBOUMHB5434IJWIMHGAUVK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Time of Arrival measurement model for non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"math.OC","authors_text":"Juri Sidorenko, Leo Doktorski, Michael Arens, Norbert Scherer-Negenborn, Volker Schatz","submitted_at":"2018-01-10T08:30:13Z","abstract_excerpt":"The quadratic system provided by the Time of Arrival technique can be solved analytically or by optimization algorithms. In practice, a combination of both methods is used. An important problem in quadratic optimization is the possible convergence to a local minimum, instead of the global minimum. This article presents an approach how this risk can be significantly reduced. The main idea of our approach is to transform the local minimum to a saddle point, by increasing the number of dimensions. In contrast to similar methods such as, dimension lifting does our problem remains non-convex."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03266","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:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLc7w+VyaWVeB/r4Z479HwhpAa5Veg9QqipT/5kTLRhBddazx21W4nb6JGkzsOl4Apy+0mHGBFv5YjmtETCRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:38.716187Z"},"content_sha256":"c2cdcb2bb3995d967bf44b527ea3074969e0897ca4b71113d30958fd006a99bc","schema_version":"1.0","event_id":"sha256:c2cdcb2bb3995d967bf44b527ea3074969e0897ca4b71113d30958fd006a99bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAHKBOUMHB5434IJWIMHGAUVK7/bundle.json","state_url":"https://pith.science/pith/OAHKBOUMHB5434IJWIMHGAUVK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAHKBOUMHB5434IJWIMHGAUVK7/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-05-29T14:36:38Z","links":{"resolver":"https://pith.science/pith/OAHKBOUMHB5434IJWIMHGAUVK7","bundle":"https://pith.science/pith/OAHKBOUMHB5434IJWIMHGAUVK7/bundle.json","state":"https://pith.science/pith/OAHKBOUMHB5434IJWIMHGAUVK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAHKBOUMHB5434IJWIMHGAUVK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OAHKBOUMHB5434IJWIMHGAUVK7","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":"8426ac4cc4174308a19adaa61b3a9735a18a698cf3b84add84aa044b08728e3d","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T08:30:13Z","title_canon_sha256":"3915aa9693f888ac159aa79976f6e232c32af0216e6eb80b6579824a90bc655c"},"schema_version":"1.0","source":{"id":"1801.03266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03266","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03266v1","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03266","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"OAHKBOUMHB54","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OAHKBOUMHB5434IJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OAHKBOUM","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:c2cdcb2bb3995d967bf44b527ea3074969e0897ca4b71113d30958fd006a99bc","target":"graph","created_at":"2026-05-18T00:26:17Z","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 quadratic system provided by the Time of Arrival technique can be solved analytically or by optimization algorithms. In practice, a combination of both methods is used. An important problem in quadratic optimization is the possible convergence to a local minimum, instead of the global minimum. This article presents an approach how this risk can be significantly reduced. The main idea of our approach is to transform the local minimum to a saddle point, by increasing the number of dimensions. In contrast to similar methods such as, dimension lifting does our problem remains non-convex.","authors_text":"Juri Sidorenko, Leo Doktorski, Michael Arens, Norbert Scherer-Negenborn, Volker Schatz","cross_cats":["eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T08:30:13Z","title":"Improved Time of Arrival measurement model for non-convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03266","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:d55e8aa9e3c39b8670032d107b05357625b5a9b9959f6705f3b62a5c44a13447","target":"record","created_at":"2026-05-18T00:26:17Z","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":"8426ac4cc4174308a19adaa61b3a9735a18a698cf3b84add84aa044b08728e3d","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T08:30:13Z","title_canon_sha256":"3915aa9693f888ac159aa79976f6e232c32af0216e6eb80b6579824a90bc655c"},"schema_version":"1.0","source":{"id":"1801.03266","kind":"arxiv","version":1}},"canonical_sha256":"700ea0ba8c387bcdf109b21873029557f14c865cc6fd4bc56a4a1262042db46c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"700ea0ba8c387bcdf109b21873029557f14c865cc6fd4bc56a4a1262042db46c","first_computed_at":"2026-05-18T00:26:17.569755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:17.569755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kUMYAa4JVmP4XgkutdYZbEvRUXgySLks1K6M4VgiJjnqwXe0LzkALsTFGhpGjh36TX0tfP+U07QfMjumK6M3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:17.570394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d55e8aa9e3c39b8670032d107b05357625b5a9b9959f6705f3b62a5c44a13447","sha256:c2cdcb2bb3995d967bf44b527ea3074969e0897ca4b71113d30958fd006a99bc"],"state_sha256":"b090eb036a1d9ae3276bbfead4e8892aa303c335025dbcf6dda5123b81dcb335"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZbEcP5Y81GU8DWiwb7xcoy32Fh756EOBZqAhcIqlY/PSdw2ZxiU7QKBkdPOdC1X8zoAm/mC5fvatkCBknsjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:36:38.719516Z","bundle_sha256":"af9251fd37bf3a1cf3d1bda9cc4db9d38a45bee6e336c68a4d00f34e1b5f4dbf"}}