{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QI6JBSIXMA7IAIPTFZSMCZSZKY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e0727865ac2f929669ed621b12f27eb60c9c3c334d1914238c118ecc91cfdc44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T17:48:48Z","title_canon_sha256":"efd4fa7c55ffadda5e245d0ea4c64af09ae2109cb9e1f7ea02bebbf6965f68c0"},"schema_version":"1.0","source":{"id":"2606.02546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02546","created_at":"2026-06-02T03:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02546v1","created_at":"2026-06-02T03:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02546","created_at":"2026-06-02T03:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"QI6JBSIXMA7I","created_at":"2026-06-02T03:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"QI6JBSIXMA7IAIPT","created_at":"2026-06-02T03:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"QI6JBSIX","created_at":"2026-06-02T03:05:09Z"}],"graph_snapshots":[{"event_id":"sha256:f5c54c4c5e74122c486ba25c542cf9ced289f10a29cd9457865b3f0e4b4f0b54","target":"graph","created_at":"2026-06-02T03:05:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.02546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Xichao Shu, Yisai Xue, Zhuo Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T17:48:48Z","title":"Abundance of Unique Subhypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02546","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:da66d01e126dc63d3d717a27b68746fc0f187843681f05723fd6e5b56f3ed542","target":"record","created_at":"2026-06-02T03:05:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e0727865ac2f929669ed621b12f27eb60c9c3c334d1914238c118ecc91cfdc44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T17:48:48Z","title_canon_sha256":"efd4fa7c55ffadda5e245d0ea4c64af09ae2109cb9e1f7ea02bebbf6965f68c0"},"schema_version":"1.0","source":{"id":"2606.02546","kind":"arxiv","version":1}},"canonical_sha256":"823c90c917603e8021f32e64c16659561fcda6db208bb6398e000bcebb8cff4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"823c90c917603e8021f32e64c16659561fcda6db208bb6398e000bcebb8cff4f","first_computed_at":"2026-06-02T03:05:09.264437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:05:09.264437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wvgMVQhCJbyBVBJ4G7py0l4dq+tiwoV+VS4gYPeJb6OXBq51jer4KJekP7VnhDcMmUfleZL2LQubgioRXhFlCA==","signature_status":"signed_v1","signed_at":"2026-06-02T03:05:09.264833Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da66d01e126dc63d3d717a27b68746fc0f187843681f05723fd6e5b56f3ed542","sha256:f5c54c4c5e74122c486ba25c542cf9ced289f10a29cd9457865b3f0e4b4f0b54"],"state_sha256":"2b32dce2dda7e884a1eea7be0ae0fe1bf2f3dffb8cf584f9c7162709645f0aa1"}