{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NFZAFNTLGVOTKM7D5GISBGBXRS","short_pith_number":"pith:NFZAFNTL","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"},"canonical_sha256":"697202b66b355d3533e3e9912098378c99ba5ac266f952e48a703c7ea01731bb","source":{"kind":"arxiv","id":"1906.06070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06070","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06070v1","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06070","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"NFZAFNTLGVOT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NFZAFNTLGVOTKM7D","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NFZAFNTL","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NFZAFNTLGVOTKM7D5GISBGBXRS","target":"record","payload":{"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"},"canonical_sha256":"697202b66b355d3533e3e9912098378c99ba5ac266f952e48a703c7ea01731bb","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"},"source_kind":"arxiv","source_id":"1906.06070","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-17T23:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrz4eT1Wrfd95K31iycMphwPblT+3j4Cqmwa/SzIao+fFV1GsoHpnSvICOJLfyoH33+obuszWwzlzpGDWrwICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:04:21.120132Z"},"content_sha256":"9bc817ec5f9af354f2d862afc0f8bc9713c0c89b77f6a762272423c0adea654a","schema_version":"1.0","event_id":"sha256:9bc817ec5f9af354f2d862afc0f8bc9713c0c89b77f6a762272423c0adea654a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NFZAFNTLGVOTKM7D5GISBGBXRS","target":"graph","payload":{"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"},"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-17T23:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Izx3PnEX1d/+RK1xYpoy/BePpZa62xOl4H+Sxp5iR5aZ3xAgK/vcNLDb+HyMS8T3Dr2nNgRaj9Osq+ItPY1qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:04:21.120916Z"},"content_sha256":"6638287b4ea3ad17b007430518b222d02d27c330db7597ec29333e1be486f02b","schema_version":"1.0","event_id":"sha256:6638287b4ea3ad17b007430518b222d02d27c330db7597ec29333e1be486f02b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/bundle.json","state_url":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/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-11T06:04:21Z","links":{"resolver":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS","bundle":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/bundle.json","state":"https://pith.science/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NFZAFNTLGVOTKM7D5GISBGBXRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NFZAFNTLGVOTKM7D5GISBGBXRS","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":"6291cf843a3c8f6a4365917be96ae27cafafda6013d2874bb7bdbf799fbeab2e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-14T08:16:19Z","title_canon_sha256":"4a33516eb9d9728dae6e8b595a1c14a15fbe6db92be5570f6466ced7598bc9e5"},"schema_version":"1.0","source":{"id":"1906.06070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06070","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06070v1","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06070","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"NFZAFNTLGVOT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NFZAFNTLGVOTKM7D","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NFZAFNTL","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:6638287b4ea3ad17b007430518b222d02d27c330db7597ec29333e1be486f02b","target":"graph","created_at":"2026-05-17T23:43:19Z","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":"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","authors_text":"Hui Zhang, Xiande Zhang, Yeow Meng Chee","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-14T08:16:19Z","title":"Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06070","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:9bc817ec5f9af354f2d862afc0f8bc9713c0c89b77f6a762272423c0adea654a","target":"record","created_at":"2026-05-17T23:43:19Z","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":"6291cf843a3c8f6a4365917be96ae27cafafda6013d2874bb7bdbf799fbeab2e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-14T08:16:19Z","title_canon_sha256":"4a33516eb9d9728dae6e8b595a1c14a15fbe6db92be5570f6466ced7598bc9e5"},"schema_version":"1.0","source":{"id":"1906.06070","kind":"arxiv","version":1}},"canonical_sha256":"697202b66b355d3533e3e9912098378c99ba5ac266f952e48a703c7ea01731bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"697202b66b355d3533e3e9912098378c99ba5ac266f952e48a703c7ea01731bb","first_computed_at":"2026-05-17T23:43:19.828908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:19.828908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tpoVSNn5HaOxzoeJWBEf52SYxoZcl1WeXBoam5MCST4iLGjp2Krp1dbi6pqlrY27W8+BgpA00vafgbsgPETMCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:19.829525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bc817ec5f9af354f2d862afc0f8bc9713c0c89b77f6a762272423c0adea654a","sha256:6638287b4ea3ad17b007430518b222d02d27c330db7597ec29333e1be486f02b"],"state_sha256":"425e61ee77603b8d660817d55a0e998650bf247bd41a12dc68f56bc8085c981a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvKfIVsmHzqC/pXti0qdWMx1G8j/UvYHsIKGFsP0tJtqGbYipk2Nlxo7MegoO8otXhpaU0J3wYXqdJ1Rm5SoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:04:21.125229Z","bundle_sha256":"3ffc4c582752784fd52a2133713dbe556367a1e493173586541d8650c1b57baa"}}