{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GJBB63VF2HZYVWPX4RWSMB4LLK","short_pith_number":"pith:GJBB63VF","canonical_record":{"source":{"id":"1703.02998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-08T19:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"2c42ad3db179a457906da0104eaf7e50da77b7d0d1acef5f816fd2db9ba50e7c","abstract_canon_sha256":"c6bd4f1bc4e73641e541962dc89d34b90ab25432c1a304918f98974fee740aee"},"schema_version":"1.0"},"canonical_sha256":"32421f6ea5d1f38ad9f7e46d26078b5ab5d72b8eab0c26438aebe4cccc8d0f16","source":{"kind":"arxiv","id":"1703.02998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02998","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02998v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02998","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"GJBB63VF2HZY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJBB63VF2HZYVWPX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJBB63VF","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GJBB63VF2HZYVWPX4RWSMB4LLK","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-08T19:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"2c42ad3db179a457906da0104eaf7e50da77b7d0d1acef5f816fd2db9ba50e7c","abstract_canon_sha256":"c6bd4f1bc4e73641e541962dc89d34b90ab25432c1a304918f98974fee740aee"},"schema_version":"1.0"},"canonical_sha256":"32421f6ea5d1f38ad9f7e46d26078b5ab5d72b8eab0c26438aebe4cccc8d0f16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.095113Z","signature_b64":"qwJim2GF7xFXrYSOOQkkeQukmTy4dgoPjKJHpG45rulMjUnCjV4Y0SXUog76fylQ+MA+LX0f9mAjBiZoHGhBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32421f6ea5d1f38ad9f7e46d26078b5ab5d72b8eab0c26438aebe4cccc8d0f16","last_reissued_at":"2026-05-18T00:49:05.094607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.094607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02998","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-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOtJQ5avGTLFOprLbTp8nh2NbScuJaU8DitHB/3PJxjvoQwsUVUScA0gQ+yqKiHVud/5sdzN6rvMwipXKS+DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:29:24.287780Z"},"content_sha256":"3efc5ef7f0b655418918f8f0f555915c5fd9847397777883a341610741192ec0","schema_version":"1.0","event_id":"sha256:3efc5ef7f0b655418918f8f0f555915c5fd9847397777883a341610741192ec0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GJBB63VF2HZYVWPX4RWSMB4LLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on quickly sampling a sparse matrix with low rank expectation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jun Tao, Karl Rohe, Norbert Binkiewicz, Xintian Han","submitted_at":"2017-03-08T19:22:11Z","abstract_excerpt":"Given matrices $X,Y \\in R^{n \\times K}$ and $S \\in R^{K \\times K}$ with positive elements, this paper proposes an algorithm fastRG to sample a sparse matrix $A$ with low rank expectation $E(A) = XSY^T$ and independent Poisson elements. This allows for quickly sampling from a broad class of stochastic blockmodel graphs (degree-corrected, mixed membership, overlapping) all of which are specific parameterizations of the generalized random product graph model defined in Section 2.2. The basic idea of fastRG is to first sample the number of edges $m$ and then sample each edge. The key insight is th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02998","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-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCtdWluo2bYeNLEoqhNNwFL7wZ14aQLU8zzse5LwUtT38IqNQCB/ehq77mPLyIMm7NnNje2VC+b4aGim/D+RDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:29:24.288232Z"},"content_sha256":"aa87fbf13f71bf0ec75765ec0f709bc23092309d6870198fa96ba2ab4be66613","schema_version":"1.0","event_id":"sha256:aa87fbf13f71bf0ec75765ec0f709bc23092309d6870198fa96ba2ab4be66613"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJBB63VF2HZYVWPX4RWSMB4LLK/bundle.json","state_url":"https://pith.science/pith/GJBB63VF2HZYVWPX4RWSMB4LLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJBB63VF2HZYVWPX4RWSMB4LLK/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-19T11:29:24Z","links":{"resolver":"https://pith.science/pith/GJBB63VF2HZYVWPX4RWSMB4LLK","bundle":"https://pith.science/pith/GJBB63VF2HZYVWPX4RWSMB4LLK/bundle.json","state":"https://pith.science/pith/GJBB63VF2HZYVWPX4RWSMB4LLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJBB63VF2HZYVWPX4RWSMB4LLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GJBB63VF2HZYVWPX4RWSMB4LLK","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":"c6bd4f1bc4e73641e541962dc89d34b90ab25432c1a304918f98974fee740aee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-08T19:22:11Z","title_canon_sha256":"2c42ad3db179a457906da0104eaf7e50da77b7d0d1acef5f816fd2db9ba50e7c"},"schema_version":"1.0","source":{"id":"1703.02998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02998","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02998v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02998","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"GJBB63VF2HZY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJBB63VF2HZYVWPX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJBB63VF","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:aa87fbf13f71bf0ec75765ec0f709bc23092309d6870198fa96ba2ab4be66613","target":"graph","created_at":"2026-05-18T00:49:05Z","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":"Given matrices $X,Y \\in R^{n \\times K}$ and $S \\in R^{K \\times K}$ with positive elements, this paper proposes an algorithm fastRG to sample a sparse matrix $A$ with low rank expectation $E(A) = XSY^T$ and independent Poisson elements. This allows for quickly sampling from a broad class of stochastic blockmodel graphs (degree-corrected, mixed membership, overlapping) all of which are specific parameterizations of the generalized random product graph model defined in Section 2.2. The basic idea of fastRG is to first sample the number of edges $m$ and then sample each edge. The key insight is th","authors_text":"Jun Tao, Karl Rohe, Norbert Binkiewicz, Xintian Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-08T19:22:11Z","title":"A note on quickly sampling a sparse matrix with low rank expectation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02998","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:3efc5ef7f0b655418918f8f0f555915c5fd9847397777883a341610741192ec0","target":"record","created_at":"2026-05-18T00:49:05Z","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":"c6bd4f1bc4e73641e541962dc89d34b90ab25432c1a304918f98974fee740aee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-03-08T19:22:11Z","title_canon_sha256":"2c42ad3db179a457906da0104eaf7e50da77b7d0d1acef5f816fd2db9ba50e7c"},"schema_version":"1.0","source":{"id":"1703.02998","kind":"arxiv","version":1}},"canonical_sha256":"32421f6ea5d1f38ad9f7e46d26078b5ab5d72b8eab0c26438aebe4cccc8d0f16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32421f6ea5d1f38ad9f7e46d26078b5ab5d72b8eab0c26438aebe4cccc8d0f16","first_computed_at":"2026-05-18T00:49:05.094607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:05.094607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qwJim2GF7xFXrYSOOQkkeQukmTy4dgoPjKJHpG45rulMjUnCjV4Y0SXUog76fylQ+MA+LX0f9mAjBiZoHGhBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:05.095113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3efc5ef7f0b655418918f8f0f555915c5fd9847397777883a341610741192ec0","sha256:aa87fbf13f71bf0ec75765ec0f709bc23092309d6870198fa96ba2ab4be66613"],"state_sha256":"a3037b3e13b1b298c3e42657786165cec2f5d65f61ed6b66a9646b8d18d5af46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0eweKmO01bhsQJYNa/M00mn0TlPVQi4wUlCRqVVP/0H+yO8pr4CmZSW8JHlvM6YAbIXWG394uHECYvBdCTADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:29:24.290927Z","bundle_sha256":"d2bb6172ade6ba2a3c2bd5a27058b1f46def6c9a9992225c283c417f7c90b267"}}