{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AXTXZQPURYHHW3ZAFA65PITS66","short_pith_number":"pith:AXTXZQPU","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"},"canonical_sha256":"05e77cc1f48e0e7b6f20283dd7a272f7b15691b401b283e5ca70b23e3601284e","source":{"kind":"arxiv","id":"2602.16041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.16041","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"2602.16041v2","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16041","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"AXTXZQPURYHH","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"pith_short_16","alias_value":"AXTXZQPURYHHW3ZA","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"pith_short_8","alias_value":"AXTXZQPU","created_at":"2026-07-28T02:23:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AXTXZQPURYHHW3ZAFA65PITS66","target":"record","payload":{"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"},"canonical_sha256":"05e77cc1f48e0e7b6f20283dd7a272f7b15691b401b283e5ca70b23e3601284e","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"},"source_kind":"arxiv","source_id":"2602.16041","source_version":2,"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-07-28T02:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jty9xn8zh/rUe1F2vg0c/DtpVNqh3ba8rv90o7b8aGX7uhkHGwS7pBuyQNE9uaNEYOv4CHQ9RqbUCy5tI38HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:42:37.652394Z"},"content_sha256":"c0ca5c975952dcad74ddaff7fc52bd61c5a5076c28f4abdd507c14f88f6a73dd","schema_version":"1.0","event_id":"sha256:c0ca5c975952dcad74ddaff7fc52bd61c5a5076c28f4abdd507c14f88f6a73dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AXTXZQPURYHHW3ZAFA65PITS66","target":"graph","payload":{"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"},"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-07-28T02:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/98KAvT3QRRqQMeiOG78YmxoNrTUax0pvBJmdbsMj6Hu4ujh2a3T59jDplBBn2RmBZ/2RxcysImF2DCxrG8sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:42:37.653182Z"},"content_sha256":"97d0e79ebc7e1a3560ba155f65a6ca822c33efd9878534fb17ae73510e9999a9","schema_version":"1.0","event_id":"sha256:97d0e79ebc7e1a3560ba155f65a6ca822c33efd9878534fb17ae73510e9999a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/bundle.json","state_url":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXTXZQPURYHHW3ZAFA65PITS66/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-08-11T12:42:37Z","links":{"resolver":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66","bundle":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/bundle.json","state":"https://pith.science/pith/AXTXZQPURYHHW3ZAFA65PITS66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXTXZQPURYHHW3ZAFA65PITS66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AXTXZQPURYHHW3ZAFA65PITS66","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":"3dc9c8451978fb785fc947bc6d5565285c88b57f6a40e9d191004605a9e6ed59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-02-17T21:48:57Z","title_canon_sha256":"264c1e300f55930245e4e5c33d29990cbd0082a763ea64c067dea1b04abc8487"},"schema_version":"1.0","source":{"id":"2602.16041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.16041","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"2602.16041v2","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16041","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"AXTXZQPURYHH","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"pith_short_16","alias_value":"AXTXZQPURYHHW3ZA","created_at":"2026-07-28T02:23:26Z"},{"alias_kind":"pith_short_8","alias_value":"AXTXZQPU","created_at":"2026-07-28T02:23:26Z"}],"graph_snapshots":[{"event_id":"sha256:97d0e79ebc7e1a3560ba155f65a6ca822c33efd9878534fb17ae73510e9999a9","target":"graph","created_at":"2026-07-28T02:23:26Z","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/2602.16041/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arpan Kumar, Minh Tang, Srijan Sengupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16041","kind":"arxiv","version":2},"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:c0ca5c975952dcad74ddaff7fc52bd61c5a5076c28f4abdd507c14f88f6a73dd","target":"record","created_at":"2026-07-28T02:23:26Z","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":"3dc9c8451978fb785fc947bc6d5565285c88b57f6a40e9d191004605a9e6ed59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-02-17T21:48:57Z","title_canon_sha256":"264c1e300f55930245e4e5c33d29990cbd0082a763ea64c067dea1b04abc8487"},"schema_version":"1.0","source":{"id":"2602.16041","kind":"arxiv","version":2}},"canonical_sha256":"05e77cc1f48e0e7b6f20283dd7a272f7b15691b401b283e5ca70b23e3601284e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05e77cc1f48e0e7b6f20283dd7a272f7b15691b401b283e5ca70b23e3601284e","first_computed_at":"2026-07-28T02:23:26.282481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T02:23:26.282481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aMtFRE5uDNghMYSSXWy4YJ4zeHTD0MYmjVP4gFBUgBiDlrnbz2Wc1UuzBwvVO2PYeIfzSzi//cfE6ihTxl4oDA==","signature_status":"signed_v1","signed_at":"2026-07-28T02:23:26.283398Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.16041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0ca5c975952dcad74ddaff7fc52bd61c5a5076c28f4abdd507c14f88f6a73dd","sha256:97d0e79ebc7e1a3560ba155f65a6ca822c33efd9878534fb17ae73510e9999a9"],"state_sha256":"0bb383c234974763b4915155a41bb52184c57a9439b9ef221f1284e34c9c5005"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4D2uYyCFcDBJcdUwrBWUyAFusuNeC6EESD8P2lPczlE1y2isiWSBErBKasBo9PiHPXxViDAgZBfQwxR7LaQrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T12:42:37.657917Z","bundle_sha256":"400486b5ea479ed14fbbf86b967ef1f3d3e32e720858adc28c3e10a4e0ae4808"}}