{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2NIZAUJEVJPCMF7QF6RP7TJEWF","short_pith_number":"pith:2NIZAUJE","canonical_record":{"source":{"id":"2006.14217","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-06-25T07:27:47Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"0d2346f7e3446ca352358bfeb4da4826f1528ff59a5e1feecb7afdb239b3dbb4","abstract_canon_sha256":"5bf161cd0ca58e6bbe159367f1d268e89d4c16425bcc223fc247afdf74c65ac2"},"schema_version":"1.0"},"canonical_sha256":"d351905124aa5e2617f02fa2ffcd24b179aa040f1d0e52ec046850c4f9fa6f04","source":{"kind":"arxiv","id":"2006.14217","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14217","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14217v4","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14217","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"2NIZAUJEVJPC","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"pith_short_16","alias_value":"2NIZAUJEVJPCMF7Q","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"pith_short_8","alias_value":"2NIZAUJE","created_at":"2026-07-05T04:26:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2NIZAUJEVJPCMF7QF6RP7TJEWF","target":"record","payload":{"canonical_record":{"source":{"id":"2006.14217","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-06-25T07:27:47Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"0d2346f7e3446ca352358bfeb4da4826f1528ff59a5e1feecb7afdb239b3dbb4","abstract_canon_sha256":"5bf161cd0ca58e6bbe159367f1d268e89d4c16425bcc223fc247afdf74c65ac2"},"schema_version":"1.0"},"canonical_sha256":"d351905124aa5e2617f02fa2ffcd24b179aa040f1d0e52ec046850c4f9fa6f04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:59.142885Z","signature_b64":"m9SOnTHNTrX26d0KMERRz1FnyEBeQxiRJknCbpPOqer95aQqCjET+i0VZMyOwmrqaGVb4BztGRH/6x1PkaBHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d351905124aa5e2617f02fa2ffcd24b179aa040f1d0e52ec046850c4f9fa6f04","last_reissued_at":"2026-07-05T04:26:59.142179Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:59.142179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.14217","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-07-05T04:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esI0JealPPr1NrkAj8EjbNrc82NOFJc6odGK1a1XqXIMTqPXpnXxUo3hJld2HhH1ev8FEdklr6nKNeqXB8XLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:34:50.532018Z"},"content_sha256":"ad4cd7db731197de84c60caa9cb032774fe630aeed2606b28d43110eb7dbb0f2","schema_version":"1.0","event_id":"sha256:ad4cd7db731197de84c60caa9cb032774fe630aeed2606b28d43110eb7dbb0f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2NIZAUJEVJPCMF7QF6RP7TJEWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stratified stochastic variational inference for high-dimensional network factor model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Emanuele Aliverti, Massimiliano Russo","submitted_at":"2020-06-25T07:27:47Z","abstract_excerpt":"There has been considerable recent interest in Bayesian modeling of high-dimensional networks via latent space approaches. When the number of nodes increases, estimation based on Markov Chain Monte Carlo can be extremely slow and show poor mixing, thereby motivating research on alternative algorithms that scale well in high-dimensional settings. In this article, we focus on the latent factor model, a widely used approach for latent space modeling of network data. We develop scalable algorithms to conduct approximate Bayesian inference via stochastic optimization. Leveraging sparse representati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14217","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.14217/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/zyIQDTpGuV1RI965r4PN5lr8kxVJyJYQ/0+DymTj5ubTerycZw/rVBVuTvf/vhoGmpl42DH5JeG3Jbp/T3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:34:50.532549Z"},"content_sha256":"0ab98d6d11480201d5d0e26e59b8997ed43fc88be3659d8778b0f8aaf1a4c14d","schema_version":"1.0","event_id":"sha256:0ab98d6d11480201d5d0e26e59b8997ed43fc88be3659d8778b0f8aaf1a4c14d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NIZAUJEVJPCMF7QF6RP7TJEWF/bundle.json","state_url":"https://pith.science/pith/2NIZAUJEVJPCMF7QF6RP7TJEWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NIZAUJEVJPCMF7QF6RP7TJEWF/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-08-18T18:34:50Z","links":{"resolver":"https://pith.science/pith/2NIZAUJEVJPCMF7QF6RP7TJEWF","bundle":"https://pith.science/pith/2NIZAUJEVJPCMF7QF6RP7TJEWF/bundle.json","state":"https://pith.science/pith/2NIZAUJEVJPCMF7QF6RP7TJEWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NIZAUJEVJPCMF7QF6RP7TJEWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2NIZAUJEVJPCMF7QF6RP7TJEWF","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":"5bf161cd0ca58e6bbe159367f1d268e89d4c16425bcc223fc247afdf74c65ac2","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-06-25T07:27:47Z","title_canon_sha256":"0d2346f7e3446ca352358bfeb4da4826f1528ff59a5e1feecb7afdb239b3dbb4"},"schema_version":"1.0","source":{"id":"2006.14217","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14217","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14217v4","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14217","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"2NIZAUJEVJPC","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"pith_short_16","alias_value":"2NIZAUJEVJPCMF7Q","created_at":"2026-07-05T04:26:59Z"},{"alias_kind":"pith_short_8","alias_value":"2NIZAUJE","created_at":"2026-07-05T04:26:59Z"}],"graph_snapshots":[{"event_id":"sha256:0ab98d6d11480201d5d0e26e59b8997ed43fc88be3659d8778b0f8aaf1a4c14d","target":"graph","created_at":"2026-07-05T04:26:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.14217/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"There has been considerable recent interest in Bayesian modeling of high-dimensional networks via latent space approaches. When the number of nodes increases, estimation based on Markov Chain Monte Carlo can be extremely slow and show poor mixing, thereby motivating research on alternative algorithms that scale well in high-dimensional settings. In this article, we focus on the latent factor model, a widely used approach for latent space modeling of network data. We develop scalable algorithms to conduct approximate Bayesian inference via stochastic optimization. Leveraging sparse representati","authors_text":"Emanuele Aliverti, Massimiliano Russo","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-06-25T07:27:47Z","title":"Stratified stochastic variational inference for high-dimensional network factor model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14217","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:ad4cd7db731197de84c60caa9cb032774fe630aeed2606b28d43110eb7dbb0f2","target":"record","created_at":"2026-07-05T04:26:59Z","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":"5bf161cd0ca58e6bbe159367f1d268e89d4c16425bcc223fc247afdf74c65ac2","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-06-25T07:27:47Z","title_canon_sha256":"0d2346f7e3446ca352358bfeb4da4826f1528ff59a5e1feecb7afdb239b3dbb4"},"schema_version":"1.0","source":{"id":"2006.14217","kind":"arxiv","version":4}},"canonical_sha256":"d351905124aa5e2617f02fa2ffcd24b179aa040f1d0e52ec046850c4f9fa6f04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d351905124aa5e2617f02fa2ffcd24b179aa040f1d0e52ec046850c4f9fa6f04","first_computed_at":"2026-07-05T04:26:59.142179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:26:59.142179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m9SOnTHNTrX26d0KMERRz1FnyEBeQxiRJknCbpPOqer95aQqCjET+i0VZMyOwmrqaGVb4BztGRH/6x1PkaBHDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:26:59.142885Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.14217","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad4cd7db731197de84c60caa9cb032774fe630aeed2606b28d43110eb7dbb0f2","sha256:0ab98d6d11480201d5d0e26e59b8997ed43fc88be3659d8778b0f8aaf1a4c14d"],"state_sha256":"9d6fe6b89b3856955ee70174d4431ba6f2db4ea03c5e45ec564abaedcacda6dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNPun0BYk26Snm9QBFUQHRcx3W3GW8NIav6ACzSYfgHpnq4iXSx/JNLO3I1PfG1PZ0s7t6XZx2MxXKcIcN84Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:34:50.538939Z","bundle_sha256":"2d52eab4e1d80327fe2ad7dd1ff6ae074a86325cc7a187a538fc06776515b964"}}