{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:AYQVPF3G77BSTR7ALJ4DTU4IW2","short_pith_number":"pith:AYQVPF3G","schema_version":"1.0","canonical_sha256":"0621579766ffc329c7e05a7839d388b68a5f9d96b5649028ae7abcfd1590045d","source":{"kind":"arxiv","id":"0901.3170","version":2},"attestation_state":"computed","paper":{"title":"On linear balancing sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar, Pascal O. Vontobel, Ron M. Roth","submitted_at":"2009-01-21T05:22:03Z","abstract_excerpt":"Let n be an even positive integer and F be the field \\GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \\subseteq F^n$ is called a balancing set if for every word y \\in F^n there is a word x \\in C such that y + x is balanced. It is shown that most linear subspaces of F^n of dimension slightly larger than 3/2\\log_2(n) are balancing sets. A generalization of this result to linear subspaces that are \"almost balancing\" is also presented. On the other hand, it is shown that the problem of deciding whether a given set of vectors in F^n spans a balancing set, is NP-hard"},"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":"0901.3170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-21T05:22:03Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"db9e98bae3b6acabf9d2d12503c624f21cad0e82fb4fcaf93a58f10bd2aa740f","abstract_canon_sha256":"40e130d39fc43819f37a927cb1854bdad6e129f6cc7725a4d506a4c7ccfe1f90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:16.218573Z","signature_b64":"tTLld7DTEVrXvr3T+vxHYw9tgktoU+xzXqw/wQuxGlwd24cbCs5PuqjyknG6HYqldad7TMc/4Wx47A/9g0T1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0621579766ffc329c7e05a7839d388b68a5f9d96b5649028ae7abcfd1590045d","last_reissued_at":"2026-05-18T04:33:16.218147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:16.218147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On linear balancing sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar, Pascal O. Vontobel, Ron M. Roth","submitted_at":"2009-01-21T05:22:03Z","abstract_excerpt":"Let n be an even positive integer and F be the field \\GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \\subseteq F^n$ is called a balancing set if for every word y \\in F^n there is a word x \\in C such that y + x is balanced. It is shown that most linear subspaces of F^n of dimension slightly larger than 3/2\\log_2(n) are balancing sets. A generalization of this result to linear subspaces that are \"almost balancing\" is also presented. On the other hand, it is shown that the problem of deciding whether a given set of vectors in F^n spans a balancing set, is NP-hard"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3170","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":"0901.3170","created_at":"2026-05-18T04:33:16.218201+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.3170v2","created_at":"2026-05-18T04:33:16.218201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3170","created_at":"2026-05-18T04:33:16.218201+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYQVPF3G77BS","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYQVPF3G77BSTR7A","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYQVPF3G","created_at":"2026-05-18T12:25:58.837520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2","json":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2.json","graph_json":"https://pith.science/api/pith-number/AYQVPF3G77BSTR7ALJ4DTU4IW2/graph.json","events_json":"https://pith.science/api/pith-number/AYQVPF3G77BSTR7ALJ4DTU4IW2/events.json","paper":"https://pith.science/paper/AYQVPF3G"},"agent_actions":{"view_html":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2","download_json":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2.json","view_paper":"https://pith.science/paper/AYQVPF3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.3170&json=true","fetch_graph":"https://pith.science/api/pith-number/AYQVPF3G77BSTR7ALJ4DTU4IW2/graph.json","fetch_events":"https://pith.science/api/pith-number/AYQVPF3G77BSTR7ALJ4DTU4IW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2/action/storage_attestation","attest_author":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2/action/author_attestation","sign_citation":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2/action/citation_signature","submit_replication":"https://pith.science/pith/AYQVPF3G77BSTR7ALJ4DTU4IW2/action/replication_record"}},"created_at":"2026-05-18T04:33:16.218201+00:00","updated_at":"2026-05-18T04:33:16.218201+00:00"}