{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:BUYZGQWEZ5UDDQIBTH5SOH7N3Z","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":"2da1f84e06484af402ec4ce86f6e82260a1908f4d71729ad7b13a4f85849a608","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-02T01:15:34Z","title_canon_sha256":"db3a8e954e7c253fea641c4b2a6544675dd2112d0e0da6e7850f2f296ea3a1e8"},"schema_version":"1.0","source":{"id":"2110.00701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.00701","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"2110.00701v1","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.00701","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"BUYZGQWEZ5UD","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"pith_short_16","alias_value":"BUYZGQWEZ5UDDQIB","created_at":"2026-07-05T03:19:47Z"},{"alias_kind":"pith_short_8","alias_value":"BUYZGQWE","created_at":"2026-07-05T03:19:47Z"}],"graph_snapshots":[{"event_id":"sha256:be265f8913f3a01263555e13ebc75ea2d3de75a43702f66e81ba3b865ae40290","target":"graph","created_at":"2026-07-05T03:19:47Z","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/2110.00701/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many multivariate data such as social and biological data exhibit complex dependencies that are best characterized by graphs. Unlike sequential data, graphs are, in general, unordered structures. This means we can no longer use classic, sequential-based compression methods on these graph-based data. Therefore, it is necessary to develop new methods for graph compression. In this paper, we present universal source coding methods for the lossless compression of unweighted, undirected, unlabelled graphs. We encode in two steps: 1) transforming graph into a rooted binary tree, 2) the encoding root","authors_text":"Anders Host-Madsen, Andras Bratincsak, June Zhang, Mojtaba Abolfazli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-02T01:15:34Z","title":"Graph Compression with Application to Model Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.00701","kind":"arxiv","version":1},"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:7a09fe4edb2c4e3281a855d1301fd7e6094f5495befd9324d525bd0b49959ef4","target":"record","created_at":"2026-07-05T03:19:47Z","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":"2da1f84e06484af402ec4ce86f6e82260a1908f4d71729ad7b13a4f85849a608","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-02T01:15:34Z","title_canon_sha256":"db3a8e954e7c253fea641c4b2a6544675dd2112d0e0da6e7850f2f296ea3a1e8"},"schema_version":"1.0","source":{"id":"2110.00701","kind":"arxiv","version":1}},"canonical_sha256":"0d319342c4cf6831c10199fb271fedde7ab34ac83f32f0be68af2d202457740a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d319342c4cf6831c10199fb271fedde7ab34ac83f32f0be68af2d202457740a","first_computed_at":"2026-07-05T03:19:47.480337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:47.480337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zypdo05eNzNbCeqIOIy9yE9iXbMv693wyf97ECkHReme4YFyxylWaW8lCZmvGdUbHKB/0BogayEDt2b1viwoDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:47.480852Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.00701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a09fe4edb2c4e3281a855d1301fd7e6094f5495befd9324d525bd0b49959ef4","sha256:be265f8913f3a01263555e13ebc75ea2d3de75a43702f66e81ba3b865ae40290"],"state_sha256":"ee71924fa26445fa87295ceb4e20dd67ebaebd6853b30da171d89bb617909870"}