{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GYL3BRQNSPTMSSS52R4VY5H2UM","short_pith_number":"pith:GYL3BRQN","schema_version":"1.0","canonical_sha256":"3617b0c60d93e6c94a5dd4795c74faa30e3d8ac141c75d45dddb982f94ecf6ef","source":{"kind":"arxiv","id":"1901.09828","version":1},"attestation_state":"computed","paper":{"title":"A dynamic stochastic blockmodel for interaction lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Michael Fop, Riccardo Rastelli","submitted_at":"2019-01-28T17:25:34Z","abstract_excerpt":"We propose a new dynamic stochastic blockmodel that focuses on the analysis of interaction lengths in networks. The model does not rely on a discretization of the time dimension and may be used to analyze networks that evolve continuously over time. The framework relies on a clustering structure on the nodes, whereby two nodes belonging to the same latent group tend to create interactions and non-interactions of similar lengths. We introduce a fast variational expectation-maximization algorithm to perform inference, and adapt a widely used clustering criterion to perform model choice. Finally,"},"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":"1901.09828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-01-28T17:25:34Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"b14f8133a4c0aaf9eebeb1aad53a19f1f71b688fabc288b49f994c3ac8488d59","abstract_canon_sha256":"c39d88cf307de4da51a913815f2f7b842d503f0cdf9c796784274ec950a99e26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:23.717680Z","signature_b64":"VsFmHrz7fWqH8AgHygUG3GYkOsMQl9zIQHddTG0h9lveiK6+FeuncUEp0F13rT6MpCpVgX3XNgINOjSZ1P+IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3617b0c60d93e6c94a5dd4795c74faa30e3d8ac141c75d45dddb982f94ecf6ef","last_reissued_at":"2026-05-17T23:55:23.717038Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:23.717038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dynamic stochastic blockmodel for interaction lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Michael Fop, Riccardo Rastelli","submitted_at":"2019-01-28T17:25:34Z","abstract_excerpt":"We propose a new dynamic stochastic blockmodel that focuses on the analysis of interaction lengths in networks. The model does not rely on a discretization of the time dimension and may be used to analyze networks that evolve continuously over time. The framework relies on a clustering structure on the nodes, whereby two nodes belonging to the same latent group tend to create interactions and non-interactions of similar lengths. We introduce a fast variational expectation-maximization algorithm to perform inference, and adapt a widely used clustering criterion to perform model choice. Finally,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09828","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":"1901.09828","created_at":"2026-05-17T23:55:23.717136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09828v1","created_at":"2026-05-17T23:55:23.717136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09828","created_at":"2026-05-17T23:55:23.717136+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYL3BRQNSPTM","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYL3BRQNSPTMSSS5","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYL3BRQN","created_at":"2026-05-18T12:33:18.533446+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/GYL3BRQNSPTMSSS52R4VY5H2UM","json":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM.json","graph_json":"https://pith.science/api/pith-number/GYL3BRQNSPTMSSS52R4VY5H2UM/graph.json","events_json":"https://pith.science/api/pith-number/GYL3BRQNSPTMSSS52R4VY5H2UM/events.json","paper":"https://pith.science/paper/GYL3BRQN"},"agent_actions":{"view_html":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM","download_json":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM.json","view_paper":"https://pith.science/paper/GYL3BRQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09828&json=true","fetch_graph":"https://pith.science/api/pith-number/GYL3BRQNSPTMSSS52R4VY5H2UM/graph.json","fetch_events":"https://pith.science/api/pith-number/GYL3BRQNSPTMSSS52R4VY5H2UM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM/action/storage_attestation","attest_author":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM/action/author_attestation","sign_citation":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM/action/citation_signature","submit_replication":"https://pith.science/pith/GYL3BRQNSPTMSSS52R4VY5H2UM/action/replication_record"}},"created_at":"2026-05-17T23:55:23.717136+00:00","updated_at":"2026-05-17T23:55:23.717136+00:00"}