{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EGNCO26NGHOOG6YK6W4APPO7CX","short_pith_number":"pith:EGNCO26N","canonical_record":{"source":{"id":"1303.5912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-24T03:32:44Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"f3b408eff4c51e6f534375a2d969af36a64f6f958c38b3b4eac710452898abd6","abstract_canon_sha256":"e1215973370bfc86460d446c7ba735d2c48fb40144b6646010d9a858684082c1"},"schema_version":"1.0"},"canonical_sha256":"219a276bcd31dce37b0af5b807bddf15c6736af575a7605c8b4324e6a7ea49b6","source":{"kind":"arxiv","id":"1303.5912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5912","created_at":"2026-05-18T03:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5912v1","created_at":"2026-05-18T03:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5912","created_at":"2026-05-18T03:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"EGNCO26NGHOO","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EGNCO26NGHOOG6YK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EGNCO26N","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EGNCO26NGHOOG6YK6W4APPO7CX","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-24T03:32:44Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"f3b408eff4c51e6f534375a2d969af36a64f6f958c38b3b4eac710452898abd6","abstract_canon_sha256":"e1215973370bfc86460d446c7ba735d2c48fb40144b6646010d9a858684082c1"},"schema_version":"1.0"},"canonical_sha256":"219a276bcd31dce37b0af5b807bddf15c6736af575a7605c8b4324e6a7ea49b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:00.879819Z","signature_b64":"yFH4Yb/7aoUcVeai021Cdz1WoAFv9dsuHXk2HFYxR3UokKD+pGLm0WajH+2eeUi655t3gDWt0tGp3u1WA57kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"219a276bcd31dce37b0af5b807bddf15c6736af575a7605c8b4324e6a7ea49b6","last_reissued_at":"2026-05-18T03:30:00.879045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:00.879045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5912","source_version":1,"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-18T03:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMge1d32Q6lMhBNpifQyEeClKAWBnMrqCTWWDb2nxU8CqVuC8QyuQcED+GXq4lJFJVFpAGs3kowgjfjHbTddAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:24:19.884083Z"},"content_sha256":"f2c712f8a329000ed752fc96e203fd31004c04b49304b31d7bd6b4cf1a52e0b9","schema_version":"1.0","event_id":"sha256:f2c712f8a329000ed752fc96e203fd31004c04b49304b31d7bd6b4cf1a52e0b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EGNCO26NGHOOG6YK6W4APPO7CX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Complex Network Clustering Algorithm Using Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bo Yang, Dayou Liu, Di Jin, Jie Liu","submitted_at":"2013-03-24T03:32:44Z","abstract_excerpt":"Recently, the sizes of networks are always very huge, and they take on distributed nature. Aiming at this kind of network clustering problem, in the sight of local view, this paper proposes a fast network clustering algorithm in which each node is regarded as an agent, and each agent tries to maximize its local function in order to optimize network modularity defined by function Q, rather than optimize function Q from the global view as traditional methods. Both the efficiency and effectiveness of this algorithm are tested against computer-generated and real-world networks. Experimental result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5912","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"},"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-18T03:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlpJNEOqHDHMLp6auG/mqDSarJeoXBo7R50zzSI76Ky8+A8JulptDDxfMgiTeFwYPfZnCVKl+uM607rU5AMlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:24:19.884775Z"},"content_sha256":"4394aa96075583bafe55a0a231ecb724e11dffa82cfe8de5a1de72afdfec5dd8","schema_version":"1.0","event_id":"sha256:4394aa96075583bafe55a0a231ecb724e11dffa82cfe8de5a1de72afdfec5dd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGNCO26NGHOOG6YK6W4APPO7CX/bundle.json","state_url":"https://pith.science/pith/EGNCO26NGHOOG6YK6W4APPO7CX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGNCO26NGHOOG6YK6W4APPO7CX/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-26T02:24:19Z","links":{"resolver":"https://pith.science/pith/EGNCO26NGHOOG6YK6W4APPO7CX","bundle":"https://pith.science/pith/EGNCO26NGHOOG6YK6W4APPO7CX/bundle.json","state":"https://pith.science/pith/EGNCO26NGHOOG6YK6W4APPO7CX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGNCO26NGHOOG6YK6W4APPO7CX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EGNCO26NGHOOG6YK6W4APPO7CX","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":"e1215973370bfc86460d446c7ba735d2c48fb40144b6646010d9a858684082c1","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-24T03:32:44Z","title_canon_sha256":"f3b408eff4c51e6f534375a2d969af36a64f6f958c38b3b4eac710452898abd6"},"schema_version":"1.0","source":{"id":"1303.5912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5912","created_at":"2026-05-18T03:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5912v1","created_at":"2026-05-18T03:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5912","created_at":"2026-05-18T03:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"EGNCO26NGHOO","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EGNCO26NGHOOG6YK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EGNCO26N","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:4394aa96075583bafe55a0a231ecb724e11dffa82cfe8de5a1de72afdfec5dd8","target":"graph","created_at":"2026-05-18T03:30:00Z","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":"Recently, the sizes of networks are always very huge, and they take on distributed nature. Aiming at this kind of network clustering problem, in the sight of local view, this paper proposes a fast network clustering algorithm in which each node is regarded as an agent, and each agent tries to maximize its local function in order to optimize network modularity defined by function Q, rather than optimize function Q from the global view as traditional methods. Both the efficiency and effectiveness of this algorithm are tested against computer-generated and real-world networks. Experimental result","authors_text":"Bo Yang, Dayou Liu, Di Jin, Jie Liu","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-24T03:32:44Z","title":"Fast Complex Network Clustering Algorithm Using Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5912","kind":"arxiv","version":1},"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:f2c712f8a329000ed752fc96e203fd31004c04b49304b31d7bd6b4cf1a52e0b9","target":"record","created_at":"2026-05-18T03:30:00Z","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":"e1215973370bfc86460d446c7ba735d2c48fb40144b6646010d9a858684082c1","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-24T03:32:44Z","title_canon_sha256":"f3b408eff4c51e6f534375a2d969af36a64f6f958c38b3b4eac710452898abd6"},"schema_version":"1.0","source":{"id":"1303.5912","kind":"arxiv","version":1}},"canonical_sha256":"219a276bcd31dce37b0af5b807bddf15c6736af575a7605c8b4324e6a7ea49b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"219a276bcd31dce37b0af5b807bddf15c6736af575a7605c8b4324e6a7ea49b6","first_computed_at":"2026-05-18T03:30:00.879045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:00.879045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yFH4Yb/7aoUcVeai021Cdz1WoAFv9dsuHXk2HFYxR3UokKD+pGLm0WajH+2eeUi655t3gDWt0tGp3u1WA57kAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:00.879819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2c712f8a329000ed752fc96e203fd31004c04b49304b31d7bd6b4cf1a52e0b9","sha256:4394aa96075583bafe55a0a231ecb724e11dffa82cfe8de5a1de72afdfec5dd8"],"state_sha256":"e0435c1845d45c1d31f434aeb1b99df3d46ad8e332d41ae092ac3d684ca3cb9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2b0JnITYIJ0G5kB33kcA8ip+QrN3wjLCdNr1POe1X5BBrxIO31zYVX/YjdIM7XTh/trNm8EdMbi53SlQdLF9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:24:19.888512Z","bundle_sha256":"331b22974dc11ec1da785efab5b269e1d5ef55f4d3bace2edf93465b8f6d7615"}}