{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:446SLSYOSY3ZZO3RO4PIMC3JYZ","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":"634c2b56e8743eb72270b498a2d185eb0ad0f3f080f94a426d81f5d72aa0d98c","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-18T23:48:29Z","title_canon_sha256":"48657c751bd424fcc053cfa02dba256177ed103ccf8fba93117d615b804a7b11"},"schema_version":"1.0","source":{"id":"1912.08950","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.08950","created_at":"2026-07-05T03:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1912.08950v2","created_at":"2026-07-05T03:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.08950","created_at":"2026-07-05T03:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"446SLSYOSY3Z","created_at":"2026-07-05T03:02:36Z"},{"alias_kind":"pith_short_16","alias_value":"446SLSYOSY3ZZO3R","created_at":"2026-07-05T03:02:36Z"},{"alias_kind":"pith_short_8","alias_value":"446SLSYO","created_at":"2026-07-05T03:02:36Z"}],"graph_snapshots":[{"event_id":"sha256:de45ca6edbf880030dd4d6600e04c76c84d8221c2bfb9cf439fdc131d105a83c","target":"graph","created_at":"2026-07-05T03:02:36Z","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/1912.08950/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose Slim Graph: the first programming model and framework for practical lossy graph compression that facilitates high-performance approximate graph processing, storage, and analytics. Slim Graph enables the developer to express numerous compression schemes using small and programmable compression kernels that can access and modify local parts of input graphs. Such kernels are executed in parallel by the underlying engine, isolating developers from complexities of parallel programming. Our kernels implement novel graph compression schemes that preserve numerous graph properties, for exam","authors_text":"Andrey Ivanov, Lukas Gianinazzi, Maciej Besta, Robert Gerstenberger, Simon Weber, Torsten Hoefler, Yishai Oltchik","cross_cats":["cs.DC","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-18T23:48:29Z","title":"Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.08950","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:6ffb05f72b5e35f186b37dcea7f6e90f2d41640738fac5c4adef0f69a8401088","target":"record","created_at":"2026-07-05T03:02:36Z","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":"634c2b56e8743eb72270b498a2d185eb0ad0f3f080f94a426d81f5d72aa0d98c","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-18T23:48:29Z","title_canon_sha256":"48657c751bd424fcc053cfa02dba256177ed103ccf8fba93117d615b804a7b11"},"schema_version":"1.0","source":{"id":"1912.08950","kind":"arxiv","version":2}},"canonical_sha256":"e73d25cb0e96379cbb71771e860b69c679496cf82646dc084c135b3c50f0d3f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e73d25cb0e96379cbb71771e860b69c679496cf82646dc084c135b3c50f0d3f8","first_computed_at":"2026-07-05T03:02:36.909886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:02:36.909886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vLJQUz1Wva2dKNcds/clPy44XT5ry/YKvPL1+XudvNbYTvOj9oTcPdp63fSC+XMsvc7UlltcH/CIzfAncnHGAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:02:36.910457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.08950","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ffb05f72b5e35f186b37dcea7f6e90f2d41640738fac5c4adef0f69a8401088","sha256:de45ca6edbf880030dd4d6600e04c76c84d8221c2bfb9cf439fdc131d105a83c"],"state_sha256":"69e08038f764836cc9b574082bd683503f8aa55a9e2b1c35bcd1349b659f767b"}