{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HM3KS2YYUFC3U2WXTKWP23HG7N","short_pith_number":"pith:HM3KS2YY","schema_version":"1.0","canonical_sha256":"3b36a96b18a145ba6ad79aacfd6ce6fb53879ecd8a8d2a8b52ae445f5c7dd9a6","source":{"kind":"arxiv","id":"1708.08305","version":2},"attestation_state":"computed","paper":{"title":"Community detection using preference networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Haluk O. Bingol, Mursel Tasgin","submitted_at":"2017-08-28T13:13:29Z","abstract_excerpt":"Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses in identifying similar functions or roles of nodes in many biological, social and computer networks. With the availability of very large networks in recent years, performance and scalability of community detection algorithms become crucial, i.e. if time complexity of an algorithm is high, it can not run on large networks. In this paper, we propose a new community detection algorith"},"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":"1708.08305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-08-28T13:13:29Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"937f58d639b75bab7f260e84d8210182978d89cef3334aac643f432b6da3dcfc","abstract_canon_sha256":"90a083567570e09abe63e30760a2df01d936df15958e59d073f0201ac72839e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:45.764932Z","signature_b64":"V4QApmLhkKMWeWKvFByhBYjoAkFOWhLUK733ht2i7jsDFCF23m0AweNwuLqXIzyHwYIyOr3RiRIWmHfRW9TRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b36a96b18a145ba6ad79aacfd6ce6fb53879ecd8a8d2a8b52ae445f5c7dd9a6","last_reissued_at":"2026-05-18T00:26:45.764294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:45.764294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community detection using preference networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Haluk O. Bingol, Mursel Tasgin","submitted_at":"2017-08-28T13:13:29Z","abstract_excerpt":"Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses in identifying similar functions or roles of nodes in many biological, social and computer networks. With the availability of very large networks in recent years, performance and scalability of community detection algorithms become crucial, i.e. if time complexity of an algorithm is high, it can not run on large networks. In this paper, we propose a new community detection algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08305","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":"1708.08305","created_at":"2026-05-18T00:26:45.764402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08305v2","created_at":"2026-05-18T00:26:45.764402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08305","created_at":"2026-05-18T00:26:45.764402+00:00"},{"alias_kind":"pith_short_12","alias_value":"HM3KS2YYUFC3","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HM3KS2YYUFC3U2WX","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HM3KS2YY","created_at":"2026-05-18T12:31:18.294218+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/HM3KS2YYUFC3U2WXTKWP23HG7N","json":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N.json","graph_json":"https://pith.science/api/pith-number/HM3KS2YYUFC3U2WXTKWP23HG7N/graph.json","events_json":"https://pith.science/api/pith-number/HM3KS2YYUFC3U2WXTKWP23HG7N/events.json","paper":"https://pith.science/paper/HM3KS2YY"},"agent_actions":{"view_html":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N","download_json":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N.json","view_paper":"https://pith.science/paper/HM3KS2YY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08305&json=true","fetch_graph":"https://pith.science/api/pith-number/HM3KS2YYUFC3U2WXTKWP23HG7N/graph.json","fetch_events":"https://pith.science/api/pith-number/HM3KS2YYUFC3U2WXTKWP23HG7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N/action/storage_attestation","attest_author":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N/action/author_attestation","sign_citation":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N/action/citation_signature","submit_replication":"https://pith.science/pith/HM3KS2YYUFC3U2WXTKWP23HG7N/action/replication_record"}},"created_at":"2026-05-18T00:26:45.764402+00:00","updated_at":"2026-05-18T00:26:45.764402+00:00"}