{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NAFTNC2VIZQCNG42I7I5XSPLXP","short_pith_number":"pith:NAFTNC2V","canonical_record":{"source":{"id":"2010.09175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-10-19T02:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"4b7741c95f70c517870098b5a2afa511460e30cc50f83bcc88d33a8591418b96","abstract_canon_sha256":"199a96e612548cea20c1e089ab7ec74df82be9315ac384f0527fe41434558a55"},"schema_version":"1.0"},"canonical_sha256":"680b368b554660269b9a47d1dbc9ebbbede7e36ca7852b589545525f7ee609b6","source":{"kind":"arxiv","id":"2010.09175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09175","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09175v2","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09175","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"NAFTNC2VIZQC","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"pith_short_16","alias_value":"NAFTNC2VIZQCNG42","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"pith_short_8","alias_value":"NAFTNC2V","created_at":"2026-07-05T02:12:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NAFTNC2VIZQCNG42I7I5XSPLXP","target":"record","payload":{"canonical_record":{"source":{"id":"2010.09175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-10-19T02:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"4b7741c95f70c517870098b5a2afa511460e30cc50f83bcc88d33a8591418b96","abstract_canon_sha256":"199a96e612548cea20c1e089ab7ec74df82be9315ac384f0527fe41434558a55"},"schema_version":"1.0"},"canonical_sha256":"680b368b554660269b9a47d1dbc9ebbbede7e36ca7852b589545525f7ee609b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:43.376693Z","signature_b64":"KzackPh5nQWLQ3K10guNldUNi/7uj9IeB4OzCuOz8z9unNP2Iyxr9SU5VZZbxzxlL9a4nEMryCD2M0SgJLj3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"680b368b554660269b9a47d1dbc9ebbbede7e36ca7852b589545525f7ee609b6","last_reissued_at":"2026-07-05T02:12:43.375618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:43.375618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.09175","source_version":2,"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-05T02:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzLAWUwEabsIGz8UagOLp3THcLsJOmxAaagzc+5BtSUx32Q6jowE8KRXlAsl3ZeHFgHS6JZyX2NYD9jV6yM7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T14:44:55.897287Z"},"content_sha256":"aa7b442ff61b0e368534bfd53cf0c84f76b34533fed8c7f9886f4351f4c521e3","schema_version":"1.0","event_id":"sha256:aa7b442ff61b0e368534bfd53cf0c84f76b34533fed8c7f9886f4351f4c521e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NAFTNC2VIZQCNG42I7I5XSPLXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Summarizing graphs using the configuration model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Houquan Zhou, Huawei Shen, Kijung Shin, Kyuhan Lee, Shenghua Liu, Xueqi Cheng","submitted_at":"2020-10-19T02:47:02Z","abstract_excerpt":"Given a large graph, how can we summarize it with fewer nodes and edges while maintaining its key properties, such as spectral property? Although graphs play more and more important roles in many real-world applications, the growth of their size presents great challenges to graph analysis. As a solution, graph summarization, which aims to find a compact representation that preserves the important properties of a given graph, has received much attention, and numerous algorithms have been developed for it. However, most of the algorithms adopt the uniform reconstruction scheme, which is based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09175","kind":"arxiv","version":2},"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/2010.09175/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-05T02:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liSfudfxi0dnJVaOLId6UXIuoVDflBeeF5u6OWa4qTzO9Z2nDfwPd8mmecS/utkHWBF/Z6uo9w2j2wh+uBOzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T14:44:55.897820Z"},"content_sha256":"d51bb30a78bbdd4db58b6664ae53612155a0c30ab1b383c84204fb4c243d6ecb","schema_version":"1.0","event_id":"sha256:d51bb30a78bbdd4db58b6664ae53612155a0c30ab1b383c84204fb4c243d6ecb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAFTNC2VIZQCNG42I7I5XSPLXP/bundle.json","state_url":"https://pith.science/pith/NAFTNC2VIZQCNG42I7I5XSPLXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAFTNC2VIZQCNG42I7I5XSPLXP/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-08-21T14:44:55Z","links":{"resolver":"https://pith.science/pith/NAFTNC2VIZQCNG42I7I5XSPLXP","bundle":"https://pith.science/pith/NAFTNC2VIZQCNG42I7I5XSPLXP/bundle.json","state":"https://pith.science/pith/NAFTNC2VIZQCNG42I7I5XSPLXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAFTNC2VIZQCNG42I7I5XSPLXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NAFTNC2VIZQCNG42I7I5XSPLXP","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":"199a96e612548cea20c1e089ab7ec74df82be9315ac384f0527fe41434558a55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-10-19T02:47:02Z","title_canon_sha256":"4b7741c95f70c517870098b5a2afa511460e30cc50f83bcc88d33a8591418b96"},"schema_version":"1.0","source":{"id":"2010.09175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09175","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09175v2","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09175","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"NAFTNC2VIZQC","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"pith_short_16","alias_value":"NAFTNC2VIZQCNG42","created_at":"2026-07-05T02:12:43Z"},{"alias_kind":"pith_short_8","alias_value":"NAFTNC2V","created_at":"2026-07-05T02:12:43Z"}],"graph_snapshots":[{"event_id":"sha256:d51bb30a78bbdd4db58b6664ae53612155a0c30ab1b383c84204fb4c243d6ecb","target":"graph","created_at":"2026-07-05T02:12:43Z","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/2010.09175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a large graph, how can we summarize it with fewer nodes and edges while maintaining its key properties, such as spectral property? Although graphs play more and more important roles in many real-world applications, the growth of their size presents great challenges to graph analysis. As a solution, graph summarization, which aims to find a compact representation that preserves the important properties of a given graph, has received much attention, and numerous algorithms have been developed for it. However, most of the algorithms adopt the uniform reconstruction scheme, which is based on","authors_text":"Houquan Zhou, Huawei Shen, Kijung Shin, Kyuhan Lee, Shenghua Liu, Xueqi Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-10-19T02:47:02Z","title":"Summarizing graphs using the configuration model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09175","kind":"arxiv","version":2},"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:aa7b442ff61b0e368534bfd53cf0c84f76b34533fed8c7f9886f4351f4c521e3","target":"record","created_at":"2026-07-05T02:12:43Z","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":"199a96e612548cea20c1e089ab7ec74df82be9315ac384f0527fe41434558a55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-10-19T02:47:02Z","title_canon_sha256":"4b7741c95f70c517870098b5a2afa511460e30cc50f83bcc88d33a8591418b96"},"schema_version":"1.0","source":{"id":"2010.09175","kind":"arxiv","version":2}},"canonical_sha256":"680b368b554660269b9a47d1dbc9ebbbede7e36ca7852b589545525f7ee609b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"680b368b554660269b9a47d1dbc9ebbbede7e36ca7852b589545525f7ee609b6","first_computed_at":"2026-07-05T02:12:43.375618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:12:43.375618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KzackPh5nQWLQ3K10guNldUNi/7uj9IeB4OzCuOz8z9unNP2Iyxr9SU5VZZbxzxlL9a4nEMryCD2M0SgJLj3DA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:12:43.376693Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.09175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa7b442ff61b0e368534bfd53cf0c84f76b34533fed8c7f9886f4351f4c521e3","sha256:d51bb30a78bbdd4db58b6664ae53612155a0c30ab1b383c84204fb4c243d6ecb"],"state_sha256":"6ba37957f615ea84246e1f2c847734815c2bd31dc666d99163dfa17a20a03fee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnLKChFQ5MD8zYOiteREzGh5tkAa9HcuNpXlnRustSye6AAKHAqI7Rt5b1ArS81ilpg8Qko/sOE0yZmthrJtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T14:44:55.903978Z","bundle_sha256":"7d982cf9898c2f8d632cf9a106df6d496bae90636c4cee6b6d11a3f5468ffacf"}}