{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6VOOPYZW4A5CPJFUXL3TOFZQZM","short_pith_number":"pith:6VOOPYZW","schema_version":"1.0","canonical_sha256":"f55ce7e336e03a27a4b4baf7371730cb09a85cc61993587f30fc4868660f5eb6","source":{"kind":"arxiv","id":"1712.05110","version":1},"attestation_state":"computed","paper":{"title":"Optimality Of Community Structure In Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alexander Belyi, Carlo Ratti, Stanislav Sobolevsky","submitted_at":"2017-12-14T07:24:19Z","abstract_excerpt":"Community detection is one of the pivotal tools for discovering the structure of complex networks. Majority of community detection methods rely on optimization of certain quality functions characterizing the proposed community structure. Perhaps, the most commonly used of those quality functions is modularity. Many heuristics are claimed to be efficient in modularity maximization, which is usually justified in relative terms through comparison of their outcomes with those provided by other known algorithms. However as all the approaches are heuristics, while the complete brute-force is not fea"},"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":"1712.05110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-12-14T07:24:19Z","cross_cats_sorted":["physics.data-an","physics.soc-ph"],"title_canon_sha256":"b061cafbd1bdb9644631c92d45d7ffb167e86f1255e6ccce8c5b29aa15f6b759","abstract_canon_sha256":"c839dee88879a46ffaec5c1c499dc57bb42c2de53050f6d8a698cd6376b11843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:00.997331Z","signature_b64":"b7qhu7HC213+ZlS5qUbNU9ZGAoWRExcUlQ0W81XgOhVJYUHkpJUskx9JrPPHWs0zUXx6zCAahmVVkn5l+5haBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f55ce7e336e03a27a4b4baf7371730cb09a85cc61993587f30fc4868660f5eb6","last_reissued_at":"2026-05-18T00:28:00.996604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:00.996604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality Of Community Structure In Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alexander Belyi, Carlo Ratti, Stanislav Sobolevsky","submitted_at":"2017-12-14T07:24:19Z","abstract_excerpt":"Community detection is one of the pivotal tools for discovering the structure of complex networks. Majority of community detection methods rely on optimization of certain quality functions characterizing the proposed community structure. Perhaps, the most commonly used of those quality functions is modularity. Many heuristics are claimed to be efficient in modularity maximization, which is usually justified in relative terms through comparison of their outcomes with those provided by other known algorithms. However as all the approaches are heuristics, while the complete brute-force is not fea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05110","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":"1712.05110","created_at":"2026-05-18T00:28:00.996713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05110v1","created_at":"2026-05-18T00:28:00.996713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05110","created_at":"2026-05-18T00:28:00.996713+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VOOPYZW4A5C","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VOOPYZW4A5CPJFU","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VOOPYZW","created_at":"2026-05-18T12:31:03.183658+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/6VOOPYZW4A5CPJFUXL3TOFZQZM","json":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM.json","graph_json":"https://pith.science/api/pith-number/6VOOPYZW4A5CPJFUXL3TOFZQZM/graph.json","events_json":"https://pith.science/api/pith-number/6VOOPYZW4A5CPJFUXL3TOFZQZM/events.json","paper":"https://pith.science/paper/6VOOPYZW"},"agent_actions":{"view_html":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM","download_json":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM.json","view_paper":"https://pith.science/paper/6VOOPYZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05110&json=true","fetch_graph":"https://pith.science/api/pith-number/6VOOPYZW4A5CPJFUXL3TOFZQZM/graph.json","fetch_events":"https://pith.science/api/pith-number/6VOOPYZW4A5CPJFUXL3TOFZQZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM/action/storage_attestation","attest_author":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM/action/author_attestation","sign_citation":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM/action/citation_signature","submit_replication":"https://pith.science/pith/6VOOPYZW4A5CPJFUXL3TOFZQZM/action/replication_record"}},"created_at":"2026-05-18T00:28:00.996713+00:00","updated_at":"2026-05-18T00:28:00.996713+00:00"}