{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EYYMCNRENIRBH2LBP6V2JKRKRJ","short_pith_number":"pith:EYYMCNRE","schema_version":"1.0","canonical_sha256":"2630c136246a2213e9617faba4aa2a8a73c3193802a14af3d88e393f8c524ba8","source":{"kind":"arxiv","id":"1908.04196","version":4},"attestation_state":"computed","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"},"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":"1908.04196","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-12T15:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"7f4a9098e636dbf670ba332b634a285028ea2dbba3f9ea852e3a0fe71954e4f2","abstract_canon_sha256":"eff5605f474321152471d9df3deb6623aaf94a698c4316e8a2a1054adb949960"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:17.466891Z","signature_b64":"m9HUvXq1vT0LBIdu9MY0+yp54LRw0CJnwEigyCefJu0Uwy4ZlmYOtuGh2YZ6spR8Im937tojm01VKeM7wcDIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2630c136246a2213e9617faba4aa2a8a73c3193802a14af3d88e393f8c524ba8","last_reissued_at":"2026-07-05T01:33:17.466417Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:17.466417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.04196","created_at":"2026-07-05T01:33:17.466487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04196v4","created_at":"2026-07-05T01:33:17.466487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04196","created_at":"2026-07-05T01:33:17.466487+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYYMCNRENIRB","created_at":"2026-07-05T01:33:17.466487+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYYMCNRENIRBH2LB","created_at":"2026-07-05T01:33:17.466487+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYYMCNRE","created_at":"2026-07-05T01:33:17.466487+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/EYYMCNRENIRBH2LBP6V2JKRKRJ","json":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ.json","graph_json":"https://pith.science/api/pith-number/EYYMCNRENIRBH2LBP6V2JKRKRJ/graph.json","events_json":"https://pith.science/api/pith-number/EYYMCNRENIRBH2LBP6V2JKRKRJ/events.json","paper":"https://pith.science/paper/EYYMCNRE"},"agent_actions":{"view_html":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ","download_json":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ.json","view_paper":"https://pith.science/paper/EYYMCNRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04196&json=true","fetch_graph":"https://pith.science/api/pith-number/EYYMCNRENIRBH2LBP6V2JKRKRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EYYMCNRENIRBH2LBP6V2JKRKRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ/action/storage_attestation","attest_author":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ/action/author_attestation","sign_citation":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ/action/citation_signature","submit_replication":"https://pith.science/pith/EYYMCNRENIRBH2LBP6V2JKRKRJ/action/replication_record"}},"created_at":"2026-07-05T01:33:17.466487+00:00","updated_at":"2026-07-05T01:33:17.466487+00:00"}