{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NFZAFNTLGVOTKM7D5GISBGBXRS","short_pith_number":"pith:NFZAFNTL","schema_version":"1.0","canonical_sha256":"697202b66b355d3533e3e9912098378c99ba5ac266f952e48a703c7ea01731bb","source":{"kind":"arxiv","id":"1906.06070","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Hui Zhang, Xiande Zhang, Yeow Meng Chee","submitted_at":"2019-06-14T08:16:19Z","abstract_excerpt":"The study of Armstrong codes is motivated by the problem of understanding complexities of dependencies in relational database systems, where attributes have bounded domains. A $(q,k,n)$-Armstrong code is a $q$-ary code of length $n$ with minimum Hamming distance $n-k+1$, and for any set of $k-1$ coordinates there exist two codewords that agree exactly there. Let $f(q,k)$ be the maximum $n$ for which such a code exists. In this paper, $f(q,3)=3q-1$ is determined for all $q\\geq 5$ with three possible exceptions. This disproves a conjecture of Sali. Further, we introduce generalized Armstrong cod"},"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":"1906.06070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-14T08:16:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4a33516eb9d9728dae6e8b595a1c14a15fbe6db92be5570f6466ced7598bc9e5","abstract_canon_sha256":"6291cf843a3c8f6a4365917be96ae27cafafda6013d2874bb7bdbf799fbeab2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:19.829525Z","signature_b64":"tpoVSNn5HaOxzoeJWBEf52SYxoZcl1WeXBoam5MCST4iLGjp2Krp1dbi6pqlrY27W8+BgpA00vafgbsgPETMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"697202b66b355d3533e3e9912098378c99ba5ac266f952e48a703c7ea01731bb","last_reissued_at":"2026-05-17T23:43:19.828908Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:19.828908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Hui Zhang, Xiande Zhang, Yeow Meng Chee","submitted_at":"2019-06-14T08:16:19Z","abstract_excerpt":"The study of Armstrong codes is motivated by the problem of understanding complexities of dependencies in relational database systems, where attributes have bounded domains. A $(q,k,n)$-Armstrong code is a $q$-ary code of length $n$ with minimum Hamming distance $n-k+1$, and for any set of $k-1$ coordinates there exist two codewords that agree exactly there. Let $f(q,k)$ be the maximum $n$ for which such a code exists. In this paper, $f(q,3)=3q-1$ is determined for all $q\\geq 5$ with three possible exceptions. This disproves a conjecture of Sali. Further, we introduce generalized Armstrong cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06070","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":"1906.06070","created_at":"2026-05-17T23:43:19.829018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06070v1","created_at":"2026-05-17T23:43:19.829018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06070","created_at":"2026-05-17T23:43:19.829018+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFZAFNTLGVOT","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFZAFNTLGVOTKM7D","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFZAFNTL","created_at":"2026-05-18T12:33:24.271573+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/NFZAFNTLGVOTKM7D5GISBGBXRS","json":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS.json","graph_json":"https://pith.science/api/pith-number/NFZAFNTLGVOTKM7D5GISBGBXRS/graph.json","events_json":"https://pith.science/api/pith-number/NFZAFNTLGVOTKM7D5GISBGBXRS/events.json","paper":"https://pith.science/paper/NFZAFNTL"},"agent_actions":{"view_html":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS","download_json":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS.json","view_paper":"https://pith.science/paper/NFZAFNTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06070&json=true","fetch_graph":"https://pith.science/api/pith-number/NFZAFNTLGVOTKM7D5GISBGBXRS/graph.json","fetch_events":"https://pith.science/api/pith-number/NFZAFNTLGVOTKM7D5GISBGBXRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/action/storage_attestation","attest_author":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/action/author_attestation","sign_citation":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/action/citation_signature","submit_replication":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/action/replication_record"}},"created_at":"2026-05-17T23:43:19.829018+00:00","updated_at":"2026-05-17T23:43:19.829018+00:00"}