{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EWVGM44KXZVVWCSF7L2PD35CBJ","short_pith_number":"pith:EWVGM44K","canonical_record":{"source":{"id":"1006.0284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T03:14:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5e223c615c973a688022471e4aec3b925478ece3e52f1f2ed7eff2adce759d3","abstract_canon_sha256":"44dc34f1763315a4853b6916a21891fc06ba42fb022a4cb4946469c00ed3b0de"},"schema_version":"1.0"},"canonical_sha256":"25aa66738abe6b5b0a45faf4f1efa20a46c8cfa51b785e30782479a34db229a1","source":{"kind":"arxiv","id":"1006.0284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0284","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0284v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0284","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"EWVGM44KXZVV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EWVGM44KXZVVWCSF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EWVGM44K","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EWVGM44KXZVVWCSF7L2PD35CBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1006.0284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T03:14:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5e223c615c973a688022471e4aec3b925478ece3e52f1f2ed7eff2adce759d3","abstract_canon_sha256":"44dc34f1763315a4853b6916a21891fc06ba42fb022a4cb4946469c00ed3b0de"},"schema_version":"1.0"},"canonical_sha256":"25aa66738abe6b5b0a45faf4f1efa20a46c8cfa51b785e30782479a34db229a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.933147Z","signature_b64":"+e2xevySnMQcHEZvrwYFPg+XdTnXQtxJEbtpT+k4ny1vmsUIDfx9KEAfLjlwaZqKlqSlmcC92TGZXwkP2aCCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25aa66738abe6b5b0a45faf4f1efa20a46c8cfa51b785e30782479a34db229a1","last_reissued_at":"2026-05-18T00:59:10.932543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.932543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.0284","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iap7+euKxS1Gdxl8FTdQUPAirQd3+y6jEYu1Gfya7cr8LoWweTWdDbuPByCJ/4i6ecPIkg6HkBdogqd2JBkBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:35:41.511656Z"},"content_sha256":"f1b7a9597f0634f1a77a798f6bb9d6d01aa4ef3754a2a8abfc47a5d7684915fa","schema_version":"1.0","event_id":"sha256:f1b7a9597f0634f1a77a798f6bb9d6d01aa4ef3754a2a8abfc47a5d7684915fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EWVGM44KXZVVWCSF7L2PD35CBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Optimality of Antidictionary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hiroyoshi Morita, Takahiro Ota","submitted_at":"2010-06-02T03:14:46Z","abstract_excerpt":"An antidictionary code is a lossless compression algorithm using an antidictionary which is a set of minimal words that do not occur as substrings in an input string. The code was proposed by Crochemore et al. in 2000, and its asymptotic optimality has been proved with respect to only a specific information source, called balanced binary source that is a binary Markov source in which a state transition occurs with probability 1/2 or 1. In this paper, we prove the optimality of both static and dynamic antidictionary codes with respect to a stationary ergodic Markov source on finite alphabet suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0284","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCarivO09Qso2dQ2dTJJfMkInGBjMG/wOIcLQ4N8op+Ne/MYOTTVNErxeIJrCbGSWXjigASC/Q1ZLSVOYgBaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:35:41.511990Z"},"content_sha256":"b71ba2c1a2d00d732d69f74396b7866d9693e022bf3ae1a58535dc8fb674edbf","schema_version":"1.0","event_id":"sha256:b71ba2c1a2d00d732d69f74396b7866d9693e022bf3ae1a58535dc8fb674edbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWVGM44KXZVVWCSF7L2PD35CBJ/bundle.json","state_url":"https://pith.science/pith/EWVGM44KXZVVWCSF7L2PD35CBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWVGM44KXZVVWCSF7L2PD35CBJ/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-20T20:35:41Z","links":{"resolver":"https://pith.science/pith/EWVGM44KXZVVWCSF7L2PD35CBJ","bundle":"https://pith.science/pith/EWVGM44KXZVVWCSF7L2PD35CBJ/bundle.json","state":"https://pith.science/pith/EWVGM44KXZVVWCSF7L2PD35CBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWVGM44KXZVVWCSF7L2PD35CBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EWVGM44KXZVVWCSF7L2PD35CBJ","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":"44dc34f1763315a4853b6916a21891fc06ba42fb022a4cb4946469c00ed3b0de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T03:14:46Z","title_canon_sha256":"e5e223c615c973a688022471e4aec3b925478ece3e52f1f2ed7eff2adce759d3"},"schema_version":"1.0","source":{"id":"1006.0284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0284","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0284v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0284","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"EWVGM44KXZVV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EWVGM44KXZVVWCSF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EWVGM44K","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:b71ba2c1a2d00d732d69f74396b7866d9693e022bf3ae1a58535dc8fb674edbf","target":"graph","created_at":"2026-05-18T00:59:10Z","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":"An antidictionary code is a lossless compression algorithm using an antidictionary which is a set of minimal words that do not occur as substrings in an input string. The code was proposed by Crochemore et al. in 2000, and its asymptotic optimality has been proved with respect to only a specific information source, called balanced binary source that is a binary Markov source in which a state transition occurs with probability 1/2 or 1. In this paper, we prove the optimality of both static and dynamic antidictionary codes with respect to a stationary ergodic Markov source on finite alphabet suc","authors_text":"Hiroyoshi Morita, Takahiro Ota","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T03:14:46Z","title":"Asymptotic Optimality of Antidictionary Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0284","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:f1b7a9597f0634f1a77a798f6bb9d6d01aa4ef3754a2a8abfc47a5d7684915fa","target":"record","created_at":"2026-05-18T00:59:10Z","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":"44dc34f1763315a4853b6916a21891fc06ba42fb022a4cb4946469c00ed3b0de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T03:14:46Z","title_canon_sha256":"e5e223c615c973a688022471e4aec3b925478ece3e52f1f2ed7eff2adce759d3"},"schema_version":"1.0","source":{"id":"1006.0284","kind":"arxiv","version":1}},"canonical_sha256":"25aa66738abe6b5b0a45faf4f1efa20a46c8cfa51b785e30782479a34db229a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25aa66738abe6b5b0a45faf4f1efa20a46c8cfa51b785e30782479a34db229a1","first_computed_at":"2026-05-18T00:59:10.932543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.932543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+e2xevySnMQcHEZvrwYFPg+XdTnXQtxJEbtpT+k4ny1vmsUIDfx9KEAfLjlwaZqKlqSlmcC92TGZXwkP2aCCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.933147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.0284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1b7a9597f0634f1a77a798f6bb9d6d01aa4ef3754a2a8abfc47a5d7684915fa","sha256:b71ba2c1a2d00d732d69f74396b7866d9693e022bf3ae1a58535dc8fb674edbf"],"state_sha256":"8fefb444e7b5a40923d94cb4082c5da7d13d2815e0d3cf9827ca71c8933c1f13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXvQ+RgZgjvYJizcPl6EI0kD5w/q2KrgUJl3AudvC7ia927cRyv5USb3v4VVgLwtIJGMcmn8lyLj4ezOmSTdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:35:41.513891Z","bundle_sha256":"d3ebb9b6c77ff09cc9469b5e1b9a32a40b99f7611f8b30cf8578180828a788d1"}}