{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:K3CITVBJKRJFMHIS5SNYOMEG3R","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":"0b017a183db17c4c3565cd8e5e90b8b4d8e95da098964b379a25e1d0551c68c8","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-01T16:38:19Z","title_canon_sha256":"34625338e996e49e985e6d586e4952a4af0fb4575fe114b7933a875c16a3d43e"},"schema_version":"1.0","source":{"id":"2006.01060","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.01060","created_at":"2026-07-05T02:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"2006.01060v4","created_at":"2026-07-05T02:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.01060","created_at":"2026-07-05T02:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"K3CITVBJKRJF","created_at":"2026-07-05T02:16:45Z"},{"alias_kind":"pith_short_16","alias_value":"K3CITVBJKRJFMHIS","created_at":"2026-07-05T02:16:45Z"},{"alias_kind":"pith_short_8","alias_value":"K3CITVBJ","created_at":"2026-07-05T02:16:45Z"}],"graph_snapshots":[{"event_id":"sha256:62f5a2bb3cdec0fa1dbe89514bf35ac06462d4c7e006d2b8de689b318f2812e8","target":"graph","created_at":"2026-07-05T02:16:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.01060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph G and the desired size k in bits, how can we summarize G within k bits, while minimizing the information loss?\n  Large-scale graphs have become omnipresent, posing considerable computational challenges. Analyzing such large graphs can be fast and easy if they are compressed sufficiently to fit in main memory or even cache. Graph summarization, which yields a coarse-grained summary graph with merged nodes, stands out with several advantages among graph compression techniques. Thus, a number of algorithms have been developed for obtaining a concise summary graph with little informa","authors_text":"Hyeonsoo Jo, Jihoon Ko, Kijung Shin, Kyuhan Lee, Sungsu Lim","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-01T16:38:19Z","title":"SSumM: Sparse Summarization of Massive Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.01060","kind":"arxiv","version":4},"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:5379319899beebbfaf61e4be5a3b1d6a0996ca72d172c0218234a875a58fea4b","target":"record","created_at":"2026-07-05T02:16:45Z","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":"0b017a183db17c4c3565cd8e5e90b8b4d8e95da098964b379a25e1d0551c68c8","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-01T16:38:19Z","title_canon_sha256":"34625338e996e49e985e6d586e4952a4af0fb4575fe114b7933a875c16a3d43e"},"schema_version":"1.0","source":{"id":"2006.01060","kind":"arxiv","version":4}},"canonical_sha256":"56c489d4295452561d12ec9b873086dc63627df0fd0a5c8ab419494ad7ddd6f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56c489d4295452561d12ec9b873086dc63627df0fd0a5c8ab419494ad7ddd6f3","first_computed_at":"2026-07-05T02:16:45.535734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:16:45.535734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VSyUnPoHHeI/r67zCPNZW1sFEuM/FF8CCVf6PBpqB7Y4KwUbGInVpyIQ4HOMSfdgjMpz3aG/4AQTbedfPFmbDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:16:45.536212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.01060","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5379319899beebbfaf61e4be5a3b1d6a0996ca72d172c0218234a875a58fea4b","sha256:62f5a2bb3cdec0fa1dbe89514bf35ac06462d4c7e006d2b8de689b318f2812e8"],"state_sha256":"b2da4e774603eeb42614d83230045af2b2a79791b83b416c21f9d4bf45227e96"}