{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7VGNBRXRQ3YNII4QF6CXKKNHEW","short_pith_number":"pith:7VGNBRXR","canonical_record":{"source":{"id":"1508.06675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-26T22:17:32Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"171de7478e698274727299187af3948169142b64e3b28379dc019a91ad5dcc73","abstract_canon_sha256":"ab81f4443866b033a180908626aa8fdcdf607293d190c7114abba73172fc2477"},"schema_version":"1.0"},"canonical_sha256":"fd4cd0c6f186f0d423902f857529a725a661bd0d2695f028817346f741aec1f2","source":{"kind":"arxiv","id":"1508.06675","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06675","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06675v2","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06675","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"pith_short_12","alias_value":"7VGNBRXRQ3YN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7VGNBRXRQ3YNII4Q","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7VGNBRXR","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7VGNBRXRQ3YNII4QF6CXKKNHEW","target":"record","payload":{"canonical_record":{"source":{"id":"1508.06675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-26T22:17:32Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"171de7478e698274727299187af3948169142b64e3b28379dc019a91ad5dcc73","abstract_canon_sha256":"ab81f4443866b033a180908626aa8fdcdf607293d190c7114abba73172fc2477"},"schema_version":"1.0"},"canonical_sha256":"fd4cd0c6f186f0d423902f857529a725a661bd0d2695f028817346f741aec1f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:03.502212Z","signature_b64":"WLptk22NUOsNaUppmPX8D8VKaiqvtx9y8h+WUncT9/J50JWsrOe/4LYxGpg/iL+X+pLzum55HPKRFaINVhFfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd4cd0c6f186f0d423902f857529a725a661bd0d2695f028817346f741aec1f2","last_reissued_at":"2026-05-18T01:20:03.501539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:03.501539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.06675","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-05-18T01:20:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DigZXZPd0Y5fVlsIBbB3Gewdl0XYhp4sdGqbPjGmGV+wzR7JvmXrXw/ksx223YijErhUO7zmFYIYCFN4+4tNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:20:08.190622Z"},"content_sha256":"0d5e14245c4c0396ef81ac598c1caefea14f4859f97afdb1b7e74e788a53514d","schema_version":"1.0","event_id":"sha256:0d5e14245c4c0396ef81ac598c1caefea14f4859f97afdb1b7e74e788a53514d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7VGNBRXRQ3YNII4QF6CXKKNHEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consistent nonparametric estimation for heavy-tailed sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Christian Borgs, Henry Cohn, Jennifer T. Chayes, Shirshendu Ganguly","submitted_at":"2015-08-26T22:17:32Z","abstract_excerpt":"We study graphons as a non-parametric generalization of stochastic block models, and show how to obtain compactly represented estimators for sparse networks in this framework. Our algorithms and analysis go beyond previous work in several ways. First, we relax the usual boundedness assumption for the generating graphon and instead treat arbitrary integrable graphons, so that we can handle networks with long tails in their degree distributions. Second, again motivated by real-world applications, we relax the usual assumption that the graphon is defined on the unit interval, to allow latent posi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06675","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":""},"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-18T01:20:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+0+ml59MhCckHZ9KtkTJhGT02IW08o/XleUD6pOFR+6g6Bv0AUd9I7WUPKQR/LLNZGyH9Hr1rWoSpniIbKvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:20:08.191290Z"},"content_sha256":"809c13908a4eac9202d50e0f5c76d858f1381f95238b5032cc82a0161171a131","schema_version":"1.0","event_id":"sha256:809c13908a4eac9202d50e0f5c76d858f1381f95238b5032cc82a0161171a131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VGNBRXRQ3YNII4QF6CXKKNHEW/bundle.json","state_url":"https://pith.science/pith/7VGNBRXRQ3YNII4QF6CXKKNHEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VGNBRXRQ3YNII4QF6CXKKNHEW/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-05-26T00:20:08Z","links":{"resolver":"https://pith.science/pith/7VGNBRXRQ3YNII4QF6CXKKNHEW","bundle":"https://pith.science/pith/7VGNBRXRQ3YNII4QF6CXKKNHEW/bundle.json","state":"https://pith.science/pith/7VGNBRXRQ3YNII4QF6CXKKNHEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VGNBRXRQ3YNII4QF6CXKKNHEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7VGNBRXRQ3YNII4QF6CXKKNHEW","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":"ab81f4443866b033a180908626aa8fdcdf607293d190c7114abba73172fc2477","cross_cats_sorted":["math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-26T22:17:32Z","title_canon_sha256":"171de7478e698274727299187af3948169142b64e3b28379dc019a91ad5dcc73"},"schema_version":"1.0","source":{"id":"1508.06675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06675","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06675v2","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06675","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"pith_short_12","alias_value":"7VGNBRXRQ3YN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7VGNBRXRQ3YNII4Q","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7VGNBRXR","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:809c13908a4eac9202d50e0f5c76d858f1381f95238b5032cc82a0161171a131","target":"graph","created_at":"2026-05-18T01:20:03Z","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"},"paper":{"abstract_excerpt":"We study graphons as a non-parametric generalization of stochastic block models, and show how to obtain compactly represented estimators for sparse networks in this framework. Our algorithms and analysis go beyond previous work in several ways. First, we relax the usual boundedness assumption for the generating graphon and instead treat arbitrary integrable graphons, so that we can handle networks with long tails in their degree distributions. Second, again motivated by real-world applications, we relax the usual assumption that the graphon is defined on the unit interval, to allow latent posi","authors_text":"Christian Borgs, Henry Cohn, Jennifer T. Chayes, Shirshendu Ganguly","cross_cats":["math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-26T22:17:32Z","title":"Consistent nonparametric estimation for heavy-tailed sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06675","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:0d5e14245c4c0396ef81ac598c1caefea14f4859f97afdb1b7e74e788a53514d","target":"record","created_at":"2026-05-18T01:20:03Z","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":"ab81f4443866b033a180908626aa8fdcdf607293d190c7114abba73172fc2477","cross_cats_sorted":["math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-26T22:17:32Z","title_canon_sha256":"171de7478e698274727299187af3948169142b64e3b28379dc019a91ad5dcc73"},"schema_version":"1.0","source":{"id":"1508.06675","kind":"arxiv","version":2}},"canonical_sha256":"fd4cd0c6f186f0d423902f857529a725a661bd0d2695f028817346f741aec1f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd4cd0c6f186f0d423902f857529a725a661bd0d2695f028817346f741aec1f2","first_computed_at":"2026-05-18T01:20:03.501539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:03.501539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WLptk22NUOsNaUppmPX8D8VKaiqvtx9y8h+WUncT9/J50JWsrOe/4LYxGpg/iL+X+pLzum55HPKRFaINVhFfCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:03.502212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d5e14245c4c0396ef81ac598c1caefea14f4859f97afdb1b7e74e788a53514d","sha256:809c13908a4eac9202d50e0f5c76d858f1381f95238b5032cc82a0161171a131"],"state_sha256":"e60b765794ef74b75c6d2d423388038f4a4bf554dfcfb9de97cca5c2e6a548b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGHA/GBYGtutOrVjCApPdLVD0q1qMl9PEHVuAX26abwRdewf+p9/KKPPH4JWb1wlvsXw1tJzzSCU/3yPGEVKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:20:08.195128Z","bundle_sha256":"81e28d474e72114bf7256c4e5c582fb795a70c595752bf679eb47ad4d6ba1561"}}