{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3UZ2YIFQYAZASDUJ2KAJYFSMLB","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":"a63c21ac000a099b1f14d669755d3cf20119e76c62684d7309be406ccd4067d2","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T22:16:37Z","title_canon_sha256":"8756731099c3087e25afaa4566e0d7006f58fdf10ad51e458a8439d744559673"},"schema_version":"1.0","source":{"id":"1204.1367","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1367","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1367v2","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1367","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"3UZ2YIFQYAZA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3UZ2YIFQYAZASDUJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3UZ2YIFQ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:a0cb24610cd99de9669c6b46efb65a70c88ae8f088c93a4c9937e949b7ef232c","target":"graph","created_at":"2026-05-18T03:29:37Z","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":"A Matching Vector (MV) family modulo $m$ is a pair of ordered lists $U=(u_1,...,u_t)$ and $V=(v_1,...,v_t)$ where $u_i,v_j \\in \\mathbb{Z}_m^n$ with the following inner product pattern: for any $i$, $< u_i,v_i>=0$, and for any $i \\ne j$, $< u_i,v_j> \\ne 0$. A MV family is called $q$-restricted if inner products $< u_i,v_j>$ take at most $q$ different values.\n  Our interest in MV families stems from their recent application in the construction of sub-exponential locally decodable codes (LDCs). There, $q$-restricted MV families are used to construct LDCs with $q$ queries, and there is special int","authors_text":"Abhishek Bhowmick, Shachar Lovett, Zeev Dvir","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T22:16:37Z","title":"New Lower Bounds for Matching Vector Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1367","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:51df6ede79628920907a4f26e6f5b54b34d875a1d1a56ab5ef7647470c52142d","target":"record","created_at":"2026-05-18T03:29:37Z","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":"a63c21ac000a099b1f14d669755d3cf20119e76c62684d7309be406ccd4067d2","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T22:16:37Z","title_canon_sha256":"8756731099c3087e25afaa4566e0d7006f58fdf10ad51e458a8439d744559673"},"schema_version":"1.0","source":{"id":"1204.1367","kind":"arxiv","version":2}},"canonical_sha256":"dd33ac20b0c032090e89d2809c164c586630939022f0c757d067a84b62d4fc51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd33ac20b0c032090e89d2809c164c586630939022f0c757d067a84b62d4fc51","first_computed_at":"2026-05-18T03:29:37.714294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:37.714294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/tJove5Pv/EizsR+Gy0hYtZ5sYB8PROAA9IKyzHlj5wZ+2MHAlyD9Ms+TB+n9ls1licPwiShPklsrOGus8xAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:37.714952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1367","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51df6ede79628920907a4f26e6f5b54b34d875a1d1a56ab5ef7647470c52142d","sha256:a0cb24610cd99de9669c6b46efb65a70c88ae8f088c93a4c9937e949b7ef232c"],"state_sha256":"5370b95138dd84b9809b19c46bc71e8e159dde7c6b3942ad934ab6b0e6ceea44"}