{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:BWZHQKGVQLBFX45TD74YLM6AK4","short_pith_number":"pith:BWZHQKGV","schema_version":"1.0","canonical_sha256":"0db27828d582c25bf3b31ff985b3c057044dcf06315cce659bf1abdc05406484","source":{"kind":"arxiv","id":"cond-mat/0408263","version":4},"attestation_state":"computed","paper":{"title":"An Agent-Based Algorithm for Detecting Community Structure in Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Gabor Csardi, Jennifer Sager, Maxwell Young, Peter Haga","submitted_at":"2004-08-12T04:56:14Z","abstract_excerpt":"We present a simple stochastic agent-based community finding algorithm. Our algorithm is tested on network data from the Zachary karate club study, data from Victor Hugo's \"Les Miserables\", and data obtained from a musical piece by J.S. Bach. In all three cases, the algorithm partitions the vertices of the graph sensibly."},"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":"cond-mat/0408263","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2004-08-12T04:56:14Z","cross_cats_sorted":[],"title_canon_sha256":"66caa9a8f8c0efc75a30c080fde42a20c1bbe8d065735e43cfd9a20bd2f91227","abstract_canon_sha256":"a93f3a3fd18aac0d3b85c96f016b33fab285dc1e38ed56fa5d3c7ed4a2823f82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:24.282023Z","signature_b64":"wV0m6zbMezn8a3gg5VKeD9f6I8eRwaWRp9HYbLY0r6kCqMaaEv1aGgSJGFaQ64Dv+4Rn/inuzh6TAn4QNXwhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db27828d582c25bf3b31ff985b3c057044dcf06315cce659bf1abdc05406484","last_reissued_at":"2026-05-18T00:50:24.281269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:24.281269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Agent-Based Algorithm for Detecting Community Structure in Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Gabor Csardi, Jennifer Sager, Maxwell Young, Peter Haga","submitted_at":"2004-08-12T04:56:14Z","abstract_excerpt":"We present a simple stochastic agent-based community finding algorithm. Our algorithm is tested on network data from the Zachary karate club study, data from Victor Hugo's \"Les Miserables\", and data obtained from a musical piece by J.S. Bach. In all three cases, the algorithm partitions the vertices of the graph sensibly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0408263","kind":"arxiv","version":4},"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":"cond-mat/0408263","created_at":"2026-05-18T00:50:24.281408+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0408263v4","created_at":"2026-05-18T00:50:24.281408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0408263","created_at":"2026-05-18T00:50:24.281408+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWZHQKGVQLBF","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWZHQKGVQLBFX45T","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWZHQKGV","created_at":"2026-05-18T12:25:52.051335+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/BWZHQKGVQLBFX45TD74YLM6AK4","json":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4.json","graph_json":"https://pith.science/api/pith-number/BWZHQKGVQLBFX45TD74YLM6AK4/graph.json","events_json":"https://pith.science/api/pith-number/BWZHQKGVQLBFX45TD74YLM6AK4/events.json","paper":"https://pith.science/paper/BWZHQKGV"},"agent_actions":{"view_html":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4","download_json":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4.json","view_paper":"https://pith.science/paper/BWZHQKGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0408263&json=true","fetch_graph":"https://pith.science/api/pith-number/BWZHQKGVQLBFX45TD74YLM6AK4/graph.json","fetch_events":"https://pith.science/api/pith-number/BWZHQKGVQLBFX45TD74YLM6AK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4/action/storage_attestation","attest_author":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4/action/author_attestation","sign_citation":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4/action/citation_signature","submit_replication":"https://pith.science/pith/BWZHQKGVQLBFX45TD74YLM6AK4/action/replication_record"}},"created_at":"2026-05-18T00:50:24.281408+00:00","updated_at":"2026-05-18T00:50:24.281408+00:00"}