{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:H7NS5ESZ4BAEALTJXJPUB7LPKS","short_pith_number":"pith:H7NS5ESZ","schema_version":"1.0","canonical_sha256":"3fdb2e9259e040402e69ba5f40fd6f5485fc158bd2ce1c3d39f6bef8e4041d12","source":{"kind":"arxiv","id":"1309.5762","version":3},"attestation_state":"computed","paper":{"title":"A new hierarchical clustering algorithm to identify non-overlapping like-minded communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bhanuteja Gullapalli, Hindol Adhya, Saswata Shannigrahi, Shyamal Kejriwal, Talasila Sai Deepak","submitted_at":"2013-09-23T11:01:20Z","abstract_excerpt":"A network has a non-overlapping community structure if the nodes of the network can be partitioned into disjoint sets such that each node in a set is densely connected to other nodes inside the set and sparsely connected to the nodes out- side it. There are many metrics to validate the efficacy of such a structure, such as clustering coefficient, betweenness, centrality, modularity and like-mindedness. Many methods have been proposed to optimize some of these metrics, but none of these works well on the recently introduced metric like-mindedness. To solve this problem, we propose a be- haviora"},"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":"1309.5762","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-09-23T11:01:20Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"d19a66dfffe526990c71156ad3faf04d5dee9f5aa1f80c7f2aa9a56948edf3af","abstract_canon_sha256":"7c019b4e8b9134d20d60c840e027dda20325b4fbf7311d7ac63acef36aff7b9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.584632Z","signature_b64":"yksO2+lLpEsr5ggFLOZj+LjaFJe2V5N8XX1zaGlTbcsgWBlvR5UyXHyXrgnj9uWZGSKUieSODcushpf5Y4bSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fdb2e9259e040402e69ba5f40fd6f5485fc158bd2ce1c3d39f6bef8e4041d12","last_reissued_at":"2026-05-18T01:11:00.583974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.583974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new hierarchical clustering algorithm to identify non-overlapping like-minded communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bhanuteja Gullapalli, Hindol Adhya, Saswata Shannigrahi, Shyamal Kejriwal, Talasila Sai Deepak","submitted_at":"2013-09-23T11:01:20Z","abstract_excerpt":"A network has a non-overlapping community structure if the nodes of the network can be partitioned into disjoint sets such that each node in a set is densely connected to other nodes inside the set and sparsely connected to the nodes out- side it. There are many metrics to validate the efficacy of such a structure, such as clustering coefficient, betweenness, centrality, modularity and like-mindedness. Many methods have been proposed to optimize some of these metrics, but none of these works well on the recently introduced metric like-mindedness. To solve this problem, we propose a be- haviora"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5762","kind":"arxiv","version":3},"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":"1309.5762","created_at":"2026-05-18T01:11:00.584067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5762v3","created_at":"2026-05-18T01:11:00.584067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5762","created_at":"2026-05-18T01:11:00.584067+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7NS5ESZ4BAE","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7NS5ESZ4BAEALTJ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7NS5ESZ","created_at":"2026-05-18T12:27:46.883200+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/H7NS5ESZ4BAEALTJXJPUB7LPKS","json":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS.json","graph_json":"https://pith.science/api/pith-number/H7NS5ESZ4BAEALTJXJPUB7LPKS/graph.json","events_json":"https://pith.science/api/pith-number/H7NS5ESZ4BAEALTJXJPUB7LPKS/events.json","paper":"https://pith.science/paper/H7NS5ESZ"},"agent_actions":{"view_html":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS","download_json":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS.json","view_paper":"https://pith.science/paper/H7NS5ESZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5762&json=true","fetch_graph":"https://pith.science/api/pith-number/H7NS5ESZ4BAEALTJXJPUB7LPKS/graph.json","fetch_events":"https://pith.science/api/pith-number/H7NS5ESZ4BAEALTJXJPUB7LPKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/action/storage_attestation","attest_author":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/action/author_attestation","sign_citation":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/action/citation_signature","submit_replication":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/action/replication_record"}},"created_at":"2026-05-18T01:11:00.584067+00:00","updated_at":"2026-05-18T01:11:00.584067+00:00"}