{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:S5VLCCA2V6DGO3XK4URLH3E22P","short_pith_number":"pith:S5VLCCA2","schema_version":"1.0","canonical_sha256":"976ab1081aaf86676eeae522b3ec9ad3cf261828a8f49bb32a054c17a43f720c","source":{"kind":"arxiv","id":"2304.08135","version":1},"attestation_state":"computed","paper":{"title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Abhishek Dhawan, Alexander S. Wein, Cheng Mao","submitted_at":"2023-04-17T10:38:08Z","abstract_excerpt":"Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem that has been extensively studied in recent years. We study a hypergraph version of the problem. Let $G^r(n,p)$ denote the $r$-uniform Erd\\H{o}s-R\\'enyi hypergraph model with $n$ vertices and edge density $p$. We consider detecting the presence of a planted $G^r(n^\\gamma, n^{-\\alpha})$ subhypergraph in a $G^r(n, n^{-\\beta})$ hypergraph, where $0< \\alpha < \\beta < r-1$ and $0 < \\gamma < 1$. Focusing on tests that are degree-$n^{o(1)}$ polynomials of the entries of the adjacency tensor,"},"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":"2304.08135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-17T10:38:08Z","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"9378de9bc8a861f54ed8a030a347b61d9060ca4f3193a7ebdc44a83aaddae3f9","abstract_canon_sha256":"8ade4329f14f40e6b823105ca17490921f7e4bf80d6c61ccc83a8d84bba04501"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:39.719606Z","signature_b64":"JjYxib2AHdIyZYxHHm4a+upqrXV05IjxDw6acqWEtOt0ltoz2DIm8W71ZlWO0p0uaTLuZJmzhQqz390YC3aHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"976ab1081aaf86676eeae522b3ec9ad3cf261828a8f49bb32a054c17a43f720c","last_reissued_at":"2026-07-05T06:01:39.719124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:39.719124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Abhishek Dhawan, Alexander S. Wein, Cheng Mao","submitted_at":"2023-04-17T10:38:08Z","abstract_excerpt":"Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem that has been extensively studied in recent years. We study a hypergraph version of the problem. Let $G^r(n,p)$ denote the $r$-uniform Erd\\H{o}s-R\\'enyi hypergraph model with $n$ vertices and edge density $p$. We consider detecting the presence of a planted $G^r(n^\\gamma, n^{-\\alpha})$ subhypergraph in a $G^r(n, n^{-\\beta})$ hypergraph, where $0< \\alpha < \\beta < r-1$ and $0 < \\gamma < 1$. Focusing on tests that are degree-$n^{o(1)}$ polynomials of the entries of the adjacency tensor,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.08135","kind":"arxiv","version":1},"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/2304.08135/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":"2304.08135","created_at":"2026-07-05T06:01:39.719180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.08135v1","created_at":"2026-07-05T06:01:39.719180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08135","created_at":"2026-07-05T06:01:39.719180+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5VLCCA2V6DG","created_at":"2026-07-05T06:01:39.719180+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5VLCCA2V6DGO3XK","created_at":"2026-07-05T06:01:39.719180+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5VLCCA2","created_at":"2026-07-05T06:01:39.719180+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.14407","citing_title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P","json":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P.json","graph_json":"https://pith.science/api/pith-number/S5VLCCA2V6DGO3XK4URLH3E22P/graph.json","events_json":"https://pith.science/api/pith-number/S5VLCCA2V6DGO3XK4URLH3E22P/events.json","paper":"https://pith.science/paper/S5VLCCA2"},"agent_actions":{"view_html":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P","download_json":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P.json","view_paper":"https://pith.science/paper/S5VLCCA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.08135&json=true","fetch_graph":"https://pith.science/api/pith-number/S5VLCCA2V6DGO3XK4URLH3E22P/graph.json","fetch_events":"https://pith.science/api/pith-number/S5VLCCA2V6DGO3XK4URLH3E22P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P/action/storage_attestation","attest_author":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P/action/author_attestation","sign_citation":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P/action/citation_signature","submit_replication":"https://pith.science/pith/S5VLCCA2V6DGO3XK4URLH3E22P/action/replication_record"}},"created_at":"2026-07-05T06:01:39.719180+00:00","updated_at":"2026-07-05T06:01:39.719180+00:00"}