{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:24DL2GFDEXPL3PKWNX6RBEKRNX","short_pith_number":"pith:24DL2GFD","canonical_record":{"source":{"id":"1602.04256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-12T22:46:57Z","cross_cats_sorted":[],"title_canon_sha256":"5c0a4eab44e59db92fd7855cce4451dbf5f8f02ecbfd63024da0fffc8c0d1419","abstract_canon_sha256":"51f3b4391ace8af1c5eb17daac5dce5b87b1ce49ede8cef0bc6b93c1690ab9e6"},"schema_version":"1.0"},"canonical_sha256":"d706bd18a325debdbd566dfd1091516df7cad36563bf28496ddbb303dd72f092","source":{"kind":"arxiv","id":"1602.04256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04256","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04256v2","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04256","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"24DL2GFDEXPL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"24DL2GFDEXPL3PKW","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"24DL2GFD","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:24DL2GFDEXPL3PKWNX6RBEKRNX","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-12T22:46:57Z","cross_cats_sorted":[],"title_canon_sha256":"5c0a4eab44e59db92fd7855cce4451dbf5f8f02ecbfd63024da0fffc8c0d1419","abstract_canon_sha256":"51f3b4391ace8af1c5eb17daac5dce5b87b1ce49ede8cef0bc6b93c1690ab9e6"},"schema_version":"1.0"},"canonical_sha256":"d706bd18a325debdbd566dfd1091516df7cad36563bf28496ddbb303dd72f092","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:16.788832Z","signature_b64":"sEeykjN4qCY8kUp/xFbt7Iu2GJH4c0FnXk8C7fdSWIBQxCNT9XIh/ajWSyJbuFCSEqjnNS75glds3JnSzPOHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d706bd18a325debdbd566dfd1091516df7cad36563bf28496ddbb303dd72f092","last_reissued_at":"2026-05-18T01:12:16.788491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:16.788491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04256","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-18T01:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzkIAZACS5jpJJYMHnWcR5Gtkf+0HXZxrVZ5lRU1NrsuQ/78+VB6xthMlRc3RDnkK8e5O6zfq9gN35FlhMK4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:23:59.450885Z"},"content_sha256":"eafcbb18d9d6fa84cc60151b0a6dbc7fda7afbe2dd0c216859bec75f6ce9a578","schema_version":"1.0","event_id":"sha256:eafcbb18d9d6fa84cc60151b0a6dbc7fda7afbe2dd0c216859bec75f6ce9a578"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:24DL2GFDEXPL3PKWNX6RBEKRNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Squish: Near-Optimal Compression for Archival of Relational Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aditya Parameswaran, Yihan Gao","submitted_at":"2016-02-12T22:46:57Z","abstract_excerpt":"Relational datasets are being generated at an alarmingly rapid rate across organizations and industries. Compressing these datasets could significantly reduce storage and archival costs. Traditional compression algorithms, e.g., gzip, are suboptimal for compressing relational datasets since they ignore the table structure and relationships between attributes.\n  We study compression algorithms that leverage the relational structure to compress datasets to a much greater extent. We develop Squish, a system that uses a combination of Bayesian Networks and Arithmetic Coding to capture multiple kin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04256","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-18T01:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uf5idydLqpYQEpIlnjIzfOpsqaLydRVSzf9eOciv1AFr3ZY7o3al1B8iN7cmPmLwuG7dGTZ92GLnk+XNfBmtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:23:59.451455Z"},"content_sha256":"a80391489c2f02d8f5f775f544653cf3917e9cab6f3cc95b01716618d5785d83","schema_version":"1.0","event_id":"sha256:a80391489c2f02d8f5f775f544653cf3917e9cab6f3cc95b01716618d5785d83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24DL2GFDEXPL3PKWNX6RBEKRNX/bundle.json","state_url":"https://pith.science/pith/24DL2GFDEXPL3PKWNX6RBEKRNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24DL2GFDEXPL3PKWNX6RBEKRNX/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-05-19T13:23:59Z","links":{"resolver":"https://pith.science/pith/24DL2GFDEXPL3PKWNX6RBEKRNX","bundle":"https://pith.science/pith/24DL2GFDEXPL3PKWNX6RBEKRNX/bundle.json","state":"https://pith.science/pith/24DL2GFDEXPL3PKWNX6RBEKRNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24DL2GFDEXPL3PKWNX6RBEKRNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:24DL2GFDEXPL3PKWNX6RBEKRNX","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":"51f3b4391ace8af1c5eb17daac5dce5b87b1ce49ede8cef0bc6b93c1690ab9e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-12T22:46:57Z","title_canon_sha256":"5c0a4eab44e59db92fd7855cce4451dbf5f8f02ecbfd63024da0fffc8c0d1419"},"schema_version":"1.0","source":{"id":"1602.04256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04256","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04256v2","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04256","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"24DL2GFDEXPL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"24DL2GFDEXPL3PKW","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"24DL2GFD","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:a80391489c2f02d8f5f775f544653cf3917e9cab6f3cc95b01716618d5785d83","target":"graph","created_at":"2026-05-18T01:12:16Z","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":"Relational datasets are being generated at an alarmingly rapid rate across organizations and industries. Compressing these datasets could significantly reduce storage and archival costs. Traditional compression algorithms, e.g., gzip, are suboptimal for compressing relational datasets since they ignore the table structure and relationships between attributes.\n  We study compression algorithms that leverage the relational structure to compress datasets to a much greater extent. We develop Squish, a system that uses a combination of Bayesian Networks and Arithmetic Coding to capture multiple kin","authors_text":"Aditya Parameswaran, Yihan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-12T22:46:57Z","title":"Squish: Near-Optimal Compression for Archival of Relational Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04256","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:eafcbb18d9d6fa84cc60151b0a6dbc7fda7afbe2dd0c216859bec75f6ce9a578","target":"record","created_at":"2026-05-18T01:12:16Z","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":"51f3b4391ace8af1c5eb17daac5dce5b87b1ce49ede8cef0bc6b93c1690ab9e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-12T22:46:57Z","title_canon_sha256":"5c0a4eab44e59db92fd7855cce4451dbf5f8f02ecbfd63024da0fffc8c0d1419"},"schema_version":"1.0","source":{"id":"1602.04256","kind":"arxiv","version":2}},"canonical_sha256":"d706bd18a325debdbd566dfd1091516df7cad36563bf28496ddbb303dd72f092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d706bd18a325debdbd566dfd1091516df7cad36563bf28496ddbb303dd72f092","first_computed_at":"2026-05-18T01:12:16.788491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:16.788491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sEeykjN4qCY8kUp/xFbt7Iu2GJH4c0FnXk8C7fdSWIBQxCNT9XIh/ajWSyJbuFCSEqjnNS75glds3JnSzPOHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:16.788832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eafcbb18d9d6fa84cc60151b0a6dbc7fda7afbe2dd0c216859bec75f6ce9a578","sha256:a80391489c2f02d8f5f775f544653cf3917e9cab6f3cc95b01716618d5785d83"],"state_sha256":"1558e7c44498940ff6a0689eca6f59c6b1cc8d540beb479527aecfc1d81d6c6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HV+gtiTW76NPMtPjnbtzgx3lWRtnahh9FDzgDyyOckJjLapDsf3U1HYCPng+1rcjNlUz3wHyskY3o8TR3ElCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T13:23:59.453967Z","bundle_sha256":"3c81b146aa90eed4036ee8561f5fe91d80dbe67239b75c533fed9e42ea945254"}}