{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X44OYNEOHV7EUCKBTUAXB4C4PN","short_pith_number":"pith:X44OYNEO","schema_version":"1.0","canonical_sha256":"bf38ec348e3d7e4a09419d0170f05c7b71111a67bd166e7293759c2360849b82","source":{"kind":"arxiv","id":"1605.08074","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.08074","created_at":"2026-05-18T00:50:01.242552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08074v3","created_at":"2026-05-18T00:50:01.242552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08074","created_at":"2026-05-18T00:50:01.242552+00:00"},{"alias_kind":"pith_short_12","alias_value":"X44OYNEOHV7E","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X44OYNEOHV7EUCKB","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X44OYNEO","created_at":"2026-05-18T12:30:51.357362+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/X44OYNEOHV7EUCKBTUAXB4C4PN","json":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN.json","graph_json":"https://pith.science/api/pith-number/X44OYNEOHV7EUCKBTUAXB4C4PN/graph.json","events_json":"https://pith.science/api/pith-number/X44OYNEOHV7EUCKBTUAXB4C4PN/events.json","paper":"https://pith.science/paper/X44OYNEO"},"agent_actions":{"view_html":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN","download_json":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN.json","view_paper":"https://pith.science/paper/X44OYNEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08074&json=true","fetch_graph":"https://pith.science/api/pith-number/X44OYNEOHV7EUCKBTUAXB4C4PN/graph.json","fetch_events":"https://pith.science/api/pith-number/X44OYNEOHV7EUCKBTUAXB4C4PN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/action/storage_attestation","attest_author":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/action/author_attestation","sign_citation":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/action/citation_signature","submit_replication":"https://pith.science/pith/X44OYNEOHV7EUCKBTUAXB4C4PN/action/replication_record"}},"created_at":"2026-05-18T00:50:01.242552+00:00","updated_at":"2026-05-18T00:50:01.242552+00:00"}