{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:YL3O6L3YTCIKZW2ZI4LDDIN3CP","short_pith_number":"pith:YL3O6L3Y","canonical_record":{"source":{"id":"cs/0601036","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-01-10T12:16:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e4fd47fcaf84cf78981e4d2ae4f99444db667fa19ce79a8b734c58e9bacac15","abstract_canon_sha256":"3a466b9259aa9f6cd08fbaa8fcca92d7e995c69f2b7f8a03b0f9a5cd1ed332c2"},"schema_version":"1.0"},"canonical_sha256":"c2f6ef2f789890acdb59471631a1bb13ca90563424a8f6008cab67d77956f7bb","source":{"kind":"arxiv","id":"cs/0601036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0601036","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0601036v1","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0601036","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"YL3O6L3YTCIK","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"YL3O6L3YTCIKZW2Z","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"YL3O6L3Y","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:YL3O6L3YTCIKZW2ZI4LDDIN3CP","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0601036","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-01-10T12:16:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e4fd47fcaf84cf78981e4d2ae4f99444db667fa19ce79a8b734c58e9bacac15","abstract_canon_sha256":"3a466b9259aa9f6cd08fbaa8fcca92d7e995c69f2b7f8a03b0f9a5cd1ed332c2"},"schema_version":"1.0"},"canonical_sha256":"c2f6ef2f789890acdb59471631a1bb13ca90563424a8f6008cab67d77956f7bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:08.890855Z","signature_b64":"5G9u6nENjP3mGKwl2ROLM1D3o8iZyMKzj9SdXhzXGGPA3ikMwPGA3stRWMmivuumPaNae4KSgNi30ova9p+jAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f6ef2f789890acdb59471631a1bb13ca90563424a8f6008cab67d77956f7bb","last_reissued_at":"2026-05-18T00:58:08.890213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:08.890213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0601036","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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vE06uFKtf583h2n1EFRt8XOtQsTJpBiqbh4PJjyrZ///uBecc7aGoCLyi+M5KElE+PUknKqKDvo6kOeCmuNmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:42:45.423657Z"},"content_sha256":"361bda8257cc99e5feea96cf7b5ef2133b6c89f4ef20147469cf0fa38e773e42","schema_version":"1.0","event_id":"sha256:361bda8257cc99e5feea96cf7b5ef2133b6c89f4ef20147469cf0fa38e773e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:YL3O6L3YTCIKZW2ZI4LDDIN3CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of computing the capacity of codes that avoid forbidden difference patterns","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Raphael Jungers, Vincent D. Blondel, Vladimir Protasov","submitted_at":"2006-01-10T12:16:05Z","abstract_excerpt":"We consider questions related to the computation of the capacity of codes that avoid forbidden difference patterns. The maximal number of $n$-bit sequences whose pairwise differences do not contain some given forbidden difference patterns increases exponentially with $n$. The exponent is the capacity of the forbidden patterns, which is given by the logarithm of the joint spectral radius of a set of matrices constructed from the forbidden difference patterns. We provide a new family of bounds that allows for the approximation, in exponential time, of the capacity with arbitrary high degree of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0601036","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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1z21vKO6ZCsOXCQ6V+KXAJPV8BaOCwa3Mc2uoRTLvo8cgwKvebruC2lJUC7uekdwJNuvdfbM4JcQVxMd+23Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:42:45.424014Z"},"content_sha256":"3c646053a2303101042958c526cbfee778eb6ce3c9c30936124eb3b9251a959e","schema_version":"1.0","event_id":"sha256:3c646053a2303101042958c526cbfee778eb6ce3c9c30936124eb3b9251a959e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/bundle.json","state_url":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/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-02T21:42:45Z","links":{"resolver":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP","bundle":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/bundle.json","state":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:YL3O6L3YTCIKZW2ZI4LDDIN3CP","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":"3a466b9259aa9f6cd08fbaa8fcca92d7e995c69f2b7f8a03b0f9a5cd1ed332c2","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-01-10T12:16:05Z","title_canon_sha256":"8e4fd47fcaf84cf78981e4d2ae4f99444db667fa19ce79a8b734c58e9bacac15"},"schema_version":"1.0","source":{"id":"cs/0601036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0601036","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0601036v1","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0601036","created_at":"2026-05-18T00:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"YL3O6L3YTCIK","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"YL3O6L3YTCIKZW2Z","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"YL3O6L3Y","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:3c646053a2303101042958c526cbfee778eb6ce3c9c30936124eb3b9251a959e","target":"graph","created_at":"2026-05-18T00:58:08Z","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":"We consider questions related to the computation of the capacity of codes that avoid forbidden difference patterns. The maximal number of $n$-bit sequences whose pairwise differences do not contain some given forbidden difference patterns increases exponentially with $n$. The exponent is the capacity of the forbidden patterns, which is given by the logarithm of the joint spectral radius of a set of matrices constructed from the forbidden difference patterns. We provide a new family of bounds that allows for the approximation, in exponential time, of the capacity with arbitrary high degree of a","authors_text":"Raphael Jungers, Vincent D. Blondel, Vladimir Protasov","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2006-01-10T12:16:05Z","title":"On the complexity of computing the capacity of codes that avoid forbidden difference patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0601036","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:361bda8257cc99e5feea96cf7b5ef2133b6c89f4ef20147469cf0fa38e773e42","target":"record","created_at":"2026-05-18T00:58:08Z","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":"3a466b9259aa9f6cd08fbaa8fcca92d7e995c69f2b7f8a03b0f9a5cd1ed332c2","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-01-10T12:16:05Z","title_canon_sha256":"8e4fd47fcaf84cf78981e4d2ae4f99444db667fa19ce79a8b734c58e9bacac15"},"schema_version":"1.0","source":{"id":"cs/0601036","kind":"arxiv","version":1}},"canonical_sha256":"c2f6ef2f789890acdb59471631a1bb13ca90563424a8f6008cab67d77956f7bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2f6ef2f789890acdb59471631a1bb13ca90563424a8f6008cab67d77956f7bb","first_computed_at":"2026-05-18T00:58:08.890213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:08.890213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5G9u6nENjP3mGKwl2ROLM1D3o8iZyMKzj9SdXhzXGGPA3ikMwPGA3stRWMmivuumPaNae4KSgNi30ova9p+jAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:08.890855Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0601036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:361bda8257cc99e5feea96cf7b5ef2133b6c89f4ef20147469cf0fa38e773e42","sha256:3c646053a2303101042958c526cbfee778eb6ce3c9c30936124eb3b9251a959e"],"state_sha256":"f5855171d74e40eda4dc03ec764ac87215289be59c942c62a02959187f345acb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPGljFKI9TJ5w82xXvFiaK0QBmhIvgjdB1r1XRBSpyHHpuY5vi+e3pto6md84HR/j2c/+a01GEsNbqlWWba4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:42:45.426068Z","bundle_sha256":"e3fa5e7153b9e897c218ac4a764df6db7dd694771d5f74502bbd9ebcf0ce145e"}}