{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NLTHQ2MVPFSTUYE2U6XXUQKA3Q","short_pith_number":"pith:NLTHQ2MV","canonical_record":{"source":{"id":"2006.09935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-17T15:33:30Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"7f5b2d75d55d4fbce479c3d3842ae7d0a4347565ae9feae95c19889d0ea9281d","abstract_canon_sha256":"6dc8ecfd1d2af426373e67d2fdce6f6d2e967ff76e3afb10cc0a7acde7fca163"},"schema_version":"1.0"},"canonical_sha256":"6ae678699579653a609aa7af7a4140dc1723eadee9d1cce655d70e18cea09971","source":{"kind":"arxiv","id":"2006.09935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.09935","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"arxiv_version","alias_value":"2006.09935v1","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09935","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"pith_short_12","alias_value":"NLTHQ2MVPFST","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"pith_short_16","alias_value":"NLTHQ2MVPFSTUYE2","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"pith_short_8","alias_value":"NLTHQ2MV","created_at":"2026-07-05T01:11:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NLTHQ2MVPFSTUYE2U6XXUQKA3Q","target":"record","payload":{"canonical_record":{"source":{"id":"2006.09935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-17T15:33:30Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"7f5b2d75d55d4fbce479c3d3842ae7d0a4347565ae9feae95c19889d0ea9281d","abstract_canon_sha256":"6dc8ecfd1d2af426373e67d2fdce6f6d2e967ff76e3afb10cc0a7acde7fca163"},"schema_version":"1.0"},"canonical_sha256":"6ae678699579653a609aa7af7a4140dc1723eadee9d1cce655d70e18cea09971","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:06.612368Z","signature_b64":"unQx9qezgLwtrJsJszcCPeslIPEve3ryqt0FBYMLh96cFMDX643qkvXmqBtJo/PjV+B586A9dMu8uv0zPgc/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ae678699579653a609aa7af7a4140dc1723eadee9d1cce655d70e18cea09971","last_reissued_at":"2026-07-05T01:11:06.611992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:06.611992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.09935","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-07-05T01:11:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1KvX1IDfgKpeWNiK88i8qBoX+Pr1zQExx7ryymbXRS5cz5D8bh3cACRxpm5C4xXuwk41VfgEynEZuaHPuPBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:07:01.782536Z"},"content_sha256":"ff0f47ece0d040c30fbc1fd8a2b627fc7aff862d92aa9b66052b3301c90de761","schema_version":"1.0","event_id":"sha256:ff0f47ece0d040c30fbc1fd8a2b627fc7aff862d92aa9b66052b3301c90de761"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NLTHQ2MVPFSTUYE2U6XXUQKA3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Lossless Graph Summarization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Jihoon Ko, Kijung Shin, Yunbum Kook","submitted_at":"2020-06-17T15:33:30Z","abstract_excerpt":"Given a fully dynamic graph, represented as a stream of edge insertions and deletions, how can we obtain and incrementally update a lossless summary of its current snapshot? As large-scale graphs are prevalent, concisely representing them is inevitable for efficient storage and analysis. Lossless graph summarization is an effective graph-compression technique with many desirable properties. It aims to compactly represent the input graph as (a) a summary graph consisting of supernodes (i.e., sets of nodes) and superedges (i.e., edges between supernodes), which provide a rough description, and ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09935","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.09935/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:11:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E0ZlETjJIrJjZPtuioB4oDo/nN4+xLca7Ck/JfDWbp2OaWiZguqeaZRVUJD9MmlIGB/cgmoBJbcpOwYRlZp5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:07:01.782907Z"},"content_sha256":"c98397756f2e158518af51d2ceb5e93ecac17f9f10821a1abec4c649bb15935d","schema_version":"1.0","event_id":"sha256:c98397756f2e158518af51d2ceb5e93ecac17f9f10821a1abec4c649bb15935d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLTHQ2MVPFSTUYE2U6XXUQKA3Q/bundle.json","state_url":"https://pith.science/pith/NLTHQ2MVPFSTUYE2U6XXUQKA3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLTHQ2MVPFSTUYE2U6XXUQKA3Q/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-07-08T19:07:01Z","links":{"resolver":"https://pith.science/pith/NLTHQ2MVPFSTUYE2U6XXUQKA3Q","bundle":"https://pith.science/pith/NLTHQ2MVPFSTUYE2U6XXUQKA3Q/bundle.json","state":"https://pith.science/pith/NLTHQ2MVPFSTUYE2U6XXUQKA3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLTHQ2MVPFSTUYE2U6XXUQKA3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NLTHQ2MVPFSTUYE2U6XXUQKA3Q","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":"6dc8ecfd1d2af426373e67d2fdce6f6d2e967ff76e3afb10cc0a7acde7fca163","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-17T15:33:30Z","title_canon_sha256":"7f5b2d75d55d4fbce479c3d3842ae7d0a4347565ae9feae95c19889d0ea9281d"},"schema_version":"1.0","source":{"id":"2006.09935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.09935","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"arxiv_version","alias_value":"2006.09935v1","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09935","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"pith_short_12","alias_value":"NLTHQ2MVPFST","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"pith_short_16","alias_value":"NLTHQ2MVPFSTUYE2","created_at":"2026-07-05T01:11:06Z"},{"alias_kind":"pith_short_8","alias_value":"NLTHQ2MV","created_at":"2026-07-05T01:11:06Z"}],"graph_snapshots":[{"event_id":"sha256:c98397756f2e158518af51d2ceb5e93ecac17f9f10821a1abec4c649bb15935d","target":"graph","created_at":"2026-07-05T01:11:06Z","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.09935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a fully dynamic graph, represented as a stream of edge insertions and deletions, how can we obtain and incrementally update a lossless summary of its current snapshot? As large-scale graphs are prevalent, concisely representing them is inevitable for efficient storage and analysis. Lossless graph summarization is an effective graph-compression technique with many desirable properties. It aims to compactly represent the input graph as (a) a summary graph consisting of supernodes (i.e., sets of nodes) and superedges (i.e., edges between supernodes), which provide a rough description, and (","authors_text":"Jihoon Ko, Kijung Shin, Yunbum Kook","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-17T15:33:30Z","title":"Incremental Lossless Graph Summarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09935","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:ff0f47ece0d040c30fbc1fd8a2b627fc7aff862d92aa9b66052b3301c90de761","target":"record","created_at":"2026-07-05T01:11:06Z","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":"6dc8ecfd1d2af426373e67d2fdce6f6d2e967ff76e3afb10cc0a7acde7fca163","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2020-06-17T15:33:30Z","title_canon_sha256":"7f5b2d75d55d4fbce479c3d3842ae7d0a4347565ae9feae95c19889d0ea9281d"},"schema_version":"1.0","source":{"id":"2006.09935","kind":"arxiv","version":1}},"canonical_sha256":"6ae678699579653a609aa7af7a4140dc1723eadee9d1cce655d70e18cea09971","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ae678699579653a609aa7af7a4140dc1723eadee9d1cce655d70e18cea09971","first_computed_at":"2026-07-05T01:11:06.611992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:11:06.611992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"unQx9qezgLwtrJsJszcCPeslIPEve3ryqt0FBYMLh96cFMDX643qkvXmqBtJo/PjV+B586A9dMu8uv0zPgc/Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:11:06.612368Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.09935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff0f47ece0d040c30fbc1fd8a2b627fc7aff862d92aa9b66052b3301c90de761","sha256:c98397756f2e158518af51d2ceb5e93ecac17f9f10821a1abec4c649bb15935d"],"state_sha256":"21f93fe5903055cd20a943ce31b52077605f466c7b4b511033a91d8cab7a671c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpH1DJUBJ2IVPEQfSzgNi7nTOVNWo2QaahfSGvsEkkXUIE2rwY1jgyxf4Z7brtgBLrUIlT8JWr89URFXnQOKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T19:07:01.785065Z","bundle_sha256":"5621d169e36178a06429b4f47183e13839f7da19dca6351adad920c65ddaf500"}}