{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AXTXZQPURYHHW3ZAFA65PITS66","short_pith_number":"pith:AXTXZQPU","schema_version":"1.0","canonical_sha256":"05e77cc1f48e0e7b6f20283dd7a272f7b15691b401b283e5ca70b23e3601284e","source":{"kind":"arxiv","id":"2602.16041","version":2},"attestation_state":"computed","paper":{"title":"Predictive Subsampling for Scalable Inference in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Arpan Kumar, Minh Tang, Srijan Sengupta","submitted_at":"2026-02-17T21:48:57Z","abstract_excerpt":"Current methods for statistical inference in networks often encounter substantial computational bottlenecks when applied to the massive network datasets that are increasingly common across scientific domains. In this paper, we develop \\textit{Predictive Subsampling} (\\texttt{PredSub}), a scalable framework for estimation and two-sample testing in networks. The central idea is to replace a full-sample estimation procedure by estimation on a random subsample, followed by out-of-sample prediction of the remaining vertices. This construction exploits the fact that the subsample provides an inferen"},"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":"2602.16041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-02-17T21:48:57Z","cross_cats_sorted":[],"title_canon_sha256":"264c1e300f55930245e4e5c33d29990cbd0082a763ea64c067dea1b04abc8487","abstract_canon_sha256":"3dc9c8451978fb785fc947bc6d5565285c88b57f6a40e9d191004605a9e6ed59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:23:26.283398Z","signature_b64":"aMtFRE5uDNghMYSSXWy4YJ4zeHTD0MYmjVP4gFBUgBiDlrnbz2Wc1UuzBwvVO2PYeIfzSzi//cfE6ihTxl4oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05e77cc1f48e0e7b6f20283dd7a272f7b15691b401b283e5ca70b23e3601284e","last_reissued_at":"2026-07-28T02:23:26.282481Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:23:26.282481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predictive Subsampling for Scalable Inference in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Arpan Kumar, Minh Tang, Srijan Sengupta","submitted_at":"2026-02-17T21:48:57Z","abstract_excerpt":"Current methods for statistical inference in networks often encounter substantial computational bottlenecks when applied to the massive network datasets that are increasingly common across scientific domains. In this paper, we develop \\textit{Predictive Subsampling} (\\texttt{PredSub}), a scalable framework for estimation and two-sample testing in networks. The central idea is to replace a full-sample estimation procedure by estimation on a random subsample, followed by out-of-sample prediction of the remaining vertices. This construction exploits the fact that the subsample provides an inferen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16041","kind":"arxiv","version":2},"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/2602.16041/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":"2602.16041","created_at":"2026-07-28T02:23:26.282908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.16041v2","created_at":"2026-07-28T02:23:26.282908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16041","created_at":"2026-07-28T02:23:26.282908+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXTXZQPURYHH","created_at":"2026-07-28T02:23:26.282908+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXTXZQPURYHHW3ZA","created_at":"2026-07-28T02:23:26.282908+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXTXZQPU","created_at":"2026-07-28T02:23:26.282908+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/AXTXZQPURYHHW3ZAFA65PITS66","json":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66.json","graph_json":"https://pith.science/api/pith-number/AXTXZQPURYHHW3ZAFA65PITS66/graph.json","events_json":"https://pith.science/api/pith-number/AXTXZQPURYHHW3ZAFA65PITS66/events.json","paper":"https://pith.science/paper/AXTXZQPU"},"agent_actions":{"view_html":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66","download_json":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66.json","view_paper":"https://pith.science/paper/AXTXZQPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.16041&json=true","fetch_graph":"https://pith.science/api/pith-number/AXTXZQPURYHHW3ZAFA65PITS66/graph.json","fetch_events":"https://pith.science/api/pith-number/AXTXZQPURYHHW3ZAFA65PITS66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/action/storage_attestation","attest_author":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/action/author_attestation","sign_citation":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/action/citation_signature","submit_replication":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/action/replication_record"}},"created_at":"2026-07-28T02:23:26.282908+00:00","updated_at":"2026-07-28T02:23:26.282908+00:00"}