{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GADPXPPTCHAK3YB7F5TGYPWV3U","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":"1f94f2b86d8da14640655f64e18825e4ac04e0badbf0f06d426bbc715171368b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:21:33Z","title_canon_sha256":"e2f9e0136840ab20d88dd9334d91ee42ed39ebfca252baddfa310ff320de4dc4"},"schema_version":"1.0","source":{"id":"2605.15021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15021","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15021v1","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15021","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"GADPXPPTCHAK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GADPXPPTCHAK3YB7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GADPXPPT","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:9c50b7780f532c8d698d5d1ed9a7ad1241ed7d710b4469c0abd2f2f2c3122616","target":"graph","created_at":"2026-05-17T23:38:54Z","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"},"paper":{"abstract_excerpt":"For a graph $G$ and $e\\in [0,1]$, denote by $I_G(e)$ the supremum of densities of $G$ over $n$-vertex graphs with edge density $e$ as $n$ goes to infinity. Liu, Mubayi and Reiher asked if there exists a graph $G$, where $I_G(e)$ has a non-trivial local maximum. In this note we resolve their problem by showing that $I_{K_{2,2,1}}(e)$ has at least two local maxima in $(0,1)$. Additionally, we determine $I_{K_{2,2,1}}(e)$, when $e=(k-1)/k$ for every integer $k\\ge 3.$","authors_text":"Bernard Lidick\\'y, J\\'ozsef Balogh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:21:33Z","title":"Local maximum of inducibility profiles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.15021","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:2620cb9cc5fb095c53e0c4ef4b92941c14312656459975d4d1e9cea08469d215","target":"record","created_at":"2026-05-17T23:38:54Z","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":"1f94f2b86d8da14640655f64e18825e4ac04e0badbf0f06d426bbc715171368b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:21:33Z","title_canon_sha256":"e2f9e0136840ab20d88dd9334d91ee42ed39ebfca252baddfa310ff320de4dc4"},"schema_version":"1.0","source":{"id":"2605.15021","kind":"arxiv","version":1}},"canonical_sha256":"3006fbbdf311c0ade03f2f666c3ed5dd0519804d2bc27a10fc8de4cfe90381ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3006fbbdf311c0ade03f2f666c3ed5dd0519804d2bc27a10fc8de4cfe90381ac","first_computed_at":"2026-05-17T23:38:54.681119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:54.681119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0lchdOUYHn+q4vRg7Ah3gNeTNWXDPimd59ZLTzjyopJUKjLtmIFE9IlDavOMvteh7L+eCXFEMsOd+eRuFZ85Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:54.681818Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2620cb9cc5fb095c53e0c4ef4b92941c14312656459975d4d1e9cea08469d215","sha256:9c50b7780f532c8d698d5d1ed9a7ad1241ed7d710b4469c0abd2f2f2c3122616"],"state_sha256":"f4189e529996cd5743a7b9ed200a257b22e47f5bb234fc9e323b743c353c1702"}