{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VHSMIH7H44CVKM3HN5FGWXUYCP","short_pith_number":"pith:VHSMIH7H","canonical_record":{"source":{"id":"1701.07221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-25T09:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"34c09061dcb67f41d9e8197ef1fa1221cbda1fb021195be68f30a7840d919031","abstract_canon_sha256":"20f2fa07efde7db3900cca6a44a677f3aa45690fc90f1973b58ec72589e6fd05"},"schema_version":"1.0"},"canonical_sha256":"a9e4c41fe7e7055533676f4a6b5e9813edf2530fcf37dceafe96abe0138c5d05","source":{"kind":"arxiv","id":"1701.07221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07221","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07221v1","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07221","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"VHSMIH7H44CV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHSMIH7H44CVKM3H","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHSMIH7H","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VHSMIH7H44CVKM3HN5FGWXUYCP","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-25T09:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"34c09061dcb67f41d9e8197ef1fa1221cbda1fb021195be68f30a7840d919031","abstract_canon_sha256":"20f2fa07efde7db3900cca6a44a677f3aa45690fc90f1973b58ec72589e6fd05"},"schema_version":"1.0"},"canonical_sha256":"a9e4c41fe7e7055533676f4a6b5e9813edf2530fcf37dceafe96abe0138c5d05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:07.136532Z","signature_b64":"XW1B1RvqkXt7JhiNWGoFK4gDe0T4vgGW1hA4TwTA/DyVvUJgeA04JQkUfd+wVHjHURSQSdwviN/5L6gGB+VCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e4c41fe7e7055533676f4a6b5e9813edf2530fcf37dceafe96abe0138c5d05","last_reissued_at":"2026-05-18T00:52:07.135916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:07.135916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07221","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-18T00:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7q9ur2JI4p+BOZxRctXkuZJkbPbp6/bpNnPspsIk/IG7YzwlbA1QFRYSjhs/D6BWVPRQFiPcJ1LHyHwIxiODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:41:16.893023Z"},"content_sha256":"31d5cef60afe4abb5e6453b4861b8740fab3c8f938e950944010aa71e420b8a2","schema_version":"1.0","event_id":"sha256:31d5cef60afe4abb5e6453b4861b8740fab3c8f938e950944010aa71e420b8a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VHSMIH7H44CVKM3HN5FGWXUYCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Community-aware network sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aristides Gionis, Evimaria Terzi, Nikolaj Tatti, Polina Rozenshtein","submitted_at":"2017-01-25T09:32:15Z","abstract_excerpt":"Network sparsification aims to reduce the number of edges of a network while maintaining its structural properties; such properties include shortest paths, cuts, spectral measures, or network modularity. Sparsification has multiple applications, such as, speeding up graph-mining algorithms, graph visualization, as well as identifying the important network edges. In this paper we consider a novel formulation of the network-sparsification problem. In addition to the network, we also consider as input a set of communities. The goal is to sparsify the network so as to preserve the network structur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07221","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-18T00:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubBL4JrQyDFgqbLOh8DrXbZDTNE5LyjMWa7aLTRjJ/VkiNl0hfGnvHNXhW4SO/AoLg8dJC/ui9TpqBfTzE0uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:41:16.893680Z"},"content_sha256":"356b35191bb54dbe976d03fb387793919e136fde5d68f5442f7e899435559359","schema_version":"1.0","event_id":"sha256:356b35191bb54dbe976d03fb387793919e136fde5d68f5442f7e899435559359"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/bundle.json","state_url":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/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-26T06:41:16Z","links":{"resolver":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP","bundle":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/bundle.json","state":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VHSMIH7H44CVKM3HN5FGWXUYCP","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":"20f2fa07efde7db3900cca6a44a677f3aa45690fc90f1973b58ec72589e6fd05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-25T09:32:15Z","title_canon_sha256":"34c09061dcb67f41d9e8197ef1fa1221cbda1fb021195be68f30a7840d919031"},"schema_version":"1.0","source":{"id":"1701.07221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07221","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07221v1","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07221","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"VHSMIH7H44CV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHSMIH7H44CVKM3H","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHSMIH7H","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:356b35191bb54dbe976d03fb387793919e136fde5d68f5442f7e899435559359","target":"graph","created_at":"2026-05-18T00:52:07Z","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":"Network sparsification aims to reduce the number of edges of a network while maintaining its structural properties; such properties include shortest paths, cuts, spectral measures, or network modularity. Sparsification has multiple applications, such as, speeding up graph-mining algorithms, graph visualization, as well as identifying the important network edges. In this paper we consider a novel formulation of the network-sparsification problem. In addition to the network, we also consider as input a set of communities. The goal is to sparsify the network so as to preserve the network structur","authors_text":"Aristides Gionis, Evimaria Terzi, Nikolaj Tatti, Polina Rozenshtein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-25T09:32:15Z","title":"Community-aware network sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07221","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:31d5cef60afe4abb5e6453b4861b8740fab3c8f938e950944010aa71e420b8a2","target":"record","created_at":"2026-05-18T00:52:07Z","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":"20f2fa07efde7db3900cca6a44a677f3aa45690fc90f1973b58ec72589e6fd05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-25T09:32:15Z","title_canon_sha256":"34c09061dcb67f41d9e8197ef1fa1221cbda1fb021195be68f30a7840d919031"},"schema_version":"1.0","source":{"id":"1701.07221","kind":"arxiv","version":1}},"canonical_sha256":"a9e4c41fe7e7055533676f4a6b5e9813edf2530fcf37dceafe96abe0138c5d05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9e4c41fe7e7055533676f4a6b5e9813edf2530fcf37dceafe96abe0138c5d05","first_computed_at":"2026-05-18T00:52:07.135916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:07.135916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XW1B1RvqkXt7JhiNWGoFK4gDe0T4vgGW1hA4TwTA/DyVvUJgeA04JQkUfd+wVHjHURSQSdwviN/5L6gGB+VCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:07.136532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31d5cef60afe4abb5e6453b4861b8740fab3c8f938e950944010aa71e420b8a2","sha256:356b35191bb54dbe976d03fb387793919e136fde5d68f5442f7e899435559359"],"state_sha256":"4b0b3149424ddb0bb0fd171bf0db57a184df763d5a6da5e47b67988de1ec69a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnlidwQ2wqBt/JkdUSnENPE1utfuGSD11Z9HwRx0FxeJkqhEqpEtNC3bl5enIrhWNr9dSOQOeYvldiqjfbkaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:41:16.897214Z","bundle_sha256":"a3c511265b28806f3f80d22e8e9a2ee3b6a847f230f1b31b68505e7f459487c3"}}