{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3YGSOTMYSMOCOYCVJWZET34FRK","short_pith_number":"pith:3YGSOTMY","canonical_record":{"source":{"id":"1712.07325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-20T05:36:00Z","cross_cats_sorted":["cs.SI","stat.AP","stat.CO","stat.ML"],"title_canon_sha256":"d937f1a149da8660168528388979ef9a23d901ab42bcb04792cf1f3efe33bf47","abstract_canon_sha256":"3caf69883f6592c620c4c53d9d1cf7e5293c2491d813f038d4f00931c28a32ea"},"schema_version":"1.0"},"canonical_sha256":"de0d274d98931c2760554db249ef858aa1de5653f3bdeffc847ba12d389690e4","source":{"kind":"arxiv","id":"1712.07325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07325","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07325v1","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07325","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"3YGSOTMYSMOC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3YGSOTMYSMOCOYCV","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3YGSOTMY","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3YGSOTMYSMOCOYCVJWZET34FRK","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-20T05:36:00Z","cross_cats_sorted":["cs.SI","stat.AP","stat.CO","stat.ML"],"title_canon_sha256":"d937f1a149da8660168528388979ef9a23d901ab42bcb04792cf1f3efe33bf47","abstract_canon_sha256":"3caf69883f6592c620c4c53d9d1cf7e5293c2491d813f038d4f00931c28a32ea"},"schema_version":"1.0"},"canonical_sha256":"de0d274d98931c2760554db249ef858aa1de5653f3bdeffc847ba12d389690e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:34.799055Z","signature_b64":"chMSOiTax+NrNMisHX01ZdUVQbnlYA3HB4lV+IvMCpTq3MndkewKzP0kYYQ84sy1bFcKv3PtEG2ZIAV1M7DMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0d274d98931c2760554db249ef858aa1de5653f3bdeffc847ba12d389690e4","last_reissued_at":"2026-05-18T00:27:34.798365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:34.798365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07325","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:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDx036a05csfvtxRAQDqn3e7t57F6dVxEn3PAtT7by2Ea/msrl4WBaq+25BA11sYxpcNesdA0F2hQVwu8jD7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:23:48.490524Z"},"content_sha256":"69414d03a401d9fa0baab48a6e2336bc3bce45fabe4e0857ca468ac933b2343c","schema_version":"1.0","event_id":"sha256:69414d03a401d9fa0baab48a6e2336bc3bce45fabe4e0857ca468ac933b2343c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3YGSOTMYSMOCOYCVJWZET34FRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model-Based Clustering of Time-Evolving Networks through Temporal Exponential-Family Random Graph Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.AP","stat.CO","stat.ML"],"primary_cat":"stat.ME","authors_text":"David R. Hunter, Kevin H. Lee, Lingzhou Xue","submitted_at":"2017-12-20T05:36:00Z","abstract_excerpt":"Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect the community structure in time-evolving networks. However, due to significant computational challenges and difficulties in modeling communities of time-evolving networks, there is little progress in the current literature to effectively find communities in time-evolving networks. In this work, we propose a novel model-based clustering framework for time-evolving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07325","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:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rh7yZ2kv7glboklm9Z/sZ0Yn1hDbKI9T+J1swIDGIgwbxpVytqi1UQTCK/xeSJ1yLUI/f1zMJaobND0OXyzRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:23:48.491277Z"},"content_sha256":"89a9540ae9b0baf3fafe9e059a0ebe13fe7342ea0075ecc44c841f557791b2cb","schema_version":"1.0","event_id":"sha256:89a9540ae9b0baf3fafe9e059a0ebe13fe7342ea0075ecc44c841f557791b2cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YGSOTMYSMOCOYCVJWZET34FRK/bundle.json","state_url":"https://pith.science/pith/3YGSOTMYSMOCOYCVJWZET34FRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YGSOTMYSMOCOYCVJWZET34FRK/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-24T10:23:48Z","links":{"resolver":"https://pith.science/pith/3YGSOTMYSMOCOYCVJWZET34FRK","bundle":"https://pith.science/pith/3YGSOTMYSMOCOYCVJWZET34FRK/bundle.json","state":"https://pith.science/pith/3YGSOTMYSMOCOYCVJWZET34FRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YGSOTMYSMOCOYCVJWZET34FRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3YGSOTMYSMOCOYCVJWZET34FRK","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":"3caf69883f6592c620c4c53d9d1cf7e5293c2491d813f038d4f00931c28a32ea","cross_cats_sorted":["cs.SI","stat.AP","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-20T05:36:00Z","title_canon_sha256":"d937f1a149da8660168528388979ef9a23d901ab42bcb04792cf1f3efe33bf47"},"schema_version":"1.0","source":{"id":"1712.07325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07325","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07325v1","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07325","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"3YGSOTMYSMOC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3YGSOTMYSMOCOYCV","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3YGSOTMY","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:89a9540ae9b0baf3fafe9e059a0ebe13fe7342ea0075ecc44c841f557791b2cb","target":"graph","created_at":"2026-05-18T00:27:34Z","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":"Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect the community structure in time-evolving networks. However, due to significant computational challenges and difficulties in modeling communities of time-evolving networks, there is little progress in the current literature to effectively find communities in time-evolving networks. In this work, we propose a novel model-based clustering framework for time-evolving","authors_text":"David R. Hunter, Kevin H. Lee, Lingzhou Xue","cross_cats":["cs.SI","stat.AP","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-20T05:36:00Z","title":"Model-Based Clustering of Time-Evolving Networks through Temporal Exponential-Family Random Graph Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07325","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:69414d03a401d9fa0baab48a6e2336bc3bce45fabe4e0857ca468ac933b2343c","target":"record","created_at":"2026-05-18T00:27:34Z","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":"3caf69883f6592c620c4c53d9d1cf7e5293c2491d813f038d4f00931c28a32ea","cross_cats_sorted":["cs.SI","stat.AP","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-20T05:36:00Z","title_canon_sha256":"d937f1a149da8660168528388979ef9a23d901ab42bcb04792cf1f3efe33bf47"},"schema_version":"1.0","source":{"id":"1712.07325","kind":"arxiv","version":1}},"canonical_sha256":"de0d274d98931c2760554db249ef858aa1de5653f3bdeffc847ba12d389690e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0d274d98931c2760554db249ef858aa1de5653f3bdeffc847ba12d389690e4","first_computed_at":"2026-05-18T00:27:34.798365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:34.798365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"chMSOiTax+NrNMisHX01ZdUVQbnlYA3HB4lV+IvMCpTq3MndkewKzP0kYYQ84sy1bFcKv3PtEG2ZIAV1M7DMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:34.799055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69414d03a401d9fa0baab48a6e2336bc3bce45fabe4e0857ca468ac933b2343c","sha256:89a9540ae9b0baf3fafe9e059a0ebe13fe7342ea0075ecc44c841f557791b2cb"],"state_sha256":"ebe75c03828ea0c537f8f27c31c1cc90575db55cabe1225fbd35445f575e745d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NftaY3ex8LG8l76vEwH90s3s8+FqUAcFEQC0uICOhSaH8Z6QbRiAP4F+VLCA9mbCbOqV0VYhdlKVuhbOQ3I9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:23:48.494601Z","bundle_sha256":"0899568a3e3561f9738c3ecebcfa572a88fc04f4f11ebc7734154ba4cbffb3c3"}}