{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VDVYHI4BKBJV6ILALUQFWY7B3Y","short_pith_number":"pith:VDVYHI4B","schema_version":"1.0","canonical_sha256":"a8eb83a38150535f21605d205b63e1de190e3726e90f6359d5ae2b49b9fa1258","source":{"kind":"arxiv","id":"1801.07783","version":2},"attestation_state":"computed","paper":{"title":"A General Definition of Network Communities and the Corresponding Detection Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Amiya Nayak, Haoye Lu","submitted_at":"2018-01-23T21:48:12Z","abstract_excerpt":"Network structures, consisting of nodes and edges, have applications in almost all subjects. A set of nodes is called a community if the nodes have strong interrelations. Industries (including cell phone carriers and online social media companies) need community structures to allocate network resources and provide proper and accurate services. However, all the current detection algorithms are motivated by the practical problems, whose applicabilities in other fields are open to question. Thence, for a new community problem, researchers need to derive algorithms ad hoc, which is arduous and eve"},"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":"1801.07783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-23T21:48:12Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4a5948c6204c105775ceaf56bf40f49e20b2139370c7ad89523236182104cba9","abstract_canon_sha256":"32409ced16edd3c068a580e0db6c613e85b863b0d0538a48cfe1d7494ba58e07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:16.724445Z","signature_b64":"VCBmaueAXN1BLcwUeFd/2CpJvp7SDC6haIox+DHgsPYDxT9TDcXM473d4UZT6hjzLz4yI7MLPyx/FSvLaLUzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8eb83a38150535f21605d205b63e1de190e3726e90f6359d5ae2b49b9fa1258","last_reissued_at":"2026-05-17T23:54:16.723936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:16.723936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Definition of Network Communities and the Corresponding Detection Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Amiya Nayak, Haoye Lu","submitted_at":"2018-01-23T21:48:12Z","abstract_excerpt":"Network structures, consisting of nodes and edges, have applications in almost all subjects. A set of nodes is called a community if the nodes have strong interrelations. Industries (including cell phone carriers and online social media companies) need community structures to allocate network resources and provide proper and accurate services. However, all the current detection algorithms are motivated by the practical problems, whose applicabilities in other fields are open to question. Thence, for a new community problem, researchers need to derive algorithms ad hoc, which is arduous and eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07783","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":"1801.07783","created_at":"2026-05-17T23:54:16.724027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07783v2","created_at":"2026-05-17T23:54:16.724027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07783","created_at":"2026-05-17T23:54:16.724027+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDVYHI4BKBJV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDVYHI4BKBJV6ILA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDVYHI4B","created_at":"2026-05-18T12:32:59.047623+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/VDVYHI4BKBJV6ILALUQFWY7B3Y","json":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y.json","graph_json":"https://pith.science/api/pith-number/VDVYHI4BKBJV6ILALUQFWY7B3Y/graph.json","events_json":"https://pith.science/api/pith-number/VDVYHI4BKBJV6ILALUQFWY7B3Y/events.json","paper":"https://pith.science/paper/VDVYHI4B"},"agent_actions":{"view_html":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y","download_json":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y.json","view_paper":"https://pith.science/paper/VDVYHI4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07783&json=true","fetch_graph":"https://pith.science/api/pith-number/VDVYHI4BKBJV6ILALUQFWY7B3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/VDVYHI4BKBJV6ILALUQFWY7B3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y/action/storage_attestation","attest_author":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y/action/author_attestation","sign_citation":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y/action/citation_signature","submit_replication":"https://pith.science/pith/VDVYHI4BKBJV6ILALUQFWY7B3Y/action/replication_record"}},"created_at":"2026-05-17T23:54:16.724027+00:00","updated_at":"2026-05-17T23:54:16.724027+00:00"}