{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4TB2AFF4NCA6B7Y5FUOOHIOAFZ","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":"f184b94b35935e50922213e693d5302246ffb16554bef975111152a67f9fc67a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-11T12:34:48Z","title_canon_sha256":"219003b3fa7c84b5656dceadeb063746a31ea725eb609081168ee5b2a8732f44"},"schema_version":"1.0","source":{"id":"1806.03936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03936","created_at":"2026-05-18T00:13:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03936v1","created_at":"2026-05-18T00:13:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03936","created_at":"2026-05-18T00:13:41Z"},{"alias_kind":"pith_short_12","alias_value":"4TB2AFF4NCA6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TB2AFF4NCA6B7Y5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TB2AFF4","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:303f92612ae983687e506f48fde3da244f3b5e2008cd06f12af2926f63d735b1","target":"graph","created_at":"2026-05-18T00:13:41Z","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":"Massive sizes of real-world graphs, such as social networks and web graph, impose serious challenges to process and perform analytics on them. These issues can be resolved by working on a small summary of the graph instead . A summary is a compressed version of the graph that removes several details, yet preserves it's essential structure. Generally, some predefined quality measure of the summary is optimized to bound the approximation error incurred by working on the summary instead of the whole graph. All known summarization algorithms are computationally prohibitive and do not scale to larg","authors_text":"Arif Zaman, Imdadullah Khan, Maham Anwar Beg, Muhammad Ahmad","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-11T12:34:48Z","title":"Scalable Approximation Algorithm for Graph Summarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03936","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:da91168f6916f5ca414b3bc556d6055bb9913b13ed3d8584bd6f9a3e9941666c","target":"record","created_at":"2026-05-18T00:13:41Z","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":"f184b94b35935e50922213e693d5302246ffb16554bef975111152a67f9fc67a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-11T12:34:48Z","title_canon_sha256":"219003b3fa7c84b5656dceadeb063746a31ea725eb609081168ee5b2a8732f44"},"schema_version":"1.0","source":{"id":"1806.03936","kind":"arxiv","version":1}},"canonical_sha256":"e4c3a014bc6881e0ff1d2d1ce3a1c02e46982a3653269ff5a3bd2e5d45c21385","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4c3a014bc6881e0ff1d2d1ce3a1c02e46982a3653269ff5a3bd2e5d45c21385","first_computed_at":"2026-05-18T00:13:41.479233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:41.479233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2w9mF7yPsWxdngkvDNqHdvMqBo48dPKAjQ/ukcUJ2eCLsrLS5v++q2LfR/S6tPqh8WK9j39C4jIdX1czr6PMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:41.479795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da91168f6916f5ca414b3bc556d6055bb9913b13ed3d8584bd6f9a3e9941666c","sha256:303f92612ae983687e506f48fde3da244f3b5e2008cd06f12af2926f63d735b1"],"state_sha256":"7d81f5cac3e710b37f0bb4b08a18524e5e16334b695edc77bab24b78ffde1f6d"}