{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VIFXLEVPU4NRGK2FPOHVCREIU3","short_pith_number":"pith:VIFXLEVP","canonical_record":{"source":{"id":"1507.06352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-22T22:35:54Z","cross_cats_sorted":["cs.SI","stat.TH"],"title_canon_sha256":"b428d0afa6f7281284b5b36e58ed4b3f8bea20871401cf0e9d61cc6ed2b289ef","abstract_canon_sha256":"b8be95d8b947716c652d444e88f65bd5619a57cd495b269a668ed1f1259db07f"},"schema_version":"1.0"},"canonical_sha256":"aa0b7592afa71b132b457b8f514488a6e2f90ce3c9c5f86b6875f08cee22aebc","source":{"kind":"arxiv","id":"1507.06352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06352","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06352v1","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06352","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"VIFXLEVPU4NR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VIFXLEVPU4NRGK2F","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VIFXLEVP","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VIFXLEVPU4NRGK2FPOHVCREIU3","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-22T22:35:54Z","cross_cats_sorted":["cs.SI","stat.TH"],"title_canon_sha256":"b428d0afa6f7281284b5b36e58ed4b3f8bea20871401cf0e9d61cc6ed2b289ef","abstract_canon_sha256":"b8be95d8b947716c652d444e88f65bd5619a57cd495b269a668ed1f1259db07f"},"schema_version":"1.0"},"canonical_sha256":"aa0b7592afa71b132b457b8f514488a6e2f90ce3c9c5f86b6875f08cee22aebc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:25.185528Z","signature_b64":"Jq2I3T8UqyuLLSPS7c71+iahdNsKNufHnZE8xXYjnNEJ500rf9cSJsTJAXBbjJWtkK/s0v+LSxTT/1vMzqbeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0b7592afa71b132b457b8f514488a6e2f90ce3c9c5f86b6875f08cee22aebc","last_reissued_at":"2026-05-18T01:36:25.185032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:25.185032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06352","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-18T01:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0QbaYO79S3+px/UAboNHfOKjANv/jbJ7f4gRAksmSKjfYusOCTuVUCuAO0pVkRRS83/B0hkXif4PkJ7B2QVSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:50:45.399614Z"},"content_sha256":"fd1d80488be9f839badd2c1245a600407e3daa966366aaaea310383b6189ad0a","schema_version":"1.0","event_id":"sha256:fd1d80488be9f839badd2c1245a600407e3daa966366aaaea310383b6189ad0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VIFXLEVPU4NRGK2FPOHVCREIU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Co-clustering of Nonsmooth Graphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.TH"],"primary_cat":"math.ST","authors_text":"David Choi","submitted_at":"2015-07-22T22:35:54Z","abstract_excerpt":"Performance bounds are given for exploratory co-clustering/ blockmodeling of bipartite graph data, where we assume the rows and columns of the data matrix are samples from an arbitrary population. This is equivalent to assuming that the data is generated from a nonsmooth graphon. It is shown that co-clusters found by any method can be extended to the row and column populations, or equivalently that the estimated blockmodel approximates a blocked version of the generative graphon, with estimation error bounded by $O_P(n^{-1/2})$. Analogous performance bounds are also given for degree-corrected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06352","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":""},"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:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUWoftqFz+RkH7FVhOLn5qSVKnFGesVEHJ9J6usrKIzItrNWqMA0u76qpzZ6ETj+dFl8IgqejYn0gIPdDcc6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:50:45.399955Z"},"content_sha256":"d36e4e00051d8e421df00abe6e2ab1aef3556cf11646c822f1638a644fd82415","schema_version":"1.0","event_id":"sha256:d36e4e00051d8e421df00abe6e2ab1aef3556cf11646c822f1638a644fd82415"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIFXLEVPU4NRGK2FPOHVCREIU3/bundle.json","state_url":"https://pith.science/pith/VIFXLEVPU4NRGK2FPOHVCREIU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIFXLEVPU4NRGK2FPOHVCREIU3/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-20T09:50:45Z","links":{"resolver":"https://pith.science/pith/VIFXLEVPU4NRGK2FPOHVCREIU3","bundle":"https://pith.science/pith/VIFXLEVPU4NRGK2FPOHVCREIU3/bundle.json","state":"https://pith.science/pith/VIFXLEVPU4NRGK2FPOHVCREIU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIFXLEVPU4NRGK2FPOHVCREIU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VIFXLEVPU4NRGK2FPOHVCREIU3","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":"b8be95d8b947716c652d444e88f65bd5619a57cd495b269a668ed1f1259db07f","cross_cats_sorted":["cs.SI","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-22T22:35:54Z","title_canon_sha256":"b428d0afa6f7281284b5b36e58ed4b3f8bea20871401cf0e9d61cc6ed2b289ef"},"schema_version":"1.0","source":{"id":"1507.06352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06352","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06352v1","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06352","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"VIFXLEVPU4NR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VIFXLEVPU4NRGK2F","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VIFXLEVP","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:d36e4e00051d8e421df00abe6e2ab1aef3556cf11646c822f1638a644fd82415","target":"graph","created_at":"2026-05-18T01:36:25Z","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":"Performance bounds are given for exploratory co-clustering/ blockmodeling of bipartite graph data, where we assume the rows and columns of the data matrix are samples from an arbitrary population. This is equivalent to assuming that the data is generated from a nonsmooth graphon. It is shown that co-clusters found by any method can be extended to the row and column populations, or equivalently that the estimated blockmodel approximates a blocked version of the generative graphon, with estimation error bounded by $O_P(n^{-1/2})$. Analogous performance bounds are also given for degree-corrected ","authors_text":"David Choi","cross_cats":["cs.SI","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-22T22:35:54Z","title":"Co-clustering of Nonsmooth Graphons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06352","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:fd1d80488be9f839badd2c1245a600407e3daa966366aaaea310383b6189ad0a","target":"record","created_at":"2026-05-18T01:36:25Z","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":"b8be95d8b947716c652d444e88f65bd5619a57cd495b269a668ed1f1259db07f","cross_cats_sorted":["cs.SI","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-22T22:35:54Z","title_canon_sha256":"b428d0afa6f7281284b5b36e58ed4b3f8bea20871401cf0e9d61cc6ed2b289ef"},"schema_version":"1.0","source":{"id":"1507.06352","kind":"arxiv","version":1}},"canonical_sha256":"aa0b7592afa71b132b457b8f514488a6e2f90ce3c9c5f86b6875f08cee22aebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa0b7592afa71b132b457b8f514488a6e2f90ce3c9c5f86b6875f08cee22aebc","first_computed_at":"2026-05-18T01:36:25.185032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:25.185032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jq2I3T8UqyuLLSPS7c71+iahdNsKNufHnZE8xXYjnNEJ500rf9cSJsTJAXBbjJWtkK/s0v+LSxTT/1vMzqbeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:25.185528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd1d80488be9f839badd2c1245a600407e3daa966366aaaea310383b6189ad0a","sha256:d36e4e00051d8e421df00abe6e2ab1aef3556cf11646c822f1638a644fd82415"],"state_sha256":"ef3ebc66e030455ad93946695d47adf9047e6705b9f49cd9657d16791b63af1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOIKJAQ7B+9Lldawwz20iy/+0hQ8GRjZit9B8PXGbZIuILR1OYJI20UQXrhzzVDE/NqoJMajO4/JRa1TAX2iBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:50:45.401916Z","bundle_sha256":"48b974a51392d2fcd991bcc448877f432e055cb2ccb56127a566901d96e763ad"}}