{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GCR2A4DMFZU4KE5YNXLSVTRHBK","short_pith_number":"pith:GCR2A4DM","schema_version":"1.0","canonical_sha256":"30a3a0706c2e69c513b86dd72ace270a96149e8193c439287418903c3e099f55","source":{"kind":"arxiv","id":"1905.06917","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.06917","created_at":"2026-05-17T23:45:43.927084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06917v3","created_at":"2026-05-17T23:45:43.927084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06917","created_at":"2026-05-17T23:45:43.927084+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCR2A4DMFZU4","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCR2A4DMFZU4KE5Y","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCR2A4DM","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK","json":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK.json","graph_json":"https://pith.science/api/pith-number/GCR2A4DMFZU4KE5YNXLSVTRHBK/graph.json","events_json":"https://pith.science/api/pith-number/GCR2A4DMFZU4KE5YNXLSVTRHBK/events.json","paper":"https://pith.science/paper/GCR2A4DM"},"agent_actions":{"view_html":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK","download_json":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK.json","view_paper":"https://pith.science/paper/GCR2A4DM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06917&json=true","fetch_graph":"https://pith.science/api/pith-number/GCR2A4DMFZU4KE5YNXLSVTRHBK/graph.json","fetch_events":"https://pith.science/api/pith-number/GCR2A4DMFZU4KE5YNXLSVTRHBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/action/storage_attestation","attest_author":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/action/author_attestation","sign_citation":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/action/citation_signature","submit_replication":"https://pith.science/pith/GCR2A4DMFZU4KE5YNXLSVTRHBK/action/replication_record"}},"created_at":"2026-05-17T23:45:43.927084+00:00","updated_at":"2026-05-17T23:45:43.927084+00:00"}