{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G2HBAUJK4C7ZU5O3RXL3COPL24","short_pith_number":"pith:G2HBAUJK","schema_version":"1.0","canonical_sha256":"368e10512ae0bf9a75db8dd7b139ebd70cfa5cfb802680bffb2a9484cda5833b","source":{"kind":"arxiv","id":"1407.6071","version":5},"attestation_state":"computed","paper":{"title":"Deep Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alfred O. Hero, Pin-Yu Chen","submitted_at":"2014-07-22T23:39:48Z","abstract_excerpt":"A deep community in a graph is a connected component that can only be seen after removal of nodes or edges from the rest of the graph. This paper formulates the problem of detecting deep communities as multi-stage node removal that maximizes a new centrality measure, called the local Fiedler vector centrality (LFVC), at each stage. The LFVC is associated with the sensitivity of algebraic connectivity to node or edge removals. We prove that a greedy node/edge removal strategy, based on successive maximization of LFVC, has bounded performance loss relative to the optimal, but intractable, combin"},"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":"1407.6071","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-22T23:39:48Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ba3c63b8c4b6021bb9baf86e1bc27dd08020344b9a90704506dcd1d0f5ac874c","abstract_canon_sha256":"83173787f8866eed47084c44654c74e56518ecec81fbdceadb93a2aca83be423"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:05.517976Z","signature_b64":"28ia6cjxF7vuFX2cVZy2/qrjfURnUAotgYz2OEFWc2aEiEs+HpooDVrphO4jDFDf0pEs1J6ZIJtHu1Wcr0caAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368e10512ae0bf9a75db8dd7b139ebd70cfa5cfb802680bffb2a9484cda5833b","last_reissued_at":"2026-05-18T01:29:05.517304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:05.517304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alfred O. Hero, Pin-Yu Chen","submitted_at":"2014-07-22T23:39:48Z","abstract_excerpt":"A deep community in a graph is a connected component that can only be seen after removal of nodes or edges from the rest of the graph. This paper formulates the problem of detecting deep communities as multi-stage node removal that maximizes a new centrality measure, called the local Fiedler vector centrality (LFVC), at each stage. The LFVC is associated with the sensitivity of algebraic connectivity to node or edge removals. We prove that a greedy node/edge removal strategy, based on successive maximization of LFVC, has bounded performance loss relative to the optimal, but intractable, combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6071","kind":"arxiv","version":5},"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":"1407.6071","created_at":"2026-05-18T01:29:05.517426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6071v5","created_at":"2026-05-18T01:29:05.517426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6071","created_at":"2026-05-18T01:29:05.517426+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2HBAUJK4C7Z","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2HBAUJK4C7ZU5O3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2HBAUJK","created_at":"2026-05-18T12:28:28.263976+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/G2HBAUJK4C7ZU5O3RXL3COPL24","json":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24.json","graph_json":"https://pith.science/api/pith-number/G2HBAUJK4C7ZU5O3RXL3COPL24/graph.json","events_json":"https://pith.science/api/pith-number/G2HBAUJK4C7ZU5O3RXL3COPL24/events.json","paper":"https://pith.science/paper/G2HBAUJK"},"agent_actions":{"view_html":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24","download_json":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24.json","view_paper":"https://pith.science/paper/G2HBAUJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6071&json=true","fetch_graph":"https://pith.science/api/pith-number/G2HBAUJK4C7ZU5O3RXL3COPL24/graph.json","fetch_events":"https://pith.science/api/pith-number/G2HBAUJK4C7ZU5O3RXL3COPL24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24/action/storage_attestation","attest_author":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24/action/author_attestation","sign_citation":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24/action/citation_signature","submit_replication":"https://pith.science/pith/G2HBAUJK4C7ZU5O3RXL3COPL24/action/replication_record"}},"created_at":"2026-05-18T01:29:05.517426+00:00","updated_at":"2026-05-18T01:29:05.517426+00:00"}