{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CL6NHAWPTFBD2TTCHOT2U527G2","short_pith_number":"pith:CL6NHAWP","canonical_record":{"source":{"id":"1410.2327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-09T01:01:57Z","cross_cats_sorted":[],"title_canon_sha256":"d82cfa5507654aa13cbffbf05883c01cb1f13c0b3db964462a197456f4d77807","abstract_canon_sha256":"d6032ec539fe3f9a9c430aebd035de99285496662428986c502a324722d13e18"},"schema_version":"1.0"},"canonical_sha256":"12fcd382cf99423d4e623ba7aa775f3690aec45389912d49253deedd090f6c89","source":{"kind":"arxiv","id":"1410.2327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2327","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2327v1","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2327","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"CL6NHAWPTFBD","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CL6NHAWPTFBD2TTC","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CL6NHAWP","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CL6NHAWPTFBD2TTCHOT2U527G2","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-09T01:01:57Z","cross_cats_sorted":[],"title_canon_sha256":"d82cfa5507654aa13cbffbf05883c01cb1f13c0b3db964462a197456f4d77807","abstract_canon_sha256":"d6032ec539fe3f9a9c430aebd035de99285496662428986c502a324722d13e18"},"schema_version":"1.0"},"canonical_sha256":"12fcd382cf99423d4e623ba7aa775f3690aec45389912d49253deedd090f6c89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:46.652777Z","signature_b64":"LaixSGDpAO2IMtRmZcTWOCwSpCfdZGIdgPPdXeZYHZTRP/eFI1WEoDoLpTkkZYoU8T+/0x+iln5RKs33ecB6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12fcd382cf99423d4e623ba7aa775f3690aec45389912d49253deedd090f6c89","last_reissued_at":"2026-05-18T02:40:46.652220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:46.652220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2327","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:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ey561L60zUeIRzTyZHB1oPQr/HepKvfg2Lv/c4rew1ob2/MP3xyZbhQEZ80dIczN8hBmEfIeefoiwK6tH3xCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:39:30.839243Z"},"content_sha256":"9153058430958fc2278e184cad3ded806beff6f5aecd72de9dbb235aca45d067","schema_version":"1.0","event_id":"sha256:9153058430958fc2278e184cad3ded806beff6f5aecd72de9dbb235aca45d067"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CL6NHAWPTFBD2TTCHOT2U527G2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust dissimilarity measure for Network Localization","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":"2014-10-09T01:01:57Z","abstract_excerpt":"In practice, network applications have to deal with failing nodes, malicious attacks, or, somehow, nodes facing highly corrupted data --- generally classified as outliers. This calls for robust, uncomplicated, and efficient methods. We propose a dissimilarity model for network localization which is robust to high-power noise, but also discriminative in the presence of regular gaussian noise. We capitalize on the known properties of the M-estimator Huber penalty function to obtain a robust, but nonconvex, problem, and devise a convex underestimator, tight in the function terms, that can be mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2327","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:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdFbGf3goXN0hyXV6Cpw7kxjtycJV7RrAG3PgpHFZAWbAcoAQ6BZxOm5rvOmfYolmvw58zXeTNnTsL/mb23kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:39:30.839945Z"},"content_sha256":"8023256c998ea8dd054835bd6086e1d58f8c6150f8ec0e3d68140115448c1636","schema_version":"1.0","event_id":"sha256:8023256c998ea8dd054835bd6086e1d58f8c6150f8ec0e3d68140115448c1636"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CL6NHAWPTFBD2TTCHOT2U527G2/bundle.json","state_url":"https://pith.science/pith/CL6NHAWPTFBD2TTCHOT2U527G2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CL6NHAWPTFBD2TTCHOT2U527G2/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-30T15:39:30Z","links":{"resolver":"https://pith.science/pith/CL6NHAWPTFBD2TTCHOT2U527G2","bundle":"https://pith.science/pith/CL6NHAWPTFBD2TTCHOT2U527G2/bundle.json","state":"https://pith.science/pith/CL6NHAWPTFBD2TTCHOT2U527G2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CL6NHAWPTFBD2TTCHOT2U527G2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CL6NHAWPTFBD2TTCHOT2U527G2","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":"d6032ec539fe3f9a9c430aebd035de99285496662428986c502a324722d13e18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-09T01:01:57Z","title_canon_sha256":"d82cfa5507654aa13cbffbf05883c01cb1f13c0b3db964462a197456f4d77807"},"schema_version":"1.0","source":{"id":"1410.2327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2327","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2327v1","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2327","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"CL6NHAWPTFBD","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CL6NHAWPTFBD2TTC","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CL6NHAWP","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:8023256c998ea8dd054835bd6086e1d58f8c6150f8ec0e3d68140115448c1636","target":"graph","created_at":"2026-05-18T02:40:46Z","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":"In practice, network applications have to deal with failing nodes, malicious attacks, or, somehow, nodes facing highly corrupted data --- generally classified as outliers. This calls for robust, uncomplicated, and efficient methods. We propose a dissimilarity model for network localization which is robust to high-power noise, but also discriminative in the presence of regular gaussian noise. We capitalize on the known properties of the M-estimator Huber penalty function to obtain a robust, but nonconvex, problem, and devise a convex underestimator, tight in the function terms, that can be mini","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":"2014-10-09T01:01:57Z","title":"Robust dissimilarity measure for Network Localization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2327","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:9153058430958fc2278e184cad3ded806beff6f5aecd72de9dbb235aca45d067","target":"record","created_at":"2026-05-18T02:40:46Z","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":"d6032ec539fe3f9a9c430aebd035de99285496662428986c502a324722d13e18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-09T01:01:57Z","title_canon_sha256":"d82cfa5507654aa13cbffbf05883c01cb1f13c0b3db964462a197456f4d77807"},"schema_version":"1.0","source":{"id":"1410.2327","kind":"arxiv","version":1}},"canonical_sha256":"12fcd382cf99423d4e623ba7aa775f3690aec45389912d49253deedd090f6c89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12fcd382cf99423d4e623ba7aa775f3690aec45389912d49253deedd090f6c89","first_computed_at":"2026-05-18T02:40:46.652220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:46.652220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LaixSGDpAO2IMtRmZcTWOCwSpCfdZGIdgPPdXeZYHZTRP/eFI1WEoDoLpTkkZYoU8T+/0x+iln5RKs33ecB6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:46.652777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9153058430958fc2278e184cad3ded806beff6f5aecd72de9dbb235aca45d067","sha256:8023256c998ea8dd054835bd6086e1d58f8c6150f8ec0e3d68140115448c1636"],"state_sha256":"8ff6ee38c8faab83473703b1428628c7290d88fa34f8853e0057373e1f69bf19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MdlMHvfMEBUEmmKoHF43i30lJOOFrLODtvSzG6fY2o2QbvPLTHctgvHK04OVrv09MUMMPSNiNe39UUmuiE6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:39:30.843421Z","bundle_sha256":"8707c8af433c03688c707388a4f83fced3d5a0491085dbf159785c37f0b971db"}}