{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OYQSR65665HLHEGJ5KBP25BEVA","short_pith_number":"pith:OYQSR656","schema_version":"1.0","canonical_sha256":"762128fbbef74eb390c9ea82fd7424a81354124458a1fd3c9ab964e962724112","source":{"kind":"arxiv","id":"1206.0629","version":1},"attestation_state":"computed","paper":{"title":"DEMON: a Local-First Discovery Method for Overlapping Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Dino Pedreschi, Fosca Giannotti, Giulio Rossetti, Michele Coscia","submitted_at":"2012-06-04T14:22:10Z","abstract_excerpt":"Community discovery in complex networks is an interesting problem with a number of applications, especially in the knowledge extraction task in social and information networks. However, many large networks often lack a particular community organization at a global level. In these cases, traditional graph partitioning algorithms fail to let the latent knowledge embedded in modular structure emerge, because they impose a top-down global view of a network. We propose here a simple local-first approach to community discovery, able to unveil the modular organization of real complex networks. This i"},"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":"1206.0629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-04T14:22:10Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"09559ae369e6b263851a0b897430745e1b46f999b68950b2c16b83bc60eb3328","abstract_canon_sha256":"b67f2d8802279e1ce9a35176a4009f8a3ba26a0e66eceb9bb8a2639f429641d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:17.079788Z","signature_b64":"8ZmF2dmTpa0FkqUgT5ZmUUplOTjSQWurwGHveK/x+HA1BvICoyiN3FnieW4Z4Y9mtzA2xGUtDxk7qZoiudjGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762128fbbef74eb390c9ea82fd7424a81354124458a1fd3c9ab964e962724112","last_reissued_at":"2026-05-18T03:54:17.079231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:17.079231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DEMON: a Local-First Discovery Method for Overlapping Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Dino Pedreschi, Fosca Giannotti, Giulio Rossetti, Michele Coscia","submitted_at":"2012-06-04T14:22:10Z","abstract_excerpt":"Community discovery in complex networks is an interesting problem with a number of applications, especially in the knowledge extraction task in social and information networks. However, many large networks often lack a particular community organization at a global level. In these cases, traditional graph partitioning algorithms fail to let the latent knowledge embedded in modular structure emerge, because they impose a top-down global view of a network. We propose here a simple local-first approach to community discovery, able to unveil the modular organization of real complex networks. This i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0629","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":"1206.0629","created_at":"2026-05-18T03:54:17.079312+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0629v1","created_at":"2026-05-18T03:54:17.079312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0629","created_at":"2026-05-18T03:54:17.079312+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYQSR65665HL","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYQSR65665HLHEGJ","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYQSR656","created_at":"2026-05-18T12:27:18.751474+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/OYQSR65665HLHEGJ5KBP25BEVA","json":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA.json","graph_json":"https://pith.science/api/pith-number/OYQSR65665HLHEGJ5KBP25BEVA/graph.json","events_json":"https://pith.science/api/pith-number/OYQSR65665HLHEGJ5KBP25BEVA/events.json","paper":"https://pith.science/paper/OYQSR656"},"agent_actions":{"view_html":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA","download_json":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA.json","view_paper":"https://pith.science/paper/OYQSR656","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0629&json=true","fetch_graph":"https://pith.science/api/pith-number/OYQSR65665HLHEGJ5KBP25BEVA/graph.json","fetch_events":"https://pith.science/api/pith-number/OYQSR65665HLHEGJ5KBP25BEVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA/action/storage_attestation","attest_author":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA/action/author_attestation","sign_citation":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA/action/citation_signature","submit_replication":"https://pith.science/pith/OYQSR65665HLHEGJ5KBP25BEVA/action/replication_record"}},"created_at":"2026-05-18T03:54:17.079312+00:00","updated_at":"2026-05-18T03:54:17.079312+00:00"}