{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QVMXAIZIW24UEM4HM3BCBJOPFX","short_pith_number":"pith:QVMXAIZI","canonical_record":{"source":{"id":"1705.06772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-18T19:15:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"34c2c450b651a5819c130c1d136a55f9403796e774a907a3d87e143d53346d69","abstract_canon_sha256":"35560a214b252061a714eb36d776ab9be8e1f9f425e35aec5fb35293f0e38c3a"},"schema_version":"1.0"},"canonical_sha256":"8559702328b6b942338766c220a5cf2dea06563a736d92252be8fe81f0fc8523","source":{"kind":"arxiv","id":"1705.06772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06772","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06772v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06772","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"QVMXAIZIW24U","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QVMXAIZIW24UEM4H","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QVMXAIZI","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QVMXAIZIW24UEM4HM3BCBJOPFX","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-18T19:15:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"34c2c450b651a5819c130c1d136a55f9403796e774a907a3d87e143d53346d69","abstract_canon_sha256":"35560a214b252061a714eb36d776ab9be8e1f9f425e35aec5fb35293f0e38c3a"},"schema_version":"1.0"},"canonical_sha256":"8559702328b6b942338766c220a5cf2dea06563a736d92252be8fe81f0fc8523","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.329913Z","signature_b64":"mBZJ7gX79WASZwmodcCoOZlMnzgNj+B71XcTZWu8nu6rkc/yovefpoIBZpu7zx+RI7Jlz7xbu6sNjBFTgXxrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8559702328b6b942338766c220a5cf2dea06563a736d92252be8fe81f0fc8523","last_reissued_at":"2026-05-18T00:44:11.329360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.329360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06772","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpBBsxQWBCsZmWtwsnAmPviQdElAXGX+bQXa+ahfmmS60I1rdCjRAxWPwbAI3SSnYhR9m7uzOGWbP3/pjR9eAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:39:12.278485Z"},"content_sha256":"238d812c98e242884aaee420f775cef07cae8b1abf0fb1b1b4150c6651ef6a3a","schema_version":"1.0","event_id":"sha256:238d812c98e242884aaee420f775cef07cae8b1abf0fb1b1b4150c6651ef6a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QVMXAIZIW24UEM4HM3BCBJOPFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized linear models with low rank effects for network data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Elizaveta Levina, Ji Zhu, Yun-Jhong Wu","submitted_at":"2017-05-18T19:15:41Z","abstract_excerpt":"Networks are a useful representation for data on connections between units of interests, but the observed connections are often noisy and/or include missing values. One common approach to network analysis is to treat the network as a realization from a random graph model, and estimate the underlying edge probability matrix, which is sometimes referred to as network denoising. Here we propose a generalized linear model with low rank effects to model network edges. This model can be applied to various types of networks, including directed and undirected, binary and weighted, and it can naturally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06772","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WEY4Zy3mhZHoo9u6RFIsC2kSV680PCcnq3QsxWyT8T2TuV/325ERfojOykz5Lm9mjvwR8DGJvmm7DpQG8yEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:39:12.278839Z"},"content_sha256":"fb51002e07bd808d1c42d162c2c26448e19853f9ee4d6e7f25e5b3e508e79dc0","schema_version":"1.0","event_id":"sha256:fb51002e07bd808d1c42d162c2c26448e19853f9ee4d6e7f25e5b3e508e79dc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVMXAIZIW24UEM4HM3BCBJOPFX/bundle.json","state_url":"https://pith.science/pith/QVMXAIZIW24UEM4HM3BCBJOPFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVMXAIZIW24UEM4HM3BCBJOPFX/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-06-05T01:39:12Z","links":{"resolver":"https://pith.science/pith/QVMXAIZIW24UEM4HM3BCBJOPFX","bundle":"https://pith.science/pith/QVMXAIZIW24UEM4HM3BCBJOPFX/bundle.json","state":"https://pith.science/pith/QVMXAIZIW24UEM4HM3BCBJOPFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVMXAIZIW24UEM4HM3BCBJOPFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QVMXAIZIW24UEM4HM3BCBJOPFX","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":"35560a214b252061a714eb36d776ab9be8e1f9f425e35aec5fb35293f0e38c3a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-18T19:15:41Z","title_canon_sha256":"34c2c450b651a5819c130c1d136a55f9403796e774a907a3d87e143d53346d69"},"schema_version":"1.0","source":{"id":"1705.06772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06772","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06772v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06772","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"QVMXAIZIW24U","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QVMXAIZIW24UEM4H","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QVMXAIZI","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:fb51002e07bd808d1c42d162c2c26448e19853f9ee4d6e7f25e5b3e508e79dc0","target":"graph","created_at":"2026-05-18T00:44:11Z","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":"Networks are a useful representation for data on connections between units of interests, but the observed connections are often noisy and/or include missing values. One common approach to network analysis is to treat the network as a realization from a random graph model, and estimate the underlying edge probability matrix, which is sometimes referred to as network denoising. Here we propose a generalized linear model with low rank effects to model network edges. This model can be applied to various types of networks, including directed and undirected, binary and weighted, and it can naturally","authors_text":"Elizaveta Levina, Ji Zhu, Yun-Jhong Wu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-18T19:15:41Z","title":"Generalized linear models with low rank effects for network data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06772","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:238d812c98e242884aaee420f775cef07cae8b1abf0fb1b1b4150c6651ef6a3a","target":"record","created_at":"2026-05-18T00:44:11Z","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":"35560a214b252061a714eb36d776ab9be8e1f9f425e35aec5fb35293f0e38c3a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-18T19:15:41Z","title_canon_sha256":"34c2c450b651a5819c130c1d136a55f9403796e774a907a3d87e143d53346d69"},"schema_version":"1.0","source":{"id":"1705.06772","kind":"arxiv","version":1}},"canonical_sha256":"8559702328b6b942338766c220a5cf2dea06563a736d92252be8fe81f0fc8523","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8559702328b6b942338766c220a5cf2dea06563a736d92252be8fe81f0fc8523","first_computed_at":"2026-05-18T00:44:11.329360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:11.329360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mBZJ7gX79WASZwmodcCoOZlMnzgNj+B71XcTZWu8nu6rkc/yovefpoIBZpu7zx+RI7Jlz7xbu6sNjBFTgXxrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:11.329913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:238d812c98e242884aaee420f775cef07cae8b1abf0fb1b1b4150c6651ef6a3a","sha256:fb51002e07bd808d1c42d162c2c26448e19853f9ee4d6e7f25e5b3e508e79dc0"],"state_sha256":"f32af743fac5492e135de907125fd7b49bfbbdc068262fe92f65d453779c1dd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luM57NIMpB1DEFAA8AlN/QajAEAKMFRfFfvJvT3lmu8c0hMja8dbuI4vxDv8qrwcmNqn4gudezcvM/JP+jWNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:39:12.280952Z","bundle_sha256":"c54b6e2abfaf800111b1e31275bceefcddffe31f00ca790989f062e6a7c6c7ce"}}