{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OWN25KCSBJMKWF5GBL7HXXVTRS","short_pith_number":"pith:OWN25KCS","schema_version":"1.0","canonical_sha256":"759baea8520a58ab17a60afe7bdeb38cbb58b293b7c2f03500b3cc8dafc6beab","source":{"kind":"arxiv","id":"2606.26735","version":1},"attestation_state":"computed","paper":{"title":"Strong counterexamples to Mubayi's supersaturation conjecture in every uniformity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heng Li, Hong Liu, Jing Wang, Xizhi Liu","submitted_at":"2026-06-25T08:16:56Z","abstract_excerpt":"The classical supersaturation problem, originating in classical results of Rademacher and Erd\\H{o}s on complete graphs, asks for the minimum number of copies of an $r$-graph $\\mathcal{F}$ in an $n$-vertex $r$-graph with $\\ex(n,\\mathcal{F})+q$ edges. Mubayi conjectured that, for every stable non-$r$-partite $r$-graph $\\mathcal{F}$, this minimum is at least $q c(n,\\mathcal{F})$, where $c(n,\\mathcal{F})$ is the minimum number of copies created by adding one edge to the $n$-vertex extremal $\\mathcal{F}$-free $r$-graph. Ma and Yuan recently constructed infinitely many graph counterexamples, with ar"},"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.26735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-25T08:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"1c3cbc2fdecd36d56be0d231d751288578689fc5e1cc93ea1874ebfd269fe875","abstract_canon_sha256":"ced0c15e60db74caa91bc34be62e38a54991b7498b2d69664785bd2e122da95e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:58.375841Z","signature_b64":"BxrIHaCL21Yt/zeF7l09jJCeDvJ915E0OoZwanjzkqAZyxMhYNQLMVAHmzD4HqX/PgPw52tZWKXKXAR/wwUnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"759baea8520a58ab17a60afe7bdeb38cbb58b293b7c2f03500b3cc8dafc6beab","last_reissued_at":"2026-06-26T01:15:58.375449Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:58.375449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong counterexamples to Mubayi's supersaturation conjecture in every uniformity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heng Li, Hong Liu, Jing Wang, Xizhi Liu","submitted_at":"2026-06-25T08:16:56Z","abstract_excerpt":"The classical supersaturation problem, originating in classical results of Rademacher and Erd\\H{o}s on complete graphs, asks for the minimum number of copies of an $r$-graph $\\mathcal{F}$ in an $n$-vertex $r$-graph with $\\ex(n,\\mathcal{F})+q$ edges. Mubayi conjectured that, for every stable non-$r$-partite $r$-graph $\\mathcal{F}$, this minimum is at least $q c(n,\\mathcal{F})$, where $c(n,\\mathcal{F})$ is the minimum number of copies created by adding one edge to the $n$-vertex extremal $\\mathcal{F}$-free $r$-graph. Ma and Yuan recently constructed infinitely many graph counterexamples, with ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26735","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.26735/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.26735","created_at":"2026-06-26T01:15:58.375503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26735v1","created_at":"2026-06-26T01:15:58.375503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26735","created_at":"2026-06-26T01:15:58.375503+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWN25KCSBJMK","created_at":"2026-06-26T01:15:58.375503+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWN25KCSBJMKWF5G","created_at":"2026-06-26T01:15:58.375503+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWN25KCS","created_at":"2026-06-26T01:15:58.375503+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/OWN25KCSBJMKWF5GBL7HXXVTRS","json":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS.json","graph_json":"https://pith.science/api/pith-number/OWN25KCSBJMKWF5GBL7HXXVTRS/graph.json","events_json":"https://pith.science/api/pith-number/OWN25KCSBJMKWF5GBL7HXXVTRS/events.json","paper":"https://pith.science/paper/OWN25KCS"},"agent_actions":{"view_html":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS","download_json":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS.json","view_paper":"https://pith.science/paper/OWN25KCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26735&json=true","fetch_graph":"https://pith.science/api/pith-number/OWN25KCSBJMKWF5GBL7HXXVTRS/graph.json","fetch_events":"https://pith.science/api/pith-number/OWN25KCSBJMKWF5GBL7HXXVTRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS/action/storage_attestation","attest_author":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS/action/author_attestation","sign_citation":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS/action/citation_signature","submit_replication":"https://pith.science/pith/OWN25KCSBJMKWF5GBL7HXXVTRS/action/replication_record"}},"created_at":"2026-06-26T01:15:58.375503+00:00","updated_at":"2026-06-26T01:15:58.375503+00:00"}