{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3UZ2YIFQYAZASDUJ2KAJYFSMLB","short_pith_number":"pith:3UZ2YIFQ","schema_version":"1.0","canonical_sha256":"dd33ac20b0c032090e89d2809c164c586630939022f0c757d067a84b62d4fc51","source":{"kind":"arxiv","id":"1204.1367","version":2},"attestation_state":"computed","paper":{"title":"New Lower Bounds for Matching Vector Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Abhishek Bhowmick, Shachar Lovett, Zeev Dvir","submitted_at":"2012-04-05T22:16:37Z","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"},"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":"1204.1367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T22:16:37Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8756731099c3087e25afaa4566e0d7006f58fdf10ad51e458a8439d744559673","abstract_canon_sha256":"a63c21ac000a099b1f14d669755d3cf20119e76c62684d7309be406ccd4067d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:37.714952Z","signature_b64":"/tJove5Pv/EizsR+Gy0hYtZ5sYB8PROAA9IKyzHlj5wZ+2MHAlyD9Ms+TB+n9ls1licPwiShPklsrOGus8xAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd33ac20b0c032090e89d2809c164c586630939022f0c757d067a84b62d4fc51","last_reissued_at":"2026-05-18T03:29:37.714294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:37.714294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Lower Bounds for Matching Vector Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Abhishek Bhowmick, Shachar Lovett, Zeev Dvir","submitted_at":"2012-04-05T22:16:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1367","kind":"arxiv","version":2},"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":"1204.1367","created_at":"2026-05-18T03:29:37.714425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1367v2","created_at":"2026-05-18T03:29:37.714425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1367","created_at":"2026-05-18T03:29:37.714425+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UZ2YIFQYAZA","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UZ2YIFQYAZASDUJ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UZ2YIFQ","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.03451","citing_title":"Redundancy Is All You Need (for CSP Sparsification)","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB","json":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB.json","graph_json":"https://pith.science/api/pith-number/3UZ2YIFQYAZASDUJ2KAJYFSMLB/graph.json","events_json":"https://pith.science/api/pith-number/3UZ2YIFQYAZASDUJ2KAJYFSMLB/events.json","paper":"https://pith.science/paper/3UZ2YIFQ"},"agent_actions":{"view_html":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB","download_json":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB.json","view_paper":"https://pith.science/paper/3UZ2YIFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1367&json=true","fetch_graph":"https://pith.science/api/pith-number/3UZ2YIFQYAZASDUJ2KAJYFSMLB/graph.json","fetch_events":"https://pith.science/api/pith-number/3UZ2YIFQYAZASDUJ2KAJYFSMLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB/action/storage_attestation","attest_author":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB/action/author_attestation","sign_citation":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB/action/citation_signature","submit_replication":"https://pith.science/pith/3UZ2YIFQYAZASDUJ2KAJYFSMLB/action/replication_record"}},"created_at":"2026-05-18T03:29:37.714425+00:00","updated_at":"2026-05-18T03:29:37.714425+00:00"}