{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z24GRO7VIBF7JFTTYEN254YWVL","short_pith_number":"pith:Z24GRO7V","schema_version":"1.0","canonical_sha256":"ceb868bbf5404bf49673c11baef316aaeea8128164251eccee39e2f15bfee7c3","source":{"kind":"arxiv","id":"1110.0305","version":2},"attestation_state":"computed","paper":{"title":"Significant communities in large sparse networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Atieh Mirshahvalad, Johan Lindholm, Martin Rosvall, Mattias Derlen","submitted_at":"2011-10-03T09:07:22Z","abstract_excerpt":"Researchers use community-detection algorithms to reveal large-scale organization in biological and social networks, but community detection is useful only if the communities are significant and not a result of noisy data. To assess the statistical significance of the network communities, or the robustness of the detected structure, one approach is to perturb the network structure by removing links and measure how much the communities change. However, perturbing sparse networks is challenging because they are inherently sensitive; they shatter easily if links are removed. Here we propose a sim"},"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":"1110.0305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-10-03T09:07:22Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4372817336d65574fe847f6efebaf691bfd5c0c551889df92f49e8426cc41170","abstract_canon_sha256":"0d12a64f0da73b4f8c8fb1d8a142a5baae6e03de72fd9ff8b43239fd13c2e25c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:48.555256Z","signature_b64":"7zq1OOKxrP9zrM0nEZlmUsb+lewC4rfhmeC2sDTK4NHKSR94at6nC9tyQ2ag0X7k1kZbYNRWAo3ytmRuoiY7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb868bbf5404bf49673c11baef316aaeea8128164251eccee39e2f15bfee7c3","last_reissued_at":"2026-05-18T03:34:48.554572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:48.554572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Significant communities in large sparse networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Atieh Mirshahvalad, Johan Lindholm, Martin Rosvall, Mattias Derlen","submitted_at":"2011-10-03T09:07:22Z","abstract_excerpt":"Researchers use community-detection algorithms to reveal large-scale organization in biological and social networks, but community detection is useful only if the communities are significant and not a result of noisy data. To assess the statistical significance of the network communities, or the robustness of the detected structure, one approach is to perturb the network structure by removing links and measure how much the communities change. However, perturbing sparse networks is challenging because they are inherently sensitive; they shatter easily if links are removed. Here we propose a sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0305","kind":"arxiv","version":2},"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":"1110.0305","created_at":"2026-05-18T03:34:48.554675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0305v2","created_at":"2026-05-18T03:34:48.554675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0305","created_at":"2026-05-18T03:34:48.554675+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z24GRO7VIBF7","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z24GRO7VIBF7JFTT","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z24GRO7V","created_at":"2026-05-18T12:26:47.523578+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/Z24GRO7VIBF7JFTTYEN254YWVL","json":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL.json","graph_json":"https://pith.science/api/pith-number/Z24GRO7VIBF7JFTTYEN254YWVL/graph.json","events_json":"https://pith.science/api/pith-number/Z24GRO7VIBF7JFTTYEN254YWVL/events.json","paper":"https://pith.science/paper/Z24GRO7V"},"agent_actions":{"view_html":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL","download_json":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL.json","view_paper":"https://pith.science/paper/Z24GRO7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0305&json=true","fetch_graph":"https://pith.science/api/pith-number/Z24GRO7VIBF7JFTTYEN254YWVL/graph.json","fetch_events":"https://pith.science/api/pith-number/Z24GRO7VIBF7JFTTYEN254YWVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL/action/storage_attestation","attest_author":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL/action/author_attestation","sign_citation":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL/action/citation_signature","submit_replication":"https://pith.science/pith/Z24GRO7VIBF7JFTTYEN254YWVL/action/replication_record"}},"created_at":"2026-05-18T03:34:48.554675+00:00","updated_at":"2026-05-18T03:34:48.554675+00:00"}