{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RIHSV3ORLHPYYXCLFBXT3G3P6R","short_pith_number":"pith:RIHSV3OR","schema_version":"1.0","canonical_sha256":"8a0f2aedd159df8c5c4b286f3d9b6ff47fd14381f32885755c2af8212df2bd2a","source":{"kind":"arxiv","id":"1401.6733","version":1},"attestation_state":"computed","paper":{"title":"Walk modularity and community structure in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Amy Strosser, Anthony Harkin, David Mehrle","submitted_at":"2014-01-27T03:48:04Z","abstract_excerpt":"Modularity maximization has been one of the most widely used approaches in the last decade for discovering community structure in networks of practical interest in biology, computing, social science, statistical mechanics, and more. Modularity is a quality function that measures the difference between the number of edges found within clusters minus the number of edges one would statistically expect to find based on random chance. We present a natural generalization of modularity based on the difference between the actual and expected number of walks within clusters, which we call walk-modulari"},"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":"1401.6733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-01-27T03:48:04Z","cross_cats_sorted":["cs.SI","physics.data-an"],"title_canon_sha256":"803ed001e96260f15c8509765a6e378fd1ff18ddc07124c7e9764646581265b7","abstract_canon_sha256":"e51fab7f3476f921c93a17c8e3b02cc72f88ed47a817638d5b0dbf809e66d0af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.699269Z","signature_b64":"fl7/i6yQSuL6G3sxl0VuWT22LRZoLGEp4JoTnBbmyBlV5DkHQBH3c3w0iwP5I/JaPo2hJcPcFO6tn1MO+PiEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a0f2aedd159df8c5c4b286f3d9b6ff47fd14381f32885755c2af8212df2bd2a","last_reissued_at":"2026-05-18T00:31:00.698602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.698602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walk modularity and community structure in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Amy Strosser, Anthony Harkin, David Mehrle","submitted_at":"2014-01-27T03:48:04Z","abstract_excerpt":"Modularity maximization has been one of the most widely used approaches in the last decade for discovering community structure in networks of practical interest in biology, computing, social science, statistical mechanics, and more. Modularity is a quality function that measures the difference between the number of edges found within clusters minus the number of edges one would statistically expect to find based on random chance. We present a natural generalization of modularity based on the difference between the actual and expected number of walks within clusters, which we call walk-modulari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6733","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":"1401.6733","created_at":"2026-05-18T00:31:00.698691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6733v1","created_at":"2026-05-18T00:31:00.698691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6733","created_at":"2026-05-18T00:31:00.698691+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIHSV3ORLHPY","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIHSV3ORLHPYYXCL","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIHSV3OR","created_at":"2026-05-18T12:28:46.137349+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/RIHSV3ORLHPYYXCLFBXT3G3P6R","json":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R.json","graph_json":"https://pith.science/api/pith-number/RIHSV3ORLHPYYXCLFBXT3G3P6R/graph.json","events_json":"https://pith.science/api/pith-number/RIHSV3ORLHPYYXCLFBXT3G3P6R/events.json","paper":"https://pith.science/paper/RIHSV3OR"},"agent_actions":{"view_html":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R","download_json":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R.json","view_paper":"https://pith.science/paper/RIHSV3OR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6733&json=true","fetch_graph":"https://pith.science/api/pith-number/RIHSV3ORLHPYYXCLFBXT3G3P6R/graph.json","fetch_events":"https://pith.science/api/pith-number/RIHSV3ORLHPYYXCLFBXT3G3P6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R/action/storage_attestation","attest_author":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R/action/author_attestation","sign_citation":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R/action/citation_signature","submit_replication":"https://pith.science/pith/RIHSV3ORLHPYYXCLFBXT3G3P6R/action/replication_record"}},"created_at":"2026-05-18T00:31:00.698691+00:00","updated_at":"2026-05-18T00:31:00.698691+00:00"}