{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H7NS5ESZ4BAEALTJXJPUB7LPKS","short_pith_number":"pith:H7NS5ESZ","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"},"canonical_sha256":"3fdb2e9259e040402e69ba5f40fd6f5485fc158bd2ce1c3d39f6bef8e4041d12","source":{"kind":"arxiv","id":"1309.5762","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5762","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5762v3","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5762","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"H7NS5ESZ4BAE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H7NS5ESZ4BAEALTJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H7NS5ESZ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H7NS5ESZ4BAEALTJXJPUB7LPKS","target":"record","payload":{"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"},"canonical_sha256":"3fdb2e9259e040402e69ba5f40fd6f5485fc158bd2ce1c3d39f6bef8e4041d12","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"},"source_kind":"arxiv","source_id":"1309.5762","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3Rm5gghSHh74JNyT2PLlkab+81c5igOP1l9KYcjpKMOWqogPUCnYMNq5Wb0dxoLt7aprGqbf1RtqSf0PgSvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:12:19.740674Z"},"content_sha256":"174140e7629c54e1c36c74e536c7f9bbe6f4b6bc06dd1c24bbf70673daacfe17","schema_version":"1.0","event_id":"sha256:174140e7629c54e1c36c74e536c7f9bbe6f4b6bc06dd1c24bbf70673daacfe17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H7NS5ESZ4BAEALTJXJPUB7LPKS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YB07SBiF2a/Aj69U2ILo0pxq/HmbY60BcuFfSrEQZQorTo1NiE7olebv1jsz/81p62HQhvwxZAyZv2O2VGfLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:12:19.741481Z"},"content_sha256":"f0397c03c2974208a0a645b8b32f552d5373de867342704c870cc7d4a764d1e0","schema_version":"1.0","event_id":"sha256:f0397c03c2974208a0a645b8b32f552d5373de867342704c870cc7d4a764d1e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/bundle.json","state_url":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T06:12:19Z","links":{"resolver":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS","bundle":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/bundle.json","state":"https://pith.science/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7NS5ESZ4BAEALTJXJPUB7LPKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H7NS5ESZ4BAEALTJXJPUB7LPKS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7c019b4e8b9134d20d60c840e027dda20325b4fbf7311d7ac63acef36aff7b9e","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-09-23T11:01:20Z","title_canon_sha256":"d19a66dfffe526990c71156ad3faf04d5dee9f5aa1f80c7f2aa9a56948edf3af"},"schema_version":"1.0","source":{"id":"1309.5762","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5762","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5762v3","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5762","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"H7NS5ESZ4BAE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H7NS5ESZ4BAEALTJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H7NS5ESZ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:f0397c03c2974208a0a645b8b32f552d5373de867342704c870cc7d4a764d1e0","target":"graph","created_at":"2026-05-18T01:11:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bhanuteja Gullapalli, Hindol Adhya, Saswata Shannigrahi, Shyamal Kejriwal, Talasila Sai Deepak","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-09-23T11:01:20Z","title":"A new hierarchical clustering algorithm to identify non-overlapping like-minded communities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5762","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:174140e7629c54e1c36c74e536c7f9bbe6f4b6bc06dd1c24bbf70673daacfe17","target":"record","created_at":"2026-05-18T01:11:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7c019b4e8b9134d20d60c840e027dda20325b4fbf7311d7ac63acef36aff7b9e","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-09-23T11:01:20Z","title_canon_sha256":"d19a66dfffe526990c71156ad3faf04d5dee9f5aa1f80c7f2aa9a56948edf3af"},"schema_version":"1.0","source":{"id":"1309.5762","kind":"arxiv","version":3}},"canonical_sha256":"3fdb2e9259e040402e69ba5f40fd6f5485fc158bd2ce1c3d39f6bef8e4041d12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fdb2e9259e040402e69ba5f40fd6f5485fc158bd2ce1c3d39f6bef8e4041d12","first_computed_at":"2026-05-18T01:11:00.583974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.583974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yksO2+lLpEsr5ggFLOZj+LjaFJe2V5N8XX1zaGlTbcsgWBlvR5UyXHyXrgnj9uWZGSKUieSODcushpf5Y4bSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.584632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5762","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:174140e7629c54e1c36c74e536c7f9bbe6f4b6bc06dd1c24bbf70673daacfe17","sha256:f0397c03c2974208a0a645b8b32f552d5373de867342704c870cc7d4a764d1e0"],"state_sha256":"1a8ecb6b8fb6c9dec98bc0e8f6771fe5575e8a522ac3bf16f137698fe229f35d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSeFHKExs5XgzELJ2xl7KWO9FtKXxLVObl5mpf+fcc0A2NkHkLgqaW17J4Yx1zW2NpZ/dCsI5WEihxzE4799AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:12:19.745413Z","bundle_sha256":"86beee6fa75436c9dbe76376dd0099dfe9544b7cee944b1799b68a520b657bad"}}