{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U3E4SLO2JQ5BQ7HUK226RI7NZ2","short_pith_number":"pith:U3E4SLO2","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"},"canonical_sha256":"a6c9c92dda4c3a187cf456b5e8a3edce8d8bc61f7f8574e50fc880b18bc6f944","source":{"kind":"arxiv","id":"2605.24734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24734","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24734v1","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24734","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"U3E4SLO2JQ5B","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"U3E4SLO2JQ5BQ7HU","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"U3E4SLO2","created_at":"2026-05-26T01:03:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U3E4SLO2JQ5BQ7HUK226RI7NZ2","target":"record","payload":{"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"},"canonical_sha256":"a6c9c92dda4c3a187cf456b5e8a3edce8d8bc61f7f8574e50fc880b18bc6f944","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"},"source_kind":"arxiv","source_id":"2605.24734","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-26T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQ9tngeCf+7BwPDKbWSuOEfU4Mcm2uPVCYDw74EpP8MrGmvg5XhuFP8i/Ni8W0OQbdQC0MteuMg4mqcmeR0oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:11:22.451503Z"},"content_sha256":"343bbbb4addd92acd9a12901abcb4fac1aa5f385116bfc848682c4be354f94fb","schema_version":"1.0","event_id":"sha256:343bbbb4addd92acd9a12901abcb4fac1aa5f385116bfc848682c4be354f94fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U3E4SLO2JQ5BQ7HUK226RI7NZ2","target":"graph","payload":{"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"},"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-26T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7ci6fTZh2bRzeNJWSHwsp4EC/ROo3hY20liZDT+FIw4czvab04NU631TAmF3AsGTv7xsiSBexn/f2Uu2a4lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:11:22.452359Z"},"content_sha256":"1d909d5624d267f52fd61c2bfcc2c135e049a3d6ba87364a6ce41d9be5475d09","schema_version":"1.0","event_id":"sha256:1d909d5624d267f52fd61c2bfcc2c135e049a3d6ba87364a6ce41d9be5475d09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/bundle.json","state_url":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/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-11T07:11:22Z","links":{"resolver":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2","bundle":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/bundle.json","state":"https://pith.science/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3E4SLO2JQ5BQ7HUK226RI7NZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U3E4SLO2JQ5BQ7HUK226RI7NZ2","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":"eb638f3e808e49b8408231c185016856c8c5580f889cdcbd4330a419788642ee","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T20:59:43Z","title_canon_sha256":"b4e6292c7d3bad48e57f03d2a21dadd2c208c5180e90bec539a1b038ef57d290"},"schema_version":"1.0","source":{"id":"2605.24734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24734","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24734v1","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24734","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"U3E4SLO2JQ5B","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"U3E4SLO2JQ5BQ7HU","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"U3E4SLO2","created_at":"2026-05-26T01:03:55Z"}],"graph_snapshots":[{"event_id":"sha256:1d909d5624d267f52fd61c2bfcc2c135e049a3d6ba87364a6ce41d9be5475d09","target":"graph","created_at":"2026-05-26T01:03:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.24734/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eric D. Kolaczyk, Hui Shen","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T20:59:43Z","title":"Consistent Identification of Top-$K$ Nodes in Noisy Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24734","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:343bbbb4addd92acd9a12901abcb4fac1aa5f385116bfc848682c4be354f94fb","target":"record","created_at":"2026-05-26T01:03:55Z","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":"eb638f3e808e49b8408231c185016856c8c5580f889cdcbd4330a419788642ee","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T20:59:43Z","title_canon_sha256":"b4e6292c7d3bad48e57f03d2a21dadd2c208c5180e90bec539a1b038ef57d290"},"schema_version":"1.0","source":{"id":"2605.24734","kind":"arxiv","version":1}},"canonical_sha256":"a6c9c92dda4c3a187cf456b5e8a3edce8d8bc61f7f8574e50fc880b18bc6f944","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6c9c92dda4c3a187cf456b5e8a3edce8d8bc61f7f8574e50fc880b18bc6f944","first_computed_at":"2026-05-26T01:03:55.574974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:55.574974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eDEXGjJjtYCSSollMbKTpIzdLS+tYB1ujSRr8CsGViWhzQbdmqNtx9ulYoWSNKCrsnPqmiGllkdIfvdmHPN9AQ==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:55.575695Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.24734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:343bbbb4addd92acd9a12901abcb4fac1aa5f385116bfc848682c4be354f94fb","sha256:1d909d5624d267f52fd61c2bfcc2c135e049a3d6ba87364a6ce41d9be5475d09"],"state_sha256":"d07b34fbf32e078e60e6edd9bd4d3849d450d6074954591449be59b0c975b6b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yN3Q3ErHIDLL6MXadXVGqp3xmtXHaBuu9qXKFb3/9mSsW4eOO5Vdjxag3vKd2LHZ80F9dsgV7h4m81jqWzphAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:11:22.457486Z","bundle_sha256":"3ba36e51ce5fa6a38d381cd8e50381ff07a3edae01013664e4c8c3f20c24911a"}}