{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HSW6A7HXBX24BHRLRAW2UBEGPL","short_pith_number":"pith:HSW6A7HX","canonical_record":{"source":{"id":"1304.4819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T13:30:23Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"c14b97f3b80da3f1966aa49742b033a83d740f0b8587dfac5c203137b1b59dd9","abstract_canon_sha256":"006e5611a517aafa253da3111fdc7eaa6e4193e942e3bc907071c53d3057d5c3"},"schema_version":"1.0"},"canonical_sha256":"3cade07cf70df5c09e2b882daa04867ae64c184779cfd029110cef98bc80a86b","source":{"kind":"arxiv","id":"1304.4819","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4819","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4819v2","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4819","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"HSW6A7HXBX24","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HSW6A7HXBX24BHRL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HSW6A7HX","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HSW6A7HXBX24BHRLRAW2UBEGPL","target":"record","payload":{"canonical_record":{"source":{"id":"1304.4819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T13:30:23Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"c14b97f3b80da3f1966aa49742b033a83d740f0b8587dfac5c203137b1b59dd9","abstract_canon_sha256":"006e5611a517aafa253da3111fdc7eaa6e4193e942e3bc907071c53d3057d5c3"},"schema_version":"1.0"},"canonical_sha256":"3cade07cf70df5c09e2b882daa04867ae64c184779cfd029110cef98bc80a86b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:42.210617Z","signature_b64":"5/jMw7ZkklILFKQov26B8i6wIyFceyR8osndO0zkgAYpxx2IAOEq6P5kAJfeuXoCwIePMIs4hR+op+hh0BqgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cade07cf70df5c09e2b882daa04867ae64c184779cfd029110cef98bc80a86b","last_reissued_at":"2026-05-18T03:27:42.209962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:42.209962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.4819","source_version":2,"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-18T03:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upvvkPPVvO6DXrAglhZDwdwcoutaNB1Oz091jR2qOcltA1wp52Nvg5Mbe+E5QioR/Sjfo822eMYLWJuExETXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:31:19.466790Z"},"content_sha256":"db3d889c7b75be5a595a1fb8596fa0c9b5ea5649ae87fa1abf9d6a7180a4d5bf","schema_version":"1.0","event_id":"sha256:db3d889c7b75be5a595a1fb8596fa0c9b5ea5649ae87fa1abf9d6a7180a4d5bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HSW6A7HXBX24BHRLRAW2UBEGPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matching-Vector Families and LDCs Over Large Modulo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Guangda Hu, Zeev Dvir","submitted_at":"2013-04-17T13:30:23Z","abstract_excerpt":"We prove new upper bounds on the size of families of vectors in $\\Z_m^n$ with restricted modular inner products, when $m$ is a large integer. More formally, if $\\vec{u}_1,\\ldots,\\vec{u}_t \\in \\Z_m^n$ and $\\vec{v}_1,\\ldots,\\vec{v}_t \\in \\Z_m^n$ satisfy $\\langle\\vec{u}_i,\\vec{v}_i\\rangle\\equiv0\\pmod m$ and $\\langle\\vec{u}_i,\\vec{v}_j\\rangle\\not\\equiv0\\pmod m$ for all $i\\neq j\\in[t]$, we prove that $t \\leq O(m^{n/2+8.47})$. This improves a recent bound of $t \\leq m^{n/2 + O(\\log(m))}$ by \\cite{BDL13} and is the best possible up to the constant 8.47 when $m$ is sufficiently larger than $n$.\n  The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4819","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"},"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-18T03:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYgg3E4KnvbUFjvBq+bY/UcsjZEVp2VvSqUkkABdvqx2IK5x0yZYe7gL3jgSYku4SPwyx20dF9FQkHEW3DGmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:31:19.467123Z"},"content_sha256":"eeb840abf998bdd02e33057937a72ddadaab9458825124d28b557354439cae6a","schema_version":"1.0","event_id":"sha256:eeb840abf998bdd02e33057937a72ddadaab9458825124d28b557354439cae6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSW6A7HXBX24BHRLRAW2UBEGPL/bundle.json","state_url":"https://pith.science/pith/HSW6A7HXBX24BHRLRAW2UBEGPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSW6A7HXBX24BHRLRAW2UBEGPL/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-09T12:31:19Z","links":{"resolver":"https://pith.science/pith/HSW6A7HXBX24BHRLRAW2UBEGPL","bundle":"https://pith.science/pith/HSW6A7HXBX24BHRLRAW2UBEGPL/bundle.json","state":"https://pith.science/pith/HSW6A7HXBX24BHRLRAW2UBEGPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSW6A7HXBX24BHRLRAW2UBEGPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HSW6A7HXBX24BHRLRAW2UBEGPL","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":"006e5611a517aafa253da3111fdc7eaa6e4193e942e3bc907071c53d3057d5c3","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T13:30:23Z","title_canon_sha256":"c14b97f3b80da3f1966aa49742b033a83d740f0b8587dfac5c203137b1b59dd9"},"schema_version":"1.0","source":{"id":"1304.4819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4819","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4819v2","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4819","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"HSW6A7HXBX24","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HSW6A7HXBX24BHRL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HSW6A7HX","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:eeb840abf998bdd02e33057937a72ddadaab9458825124d28b557354439cae6a","target":"graph","created_at":"2026-05-18T03:27:42Z","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":"We prove new upper bounds on the size of families of vectors in $\\Z_m^n$ with restricted modular inner products, when $m$ is a large integer. More formally, if $\\vec{u}_1,\\ldots,\\vec{u}_t \\in \\Z_m^n$ and $\\vec{v}_1,\\ldots,\\vec{v}_t \\in \\Z_m^n$ satisfy $\\langle\\vec{u}_i,\\vec{v}_i\\rangle\\equiv0\\pmod m$ and $\\langle\\vec{u}_i,\\vec{v}_j\\rangle\\not\\equiv0\\pmod m$ for all $i\\neq j\\in[t]$, we prove that $t \\leq O(m^{n/2+8.47})$. This improves a recent bound of $t \\leq m^{n/2 + O(\\log(m))}$ by \\cite{BDL13} and is the best possible up to the constant 8.47 when $m$ is sufficiently larger than $n$.\n  The ","authors_text":"Guangda Hu, Zeev Dvir","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T13:30:23Z","title":"Matching-Vector Families and LDCs Over Large Modulo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4819","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:db3d889c7b75be5a595a1fb8596fa0c9b5ea5649ae87fa1abf9d6a7180a4d5bf","target":"record","created_at":"2026-05-18T03:27:42Z","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":"006e5611a517aafa253da3111fdc7eaa6e4193e942e3bc907071c53d3057d5c3","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T13:30:23Z","title_canon_sha256":"c14b97f3b80da3f1966aa49742b033a83d740f0b8587dfac5c203137b1b59dd9"},"schema_version":"1.0","source":{"id":"1304.4819","kind":"arxiv","version":2}},"canonical_sha256":"3cade07cf70df5c09e2b882daa04867ae64c184779cfd029110cef98bc80a86b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cade07cf70df5c09e2b882daa04867ae64c184779cfd029110cef98bc80a86b","first_computed_at":"2026-05-18T03:27:42.209962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:42.209962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/jMw7ZkklILFKQov26B8i6wIyFceyR8osndO0zkgAYpxx2IAOEq6P5kAJfeuXoCwIePMIs4hR+op+hh0BqgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:42.210617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db3d889c7b75be5a595a1fb8596fa0c9b5ea5649ae87fa1abf9d6a7180a4d5bf","sha256:eeb840abf998bdd02e33057937a72ddadaab9458825124d28b557354439cae6a"],"state_sha256":"9de700f4e78de7e987e506b7a75acbbc3bbcc84ccf3e5c86b97633303b0aca7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQ4D8JJ/PZDuUm+tA+RT5W+4s8t9vROT7aImJofUt8LdFEPU8L73+GSmSThF0XHnbOXU5A8C8R8Jaz5EaUWGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:31:19.469191Z","bundle_sha256":"9dc63b905705df6b85de7936ea37f431f37cb8d37ff6e765a7f2e86a2202bd82"}}