{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DPRMW6YL4UWPOY3PJWBEQ4Y7RJ","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":"e66addc08242390e36a3e49d908589272186a79e973d5ceeb7b65465e3bc4b99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T06:54:44Z","title_canon_sha256":"76bbd861424c043974f37684f09689dfa82ae9982e6153c9c035e02fd373e2ed"},"schema_version":"1.0","source":{"id":"1301.0980","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0980","created_at":"2026-05-18T03:29:29Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0980v2","created_at":"2026-05-18T03:29:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0980","created_at":"2026-05-18T03:29:29Z"},{"alias_kind":"pith_short_12","alias_value":"DPRMW6YL4UWP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DPRMW6YL4UWPOY3P","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DPRMW6YL","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:8b64ca04831d4796973fe4a5dc0d29eb40ad8b4031836743f2978a23cf3b5fc4","target":"graph","created_at":"2026-05-18T03:29:29Z","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":"\\textit{Matching families} are one of the major ingredients in the construction of {\\em locally decodable codes} (LDCs) and the best known constructions of LDCs with a constant number of queries are based on matching families. The determination of the largest size of any matching family in $\\mathbb{Z}_m^n$, where $\\mathbb{Z}_m$ is the ring of integers modulo $m$, is an interesting problem. In this paper, we show an upper bound of $O((pq)^{0.625n+0.125})$ for the size of any matching family in $\\mathbb{Z}_{pq}^n$, where $p$ and $q$ are two distinct primes. Our bound is valid when $n$ is a const","authors_text":"Huaxiong Wang, Liang Feng Zhang, San Ling, Yeow Meng Chee","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T06:54:44Z","title":"Upper Bounds on Matching Families in $\\mathbb{Z}_{pq}^n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0980","kind":"arxiv","version":2},"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:026c640d4caa49692ad1c75e493f6f3dec5c6359971ab2918fca5eb24f6b3d37","target":"record","created_at":"2026-05-18T03:29:29Z","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":"e66addc08242390e36a3e49d908589272186a79e973d5ceeb7b65465e3bc4b99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T06:54:44Z","title_canon_sha256":"76bbd861424c043974f37684f09689dfa82ae9982e6153c9c035e02fd373e2ed"},"schema_version":"1.0","source":{"id":"1301.0980","kind":"arxiv","version":2}},"canonical_sha256":"1be2cb7b0be52cf7636f4d8248731f8a4d7d1cb453fa8dbd5d62808c45d3e9a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1be2cb7b0be52cf7636f4d8248731f8a4d7d1cb453fa8dbd5d62808c45d3e9a8","first_computed_at":"2026-05-18T03:29:29.380023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:29.380023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/P0Y7m9bP8AMgQj0GP+FKCb2rXJSDS2DUk6upCZJB6ZUOT3hf4cgce9JM35Vaiotp1f0vmHz5qpNXe66WM3xBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:29.380745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0980","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:026c640d4caa49692ad1c75e493f6f3dec5c6359971ab2918fca5eb24f6b3d37","sha256:8b64ca04831d4796973fe4a5dc0d29eb40ad8b4031836743f2978a23cf3b5fc4"],"state_sha256":"5b81bc87c1e9d51429fff1c92888bf316d1d300e9d9452be7b7b7b64e6b56e3b"}