{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2IQTUNSPSHRJHMDJNGT2CXR4OR","short_pith_number":"pith:2IQTUNSP","schema_version":"1.0","canonical_sha256":"d2213a364f91e293b06969a7a15e3c7461464f7c7b71ebe640ea90405b30feb5","source":{"kind":"arxiv","id":"1104.5247","version":2},"attestation_state":"computed","paper":{"title":"Identifying communities by influence dynamics in social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Angel Stanoev, Daniel Smilkov, Ljupco Kocarev","submitted_at":"2011-04-27T21:09:25Z","abstract_excerpt":"Communities are not static; they evolve, split and merge, appear and disappear, i.e. they are product of dynamical processes that govern the evolution of the network. A good algorithm for community detection should not only quantify the topology of the network, but incorporate the dynamical processes that take place on the network. We present a novel algorithm for community detection that combines network structure with processes that support creation and/or evolution of communities. The algorithm does not embrace the universal approach but instead tries to focus on social networks and model d"},"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":"1104.5247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-04-27T21:09:25Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"b0d4efa754ca0f789ec3e87359a8d18e92100f2ba25a3c0101806140f53a5a5e","abstract_canon_sha256":"cf22c9efb9086d38dcea6b10c104982f6e3ec6fd35a490b440652e16610721ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:52.582226Z","signature_b64":"aA3UaLAgs7KdnAXtfTgLXjZ+EgmBdhG6P/72eqjfFoP91LOpCD1z8VS/60PRR0suSgutEeb/RhLNOh26MlsrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2213a364f91e293b06969a7a15e3c7461464f7c7b71ebe640ea90405b30feb5","last_reissued_at":"2026-05-18T04:07:52.581590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:52.581590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying communities by influence dynamics in social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Angel Stanoev, Daniel Smilkov, Ljupco Kocarev","submitted_at":"2011-04-27T21:09:25Z","abstract_excerpt":"Communities are not static; they evolve, split and merge, appear and disappear, i.e. they are product of dynamical processes that govern the evolution of the network. A good algorithm for community detection should not only quantify the topology of the network, but incorporate the dynamical processes that take place on the network. We present a novel algorithm for community detection that combines network structure with processes that support creation and/or evolution of communities. The algorithm does not embrace the universal approach but instead tries to focus on social networks and model d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5247","kind":"arxiv","version":2},"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":"1104.5247","created_at":"2026-05-18T04:07:52.581670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5247v2","created_at":"2026-05-18T04:07:52.581670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5247","created_at":"2026-05-18T04:07:52.581670+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IQTUNSPSHRJ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IQTUNSPSHRJHMDJ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IQTUNSP","created_at":"2026-05-18T12:26:18.847500+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/2IQTUNSPSHRJHMDJNGT2CXR4OR","json":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR.json","graph_json":"https://pith.science/api/pith-number/2IQTUNSPSHRJHMDJNGT2CXR4OR/graph.json","events_json":"https://pith.science/api/pith-number/2IQTUNSPSHRJHMDJNGT2CXR4OR/events.json","paper":"https://pith.science/paper/2IQTUNSP"},"agent_actions":{"view_html":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR","download_json":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR.json","view_paper":"https://pith.science/paper/2IQTUNSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5247&json=true","fetch_graph":"https://pith.science/api/pith-number/2IQTUNSPSHRJHMDJNGT2CXR4OR/graph.json","fetch_events":"https://pith.science/api/pith-number/2IQTUNSPSHRJHMDJNGT2CXR4OR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR/action/storage_attestation","attest_author":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR/action/author_attestation","sign_citation":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR/action/citation_signature","submit_replication":"https://pith.science/pith/2IQTUNSPSHRJHMDJNGT2CXR4OR/action/replication_record"}},"created_at":"2026-05-18T04:07:52.581670+00:00","updated_at":"2026-05-18T04:07:52.581670+00:00"}