{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IBSSTPNSDFKIALSZSFOR2YBSNA","short_pith_number":"pith:IBSSTPNS","canonical_record":{"source":{"id":"1601.00286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-01-03T12:28:37Z","cross_cats_sorted":["cs.DC","physics.soc-ph"],"title_canon_sha256":"dda6219a86ce3efdc31b1a248d00fb0fcd17d867428c9bc5d9629bf6ad8d7f55","abstract_canon_sha256":"625cab3da2a1f40876daf28aa25059518962c8e2ee3aed544ab6555d39672d51"},"schema_version":"1.0"},"canonical_sha256":"406529bdb21954802e59915d1d60326835b01723a3e6cc9716d0e3a6fa40a0b6","source":{"kind":"arxiv","id":"1601.00286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00286","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00286v1","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00286","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"IBSSTPNSDFKI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IBSSTPNSDFKIALSZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IBSSTPNS","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IBSSTPNSDFKIALSZSFOR2YBSNA","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-01-03T12:28:37Z","cross_cats_sorted":["cs.DC","physics.soc-ph"],"title_canon_sha256":"dda6219a86ce3efdc31b1a248d00fb0fcd17d867428c9bc5d9629bf6ad8d7f55","abstract_canon_sha256":"625cab3da2a1f40876daf28aa25059518962c8e2ee3aed544ab6555d39672d51"},"schema_version":"1.0"},"canonical_sha256":"406529bdb21954802e59915d1d60326835b01723a3e6cc9716d0e3a6fa40a0b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:27.913767Z","signature_b64":"jHOz9mcllgQqBI2o2wqdjl9FuFrfhs1Skora2TzpRKQTirKv6k9SklHCZIp63KM07QlLSE5KWDiBR+oagG/yDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"406529bdb21954802e59915d1d60326835b01723a3e6cc9716d0e3a6fa40a0b6","last_reissued_at":"2026-05-18T01:23:27.913084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:27.913084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00286","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnNbT1Mnc/1giMtPZ+tmwSMqSR3PS9qinlMS6Ji5rDE4lZps7dCsRrKa4To7KUt03i2LzF37kncXkifrjRT1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:28:14.696936Z"},"content_sha256":"0fb2498111a182153e9a39d5f0f5bf117835d98254e373263cc3c1392547f44a","schema_version":"1.0","event_id":"sha256:0fb2498111a182153e9a39d5f0f5bf117835d98254e373263cc3c1392547f44a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IBSSTPNSDFKIALSZSFOR2YBSNA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure-Preserving Sparsification Methods for Social Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christian L. Staudt, Dorothea Wagner, Gerd Lindner, Henning Meyerhenke, Michael Hamann","submitted_at":"2016-01-03T12:28:37Z","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 or locally by these scores. We show that applying a local filtering technique improves the preservation of all kinds of properties. In addition, we pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00286","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cck9CirNatzzoqIGvNfnemrxT1KPgbUX7i5Q7mvUW3ZuLekudMGDnfX7k2YmWgCG0kHcqVPmVZpk1aPEYwXGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:28:14.697375Z"},"content_sha256":"c90e5e183bfd2ae0f0bde1b3a8353fb4b87bd4d6929f9827723f4e23c0981662","schema_version":"1.0","event_id":"sha256:c90e5e183bfd2ae0f0bde1b3a8353fb4b87bd4d6929f9827723f4e23c0981662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBSSTPNSDFKIALSZSFOR2YBSNA/bundle.json","state_url":"https://pith.science/pith/IBSSTPNSDFKIALSZSFOR2YBSNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBSSTPNSDFKIALSZSFOR2YBSNA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T02:28:14Z","links":{"resolver":"https://pith.science/pith/IBSSTPNSDFKIALSZSFOR2YBSNA","bundle":"https://pith.science/pith/IBSSTPNSDFKIALSZSFOR2YBSNA/bundle.json","state":"https://pith.science/pith/IBSSTPNSDFKIALSZSFOR2YBSNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBSSTPNSDFKIALSZSFOR2YBSNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IBSSTPNSDFKIALSZSFOR2YBSNA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"625cab3da2a1f40876daf28aa25059518962c8e2ee3aed544ab6555d39672d51","cross_cats_sorted":["cs.DC","physics.soc-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-01-03T12:28:37Z","title_canon_sha256":"dda6219a86ce3efdc31b1a248d00fb0fcd17d867428c9bc5d9629bf6ad8d7f55"},"schema_version":"1.0","source":{"id":"1601.00286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00286","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00286v1","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00286","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"IBSSTPNSDFKI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IBSSTPNSDFKIALSZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IBSSTPNS","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:c90e5e183bfd2ae0f0bde1b3a8353fb4b87bd4d6929f9827723f4e23c0981662","target":"graph","created_at":"2026-05-18T01:23:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 or locally by these scores. We show that applying a local filtering technique improves the preservation of all kinds of properties. In addition, we pro","authors_text":"Christian L. Staudt, Dorothea Wagner, Gerd Lindner, Henning Meyerhenke, Michael Hamann","cross_cats":["cs.DC","physics.soc-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-01-03T12:28:37Z","title":"Structure-Preserving Sparsification Methods for Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00286","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0fb2498111a182153e9a39d5f0f5bf117835d98254e373263cc3c1392547f44a","target":"record","created_at":"2026-05-18T01:23:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"625cab3da2a1f40876daf28aa25059518962c8e2ee3aed544ab6555d39672d51","cross_cats_sorted":["cs.DC","physics.soc-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-01-03T12:28:37Z","title_canon_sha256":"dda6219a86ce3efdc31b1a248d00fb0fcd17d867428c9bc5d9629bf6ad8d7f55"},"schema_version":"1.0","source":{"id":"1601.00286","kind":"arxiv","version":1}},"canonical_sha256":"406529bdb21954802e59915d1d60326835b01723a3e6cc9716d0e3a6fa40a0b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"406529bdb21954802e59915d1d60326835b01723a3e6cc9716d0e3a6fa40a0b6","first_computed_at":"2026-05-18T01:23:27.913084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:27.913084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jHOz9mcllgQqBI2o2wqdjl9FuFrfhs1Skora2TzpRKQTirKv6k9SklHCZIp63KM07QlLSE5KWDiBR+oagG/yDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:27.913767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fb2498111a182153e9a39d5f0f5bf117835d98254e373263cc3c1392547f44a","sha256:c90e5e183bfd2ae0f0bde1b3a8353fb4b87bd4d6929f9827723f4e23c0981662"],"state_sha256":"c27529ac04e39b1a6490df2ec627099161c85f02316b637fabe9aca13577c324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a0enxoMokmT4PLaInfxdKxRydOvUIHEYKzJYqOfbqyeA8CwutsrBlOHZB+5r1UFhf5kEFHwlqkL16T78L3yjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:28:14.700453Z","bundle_sha256":"c5cb7d3ca1091affc39c964a0c5e8637cdc76f1536eb014fc5aed3cdaa9645c2"}}