{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C6ENOQCVY3YUXGZ7GYGV3MFVAK","short_pith_number":"pith:C6ENOQCV","schema_version":"1.0","canonical_sha256":"1788d74055c6f14b9b3f360d5db0b502bce90dbeb68269509470a384da875199","source":{"kind":"arxiv","id":"1511.07210","version":1},"attestation_state":"computed","paper":{"title":"Nearest Neighbor search in Complex Network for Community Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"S.P. Ghrera, Suman Saha","submitted_at":"2015-11-23T13:06:39Z","abstract_excerpt":"Nearest neighbor search is a basic computational tool used extensively in almost research domains of computer science specially when dealing with large amount of data. However, the use of nearest neighbor search is restricted for the purpose of algorithmic development by the existence of the notion of nearness among the data points. The recent trend of research is on large, complex networks and their structural analysis, where nodes represent entities and edges represent any kind of relation between entities. Community detection in complex network is an important problem of much interest. In g"},"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":"1511.07210","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2015-11-23T13:06:39Z","cross_cats_sorted":[],"title_canon_sha256":"6c2dfc69b72fb55240633f4f3f9dc0bc4f3d25651958df370a56bbc6a72a9ce7","abstract_canon_sha256":"8fb1348d15825715d8c8bd414c5b75cdc9a63ac2539de930237c3eb923c4944f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.934445Z","signature_b64":"qQtFuLZp1hERnT2iyteiPPhTs5M1tphWTzB2BhPTukws3wqKOFQna/3WtNrB/5lZHj2DTKr5cx6wG5fJiiWHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1788d74055c6f14b9b3f360d5db0b502bce90dbeb68269509470a384da875199","last_reissued_at":"2026-05-18T01:26:11.933933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.933933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearest Neighbor search in Complex Network for Community Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"S.P. Ghrera, Suman Saha","submitted_at":"2015-11-23T13:06:39Z","abstract_excerpt":"Nearest neighbor search is a basic computational tool used extensively in almost research domains of computer science specially when dealing with large amount of data. However, the use of nearest neighbor search is restricted for the purpose of algorithmic development by the existence of the notion of nearness among the data points. The recent trend of research is on large, complex networks and their structural analysis, where nodes represent entities and edges represent any kind of relation between entities. Community detection in complex network is an important problem of much interest. In g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07210","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":"1511.07210","created_at":"2026-05-18T01:26:11.934015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07210v1","created_at":"2026-05-18T01:26:11.934015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07210","created_at":"2026-05-18T01:26:11.934015+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6ENOQCVY3YU","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6ENOQCVY3YUXGZ7","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6ENOQCV","created_at":"2026-05-18T12:29:14.074870+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/C6ENOQCVY3YUXGZ7GYGV3MFVAK","json":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK.json","graph_json":"https://pith.science/api/pith-number/C6ENOQCVY3YUXGZ7GYGV3MFVAK/graph.json","events_json":"https://pith.science/api/pith-number/C6ENOQCVY3YUXGZ7GYGV3MFVAK/events.json","paper":"https://pith.science/paper/C6ENOQCV"},"agent_actions":{"view_html":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK","download_json":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK.json","view_paper":"https://pith.science/paper/C6ENOQCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07210&json=true","fetch_graph":"https://pith.science/api/pith-number/C6ENOQCVY3YUXGZ7GYGV3MFVAK/graph.json","fetch_events":"https://pith.science/api/pith-number/C6ENOQCVY3YUXGZ7GYGV3MFVAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK/action/storage_attestation","attest_author":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK/action/author_attestation","sign_citation":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK/action/citation_signature","submit_replication":"https://pith.science/pith/C6ENOQCVY3YUXGZ7GYGV3MFVAK/action/replication_record"}},"created_at":"2026-05-18T01:26:11.934015+00:00","updated_at":"2026-05-18T01:26:11.934015+00:00"}