{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:U3E4SLO2JQ5BQ7HUK226RI7NZ2","short_pith_number":"pith:U3E4SLO2","schema_version":"1.0","canonical_sha256":"a6c9c92dda4c3a187cf456b5e8a3edce8d8bc61f7f8574e50fc880b18bc6f944","source":{"kind":"arxiv","id":"2605.24734","version":1},"attestation_state":"computed","paper":{"title":"Consistent Identification of Top-$K$ Nodes in Noisy Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Eric D. Kolaczyk, Hui Shen","submitted_at":"2026-05-23T20:59:43Z","abstract_excerpt":"Identifying the most influential nodes in a network, typically using centrality measures, is a central task in applied network analysis. However, real-world networks are often constructed from noisy or incomplete data, which can distort rankings and lead to errors in identifying the true top-$k$ nodes. In this paper, we study how network noise affects the recovery of the true top-$k$ node set based on degree centrality. Specifically, we consider a noisy network observation in which edges are randomly added or removed according to a probabilistic noise model, and analyze the resulting empirical"},"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":"2605.24734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T20:59:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"b4e6292c7d3bad48e57f03d2a21dadd2c208c5180e90bec539a1b038ef57d290","abstract_canon_sha256":"eb638f3e808e49b8408231c185016856c8c5580f889cdcbd4330a419788642ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:55.575695Z","signature_b64":"eDEXGjJjtYCSSollMbKTpIzdLS+tYB1ujSRr8CsGViWhzQbdmqNtx9ulYoWSNKCrsnPqmiGllkdIfvdmHPN9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6c9c92dda4c3a187cf456b5e8a3edce8d8bc61f7f8574e50fc880b18bc6f944","last_reissued_at":"2026-05-26T01:03:55.574974Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:55.574974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistent Identification of Top-$K$ Nodes in Noisy Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Eric D. Kolaczyk, Hui Shen","submitted_at":"2026-05-23T20:59:43Z","abstract_excerpt":"Identifying the most influential nodes in a network, typically using centrality measures, is a central task in applied network analysis. However, real-world networks are often constructed from noisy or incomplete data, which can distort rankings and lead to errors in identifying the true top-$k$ nodes. In this paper, we study how network noise affects the recovery of the true top-$k$ node set based on degree centrality. Specifically, we consider a noisy network observation in which edges are randomly added or removed according to a probabilistic noise model, and analyze the resulting empirical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24734","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.24734/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.24734","created_at":"2026-05-26T01:03:55.575085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24734v1","created_at":"2026-05-26T01:03:55.575085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24734","created_at":"2026-05-26T01:03:55.575085+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3E4SLO2JQ5B","created_at":"2026-05-26T01:03:55.575085+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3E4SLO2JQ5BQ7HU","created_at":"2026-05-26T01:03:55.575085+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3E4SLO2","created_at":"2026-05-26T01:03:55.575085+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/U3E4SLO2JQ5BQ7HUK226RI7NZ2","json":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2.json","graph_json":"https://pith.science/api/pith-number/U3E4SLO2JQ5BQ7HUK226RI7NZ2/graph.json","events_json":"https://pith.science/api/pith-number/U3E4SLO2JQ5BQ7HUK226RI7NZ2/events.json","paper":"https://pith.science/paper/U3E4SLO2"},"agent_actions":{"view_html":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2","download_json":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2.json","view_paper":"https://pith.science/paper/U3E4SLO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24734&json=true","fetch_graph":"https://pith.science/api/pith-number/U3E4SLO2JQ5BQ7HUK226RI7NZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/U3E4SLO2JQ5BQ7HUK226RI7NZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/action/storage_attestation","attest_author":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/action/author_attestation","sign_citation":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/action/citation_signature","submit_replication":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/action/replication_record"}},"created_at":"2026-05-26T01:03:55.575085+00:00","updated_at":"2026-05-26T01:03:55.575085+00:00"}