{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YOMG42UHCFNGALPY2ITGMN7IL2","short_pith_number":"pith:YOMG42UH","canonical_record":{"source":{"id":"1610.09020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-27T21:55:51Z","cross_cats_sorted":[],"title_canon_sha256":"726712b7ddbaa2e88742caa380c606897ed3999157ce7dbb003a69af4c53059d","abstract_canon_sha256":"6bce2bb7f479fd073a98ba603c1020de2cbb10fae2fd4df9a72a22cdf00e9bb6"},"schema_version":"1.0"},"canonical_sha256":"c3986e6a87115a602df8d2266637e85ebd33b2ff0bfeefeb90830fbd513f96c1","source":{"kind":"arxiv","id":"1610.09020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09020","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09020v1","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09020","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"YOMG42UHCFNG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOMG42UHCFNGALPY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOMG42UH","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YOMG42UHCFNGALPY2ITGMN7IL2","target":"record","payload":{"canonical_record":{"source":{"id":"1610.09020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-27T21:55:51Z","cross_cats_sorted":[],"title_canon_sha256":"726712b7ddbaa2e88742caa380c606897ed3999157ce7dbb003a69af4c53059d","abstract_canon_sha256":"6bce2bb7f479fd073a98ba603c1020de2cbb10fae2fd4df9a72a22cdf00e9bb6"},"schema_version":"1.0"},"canonical_sha256":"c3986e6a87115a602df8d2266637e85ebd33b2ff0bfeefeb90830fbd513f96c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:59.416098Z","signature_b64":"DnhDdn+bcNIqMmYF2bg+0yfOcaI45htRXR3nzKj3Ctrwy2g/3oLXbD/S/q3qc4uUJwtC6+fdMadU1veLbwXEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3986e6a87115a602df8d2266637e85ebd33b2ff0bfeefeb90830fbd513f96c1","last_reissued_at":"2026-05-18T01:00:59.415394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:59.415394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.09020","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-18T01:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8EUxpJtoOJ0wPgOxEHSUDksfje1i7gdZona14Jao1XF53PrEj7ZHl63WpJEcwT+MktqFZkB+ZsOYauv3CTgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:21:46.459909Z"},"content_sha256":"d6da34cf34f3033bd4edfc256893b2c4a4db1a5a946d78ef42dcf13b40a06cc1","schema_version":"1.0","event_id":"sha256:d6da34cf34f3033bd4edfc256893b2c4a4db1a5a946d78ef42dcf13b40a06cc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YOMG42UHCFNGALPY2ITGMN7IL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dealing with bad apples: Robust range-based network localization via distributed relaxation methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'audia Soares, Jo\\~ao Gomes","submitted_at":"2016-10-27T21:55:51Z","abstract_excerpt":"Real-world network applications must cope with failing nodes, malicious attacks, or, somehow, nodes facing corrupted data --- classified as outliers. One enabling application is the geographic localization of the network nodes. However, despite excellent work on the network localization problem, prior research seldom considered outlier data --- even now, when already deployed networks cry out for robust procedures. We propose robust, fast, and distributed network localization algorithms, resilient to high-power noise, but also precise under regular Gaussian noise. We use the Huber M-estimator "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09020","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-18T01:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lq7ruaOySTC/aMev7/rmihkjpzQb0xcCmkVzCptQmBVCb62QSX3zwPi68nybHLmapmqfAjrpfQAzRJBxm++CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:21:46.460247Z"},"content_sha256":"3a9a8ac9c099703299018ac2db4fd16a768b91789de551a46f52c77bc7600293","schema_version":"1.0","event_id":"sha256:3a9a8ac9c099703299018ac2db4fd16a768b91789de551a46f52c77bc7600293"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOMG42UHCFNGALPY2ITGMN7IL2/bundle.json","state_url":"https://pith.science/pith/YOMG42UHCFNGALPY2ITGMN7IL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOMG42UHCFNGALPY2ITGMN7IL2/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-27T18:21:46Z","links":{"resolver":"https://pith.science/pith/YOMG42UHCFNGALPY2ITGMN7IL2","bundle":"https://pith.science/pith/YOMG42UHCFNGALPY2ITGMN7IL2/bundle.json","state":"https://pith.science/pith/YOMG42UHCFNGALPY2ITGMN7IL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOMG42UHCFNGALPY2ITGMN7IL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YOMG42UHCFNGALPY2ITGMN7IL2","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":"6bce2bb7f479fd073a98ba603c1020de2cbb10fae2fd4df9a72a22cdf00e9bb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-27T21:55:51Z","title_canon_sha256":"726712b7ddbaa2e88742caa380c606897ed3999157ce7dbb003a69af4c53059d"},"schema_version":"1.0","source":{"id":"1610.09020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09020","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09020v1","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09020","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"YOMG42UHCFNG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOMG42UHCFNGALPY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOMG42UH","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:3a9a8ac9c099703299018ac2db4fd16a768b91789de551a46f52c77bc7600293","target":"graph","created_at":"2026-05-18T01:00:59Z","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":"Real-world network applications must cope with failing nodes, malicious attacks, or, somehow, nodes facing corrupted data --- classified as outliers. One enabling application is the geographic localization of the network nodes. However, despite excellent work on the network localization problem, prior research seldom considered outlier data --- even now, when already deployed networks cry out for robust procedures. We propose robust, fast, and distributed network localization algorithms, resilient to high-power noise, but also precise under regular Gaussian noise. We use the Huber M-estimator ","authors_text":"Cl\\'audia Soares, Jo\\~ao Gomes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-27T21:55:51Z","title":"Dealing with bad apples: Robust range-based network localization via distributed relaxation methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09020","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:d6da34cf34f3033bd4edfc256893b2c4a4db1a5a946d78ef42dcf13b40a06cc1","target":"record","created_at":"2026-05-18T01:00:59Z","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":"6bce2bb7f479fd073a98ba603c1020de2cbb10fae2fd4df9a72a22cdf00e9bb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-27T21:55:51Z","title_canon_sha256":"726712b7ddbaa2e88742caa380c606897ed3999157ce7dbb003a69af4c53059d"},"schema_version":"1.0","source":{"id":"1610.09020","kind":"arxiv","version":1}},"canonical_sha256":"c3986e6a87115a602df8d2266637e85ebd33b2ff0bfeefeb90830fbd513f96c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3986e6a87115a602df8d2266637e85ebd33b2ff0bfeefeb90830fbd513f96c1","first_computed_at":"2026-05-18T01:00:59.415394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:59.415394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DnhDdn+bcNIqMmYF2bg+0yfOcaI45htRXR3nzKj3Ctrwy2g/3oLXbD/S/q3qc4uUJwtC6+fdMadU1veLbwXEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:59.416098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6da34cf34f3033bd4edfc256893b2c4a4db1a5a946d78ef42dcf13b40a06cc1","sha256:3a9a8ac9c099703299018ac2db4fd16a768b91789de551a46f52c77bc7600293"],"state_sha256":"022da83b5e58938104ebf5d1c4f0dff5f738072e1a2b502f0a97a283cdad1de4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PK8P5cS1on7kpPob6z7UBpMhykMQMvu7V/H4RAB/nD6D8bpiUsChDueFFCcmig3Z4WseiIf0hFj2B/a95e6bBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:21:46.462089Z","bundle_sha256":"ff167163c7f067247a4b43a1f9ca110644834dc305207ecd29f3c5f05c55e579"}}