{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QI6JBSIXMA7IAIPTFZSMCZSZKY","short_pith_number":"pith:QI6JBSIX","schema_version":"1.0","canonical_sha256":"823c90c917603e8021f32e64c16659561fcda6db208bb6398e000bcebb8cff4f","source":{"kind":"arxiv","id":"2606.02546","version":1},"attestation_state":"computed","paper":{"title":"Abundance of Unique Subhypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xichao Shu, Yisai Xue, Zhuo Wu","submitted_at":"2026-06-01T17:48:48Z","abstract_excerpt":"Given $k$-uniform hypergraphs $G$ and $H$, we say that $G$ is a unique subhypergraph of $H$ if $H$ contains exactly one subhypergraph isomorphic to $G$. For an $n$-vertex $k$-graph $H$, let $f_k(H)$ be the number of non-isomorphic unique subhypergraphs of $H$, normalized by $2^{\\binom n k}/n!$, and let $f_k(n)$ be the maximum of $f_k(H)$ over all $n$-vertex $k$-graphs $H$. In the graph case $k=2$, Erd\\H{o}s asked whether there exists a constant $\\delta>0$ such that $f_2(n)>\\delta$ for all $n$, offering \\$100 for a proof and \\$25 for a disproof.\n  Recently, Brada\\v{c} and Christoph answered thi"},"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":"2606.02546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T17:48:48Z","cross_cats_sorted":[],"title_canon_sha256":"efd4fa7c55ffadda5e245d0ea4c64af09ae2109cb9e1f7ea02bebbf6965f68c0","abstract_canon_sha256":"e0727865ac2f929669ed621b12f27eb60c9c3c334d1914238c118ecc91cfdc44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:05:09.264833Z","signature_b64":"wvgMVQhCJbyBVBJ4G7py0l4dq+tiwoV+VS4gYPeJb6OXBq51jer4KJekP7VnhDcMmUfleZL2LQubgioRXhFlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823c90c917603e8021f32e64c16659561fcda6db208bb6398e000bcebb8cff4f","last_reissued_at":"2026-06-02T03:05:09.264437Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:05:09.264437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abundance of Unique Subhypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xichao Shu, Yisai Xue, Zhuo Wu","submitted_at":"2026-06-01T17:48:48Z","abstract_excerpt":"Given $k$-uniform hypergraphs $G$ and $H$, we say that $G$ is a unique subhypergraph of $H$ if $H$ contains exactly one subhypergraph isomorphic to $G$. For an $n$-vertex $k$-graph $H$, let $f_k(H)$ be the number of non-isomorphic unique subhypergraphs of $H$, normalized by $2^{\\binom n k}/n!$, and let $f_k(n)$ be the maximum of $f_k(H)$ over all $n$-vertex $k$-graphs $H$. In the graph case $k=2$, Erd\\H{o}s asked whether there exists a constant $\\delta>0$ such that $f_2(n)>\\delta$ for all $n$, offering \\$100 for a proof and \\$25 for a disproof.\n  Recently, Brada\\v{c} and Christoph answered thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02546","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/2606.02546/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":"2606.02546","created_at":"2026-06-02T03:05:09.264494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02546v1","created_at":"2026-06-02T03:05:09.264494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02546","created_at":"2026-06-02T03:05:09.264494+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI6JBSIXMA7I","created_at":"2026-06-02T03:05:09.264494+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI6JBSIXMA7IAIPT","created_at":"2026-06-02T03:05:09.264494+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI6JBSIX","created_at":"2026-06-02T03:05:09.264494+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/QI6JBSIXMA7IAIPTFZSMCZSZKY","json":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY.json","graph_json":"https://pith.science/api/pith-number/QI6JBSIXMA7IAIPTFZSMCZSZKY/graph.json","events_json":"https://pith.science/api/pith-number/QI6JBSIXMA7IAIPTFZSMCZSZKY/events.json","paper":"https://pith.science/paper/QI6JBSIX"},"agent_actions":{"view_html":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY","download_json":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY.json","view_paper":"https://pith.science/paper/QI6JBSIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02546&json=true","fetch_graph":"https://pith.science/api/pith-number/QI6JBSIXMA7IAIPTFZSMCZSZKY/graph.json","fetch_events":"https://pith.science/api/pith-number/QI6JBSIXMA7IAIPTFZSMCZSZKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY/action/storage_attestation","attest_author":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY/action/author_attestation","sign_citation":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY/action/citation_signature","submit_replication":"https://pith.science/pith/QI6JBSIXMA7IAIPTFZSMCZSZKY/action/replication_record"}},"created_at":"2026-06-02T03:05:09.264494+00:00","updated_at":"2026-06-02T03:05:09.264494+00:00"}