{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZZYJ7GADML5II2S3KL76OXMWDU","short_pith_number":"pith:ZZYJ7GAD","schema_version":"1.0","canonical_sha256":"ce709f980362fa846a5b52ffe75d961d360a8323f2f41ddebdabff7de2528142","source":{"kind":"arxiv","id":"1810.07275","version":2},"attestation_state":"computed","paper":{"title":"Graph Compression Using The Regularity Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Pelosin","submitted_at":"2018-10-02T15:43:38Z","abstract_excerpt":"We are living in a world which is getting more and more interconnected and, as physiological effect, the interaction between the entities produces more and more information. This high throughput generation calls for techniques able to reduce the volume of the data, but still able to preserve the carried knowledge. Data compression and summarization techniques are one of the possible approaches to face such problems. The aim of this thesis is to devise a new pipeline for compressing and decompressing a graph by exploiting Szemer\\'edi's Regularity Lemma. In particular, it has been developed a pr"},"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":"1810.07275","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T15:43:38Z","cross_cats_sorted":[],"title_canon_sha256":"729b43bd368cb42e578873d4f342c36a451339f72f2afe004146a737ad57fc88","abstract_canon_sha256":"c9a87e0b2674f45e4edad0c26664afabd0c18f8ca7e58df1b2732181fca6d29d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:18.860043Z","signature_b64":"MbFwh/E7nim4RJRYRzACd/RLBtpRYLSZBiYCrHcylMFKHvAl0iGhDROyPZqtY6FwUf9dGl5ljkEdzQUWDdC0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce709f980362fa846a5b52ffe75d961d360a8323f2f41ddebdabff7de2528142","last_reissued_at":"2026-05-17T23:58:18.859547Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:18.859547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Compression Using The Regularity Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Pelosin","submitted_at":"2018-10-02T15:43:38Z","abstract_excerpt":"We are living in a world which is getting more and more interconnected and, as physiological effect, the interaction between the entities produces more and more information. This high throughput generation calls for techniques able to reduce the volume of the data, but still able to preserve the carried knowledge. Data compression and summarization techniques are one of the possible approaches to face such problems. The aim of this thesis is to devise a new pipeline for compressing and decompressing a graph by exploiting Szemer\\'edi's Regularity Lemma. In particular, it has been developed a pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07275","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":""},"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":"1810.07275","created_at":"2026-05-17T23:58:18.859630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07275v2","created_at":"2026-05-17T23:58:18.859630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07275","created_at":"2026-05-17T23:58:18.859630+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZYJ7GADML5I","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZYJ7GADML5II2S3","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZYJ7GAD","created_at":"2026-05-18T12:33:07.085635+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/ZZYJ7GADML5II2S3KL76OXMWDU","json":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU.json","graph_json":"https://pith.science/api/pith-number/ZZYJ7GADML5II2S3KL76OXMWDU/graph.json","events_json":"https://pith.science/api/pith-number/ZZYJ7GADML5II2S3KL76OXMWDU/events.json","paper":"https://pith.science/paper/ZZYJ7GAD"},"agent_actions":{"view_html":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU","download_json":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU.json","view_paper":"https://pith.science/paper/ZZYJ7GAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07275&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZYJ7GADML5II2S3KL76OXMWDU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZYJ7GADML5II2S3KL76OXMWDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/action/storage_attestation","attest_author":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/action/author_attestation","sign_citation":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/action/citation_signature","submit_replication":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/action/replication_record"}},"created_at":"2026-05-17T23:58:18.859630+00:00","updated_at":"2026-05-17T23:58:18.859630+00:00"}