{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GCR2A4DMFZU4KE5YNXLSVTRHBK","short_pith_number":"pith:GCR2A4DM","canonical_record":{"source":{"id":"1905.06917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-16T17:29:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"8119357eff88b1ecbff2e601d1d3b456243a2d6620bff952e8bfd6f42bea7419","abstract_canon_sha256":"bf3fd202a19b5873e5876871a3b80c4ef3ff97967e8020c5f642242b2208dfd5"},"schema_version":"1.0"},"canonical_sha256":"30a3a0706c2e69c513b86dd72ace270a96149e8193c439287418903c3e099f55","source":{"kind":"arxiv","id":"1905.06917","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06917","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06917v3","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06917","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"GCR2A4DMFZU4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCR2A4DMFZU4KE5Y","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCR2A4DM","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GCR2A4DMFZU4KE5YNXLSVTRHBK","target":"record","payload":{"canonical_record":{"source":{"id":"1905.06917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-16T17:29:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"8119357eff88b1ecbff2e601d1d3b456243a2d6620bff952e8bfd6f42bea7419","abstract_canon_sha256":"bf3fd202a19b5873e5876871a3b80c4ef3ff97967e8020c5f642242b2208dfd5"},"schema_version":"1.0"},"canonical_sha256":"30a3a0706c2e69c513b86dd72ace270a96149e8193c439287418903c3e099f55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:43.927529Z","signature_b64":"eas8mv/3X+36JAOKIh4Z5V8avxfPSzXfPBlx1+x8wAwSLt0NuLLEtsfcls9C7/Md2/b2g2q/uPVfApheABOCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a3a0706c2e69c513b86dd72ace270a96149e8193c439287418903c3e099f55","last_reissued_at":"2026-05-17T23:45:43.926986Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:43.926986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.06917","source_version":3,"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-05-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2CAMAyCu//2cyACx3dzLRy8FxVqKvAJxU3RUKs818l2OhhLeWTbQrXyilH2cbdi9BOS/GFUuXMvFCGl8t/yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:28:26.440994Z"},"content_sha256":"16f708ec20fb2d4f8d9b8cf1fac523455ff38e93f1fc78bff48b6dd9e7978ce7","schema_version":"1.0","event_id":"sha256:16f708ec20fb2d4f8d9b8cf1fac523455ff38e93f1fc78bff48b6dd9e7978ce7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GCR2A4DMFZU4KE5YNXLSVTRHBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separating Structure from Noise in Large Graphs Using the Regularity Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Francesco Pelosin, Marcello Pelillo, Marco Fiorucci","submitted_at":"2019-05-16T17:29:54Z","abstract_excerpt":"How can we separate structural information from noise in large graphs? To address this fundamental question, we propose a graph summarization approach based on Szemer\\'edi's Regularity Lemma, a well-known result in graph theory, which roughly states that every graph can be approximated by the union of a small number of random-like bipartite graphs called `regular pairs'. Hence, the Regularity Lemma provides us with a principled way to describe the essential structure of large graphs using a small amount of data. Our paper has several contributions: (i) We present our summarization algorithm wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06917","kind":"arxiv","version":3},"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"},"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-05-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8h4qOgtNFmCPj9wkaG1tdExvPno7rv3Dc24BBhX/EMbwA0r3sfChFbnHjWS2QpgoRHtWOXypRfL3QjX4wrVpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:28:26.441759Z"},"content_sha256":"9df1e5bee9cdc31b72ad6c59d7daae0a7a859597b06c476249578850061643c5","schema_version":"1.0","event_id":"sha256:9df1e5bee9cdc31b72ad6c59d7daae0a7a859597b06c476249578850061643c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/bundle.json","state_url":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/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-06-08T02:28:26Z","links":{"resolver":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK","bundle":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/bundle.json","state":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GCR2A4DMFZU4KE5YNXLSVTRHBK","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":"bf3fd202a19b5873e5876871a3b80c4ef3ff97967e8020c5f642242b2208dfd5","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-16T17:29:54Z","title_canon_sha256":"8119357eff88b1ecbff2e601d1d3b456243a2d6620bff952e8bfd6f42bea7419"},"schema_version":"1.0","source":{"id":"1905.06917","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06917","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06917v3","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06917","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"GCR2A4DMFZU4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCR2A4DMFZU4KE5Y","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCR2A4DM","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:9df1e5bee9cdc31b72ad6c59d7daae0a7a859597b06c476249578850061643c5","target":"graph","created_at":"2026-05-17T23:45: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"},"paper":{"abstract_excerpt":"How can we separate structural information from noise in large graphs? To address this fundamental question, we propose a graph summarization approach based on Szemer\\'edi's Regularity Lemma, a well-known result in graph theory, which roughly states that every graph can be approximated by the union of a small number of random-like bipartite graphs called `regular pairs'. Hence, the Regularity Lemma provides us with a principled way to describe the essential structure of large graphs using a small amount of data. Our paper has several contributions: (i) We present our summarization algorithm wh","authors_text":"Francesco Pelosin, Marcello Pelillo, Marco Fiorucci","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-16T17:29:54Z","title":"Separating Structure from Noise in Large Graphs Using the Regularity Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06917","kind":"arxiv","version":3},"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:16f708ec20fb2d4f8d9b8cf1fac523455ff38e93f1fc78bff48b6dd9e7978ce7","target":"record","created_at":"2026-05-17T23:45: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":"bf3fd202a19b5873e5876871a3b80c4ef3ff97967e8020c5f642242b2208dfd5","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-16T17:29:54Z","title_canon_sha256":"8119357eff88b1ecbff2e601d1d3b456243a2d6620bff952e8bfd6f42bea7419"},"schema_version":"1.0","source":{"id":"1905.06917","kind":"arxiv","version":3}},"canonical_sha256":"30a3a0706c2e69c513b86dd72ace270a96149e8193c439287418903c3e099f55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30a3a0706c2e69c513b86dd72ace270a96149e8193c439287418903c3e099f55","first_computed_at":"2026-05-17T23:45:43.926986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:43.926986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eas8mv/3X+36JAOKIh4Z5V8avxfPSzXfPBlx1+x8wAwSLt0NuLLEtsfcls9C7/Md2/b2g2q/uPVfApheABOCCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:43.927529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06917","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16f708ec20fb2d4f8d9b8cf1fac523455ff38e93f1fc78bff48b6dd9e7978ce7","sha256:9df1e5bee9cdc31b72ad6c59d7daae0a7a859597b06c476249578850061643c5"],"state_sha256":"edaecee3a397d152836060ba245885deeb107369d1395f6c8ab59ae1dc7d7363"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41txSfGtMYSvTwk/pvjVsp7LFTD3cLqv0qfdsoW5R3LmGpCJ2SL4hAQVEMFJrC2yWSIFJxrVqWlE96O/Ma/TBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:28:26.445425Z","bundle_sha256":"b94a3f55a2eafebe85fbbd9e72c57f76f832270085335159b232ba587d676036"}}