{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z7KVOXD7NRPCOHKNDKZX4E6U2G","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":"395c012c53b8f39a30ce96ad6b02bb37f6b00a5611704069a8112d0efaddda4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-25T23:43:20Z","title_canon_sha256":"9cdb8b66ea784e937664d42266dac9aaa8c432e0c3566975a7d8a14b8bb4e5cf"},"schema_version":"1.0","source":{"id":"1605.08102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08102","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08102v1","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08102","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"Z7KVOXD7NRPC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z7KVOXD7NRPCOHKN","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z7KVOXD7","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:b64093640b545b1450be6dc9dcdfabf46f122d7b14eb81032d485b1fa282b241","target":"graph","created_at":"2026-05-18T01:13:37Z","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":"Synchronization codes are frequently used in numerical data transmission and storage. Compression by Substring Enumeration (CSE) is a new lossless compression scheme that has turned into a new and unusual application for synchronization codes. CSE is an inherently bit-oriented technique. However, since the usual benchmark files are all byte-oriented, CSE incurred a penalty due to a problem called phase unawareness. Subsequent work showed that inserting a synchronization code inside the data before compressing it improves the compression performance. In this paper, we present two constraint mod","authors_text":"Claude-Guy Quimper, Danny Dub\\'e, Dany Vohl","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-25T23:43:20Z","title":"Finding Synchronization Codes to Boost Compression by Substring Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08102","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:8a80d96352e2ccb53f90d4d29d47d20ae72255da4540620b3230c9910faaa040","target":"record","created_at":"2026-05-18T01:13:37Z","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":"395c012c53b8f39a30ce96ad6b02bb37f6b00a5611704069a8112d0efaddda4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-25T23:43:20Z","title_canon_sha256":"9cdb8b66ea784e937664d42266dac9aaa8c432e0c3566975a7d8a14b8bb4e5cf"},"schema_version":"1.0","source":{"id":"1605.08102","kind":"arxiv","version":1}},"canonical_sha256":"cfd5575c7f6c5e271d4d1ab37e13d4d1b231abf42a75547da5820dbadbeab6a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfd5575c7f6c5e271d4d1ab37e13d4d1b231abf42a75547da5820dbadbeab6a5","first_computed_at":"2026-05-18T01:13:37.112527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:37.112527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/CjK+ofUISrZ5L5w8PyajQ0Ym1jF3ehGyZn2MmnG2KL2fl3C972t5u3XtoJA7cKq00IDlCPHmwIZ2+wix0LDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:37.113001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a80d96352e2ccb53f90d4d29d47d20ae72255da4540620b3230c9910faaa040","sha256:b64093640b545b1450be6dc9dcdfabf46f122d7b14eb81032d485b1fa282b241"],"state_sha256":"66dc4e8f9706ea534e64c73b350d6df252d04c43d0a8f746f894149d857371ea"}