{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TDWC7JUFPWPBKUWPKP5AUSBWGL","short_pith_number":"pith:TDWC7JUF","schema_version":"1.0","canonical_sha256":"98ec2fa6857d9e1552cf53fa0a483632e8b7125f80a4451173336f70da0e4e81","source":{"kind":"arxiv","id":"1902.01483","version":1},"attestation_state":"computed","paper":{"title":"Discovering Nested Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aristides Gionis, Nikolaj Tatti","submitted_at":"2019-02-04T22:30:08Z","abstract_excerpt":"Finding communities in graphs is one of the most well-studied problems in data mining and social-network analysis. In many real applications, the underlying graph does not have a clear community structure. In those cases, selecting a single community turns out to be a fairly ill-posed problem, as the optimization criterion has to make a difficult choice between selecting a tight but small community or a more inclusive but sparser community.\n  In order to avoid the problem of selecting only a single community we propose discovering a sequence of nested communities. More formally, given a graph "},"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":"1902.01483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T22:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"c1513bb10778e9f18da3f573690125d372bf2326d409c438e21e165b1159107f","abstract_canon_sha256":"a6c0c7b1a289887129e604b4b4c9dda4a05eb9eefd5dc67955e8bd695a20653d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:47.576002Z","signature_b64":"sNuKmPsraVvRrSoPGsj0rsFyONtrGLJsUuoMp5m4KfNfE4VUqGS5BYjagj8Uj65efa/aINUKrFgcHBDnWwa+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98ec2fa6857d9e1552cf53fa0a483632e8b7125f80a4451173336f70da0e4e81","last_reissued_at":"2026-05-17T23:54:47.575579Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:47.575579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering Nested Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aristides Gionis, Nikolaj Tatti","submitted_at":"2019-02-04T22:30:08Z","abstract_excerpt":"Finding communities in graphs is one of the most well-studied problems in data mining and social-network analysis. In many real applications, the underlying graph does not have a clear community structure. In those cases, selecting a single community turns out to be a fairly ill-posed problem, as the optimization criterion has to make a difficult choice between selecting a tight but small community or a more inclusive but sparser community.\n  In order to avoid the problem of selecting only a single community we propose discovering a sequence of nested communities. More formally, given a graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01483","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":"1902.01483","created_at":"2026-05-17T23:54:47.575642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01483v1","created_at":"2026-05-17T23:54:47.575642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01483","created_at":"2026-05-17T23:54:47.575642+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDWC7JUFPWPB","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDWC7JUFPWPBKUWP","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDWC7JUF","created_at":"2026-05-18T12:33:27.125529+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/TDWC7JUFPWPBKUWPKP5AUSBWGL","json":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL.json","graph_json":"https://pith.science/api/pith-number/TDWC7JUFPWPBKUWPKP5AUSBWGL/graph.json","events_json":"https://pith.science/api/pith-number/TDWC7JUFPWPBKUWPKP5AUSBWGL/events.json","paper":"https://pith.science/paper/TDWC7JUF"},"agent_actions":{"view_html":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL","download_json":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL.json","view_paper":"https://pith.science/paper/TDWC7JUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01483&json=true","fetch_graph":"https://pith.science/api/pith-number/TDWC7JUFPWPBKUWPKP5AUSBWGL/graph.json","fetch_events":"https://pith.science/api/pith-number/TDWC7JUFPWPBKUWPKP5AUSBWGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL/action/storage_attestation","attest_author":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL/action/author_attestation","sign_citation":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL/action/citation_signature","submit_replication":"https://pith.science/pith/TDWC7JUFPWPBKUWPKP5AUSBWGL/action/replication_record"}},"created_at":"2026-05-17T23:54:47.575642+00:00","updated_at":"2026-05-17T23:54:47.575642+00:00"}