{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BO367DVVBGZBYRYAACVRTVS6CP","short_pith_number":"pith:BO367DVV","canonical_record":{"source":{"id":"1407.5616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2014-07-19T12:13:45Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a35f76065587c37872cd5c10643934bb670b4fddc13cf8ff4c2e993936393596","abstract_canon_sha256":"f918082d95cc52b589b1b7326d367a66b84035b3250e7e1284b67e44ab286be1"},"schema_version":"1.0"},"canonical_sha256":"0bb7ef8eb509b21c470000ab19d65e13f60eed615f53c394e8b952641b3de2cb","source":{"kind":"arxiv","id":"1407.5616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5616","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5616v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5616","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"BO367DVVBGZB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BO367DVVBGZBYRYA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BO367DVV","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BO367DVVBGZBYRYAACVRTVS6CP","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2014-07-19T12:13:45Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a35f76065587c37872cd5c10643934bb670b4fddc13cf8ff4c2e993936393596","abstract_canon_sha256":"f918082d95cc52b589b1b7326d367a66b84035b3250e7e1284b67e44ab286be1"},"schema_version":"1.0"},"canonical_sha256":"0bb7ef8eb509b21c470000ab19d65e13f60eed615f53c394e8b952641b3de2cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:06.903967Z","signature_b64":"Gcc7svGJP0pbDa/REjbExn9obP0rsX1IS/aF223LRwVsn2dMYeJCsF0tI1CwtblWGb/vzuYFNmHj1/zuDTrICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb7ef8eb509b21c470000ab19d65e13f60eed615f53c394e8b952641b3de2cb","last_reissued_at":"2026-05-18T02:47:06.903542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:06.903542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5616","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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARMSZXuLUOrPjfkcGrzilg8SacucUsHnv6NOXWawepej0eE3JHobDnBJuwt6qqerhAHpjwexVTvAF7bQjdzWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:02:32.258433Z"},"content_sha256":"718a2ea4cc96f6ea6719f263803888266b4bab08f0df8d1522325995b02c5ef8","schema_version":"1.0","event_id":"sha256:718a2ea4cc96f6ea6719f263803888266b4bab08f0df8d1522325995b02c5ef8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BO367DVVBGZBYRYAACVRTVS6CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TW-TOA Based Positioning in the Presence of Clock Imperfections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.AP","authors_text":"Erik G. Str\\\"om, Mohammad Reza Gholami, Sinan Gezici","submitted_at":"2014-07-19T12:13:45Z","abstract_excerpt":"This paper studies the positioning problem based on two-way time-of-arrival (TW-TOA) measurements in asynchronous wireless sensor networks. Since the optimal estimator for this problem involves difficult nonconvex optimization, we propose two suboptimal estimators based on squared-range least squares and least absolute mean of residual errors. The former approach is formulated as a general trust region subproblem which can be solved exactly under mild conditions. The latter approach is formulated as a difference of convex functions programming (DCP), which can be solved using a concave-convex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5616","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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ay27MrVSdgoRmU8w4v3nDnI43SaQoJ2ECODgPNyVm2nqn3mdtT5A6FdWetHOdYl11D5hJFmy+CqLoqIhNnN5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:02:32.258785Z"},"content_sha256":"75254f824bc896d2ab12fb16f335d37af0858a77bcda83201a9e133405f69e9a","schema_version":"1.0","event_id":"sha256:75254f824bc896d2ab12fb16f335d37af0858a77bcda83201a9e133405f69e9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BO367DVVBGZBYRYAACVRTVS6CP/bundle.json","state_url":"https://pith.science/pith/BO367DVVBGZBYRYAACVRTVS6CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BO367DVVBGZBYRYAACVRTVS6CP/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-23T14:02:32Z","links":{"resolver":"https://pith.science/pith/BO367DVVBGZBYRYAACVRTVS6CP","bundle":"https://pith.science/pith/BO367DVVBGZBYRYAACVRTVS6CP/bundle.json","state":"https://pith.science/pith/BO367DVVBGZBYRYAACVRTVS6CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BO367DVVBGZBYRYAACVRTVS6CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BO367DVVBGZBYRYAACVRTVS6CP","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":"f918082d95cc52b589b1b7326d367a66b84035b3250e7e1284b67e44ab286be1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2014-07-19T12:13:45Z","title_canon_sha256":"a35f76065587c37872cd5c10643934bb670b4fddc13cf8ff4c2e993936393596"},"schema_version":"1.0","source":{"id":"1407.5616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5616","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5616v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5616","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"BO367DVVBGZB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BO367DVVBGZBYRYA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BO367DVV","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:75254f824bc896d2ab12fb16f335d37af0858a77bcda83201a9e133405f69e9a","target":"graph","created_at":"2026-05-18T02:47:06Z","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":"This paper studies the positioning problem based on two-way time-of-arrival (TW-TOA) measurements in asynchronous wireless sensor networks. Since the optimal estimator for this problem involves difficult nonconvex optimization, we propose two suboptimal estimators based on squared-range least squares and least absolute mean of residual errors. The former approach is formulated as a general trust region subproblem which can be solved exactly under mild conditions. The latter approach is formulated as a difference of convex functions programming (DCP), which can be solved using a concave-convex ","authors_text":"Erik G. Str\\\"om, Mohammad Reza Gholami, Sinan Gezici","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2014-07-19T12:13:45Z","title":"TW-TOA Based Positioning in the Presence of Clock Imperfections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5616","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:718a2ea4cc96f6ea6719f263803888266b4bab08f0df8d1522325995b02c5ef8","target":"record","created_at":"2026-05-18T02:47:06Z","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":"f918082d95cc52b589b1b7326d367a66b84035b3250e7e1284b67e44ab286be1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2014-07-19T12:13:45Z","title_canon_sha256":"a35f76065587c37872cd5c10643934bb670b4fddc13cf8ff4c2e993936393596"},"schema_version":"1.0","source":{"id":"1407.5616","kind":"arxiv","version":1}},"canonical_sha256":"0bb7ef8eb509b21c470000ab19d65e13f60eed615f53c394e8b952641b3de2cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bb7ef8eb509b21c470000ab19d65e13f60eed615f53c394e8b952641b3de2cb","first_computed_at":"2026-05-18T02:47:06.903542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:06.903542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gcc7svGJP0pbDa/REjbExn9obP0rsX1IS/aF223LRwVsn2dMYeJCsF0tI1CwtblWGb/vzuYFNmHj1/zuDTrICA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:06.903967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:718a2ea4cc96f6ea6719f263803888266b4bab08f0df8d1522325995b02c5ef8","sha256:75254f824bc896d2ab12fb16f335d37af0858a77bcda83201a9e133405f69e9a"],"state_sha256":"0a43805024a8c1a3bea7ed56e0e38d7581877827c24ee19ac118faf6ba7ff871"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZDTX2EitaLCt8dKrNsjkbEEnWxABSdPMNj/cSBDsKNPZ81NPueWOqfahDv2mi1iKMc4eAY64YFMBz1NJz0EFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:02:32.260888Z","bundle_sha256":"19d70caf8b2d30e3b5aac89cd87b1d0a59fc1e81c919a1978d749e92ea76cc18"}}