{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KXKGYBOVRLNGRLQ2BREMKKN64S","short_pith_number":"pith:KXKGYBOV","schema_version":"1.0","canonical_sha256":"55d46c05d58ada68ae1a0c48c529bee4bf4ef8a04dba09f56b9c026fdf79e5e2","source":{"kind":"arxiv","id":"1011.1813","version":1},"attestation_state":"computed","paper":{"title":"Uncovering latent structure in valued graphs: A variational approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Corinne Vacher, Mahendra Mariadassou, St\\'ephane Robin","submitted_at":"2010-11-08T14:50:30Z","abstract_excerpt":"As more and more network-structured data sets are available, the statistical analysis of valued graphs has become common place. Looking for a latent structure is one of the many strategies used to better understand the behavior of a network. Several methods already exist for the binary case. We present a model-based strategy to uncover groups of nodes in valued graphs. This framework can be used for a wide span of parametric random graphs models and allows to include covariates. Variational tools allow us to achieve approximate maximum likelihood estimation of the parameters of these models. W"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1011.1813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2010-11-08T14:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"182d37e36a4826dd14e307b09fa33f4d0cd83d050843efaac47ba6d15a1aa19e","abstract_canon_sha256":"2aa4b550258d2bfcdf42aea40bc17b984e421e864ee72ddc12e5d4c69b4d0d7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:49.823916Z","signature_b64":"fxdsrRIYzRxUpELVgZhWVAtAvzbITtCcNnAMpjFJMyPoBUMviqInHzXvi5OEzHFu7a+nD/Jr1yJQ0++caXF1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55d46c05d58ada68ae1a0c48c529bee4bf4ef8a04dba09f56b9c026fdf79e5e2","last_reissued_at":"2026-05-18T04:36:49.823469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:49.823469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncovering latent structure in valued graphs: A variational approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Corinne Vacher, Mahendra Mariadassou, St\\'ephane Robin","submitted_at":"2010-11-08T14:50:30Z","abstract_excerpt":"As more and more network-structured data sets are available, the statistical analysis of valued graphs has become common place. Looking for a latent structure is one of the many strategies used to better understand the behavior of a network. Several methods already exist for the binary case. We present a model-based strategy to uncover groups of nodes in valued graphs. This framework can be used for a wide span of parametric random graphs models and allows to include covariates. Variational tools allow us to achieve approximate maximum likelihood estimation of the parameters of these models. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1813","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.1813","created_at":"2026-05-18T04:36:49.823538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1813v1","created_at":"2026-05-18T04:36:49.823538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1813","created_at":"2026-05-18T04:36:49.823538+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXKGYBOVRLNG","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXKGYBOVRLNGRLQ2","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXKGYBOV","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S","json":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S.json","graph_json":"https://pith.science/api/pith-number/KXKGYBOVRLNGRLQ2BREMKKN64S/graph.json","events_json":"https://pith.science/api/pith-number/KXKGYBOVRLNGRLQ2BREMKKN64S/events.json","paper":"https://pith.science/paper/KXKGYBOV"},"agent_actions":{"view_html":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S","download_json":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S.json","view_paper":"https://pith.science/paper/KXKGYBOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1813&json=true","fetch_graph":"https://pith.science/api/pith-number/KXKGYBOVRLNGRLQ2BREMKKN64S/graph.json","fetch_events":"https://pith.science/api/pith-number/KXKGYBOVRLNGRLQ2BREMKKN64S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S/action/storage_attestation","attest_author":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S/action/author_attestation","sign_citation":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S/action/citation_signature","submit_replication":"https://pith.science/pith/KXKGYBOVRLNGRLQ2BREMKKN64S/action/replication_record"}},"created_at":"2026-05-18T04:36:49.823538+00:00","updated_at":"2026-05-18T04:36:49.823538+00:00"}