{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OHPYI6DEDOQQJ6WWON4RFCMXBU","short_pith_number":"pith:OHPYI6DE","canonical_record":{"source":{"id":"1807.00108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-30T02:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"b7c2bde48c82488a645427e09c10fcd1d92140574d09307ae810e9946f9ac6c6","abstract_canon_sha256":"841631682d431725192a106d8ebfd262e009028c8a52eb3810e1850b2e71e63f"},"schema_version":"1.0"},"canonical_sha256":"71df8478641ba104fad673791289970d2137b866a0479bf38a3cc0d2c5043c4d","source":{"kind":"arxiv","id":"1807.00108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00108","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00108v1","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00108","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"OHPYI6DEDOQQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OHPYI6DEDOQQJ6WW","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OHPYI6DE","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OHPYI6DEDOQQJ6WWON4RFCMXBU","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-30T02:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"b7c2bde48c82488a645427e09c10fcd1d92140574d09307ae810e9946f9ac6c6","abstract_canon_sha256":"841631682d431725192a106d8ebfd262e009028c8a52eb3810e1850b2e71e63f"},"schema_version":"1.0"},"canonical_sha256":"71df8478641ba104fad673791289970d2137b866a0479bf38a3cc0d2c5043c4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.073146Z","signature_b64":"PntVHR0a5Jiy8sJIoqZGznOkSBbRo3p1QyqDjoN1bL3USbJlNQx8/U0Rkry8o4eIUNaXQis+t0Ty6xBCKP8HDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71df8478641ba104fad673791289970d2137b866a0479bf38a3cc0d2c5043c4d","last_reissued_at":"2026-05-18T00:11:56.072478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.072478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00108","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:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVK5yPCbPBOjQ5UReAOyekXl6jQ0IhA8RUBwRWPajX0yYSK1V9ZxmtE3+Cbag1TCRYjZwhpigJbgjaHkKYTIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:35:04.928929Z"},"content_sha256":"37b77661355b7b697d9e4ee21f1e73df51dd1ae11513c6bb205dae6d2bc09d86","schema_version":"1.0","event_id":"sha256:37b77661355b7b697d9e4ee21f1e73df51dd1ae11513c6bb205dae6d2bc09d86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OHPYI6DEDOQQJ6WWON4RFCMXBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Component-based Network Localization with Noisy Range Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Deying Li, Tianyuan Sun, Wenping Chen, Yongcai Wang, Zhaoquan Gu","submitted_at":"2018-06-30T02:12:42Z","abstract_excerpt":"Accurate and robust localization is crucial for wireless ad-hoc and sensor networks. Among the localization techniques, component-based methods advance themselves for conquering network sparseness and anchor sparseness. But component-based methods are sensitive to ranging noises, which may cause a huge accumulated error either in component realization or merging process. This paper presents three results for robust component-based localization under ranging noises. (1) For a rigid graph component, a novel method is proposed to evaluate the graph's possible number of flip ambiguities under nois"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00108","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:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTP+i6Pb2n34GoX0RyCmFXpaXLiZRArTyxOWnNO7cXmFEDF93rnlumkA1EJHKBZrCVgV/H2WxtRq7V5KgaMrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:35:04.929599Z"},"content_sha256":"41176530563e84687afb3fa00bf6e819e87aea35dde0905c23f42c2043a3838a","schema_version":"1.0","event_id":"sha256:41176530563e84687afb3fa00bf6e819e87aea35dde0905c23f42c2043a3838a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHPYI6DEDOQQJ6WWON4RFCMXBU/bundle.json","state_url":"https://pith.science/pith/OHPYI6DEDOQQJ6WWON4RFCMXBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHPYI6DEDOQQJ6WWON4RFCMXBU/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-11T21:35:04Z","links":{"resolver":"https://pith.science/pith/OHPYI6DEDOQQJ6WWON4RFCMXBU","bundle":"https://pith.science/pith/OHPYI6DEDOQQJ6WWON4RFCMXBU/bundle.json","state":"https://pith.science/pith/OHPYI6DEDOQQJ6WWON4RFCMXBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHPYI6DEDOQQJ6WWON4RFCMXBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OHPYI6DEDOQQJ6WWON4RFCMXBU","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":"841631682d431725192a106d8ebfd262e009028c8a52eb3810e1850b2e71e63f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-30T02:12:42Z","title_canon_sha256":"b7c2bde48c82488a645427e09c10fcd1d92140574d09307ae810e9946f9ac6c6"},"schema_version":"1.0","source":{"id":"1807.00108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00108","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00108v1","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00108","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"OHPYI6DEDOQQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OHPYI6DEDOQQJ6WW","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OHPYI6DE","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:41176530563e84687afb3fa00bf6e819e87aea35dde0905c23f42c2043a3838a","target":"graph","created_at":"2026-05-18T00:11:56Z","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":"Accurate and robust localization is crucial for wireless ad-hoc and sensor networks. Among the localization techniques, component-based methods advance themselves for conquering network sparseness and anchor sparseness. But component-based methods are sensitive to ranging noises, which may cause a huge accumulated error either in component realization or merging process. This paper presents three results for robust component-based localization under ranging noises. (1) For a rigid graph component, a novel method is proposed to evaluate the graph's possible number of flip ambiguities under nois","authors_text":"Deying Li, Tianyuan Sun, Wenping Chen, Yongcai Wang, Zhaoquan Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-30T02:12:42Z","title":"Robust Component-based Network Localization with Noisy Range Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00108","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:37b77661355b7b697d9e4ee21f1e73df51dd1ae11513c6bb205dae6d2bc09d86","target":"record","created_at":"2026-05-18T00:11:56Z","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":"841631682d431725192a106d8ebfd262e009028c8a52eb3810e1850b2e71e63f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-30T02:12:42Z","title_canon_sha256":"b7c2bde48c82488a645427e09c10fcd1d92140574d09307ae810e9946f9ac6c6"},"schema_version":"1.0","source":{"id":"1807.00108","kind":"arxiv","version":1}},"canonical_sha256":"71df8478641ba104fad673791289970d2137b866a0479bf38a3cc0d2c5043c4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71df8478641ba104fad673791289970d2137b866a0479bf38a3cc0d2c5043c4d","first_computed_at":"2026-05-18T00:11:56.072478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:56.072478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PntVHR0a5Jiy8sJIoqZGznOkSBbRo3p1QyqDjoN1bL3USbJlNQx8/U0Rkry8o4eIUNaXQis+t0Ty6xBCKP8HDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:56.073146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37b77661355b7b697d9e4ee21f1e73df51dd1ae11513c6bb205dae6d2bc09d86","sha256:41176530563e84687afb3fa00bf6e819e87aea35dde0905c23f42c2043a3838a"],"state_sha256":"0b8f75e774fbfd31219bb6fb8d747facbd68091f3eb763aea2db47b67f64db0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1WXfA8ywXZx/g2TXDk1Fu8DJOYwogepUMLFQxuSDXLsa+uvOdTPRRTdg7ef5h5Lo5bLVdLBkj8wX+cWJGInAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:35:04.933668Z","bundle_sha256":"96b6d7942c8064671a4663bf62aed52137444fa2361afe3a5dd34f0a5a2c1b1a"}}