{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QC6MULZWJXC4A3KYQ5CGSSPGW7","short_pith_number":"pith:QC6MULZW","canonical_record":{"source":{"id":"1106.3791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-06-20T01:10:01Z","cross_cats_sorted":["cs.CE","cs.IT","math.IT"],"title_canon_sha256":"9359d8222941930118e13212979ebf41fef48694043ca7c064e32556de5e1505","abstract_canon_sha256":"7b631fa919658183ac2d8d68f29db47c7b50a60d62d35058f8da664a43c5741b"},"schema_version":"1.0"},"canonical_sha256":"80bcca2f364dc5c06d5887446949e6b7f7f48c5ed49493c9e981994bd3876a5e","source":{"kind":"arxiv","id":"1106.3791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3791","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3791v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3791","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"QC6MULZWJXC4","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QC6MULZWJXC4A3KY","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QC6MULZW","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QC6MULZWJXC4A3KYQ5CGSSPGW7","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-06-20T01:10:01Z","cross_cats_sorted":["cs.CE","cs.IT","math.IT"],"title_canon_sha256":"9359d8222941930118e13212979ebf41fef48694043ca7c064e32556de5e1505","abstract_canon_sha256":"7b631fa919658183ac2d8d68f29db47c7b50a60d62d35058f8da664a43c5741b"},"schema_version":"1.0"},"canonical_sha256":"80bcca2f364dc5c06d5887446949e6b7f7f48c5ed49493c9e981994bd3876a5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:42.129841Z","signature_b64":"4VkZToaXYP6ep4AUO16UvBlXbGeFOw7tjAgBkuUMy/gEYo9CKZsTzFp0v/Wvhoylol9n9Glrd/KfYRYtXPK7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80bcca2f364dc5c06d5887446949e6b7f7f48c5ed49493c9e981994bd3876a5e","last_reissued_at":"2026-05-18T04:19:42.129242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:42.129242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3791","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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LgBA6wfma4Fnk0RBYXncwSMhVi6rKk7kRpky8EpNo6RGWif7y4yUyTjlr6jJVpa/QWxK00hSefe46at7yqMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T21:58:43.887347Z"},"content_sha256":"2e3d2e4c4005af547c3903a26be1f49eee9ea1ec290703ba7c20c36a10198833","schema_version":"1.0","event_id":"sha256:2e3d2e4c4005af547c3903a26be1f49eee9ea1ec290703ba7c20c36a10198833"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QC6MULZWJXC4A3KYQ5CGSSPGW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reference Sequence Construction for Relative Compression of Genomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.IT","math.IT"],"primary_cat":"q-bio.QM","authors_text":"Justin Zobel, Shanika Kuruppu, Simon Puglisi","submitted_at":"2011-06-20T01:10:01Z","abstract_excerpt":"Relative compression, where a set of similar strings are compressed with respect to a reference string, is a very effective method of compressing DNA datasets containing multiple similar sequences. Relative compression is fast to perform and also supports rapid random access to the underlying data. The main difficulty of relative compression is in selecting an appropriate reference sequence. In this paper, we explore using the dictionary of repeats generated by Comrad, Re-pair and Dna-x algorithms as reference sequences for relative compression. We show this technique allows better compression"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3791","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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cy1ykFFAIBpSL2nXpOZfk6jDIvnufVLlxSDNJF7TENkw6CYEVUS1hF85fet3L2Cao95SFM379viSq7yWQrlLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T21:58:43.887958Z"},"content_sha256":"6630c8add1255a75b59b6305a0f23a573fb995b8978c1852b9037a25c245e272","schema_version":"1.0","event_id":"sha256:6630c8add1255a75b59b6305a0f23a573fb995b8978c1852b9037a25c245e272"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QC6MULZWJXC4A3KYQ5CGSSPGW7/bundle.json","state_url":"https://pith.science/pith/QC6MULZWJXC4A3KYQ5CGSSPGW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QC6MULZWJXC4A3KYQ5CGSSPGW7/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-07-07T21:58:43Z","links":{"resolver":"https://pith.science/pith/QC6MULZWJXC4A3KYQ5CGSSPGW7","bundle":"https://pith.science/pith/QC6MULZWJXC4A3KYQ5CGSSPGW7/bundle.json","state":"https://pith.science/pith/QC6MULZWJXC4A3KYQ5CGSSPGW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QC6MULZWJXC4A3KYQ5CGSSPGW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QC6MULZWJXC4A3KYQ5CGSSPGW7","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":"7b631fa919658183ac2d8d68f29db47c7b50a60d62d35058f8da664a43c5741b","cross_cats_sorted":["cs.CE","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-06-20T01:10:01Z","title_canon_sha256":"9359d8222941930118e13212979ebf41fef48694043ca7c064e32556de5e1505"},"schema_version":"1.0","source":{"id":"1106.3791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3791","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3791v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3791","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"QC6MULZWJXC4","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QC6MULZWJXC4A3KY","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QC6MULZW","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:6630c8add1255a75b59b6305a0f23a573fb995b8978c1852b9037a25c245e272","target":"graph","created_at":"2026-05-18T04:19:42Z","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":"Relative compression, where a set of similar strings are compressed with respect to a reference string, is a very effective method of compressing DNA datasets containing multiple similar sequences. Relative compression is fast to perform and also supports rapid random access to the underlying data. The main difficulty of relative compression is in selecting an appropriate reference sequence. In this paper, we explore using the dictionary of repeats generated by Comrad, Re-pair and Dna-x algorithms as reference sequences for relative compression. We show this technique allows better compression","authors_text":"Justin Zobel, Shanika Kuruppu, Simon Puglisi","cross_cats":["cs.CE","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-06-20T01:10:01Z","title":"Reference Sequence Construction for Relative Compression of Genomes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3791","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:2e3d2e4c4005af547c3903a26be1f49eee9ea1ec290703ba7c20c36a10198833","target":"record","created_at":"2026-05-18T04:19:42Z","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":"7b631fa919658183ac2d8d68f29db47c7b50a60d62d35058f8da664a43c5741b","cross_cats_sorted":["cs.CE","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-06-20T01:10:01Z","title_canon_sha256":"9359d8222941930118e13212979ebf41fef48694043ca7c064e32556de5e1505"},"schema_version":"1.0","source":{"id":"1106.3791","kind":"arxiv","version":1}},"canonical_sha256":"80bcca2f364dc5c06d5887446949e6b7f7f48c5ed49493c9e981994bd3876a5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80bcca2f364dc5c06d5887446949e6b7f7f48c5ed49493c9e981994bd3876a5e","first_computed_at":"2026-05-18T04:19:42.129242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:42.129242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4VkZToaXYP6ep4AUO16UvBlXbGeFOw7tjAgBkuUMy/gEYo9CKZsTzFp0v/Wvhoylol9n9Glrd/KfYRYtXPK7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:42.129841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e3d2e4c4005af547c3903a26be1f49eee9ea1ec290703ba7c20c36a10198833","sha256:6630c8add1255a75b59b6305a0f23a573fb995b8978c1852b9037a25c245e272"],"state_sha256":"a0b63d0397347bce3fedf26bdaee8efdd732bc1130941b732c83bff5f30db9d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6azgKNk7DiEGxI0XZ9hm6Cu4z6ws6LFZGjvrEu2eexTKEsEHbfO/kKrPpgvqULZVllMLn/GI0+oiCB0XahHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T21:58:43.891448Z","bundle_sha256":"49093d495b1c3254aa62fa7388316ba010588a7319d6d05ded2a0de669d36fdd"}}