{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VHSMIH7H44CVKM3HN5FGWXUYCP","short_pith_number":"pith:VHSMIH7H","schema_version":"1.0","canonical_sha256":"a9e4c41fe7e7055533676f4a6b5e9813edf2530fcf37dceafe96abe0138c5d05","source":{"kind":"arxiv","id":"1701.07221","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.07221","created_at":"2026-05-18T00:52:07.136008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07221v1","created_at":"2026-05-18T00:52:07.136008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07221","created_at":"2026-05-18T00:52:07.136008+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHSMIH7H44CV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHSMIH7H44CVKM3H","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHSMIH7H","created_at":"2026-05-18T12:31:49.984773+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/VHSMIH7H44CVKM3HN5FGWXUYCP","json":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP.json","graph_json":"https://pith.science/api/pith-number/VHSMIH7H44CVKM3HN5FGWXUYCP/graph.json","events_json":"https://pith.science/api/pith-number/VHSMIH7H44CVKM3HN5FGWXUYCP/events.json","paper":"https://pith.science/paper/VHSMIH7H"},"agent_actions":{"view_html":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP","download_json":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP.json","view_paper":"https://pith.science/paper/VHSMIH7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07221&json=true","fetch_graph":"https://pith.science/api/pith-number/VHSMIH7H44CVKM3HN5FGWXUYCP/graph.json","fetch_events":"https://pith.science/api/pith-number/VHSMIH7H44CVKM3HN5FGWXUYCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/action/storage_attestation","attest_author":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/action/author_attestation","sign_citation":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/action/citation_signature","submit_replication":"https://pith.science/pith/VHSMIH7H44CVKM3HN5FGWXUYCP/action/replication_record"}},"created_at":"2026-05-18T00:52:07.136008+00:00","updated_at":"2026-05-18T00:52:07.136008+00:00"}