{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X44OYNEOHV7EUCKBTUAXB4C4PN","short_pith_number":"pith:X44OYNEO","canonical_record":{"source":{"id":"1605.08074","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-25T21:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"3a1dc08291e23a2265fd1313f5541c1a8b95ff2bce29c3b7fdee57046dee718f","abstract_canon_sha256":"6d2470f7ef87f273bb8bb9665a52db16c2e62fe9c101507897ffc483bbbbb574"},"schema_version":"1.0"},"canonical_sha256":"bf38ec348e3d7e4a09419d0170f05c7b71111a67bd166e7293759c2360849b82","source":{"kind":"arxiv","id":"1605.08074","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08074","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08074v3","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08074","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"X44OYNEOHV7E","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X44OYNEOHV7EUCKB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X44OYNEO","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X44OYNEOHV7EUCKBTUAXB4C4PN","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08074","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-25T21:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"3a1dc08291e23a2265fd1313f5541c1a8b95ff2bce29c3b7fdee57046dee718f","abstract_canon_sha256":"6d2470f7ef87f273bb8bb9665a52db16c2e62fe9c101507897ffc483bbbbb574"},"schema_version":"1.0"},"canonical_sha256":"bf38ec348e3d7e4a09419d0170f05c7b71111a67bd166e7293759c2360849b82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.243104Z","signature_b64":"jue2aOgsD1FeDUx6sB3SZtQg23lR5/HW7BJxRas6PN6ZQaLGgIHaGuciAyd8ButrStibPDTKwlH6D7ugvtGHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf38ec348e3d7e4a09419d0170f05c7b71111a67bd166e7293759c2360849b82","last_reissued_at":"2026-05-18T00:50:01.242440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.242440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08074","source_version":3,"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:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omY0DeQ/7M4OG5WFlJZUv+CPZBnM9ayCfxbWychns7fD3yOSg/2R8huApcPJkA1OD36xEoSipx6v3Bu8un19BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:03:19.277821Z"},"content_sha256":"3b382070a561c8c3cc5d3ae782b0ddc2833b587bd3430f549bd20bc120d50bdc","schema_version":"1.0","event_id":"sha256:3b382070a561c8c3cc5d3ae782b0ddc2833b587bd3430f549bd20bc120d50bdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X44OYNEOHV7EUCKBTUAXB4C4PN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal Clustering in Dynamic Networks with Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ananthram Swami, Bruno Ribeiro, Don Towsley, Kun Tu","submitted_at":"2016-05-25T21:07:14Z","abstract_excerpt":"Dynamic networks are increasingly being usedd to model real world datasets. A challenging task in their analysis is to detect and characterize clusters. It is useful for analyzing real-world data such as detecting evolving communities in networks. We propose a temporal clustering framework based on a set of network generative models to address this problem. We use PARAFAC decomposition to learn network models from datasets.We then use $K$-means for clustering, the Silhouette criterion to determine the number of clusters, and a similarity score to order the clusters and retain the significant o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08074","kind":"arxiv","version":3},"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:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTaW+fgTQjyfkseTrR9M/zX1KtVDpfxmJSbT1lSg8969dYkasuoFM8T9q5wDI+O2hc+DONZS4ipUGoRpYjOHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:03:19.278502Z"},"content_sha256":"5093ecdef60fcd95ff7c0cf55b957c53bd60d55a6fc28fa77e8668228915553d","schema_version":"1.0","event_id":"sha256:5093ecdef60fcd95ff7c0cf55b957c53bd60d55a6fc28fa77e8668228915553d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/bundle.json","state_url":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/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-26T00:03:19Z","links":{"resolver":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN","bundle":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/bundle.json","state":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X44OYNEOHV7EUCKBTUAXB4C4PN","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":"6d2470f7ef87f273bb8bb9665a52db16c2e62fe9c101507897ffc483bbbbb574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-25T21:07:14Z","title_canon_sha256":"3a1dc08291e23a2265fd1313f5541c1a8b95ff2bce29c3b7fdee57046dee718f"},"schema_version":"1.0","source":{"id":"1605.08074","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08074","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08074v3","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08074","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"X44OYNEOHV7E","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X44OYNEOHV7EUCKB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X44OYNEO","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:5093ecdef60fcd95ff7c0cf55b957c53bd60d55a6fc28fa77e8668228915553d","target":"graph","created_at":"2026-05-18T00:50:01Z","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 increasingly being usedd to model real world datasets. A challenging task in their analysis is to detect and characterize clusters. It is useful for analyzing real-world data such as detecting evolving communities in networks. We propose a temporal clustering framework based on a set of network generative models to address this problem. We use PARAFAC decomposition to learn network models from datasets.We then use $K$-means for clustering, the Silhouette criterion to determine the number of clusters, and a similarity score to order the clusters and retain the significant o","authors_text":"Ananthram Swami, Bruno Ribeiro, Don Towsley, Kun Tu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-25T21:07:14Z","title":"Temporal Clustering in Dynamic Networks with Tensor Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08074","kind":"arxiv","version":3},"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:3b382070a561c8c3cc5d3ae782b0ddc2833b587bd3430f549bd20bc120d50bdc","target":"record","created_at":"2026-05-18T00:50:01Z","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":"6d2470f7ef87f273bb8bb9665a52db16c2e62fe9c101507897ffc483bbbbb574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-25T21:07:14Z","title_canon_sha256":"3a1dc08291e23a2265fd1313f5541c1a8b95ff2bce29c3b7fdee57046dee718f"},"schema_version":"1.0","source":{"id":"1605.08074","kind":"arxiv","version":3}},"canonical_sha256":"bf38ec348e3d7e4a09419d0170f05c7b71111a67bd166e7293759c2360849b82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf38ec348e3d7e4a09419d0170f05c7b71111a67bd166e7293759c2360849b82","first_computed_at":"2026-05-18T00:50:01.242440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:01.242440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jue2aOgsD1FeDUx6sB3SZtQg23lR5/HW7BJxRas6PN6ZQaLGgIHaGuciAyd8ButrStibPDTKwlH6D7ugvtGHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:01.243104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08074","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b382070a561c8c3cc5d3ae782b0ddc2833b587bd3430f549bd20bc120d50bdc","sha256:5093ecdef60fcd95ff7c0cf55b957c53bd60d55a6fc28fa77e8668228915553d"],"state_sha256":"52cf7a45cfe02d5bd895e585347dfa84f5947365fecc12a10fa377a3c45b061b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NiDs7VI1I47L8Dw0WjKHEKo0ZTFG9iQUS5sVhxdzNkj5yyX466JBcgrgheX1xZrkrWemoVT6xAHfXoeVvnGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:03:19.282404Z","bundle_sha256":"2c84b04d63e898f251c850b010c70b59ed7aac2a7d278f026d1f2843dcfdeb42"}}