{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ACC6JU4UFG7OYOXQWBAEOUFODH","short_pith_number":"pith:ACC6JU4U","canonical_record":{"source":{"id":"1807.06874","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T11:48:37Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"140408f9a49977a872d816225660a37b2eccfd31cc8525b21d43b65c203c72df","abstract_canon_sha256":"dc53746b1d33792121c85bb29b8d33e1977d94eff3174e23fd6ead7d73229455"},"schema_version":"1.0"},"canonical_sha256":"0085e4d39429beec3af0b0404750ae19d33b24ce9dcfc8446c4c90df5f08ea28","source":{"kind":"arxiv","id":"1807.06874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06874","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06874v1","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06874","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"ACC6JU4UFG7O","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ACC6JU4UFG7OYOXQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ACC6JU4U","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ACC6JU4UFG7OYOXQWBAEOUFODH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.06874","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T11:48:37Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"140408f9a49977a872d816225660a37b2eccfd31cc8525b21d43b65c203c72df","abstract_canon_sha256":"dc53746b1d33792121c85bb29b8d33e1977d94eff3174e23fd6ead7d73229455"},"schema_version":"1.0"},"canonical_sha256":"0085e4d39429beec3af0b0404750ae19d33b24ce9dcfc8446c4c90df5f08ea28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:25.489689Z","signature_b64":"DdLPAaImDhgSzbSs6PhhzqrN7oCFQVcymDSRC2m6OCdmL8BqPU02btz3mTAdZE4ERfemrWIgkHJkjfjApx32Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0085e4d39429beec3af0b0404750ae19d33b24ce9dcfc8446c4c90df5f08ea28","last_reissued_at":"2026-05-18T00:10:25.488932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:25.488932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.06874","source_version":1,"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-18T00:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czVllpmwMknYGiVHSLaITxSmoqDody2InFBhKOjOorNJpDt4B8gI2Abx//zuRiITPM5vDt2RRuy9BGSuTRdLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:21:45.435885Z"},"content_sha256":"170fc084ffa7d48eb76c98dd54bdc9b1b7572745fd744e73970a6def58dc1339","schema_version":"1.0","event_id":"sha256:170fc084ffa7d48eb76c98dd54bdc9b1b7572745fd744e73970a6def58dc1339"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ACC6JU4UFG7OYOXQWBAEOUFODH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Information-theoretic Framework for the Lossy Compression of Link Streams","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Robin Lamarche-Perrin","submitted_at":"2018-07-18T11:48:37Z","abstract_excerpt":"Graph compression is a data analysis technique that consists in the replacement of parts of a graph by more general structural patterns in order to reduce its description length. It notably provides interesting exploration tools for the study of real, large-scale, and complex graphs which cannot be grasped at first glance. This article proposes a framework for the compression of temporal graphs, that is for the compression of graphs that evolve with time. This framework first builds on a simple and limited scheme, exploiting structural equivalence for the lossless compression of static graphs,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06874","kind":"arxiv","version":1},"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-18T00:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjzrBAi+c9vnJQSh/CAPstVoYCfGPW6XQqe5fr+HdFzWWhFLD9Cb+UJDZuALCsVuyTn5FMUMDFWKcg9dPppPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:21:45.436251Z"},"content_sha256":"ad2c95ad8cae6f27e572f5977a52150d40585a0ee9466b230d3ea870f023123e","schema_version":"1.0","event_id":"sha256:ad2c95ad8cae6f27e572f5977a52150d40585a0ee9466b230d3ea870f023123e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACC6JU4UFG7OYOXQWBAEOUFODH/bundle.json","state_url":"https://pith.science/pith/ACC6JU4UFG7OYOXQWBAEOUFODH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACC6JU4UFG7OYOXQWBAEOUFODH/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-29T12:21:45Z","links":{"resolver":"https://pith.science/pith/ACC6JU4UFG7OYOXQWBAEOUFODH","bundle":"https://pith.science/pith/ACC6JU4UFG7OYOXQWBAEOUFODH/bundle.json","state":"https://pith.science/pith/ACC6JU4UFG7OYOXQWBAEOUFODH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACC6JU4UFG7OYOXQWBAEOUFODH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ACC6JU4UFG7OYOXQWBAEOUFODH","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":"dc53746b1d33792121c85bb29b8d33e1977d94eff3174e23fd6ead7d73229455","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T11:48:37Z","title_canon_sha256":"140408f9a49977a872d816225660a37b2eccfd31cc8525b21d43b65c203c72df"},"schema_version":"1.0","source":{"id":"1807.06874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06874","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06874v1","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06874","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"ACC6JU4UFG7O","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ACC6JU4UFG7OYOXQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ACC6JU4U","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:ad2c95ad8cae6f27e572f5977a52150d40585a0ee9466b230d3ea870f023123e","target":"graph","created_at":"2026-05-18T00:10:25Z","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":"Graph compression is a data analysis technique that consists in the replacement of parts of a graph by more general structural patterns in order to reduce its description length. It notably provides interesting exploration tools for the study of real, large-scale, and complex graphs which cannot be grasped at first glance. This article proposes a framework for the compression of temporal graphs, that is for the compression of graphs that evolve with time. This framework first builds on a simple and limited scheme, exploiting structural equivalence for the lossless compression of static graphs,","authors_text":"Robin Lamarche-Perrin","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T11:48:37Z","title":"An Information-theoretic Framework for the Lossy Compression of Link Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06874","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:170fc084ffa7d48eb76c98dd54bdc9b1b7572745fd744e73970a6def58dc1339","target":"record","created_at":"2026-05-18T00:10:25Z","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":"dc53746b1d33792121c85bb29b8d33e1977d94eff3174e23fd6ead7d73229455","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T11:48:37Z","title_canon_sha256":"140408f9a49977a872d816225660a37b2eccfd31cc8525b21d43b65c203c72df"},"schema_version":"1.0","source":{"id":"1807.06874","kind":"arxiv","version":1}},"canonical_sha256":"0085e4d39429beec3af0b0404750ae19d33b24ce9dcfc8446c4c90df5f08ea28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0085e4d39429beec3af0b0404750ae19d33b24ce9dcfc8446c4c90df5f08ea28","first_computed_at":"2026-05-18T00:10:25.488932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:25.488932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DdLPAaImDhgSzbSs6PhhzqrN7oCFQVcymDSRC2m6OCdmL8BqPU02btz3mTAdZE4ERfemrWIgkHJkjfjApx32Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:25.489689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:170fc084ffa7d48eb76c98dd54bdc9b1b7572745fd744e73970a6def58dc1339","sha256:ad2c95ad8cae6f27e572f5977a52150d40585a0ee9466b230d3ea870f023123e"],"state_sha256":"3e29c92c5f9ad0c8fe706d9eab9a35e028f4236d344480573bfffd613f0137d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyHGN+S950etNAqkODM4kFwAVp/pdEXlNrO6kexZuTDSz7d4rYKzB6tXpO27PVk7aG0/g6/pjPcIbN+16xJhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T12:21:45.438173Z","bundle_sha256":"5e5c85c17b9562a26ef027ae77fcb17fd7fad6c48dca86f4155cfa18ca67b74a"}}