{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PYNQ6P2QH72YNCORKVY6BKLK57","short_pith_number":"pith:PYNQ6P2Q","canonical_record":{"source":{"id":"1607.01718","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-06T17:35:55Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"5ffb6c517b20ec85d353b5b74972c0bcb983a729defa7d3e50212829906c0cca","abstract_canon_sha256":"badc08d10f3e6d44f2354411839d18711b284d3b16be190bc95c9b5c2fc330fa"},"schema_version":"1.0"},"canonical_sha256":"7e1b0f3f503ff58689d15571e0a96aefec1ceb98ff922eccee0053592c7ed2eb","source":{"kind":"arxiv","id":"1607.01718","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01718","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01718v4","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01718","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"PYNQ6P2QH72Y","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PYNQ6P2QH72YNCOR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PYNQ6P2Q","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PYNQ6P2QH72YNCORKVY6BKLK57","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01718","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-06T17:35:55Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"5ffb6c517b20ec85d353b5b74972c0bcb983a729defa7d3e50212829906c0cca","abstract_canon_sha256":"badc08d10f3e6d44f2354411839d18711b284d3b16be190bc95c9b5c2fc330fa"},"schema_version":"1.0"},"canonical_sha256":"7e1b0f3f503ff58689d15571e0a96aefec1ceb98ff922eccee0053592c7ed2eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:04.251291Z","signature_b64":"oHUzyJzyKroLAkgGVi9bk26TsaYTfwYrKenv2uJ6ciLJ5ZGS0CZmY56sEjnp17iugJ5XKMHO1r/1gj4qc0hBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e1b0f3f503ff58689d15571e0a96aefec1ceb98ff922eccee0053592c7ed2eb","last_reissued_at":"2026-05-18T00:44:04.250870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:04.250870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01718","source_version":4,"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-18T00:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ng/7DIOunw1/e4JCQbvZ83j0A4IiaVmX9HONjBCvxnjPy97AZcDKXv/EHWp2aC80EFFwfLOJuVeLHUyfyFSbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:52:59.210051Z"},"content_sha256":"af5d217924cfc26b3eec7ccbac1057bf8c6e55cf3d184dccd9f42bd8d85d00d3","schema_version":"1.0","event_id":"sha256:af5d217924cfc26b3eec7ccbac1057bf8c6e55cf3d184dccd9f42bd8d85d00d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PYNQ6P2QH72YNCORKVY6BKLK57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphons, mergeons, and so on!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Justin Eldridge, Mikhail Belkin, Yusu Wang","submitted_at":"2016-07-06T17:35:55Z","abstract_excerpt":"In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons are a far richer class of graph models than stochastic blockmodels, the primary setting for recent progress in the statistical theory of graph clustering. We define what it means for an algorithm to produce the \"correct\" clustering, give sufficient conditions in which a method is statistically consistent, and provide an explicit algorithm satisfying these prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01718","kind":"arxiv","version":4},"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-18T00:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9TPmSKaArGacKokWyvpj2txDnvRE89HVz5IbLuQehYrxO5DRpwLMeMXOsrP7ooha3N78YP6sjESroQOTuVmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:52:59.210752Z"},"content_sha256":"ba5708b846f5e36dd011cc7c07bdb5ae1e56f56371bfb2cf7c3c145e313ebfd3","schema_version":"1.0","event_id":"sha256:ba5708b846f5e36dd011cc7c07bdb5ae1e56f56371bfb2cf7c3c145e313ebfd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYNQ6P2QH72YNCORKVY6BKLK57/bundle.json","state_url":"https://pith.science/pith/PYNQ6P2QH72YNCORKVY6BKLK57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYNQ6P2QH72YNCORKVY6BKLK57/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-27T01:52:59Z","links":{"resolver":"https://pith.science/pith/PYNQ6P2QH72YNCORKVY6BKLK57","bundle":"https://pith.science/pith/PYNQ6P2QH72YNCORKVY6BKLK57/bundle.json","state":"https://pith.science/pith/PYNQ6P2QH72YNCORKVY6BKLK57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYNQ6P2QH72YNCORKVY6BKLK57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PYNQ6P2QH72YNCORKVY6BKLK57","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":"badc08d10f3e6d44f2354411839d18711b284d3b16be190bc95c9b5c2fc330fa","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-06T17:35:55Z","title_canon_sha256":"5ffb6c517b20ec85d353b5b74972c0bcb983a729defa7d3e50212829906c0cca"},"schema_version":"1.0","source":{"id":"1607.01718","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01718","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01718v4","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01718","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"PYNQ6P2QH72Y","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PYNQ6P2QH72YNCOR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PYNQ6P2Q","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:ba5708b846f5e36dd011cc7c07bdb5ae1e56f56371bfb2cf7c3c145e313ebfd3","target":"graph","created_at":"2026-05-18T00:44:04Z","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":"In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons are a far richer class of graph models than stochastic blockmodels, the primary setting for recent progress in the statistical theory of graph clustering. We define what it means for an algorithm to produce the \"correct\" clustering, give sufficient conditions in which a method is statistically consistent, and provide an explicit algorithm satisfying these prop","authors_text":"Justin Eldridge, Mikhail Belkin, Yusu Wang","cross_cats":["cs.DS","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-06T17:35:55Z","title":"Graphons, mergeons, and so on!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01718","kind":"arxiv","version":4},"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:af5d217924cfc26b3eec7ccbac1057bf8c6e55cf3d184dccd9f42bd8d85d00d3","target":"record","created_at":"2026-05-18T00:44:04Z","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":"badc08d10f3e6d44f2354411839d18711b284d3b16be190bc95c9b5c2fc330fa","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-06T17:35:55Z","title_canon_sha256":"5ffb6c517b20ec85d353b5b74972c0bcb983a729defa7d3e50212829906c0cca"},"schema_version":"1.0","source":{"id":"1607.01718","kind":"arxiv","version":4}},"canonical_sha256":"7e1b0f3f503ff58689d15571e0a96aefec1ceb98ff922eccee0053592c7ed2eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e1b0f3f503ff58689d15571e0a96aefec1ceb98ff922eccee0053592c7ed2eb","first_computed_at":"2026-05-18T00:44:04.250870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:04.250870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oHUzyJzyKroLAkgGVi9bk26TsaYTfwYrKenv2uJ6ciLJ5ZGS0CZmY56sEjnp17iugJ5XKMHO1r/1gj4qc0hBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:04.251291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01718","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af5d217924cfc26b3eec7ccbac1057bf8c6e55cf3d184dccd9f42bd8d85d00d3","sha256:ba5708b846f5e36dd011cc7c07bdb5ae1e56f56371bfb2cf7c3c145e313ebfd3"],"state_sha256":"0d854e3739e6a84bba640fc85e47168e395b547096f975ed5e506985587e7509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2y9TixtQ/SA1MHxMj7GIqBQUTm4woy+mYwrl1Qj0sY+V73nIcBf7b/xxGQXh+eRUSr7U2DluAtFI//0pyZ6uDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:52:59.214431Z","bundle_sha256":"278ac65ad5f8a2799d560594caabb06e0715c3b15f5a7a0e4d6ca2a66035dfdd"}}