{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:YL3O6L3YTCIKZW2ZI4LDDIN3CP","short_pith_number":"pith:YL3O6L3Y","schema_version":"1.0","canonical_sha256":"c2f6ef2f789890acdb59471631a1bb13ca90563424a8f6008cab67d77956f7bb","source":{"kind":"arxiv","id":"cs/0601036","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0601036","created_at":"2026-05-18T00:58:08.890305+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0601036v1","created_at":"2026-05-18T00:58:08.890305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0601036","created_at":"2026-05-18T00:58:08.890305+00:00"},{"alias_kind":"pith_short_12","alias_value":"YL3O6L3YTCIK","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"YL3O6L3YTCIKZW2Z","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"YL3O6L3Y","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP","json":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP.json","graph_json":"https://pith.science/api/pith-number/YL3O6L3YTCIKZW2ZI4LDDIN3CP/graph.json","events_json":"https://pith.science/api/pith-number/YL3O6L3YTCIKZW2ZI4LDDIN3CP/events.json","paper":"https://pith.science/paper/YL3O6L3Y"},"agent_actions":{"view_html":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP","download_json":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP.json","view_paper":"https://pith.science/paper/YL3O6L3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0601036&json=true","fetch_graph":"https://pith.science/api/pith-number/YL3O6L3YTCIKZW2ZI4LDDIN3CP/graph.json","fetch_events":"https://pith.science/api/pith-number/YL3O6L3YTCIKZW2ZI4LDDIN3CP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/action/storage_attestation","attest_author":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/action/author_attestation","sign_citation":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/action/citation_signature","submit_replication":"https://pith.science/pith/YL3O6L3YTCIKZW2ZI4LDDIN3CP/action/replication_record"}},"created_at":"2026-05-18T00:58:08.890305+00:00","updated_at":"2026-05-18T00:58:08.890305+00:00"}