{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OKELMWG63IFOXS3QERIWF6PHH6","short_pith_number":"pith:OKELMWG6","schema_version":"1.0","canonical_sha256":"7288b658deda0aebcb70245162f9e73fa3010d933ce45d57685fb7446d14610a","source":{"kind":"arxiv","id":"1610.00140","version":3},"attestation_state":"computed","paper":{"title":"Induced bisecting families for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Rogers Mathew, Sudebkumar Prasant Pal, Tapas Kumar Mishra","submitted_at":"2016-10-01T14:21:06Z","abstract_excerpt":"Two $n$-dimensional vectors $A$ and $B$, $A,B \\in \\mathbb{R}^n$, are said to be \\emph{trivially orthogonal} if in every coordinate $i \\in [n]$, at least one of $A(i)$ or $B(i)$ is zero. Given the $n$-dimensional Hamming cube $\\{0,1\\}^n$, we study the minimum cardinality of a set $\\mathcal{V}$ of $n$-dimensional $\\{-1,0,1\\}$ vectors, each containing exactly $d$ non-zero entries, such that every `possible' point $A \\in \\{0,1\\}^n$ in the Hamming cube has some $V \\in \\mathcal{V}$ which is orthogonal, but not trivially orthogonal, to $A$. We give asymptotically tight lower and (constructive) upper "},"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":"1610.00140","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-01T14:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"475b17e53b86c3f3e3bad9d18bbf331582bb6c34c33fd6c86ff5d6743fc5021b","abstract_canon_sha256":"319b3ecbf66cf97c6d13e941e3b5ee042d60a6652e25488be130aea5b2359923"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:58.539081Z","signature_b64":"p3OQrY9t/UUf0d1t2RsfvJFRWMfEk4HUgavpIHYE8kPW9Nx/pffsFm4An/McEOf3I2yWZGHDewSutDnuBFtNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7288b658deda0aebcb70245162f9e73fa3010d933ce45d57685fb7446d14610a","last_reissued_at":"2026-05-18T00:52:58.538713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:58.538713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced bisecting families for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Rogers Mathew, Sudebkumar Prasant Pal, Tapas Kumar Mishra","submitted_at":"2016-10-01T14:21:06Z","abstract_excerpt":"Two $n$-dimensional vectors $A$ and $B$, $A,B \\in \\mathbb{R}^n$, are said to be \\emph{trivially orthogonal} if in every coordinate $i \\in [n]$, at least one of $A(i)$ or $B(i)$ is zero. Given the $n$-dimensional Hamming cube $\\{0,1\\}^n$, we study the minimum cardinality of a set $\\mathcal{V}$ of $n$-dimensional $\\{-1,0,1\\}$ vectors, each containing exactly $d$ non-zero entries, such that every `possible' point $A \\in \\{0,1\\}^n$ in the Hamming cube has some $V \\in \\mathcal{V}$ which is orthogonal, but not trivially orthogonal, to $A$. We give asymptotically tight lower and (constructive) upper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00140","kind":"arxiv","version":3},"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":"1610.00140","created_at":"2026-05-18T00:52:58.538768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00140v3","created_at":"2026-05-18T00:52:58.538768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00140","created_at":"2026-05-18T00:52:58.538768+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKELMWG63IFO","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKELMWG63IFOXS3Q","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKELMWG6","created_at":"2026-05-18T12:30:36.002864+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/OKELMWG63IFOXS3QERIWF6PHH6","json":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6.json","graph_json":"https://pith.science/api/pith-number/OKELMWG63IFOXS3QERIWF6PHH6/graph.json","events_json":"https://pith.science/api/pith-number/OKELMWG63IFOXS3QERIWF6PHH6/events.json","paper":"https://pith.science/paper/OKELMWG6"},"agent_actions":{"view_html":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6","download_json":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6.json","view_paper":"https://pith.science/paper/OKELMWG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00140&json=true","fetch_graph":"https://pith.science/api/pith-number/OKELMWG63IFOXS3QERIWF6PHH6/graph.json","fetch_events":"https://pith.science/api/pith-number/OKELMWG63IFOXS3QERIWF6PHH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6/action/storage_attestation","attest_author":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6/action/author_attestation","sign_citation":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6/action/citation_signature","submit_replication":"https://pith.science/pith/OKELMWG63IFOXS3QERIWF6PHH6/action/replication_record"}},"created_at":"2026-05-18T00:52:58.538768+00:00","updated_at":"2026-05-18T00:52:58.538768+00:00"}