{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2NEGMZB6KTEW4WZ6NY4KYBFIQW","short_pith_number":"pith:2NEGMZB6","schema_version":"1.0","canonical_sha256":"d34866643e54c96e5b3e6e38ac04a885b6bae71b88e3abb36393f0525910db7b","source":{"kind":"arxiv","id":"1707.03487","version":1},"attestation_state":"computed","paper":{"title":"Robust Estimation from Multiple Graphs under Gross Error Contamination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Carey E. Priebe, Joshua T. Vogelstein, Minh Tang, Runze Tang","submitted_at":"2017-07-11T23:06:03Z","abstract_excerpt":"Estimation of graph parameters based on a collection of graphs is essential for a wide range of graph inference tasks. In practice, weighted graphs are generally observed with edge contamination. We consider a weighted latent position graph model contaminated via an edge weight gross error model and propose an estimation methodology based on robust Lq estimation followed by low-rank adjacency spectral decomposition. We demonstrate that, under appropriate conditions, our estimator both maintains Lq robustness and wins the bias-variance tradeoff by exploiting low-rank graph structure. We illustr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1707.03487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-11T23:06:03Z","cross_cats_sorted":[],"title_canon_sha256":"0923519b15c5cbb5337ff53b51da0445a8bf28e0f4645492e63481ed2e4f6d12","abstract_canon_sha256":"05225925f4a27f38c677e67ccdb071fd5279e124dac4fa76118d617509b419c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:25.869747Z","signature_b64":"OjYJ22zhV0U37TMDM6IuaXD32ywiIVabjn6R0JD2SQBIac4UQJV2got+uqhOr1SPtNEglZ2V9W+/qFbzDYeuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d34866643e54c96e5b3e6e38ac04a885b6bae71b88e3abb36393f0525910db7b","last_reissued_at":"2026-05-18T00:40:25.869134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:25.869134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Estimation from Multiple Graphs under Gross Error Contamination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Carey E. Priebe, Joshua T. Vogelstein, Minh Tang, Runze Tang","submitted_at":"2017-07-11T23:06:03Z","abstract_excerpt":"Estimation of graph parameters based on a collection of graphs is essential for a wide range of graph inference tasks. In practice, weighted graphs are generally observed with edge contamination. We consider a weighted latent position graph model contaminated via an edge weight gross error model and propose an estimation methodology based on robust Lq estimation followed by low-rank adjacency spectral decomposition. We demonstrate that, under appropriate conditions, our estimator both maintains Lq robustness and wins the bias-variance tradeoff by exploiting low-rank graph structure. We illustr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03487","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.03487","created_at":"2026-05-18T00:40:25.869232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03487v1","created_at":"2026-05-18T00:40:25.869232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03487","created_at":"2026-05-18T00:40:25.869232+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NEGMZB6KTEW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NEGMZB6KTEW4WZ6","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NEGMZB6","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW","json":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW.json","graph_json":"https://pith.science/api/pith-number/2NEGMZB6KTEW4WZ6NY4KYBFIQW/graph.json","events_json":"https://pith.science/api/pith-number/2NEGMZB6KTEW4WZ6NY4KYBFIQW/events.json","paper":"https://pith.science/paper/2NEGMZB6"},"agent_actions":{"view_html":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW","download_json":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW.json","view_paper":"https://pith.science/paper/2NEGMZB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03487&json=true","fetch_graph":"https://pith.science/api/pith-number/2NEGMZB6KTEW4WZ6NY4KYBFIQW/graph.json","fetch_events":"https://pith.science/api/pith-number/2NEGMZB6KTEW4WZ6NY4KYBFIQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW/action/storage_attestation","attest_author":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW/action/author_attestation","sign_citation":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW/action/citation_signature","submit_replication":"https://pith.science/pith/2NEGMZB6KTEW4WZ6NY4KYBFIQW/action/replication_record"}},"created_at":"2026-05-18T00:40:25.869232+00:00","updated_at":"2026-05-18T00:40:25.869232+00:00"}