{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TUW557FHHJJRZHZ5O2GBOF3PMF","short_pith_number":"pith:TUW557FH","schema_version":"1.0","canonical_sha256":"9d2ddefca73a531c9f3d768c17176f6169c716f23236ffd39270574460d787d4","source":{"kind":"arxiv","id":"1303.7226","version":1},"attestation_state":"computed","paper":{"title":"Detecting Overlapping Temporal Community Structure in Time-Evolving Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph","stat.ML"],"primary_cat":"cs.SI","authors_text":"Rahul Urgaonkar, Vikas Kawadia, Yudong Chen","submitted_at":"2013-03-28T19:56:39Z","abstract_excerpt":"We present a principled approach for detecting overlapping temporal community structure in dynamic networks. Our method is based on the following framework: find the overlapping temporal community structure that maximizes a quality function associated with each snapshot of the network subject to a temporal smoothness constraint. A novel quality function and a smoothness constraint are proposed to handle overlaps, and a new convex relaxation is used to solve the resulting combinatorial optimization problem. We provide theoretical guarantees as well as experimental results that reveal community "},"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":"1303.7226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-28T19:56:39Z","cross_cats_sorted":["cs.LG","physics.soc-ph","stat.ML"],"title_canon_sha256":"da535308aa0adb2d915e0e21d2c7bf0fc0a505852da71cc2905c2f9261031ac5","abstract_canon_sha256":"ffdf1fd8b0862ccb14d4e8a01d99dbd42ff496c616dc5f387b7314cfe40dd3a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:37.957121Z","signature_b64":"m+Mfm0A/iomV8/Dlf02pLZy5GS47ZiWAIIOW6fhibqgpErWQqqa+eVCgHblNdAV0U1H3D3BnAKsAWnGYZvgyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d2ddefca73a531c9f3d768c17176f6169c716f23236ffd39270574460d787d4","last_reissued_at":"2026-05-18T03:29:37.956244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:37.956244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting Overlapping Temporal Community Structure in Time-Evolving Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph","stat.ML"],"primary_cat":"cs.SI","authors_text":"Rahul Urgaonkar, Vikas Kawadia, Yudong Chen","submitted_at":"2013-03-28T19:56:39Z","abstract_excerpt":"We present a principled approach for detecting overlapping temporal community structure in dynamic networks. Our method is based on the following framework: find the overlapping temporal community structure that maximizes a quality function associated with each snapshot of the network subject to a temporal smoothness constraint. A novel quality function and a smoothness constraint are proposed to handle overlaps, and a new convex relaxation is used to solve the resulting combinatorial optimization problem. We provide theoretical guarantees as well as experimental results that reveal community "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7226","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":"1303.7226","created_at":"2026-05-18T03:29:37.956377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.7226v1","created_at":"2026-05-18T03:29:37.956377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7226","created_at":"2026-05-18T03:29:37.956377+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUW557FHHJJR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUW557FHHJJRZHZ5","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUW557FH","created_at":"2026-05-18T12:28:02.375192+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/TUW557FHHJJRZHZ5O2GBOF3PMF","json":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF.json","graph_json":"https://pith.science/api/pith-number/TUW557FHHJJRZHZ5O2GBOF3PMF/graph.json","events_json":"https://pith.science/api/pith-number/TUW557FHHJJRZHZ5O2GBOF3PMF/events.json","paper":"https://pith.science/paper/TUW557FH"},"agent_actions":{"view_html":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF","download_json":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF.json","view_paper":"https://pith.science/paper/TUW557FH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.7226&json=true","fetch_graph":"https://pith.science/api/pith-number/TUW557FHHJJRZHZ5O2GBOF3PMF/graph.json","fetch_events":"https://pith.science/api/pith-number/TUW557FHHJJRZHZ5O2GBOF3PMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF/action/storage_attestation","attest_author":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF/action/author_attestation","sign_citation":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF/action/citation_signature","submit_replication":"https://pith.science/pith/TUW557FHHJJRZHZ5O2GBOF3PMF/action/replication_record"}},"created_at":"2026-05-18T03:29:37.956377+00:00","updated_at":"2026-05-18T03:29:37.956377+00:00"}