{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZZYJ7GADML5II2S3KL76OXMWDU","short_pith_number":"pith:ZZYJ7GAD","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"},"canonical_sha256":"ce709f980362fa846a5b52ffe75d961d360a8323f2f41ddebdabff7de2528142","source":{"kind":"arxiv","id":"1810.07275","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07275","created_at":"2026-05-17T23:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07275v2","created_at":"2026-05-17T23:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07275","created_at":"2026-05-17T23:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZZYJ7GADML5I","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZZYJ7GADML5II2S3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZZYJ7GAD","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZZYJ7GADML5II2S3KL76OXMWDU","target":"record","payload":{"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"},"canonical_sha256":"ce709f980362fa846a5b52ffe75d961d360a8323f2f41ddebdabff7de2528142","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"},"source_kind":"arxiv","source_id":"1810.07275","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-05-17T23:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYvZ+r4+Jm5AvKD/qIOQbLNik3xfiLliuhkaXT43fulUFKtmV+5ZlQJa8hQWS89iQ+YjU3rzsuKfSAomPRwWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:42:14.278422Z"},"content_sha256":"87122c236f619172b300cd1cae5fc3a7f8354b0934f65d3048ece222ef11e21f","schema_version":"1.0","event_id":"sha256:87122c236f619172b300cd1cae5fc3a7f8354b0934f65d3048ece222ef11e21f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZZYJ7GADML5II2S3KL76OXMWDU","target":"graph","payload":{"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"},"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:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbVQJ86goiFpGvFJUTTS9X2Zyri1tmRl2MiW3fLvg4zpADFe1nQ9QP5aEXRXpU5zBcjJn5zywxcJ3YxQt0wWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:42:14.278803Z"},"content_sha256":"3edcb8e489db7477b03c1801c0612a6906e5d84bda7de48d38ed4d8effd0d68c","schema_version":"1.0","event_id":"sha256:3edcb8e489db7477b03c1801c0612a6906e5d84bda7de48d38ed4d8effd0d68c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/bundle.json","state_url":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZYJ7GADML5II2S3KL76OXMWDU/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-08T16:42:14Z","links":{"resolver":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU","bundle":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/bundle.json","state":"https://pith.science/pith/ZZYJ7GADML5II2S3KL76OXMWDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZYJ7GADML5II2S3KL76OXMWDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZZYJ7GADML5II2S3KL76OXMWDU","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":"c9a87e0b2674f45e4edad0c26664afabd0c18f8ca7e58df1b2732181fca6d29d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T15:43:38Z","title_canon_sha256":"729b43bd368cb42e578873d4f342c36a451339f72f2afe004146a737ad57fc88"},"schema_version":"1.0","source":{"id":"1810.07275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07275","created_at":"2026-05-17T23:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07275v2","created_at":"2026-05-17T23:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07275","created_at":"2026-05-17T23:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZZYJ7GADML5I","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZZYJ7GADML5II2S3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZZYJ7GAD","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:3edcb8e489db7477b03c1801c0612a6906e5d84bda7de48d38ed4d8effd0d68c","target":"graph","created_at":"2026-05-17T23:58:18Z","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":"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","authors_text":"Francesco Pelosin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T15:43:38Z","title":"Graph Compression Using The Regularity Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07275","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:87122c236f619172b300cd1cae5fc3a7f8354b0934f65d3048ece222ef11e21f","target":"record","created_at":"2026-05-17T23:58:18Z","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":"c9a87e0b2674f45e4edad0c26664afabd0c18f8ca7e58df1b2732181fca6d29d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T15:43:38Z","title_canon_sha256":"729b43bd368cb42e578873d4f342c36a451339f72f2afe004146a737ad57fc88"},"schema_version":"1.0","source":{"id":"1810.07275","kind":"arxiv","version":2}},"canonical_sha256":"ce709f980362fa846a5b52ffe75d961d360a8323f2f41ddebdabff7de2528142","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce709f980362fa846a5b52ffe75d961d360a8323f2f41ddebdabff7de2528142","first_computed_at":"2026-05-17T23:58:18.859547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:18.859547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MbFwh/E7nim4RJRYRzACd/RLBtpRYLSZBiYCrHcylMFKHvAl0iGhDROyPZqtY6FwUf9dGl5ljkEdzQUWDdC0Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:18.860043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87122c236f619172b300cd1cae5fc3a7f8354b0934f65d3048ece222ef11e21f","sha256:3edcb8e489db7477b03c1801c0612a6906e5d84bda7de48d38ed4d8effd0d68c"],"state_sha256":"061e4ebf647284e118702c812f69ab69cd1dea38c7de0db96f7934882bba9696"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3fuDC1udmdV+25PO/qquRd4Q0oailb7aZV0B+ZFk/Uze/bv7PyrAH5cKFKQTUUne8Rnhk7vZEzv8ou9SmCdyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:42:14.281045Z","bundle_sha256":"ac0901aef301178e191b4818b1045e4a5a589ce1c57258b12f0f5688d305d505"}}