{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3PDMONIUL2PI3UMPZ5VXQVRWMW","short_pith_number":"pith:3PDMONIU","schema_version":"1.0","canonical_sha256":"dbc6c735145e9e8dd18fcf6b78563665bda4709465b3b8be706903a9e8476437","source":{"kind":"arxiv","id":"1611.04308","version":4},"attestation_state":"computed","paper":{"title":"Uncertain Graph Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Dimitris Papadias, Francesco Bonchi, Nikolaos Papailiou, Panos Parchas","submitted_at":"2016-11-14T09:58:11Z","abstract_excerpt":"Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely expensive. Sparsification has often been used to reduce the size of deterministic graphs by maintaining only the important edges. However, adaptation of deterministic sparsification methods fails in the uncertain setting. To overcome this problem, we introduce the first sparsification techniques aimed explicitly at uncertain graphs. The proposed methods reduce "},"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":"1611.04308","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T09:58:11Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"3cb5d84d4d537709c46d6875d424eaeff897e0890784cd794a1110db60265c3d","abstract_canon_sha256":"791134418062b2c6db2f70dca7f5899933ee33ada1fce34b8c0419853c5e5046"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.241826Z","signature_b64":"axDzpEhb+NHd4472JmqxzlFmgxuEaGlrBDamrIp2LDHNHLnjkojxjBXgZ+GYV3tn6K/tlz+83Jfq0TAEHrmBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc6c735145e9e8dd18fcf6b78563665bda4709465b3b8be706903a9e8476437","last_reissued_at":"2026-05-18T00:43:45.241054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.241054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertain Graph Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Dimitris Papadias, Francesco Bonchi, Nikolaos Papailiou, Panos Parchas","submitted_at":"2016-11-14T09:58:11Z","abstract_excerpt":"Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely expensive. Sparsification has often been used to reduce the size of deterministic graphs by maintaining only the important edges. However, adaptation of deterministic sparsification methods fails in the uncertain setting. To overcome this problem, we introduce the first sparsification techniques aimed explicitly at uncertain graphs. The proposed methods reduce "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04308","kind":"arxiv","version":4},"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":"1611.04308","created_at":"2026-05-18T00:43:45.241165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04308v4","created_at":"2026-05-18T00:43:45.241165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04308","created_at":"2026-05-18T00:43:45.241165+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PDMONIUL2PI","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PDMONIUL2PI3UMP","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PDMONIU","created_at":"2026-05-18T12:29:55.572404+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/3PDMONIUL2PI3UMPZ5VXQVRWMW","json":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW.json","graph_json":"https://pith.science/api/pith-number/3PDMONIUL2PI3UMPZ5VXQVRWMW/graph.json","events_json":"https://pith.science/api/pith-number/3PDMONIUL2PI3UMPZ5VXQVRWMW/events.json","paper":"https://pith.science/paper/3PDMONIU"},"agent_actions":{"view_html":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW","download_json":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW.json","view_paper":"https://pith.science/paper/3PDMONIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04308&json=true","fetch_graph":"https://pith.science/api/pith-number/3PDMONIUL2PI3UMPZ5VXQVRWMW/graph.json","fetch_events":"https://pith.science/api/pith-number/3PDMONIUL2PI3UMPZ5VXQVRWMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW/action/storage_attestation","attest_author":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW/action/author_attestation","sign_citation":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW/action/citation_signature","submit_replication":"https://pith.science/pith/3PDMONIUL2PI3UMPZ5VXQVRWMW/action/replication_record"}},"created_at":"2026-05-18T00:43:45.241165+00:00","updated_at":"2026-05-18T00:43:45.241165+00:00"}