{"paper":{"title":"Hyperedge Estimation using Polylogarithmic Subset Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra","submitted_at":"2019-08-12T15:30:08Z","abstract_excerpt":"In this work, we estimate the number of hyperedges in a hypergraph ${\\cal H}(U({\\cal H}), {\\cal F}({\\cal H}))$, where $U({\\cal H})$ denotes the set of vertices and ${\\cal F}({\\cal H}))$ denotes the set of hyperedges. We assume a query oracle access to the hypergraph ${\\cal H}$. Estimating the number of edges, triangles or small subgraphs in a graph is a well studied problem. Beame \\etal~and Bhattacharya \\etal~gave algorithms to estimate the number of edges and triangles in a graph using queries to the {\\sc Bipartite Independent Set} ({\\sc BIS}) and the {\\sc Tripartite Independent Set} ({\\sc TI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04196","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04196/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"}