{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:UT7SEUA44NUJJ6USN65XNJU4FG","short_pith_number":"pith:UT7SEUA4","schema_version":"1.0","canonical_sha256":"a4ff22501ce36894fa926fbb76a69c298ab4d67e4c5f018f3b724b9e737830a8","source":{"kind":"arxiv","id":"0810.1355","version":1},"attestation_state":"computed","paper":{"title":"Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Anirban Dasgupta, Jure Leskovec, Kevin J. Lang, Michael W. Mahoney","submitted_at":"2008-10-08T05:42:43Z","abstract_excerpt":"A large body of work has been devoted to defining and identifying clusters or communities in social and information networks. We explore from a novel perspective several questions related to identifying meaningful communities in large social and information networks, and we come to several striking conclusions. We employ approximation algorithms for the graph partitioning problem to characterize as a function of size the statistical and structural properties of partitions of graphs that could plausibly be interpreted as communities. In particular, we define the network community profile plot, "},"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":"0810.1355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-10-08T05:42:43Z","cross_cats_sorted":["physics.data-an","physics.soc-ph"],"title_canon_sha256":"f03850e9a71955c12a297a9f0bd04b7740a6e40cfbc202f9385beee35a742d02","abstract_canon_sha256":"3ab0ee11dea45e0ede1d724c207519aabfdd4d589aec78f7ef54c784bdd6eb35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:15:02.076222Z","signature_b64":"Q0P+P7ZhFJQlPyonUa8wfWdd8LVicb57Ts1x6I+f4JeerRjT3wVGMeDxQ6ao4SS04i7revGW3OFHfhFp+d8fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ff22501ce36894fa926fbb76a69c298ab4d67e4c5f018f3b724b9e737830a8","last_reissued_at":"2026-07-04T15:15:02.075811Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:15:02.075811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Anirban Dasgupta, Jure Leskovec, Kevin J. Lang, Michael W. Mahoney","submitted_at":"2008-10-08T05:42:43Z","abstract_excerpt":"A large body of work has been devoted to defining and identifying clusters or communities in social and information networks. We explore from a novel perspective several questions related to identifying meaningful communities in large social and information networks, and we come to several striking conclusions. We employ approximation algorithms for the graph partitioning problem to characterize as a function of size the statistical and structural properties of partitions of graphs that could plausibly be interpreted as communities. In particular, we define the network community profile plot, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1355","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0810.1355/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0810.1355","created_at":"2026-07-04T15:15:02.075870+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.1355v1","created_at":"2026-07-04T15:15:02.075870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1355","created_at":"2026-07-04T15:15:02.075870+00:00"},{"alias_kind":"pith_short_12","alias_value":"UT7SEUA44NUJ","created_at":"2026-07-04T15:15:02.075870+00:00"},{"alias_kind":"pith_short_16","alias_value":"UT7SEUA44NUJJ6US","created_at":"2026-07-04T15:15:02.075870+00:00"},{"alias_kind":"pith_short_8","alias_value":"UT7SEUA4","created_at":"2026-07-04T15:15:02.075870+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/UT7SEUA44NUJJ6USN65XNJU4FG","json":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG.json","graph_json":"https://pith.science/api/pith-number/UT7SEUA44NUJJ6USN65XNJU4FG/graph.json","events_json":"https://pith.science/api/pith-number/UT7SEUA44NUJJ6USN65XNJU4FG/events.json","paper":"https://pith.science/paper/UT7SEUA4"},"agent_actions":{"view_html":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG","download_json":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG.json","view_paper":"https://pith.science/paper/UT7SEUA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.1355&json=true","fetch_graph":"https://pith.science/api/pith-number/UT7SEUA44NUJJ6USN65XNJU4FG/graph.json","fetch_events":"https://pith.science/api/pith-number/UT7SEUA44NUJJ6USN65XNJU4FG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG/action/storage_attestation","attest_author":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG/action/author_attestation","sign_citation":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG/action/citation_signature","submit_replication":"https://pith.science/pith/UT7SEUA44NUJJ6USN65XNJU4FG/action/replication_record"}},"created_at":"2026-07-04T15:15:02.075870+00:00","updated_at":"2026-07-04T15:15:02.075870+00:00"}