{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G3QLHWAXOQ7GEOG3SWKNLZO3Y7","short_pith_number":"pith:G3QLHWAX","schema_version":"1.0","canonical_sha256":"36e0b3d817743e6238db9594d5e5dbc7c540e408b6e7dd27baa14f4393b854ca","source":{"kind":"arxiv","id":"1505.00564","version":1},"attestation_state":"computed","paper":{"title":"Structure-Preserving Sparsification of Social Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christian L. Staudt, Dorothea Wagner, Gerd Lindner, Henning Meyerhenke, Michael Hamann","submitted_at":"2015-05-04T09:11:34Z","abstract_excerpt":"Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different contexts. We contribute the first systematic conceptual and experimental comparison of \\textit{edge sparsification} methods on a diverse set of network properties. It is shown that they can be understood as methods for rating edges by importance and then filtering globally by these scores. In addition, we propose a new sparsification method (\\textit{Local Degree}) which preserves edges leading to local hub nodes. All meth"},"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":"1505.00564","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.SI","submitted_at":"2015-05-04T09:11:34Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4e9c2ed2fd993184b806f22c909bb09a0f2bc866321ea8919990f98af03a6a8b","abstract_canon_sha256":"c2bd393acc92597862877cc47f1a88fbf545eed759c498a382f623aae07475a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:02.603264Z","signature_b64":"kegFNzGvcDrmNja/VyXR0e5YidZGB+VKtAyAr3FeUj4bHgDJSprSROgAxsO0DYJaIO5yX2zOMVx2+uDmYWTbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36e0b3d817743e6238db9594d5e5dbc7c540e408b6e7dd27baa14f4393b854ca","last_reissued_at":"2026-05-18T02:17:02.602446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:02.602446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure-Preserving Sparsification of Social Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christian L. Staudt, Dorothea Wagner, Gerd Lindner, Henning Meyerhenke, Michael Hamann","submitted_at":"2015-05-04T09:11:34Z","abstract_excerpt":"Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different contexts. We contribute the first systematic conceptual and experimental comparison of \\textit{edge sparsification} methods on a diverse set of network properties. It is shown that they can be understood as methods for rating edges by importance and then filtering globally by these scores. In addition, we propose a new sparsification method (\\textit{Local Degree}) which preserves edges leading to local hub nodes. All meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00564","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":"1505.00564","created_at":"2026-05-18T02:17:02.602575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00564v1","created_at":"2026-05-18T02:17:02.602575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00564","created_at":"2026-05-18T02:17:02.602575+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3QLHWAXOQ7G","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3QLHWAXOQ7GEOG3","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3QLHWAX","created_at":"2026-05-18T12:29:22.688609+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/G3QLHWAXOQ7GEOG3SWKNLZO3Y7","json":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7.json","graph_json":"https://pith.science/api/pith-number/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/graph.json","events_json":"https://pith.science/api/pith-number/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/events.json","paper":"https://pith.science/paper/G3QLHWAX"},"agent_actions":{"view_html":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7","download_json":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7.json","view_paper":"https://pith.science/paper/G3QLHWAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00564&json=true","fetch_graph":"https://pith.science/api/pith-number/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/graph.json","fetch_events":"https://pith.science/api/pith-number/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/action/storage_attestation","attest_author":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/action/author_attestation","sign_citation":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/action/citation_signature","submit_replication":"https://pith.science/pith/G3QLHWAXOQ7GEOG3SWKNLZO3Y7/action/replication_record"}},"created_at":"2026-05-18T02:17:02.602575+00:00","updated_at":"2026-05-18T02:17:02.602575+00:00"}