{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YZD2HQF3G2SQALARCEYFRUXKJQ","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":"46a334a5da40fb9bab8febadaeef5985cd5dc99ff250514bb45e7b4229c2fb9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T17:10:55Z","title_canon_sha256":"8e4dd8cfde7b11a3977dd4ea68042670364e26f7c1cc44a92b89b28b1f7773ce"},"schema_version":"1.0","source":{"id":"2606.31967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31967","created_at":"2026-07-01T01:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31967v1","created_at":"2026-07-01T01:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31967","created_at":"2026-07-01T01:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"YZD2HQF3G2SQ","created_at":"2026-07-01T01:18:27Z"},{"alias_kind":"pith_short_16","alias_value":"YZD2HQF3G2SQALAR","created_at":"2026-07-01T01:18:27Z"},{"alias_kind":"pith_short_8","alias_value":"YZD2HQF3","created_at":"2026-07-01T01:18:27Z"}],"graph_snapshots":[{"event_id":"sha256:7a98aa6d47de9a4251870a9687553f93ead112dfdacc8c1b1eedad83f9d3648d","target":"graph","created_at":"2026-07-01T01:18:27Z","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.31967/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $k_r(G)$ denote the number of $r$-cliques in a graph $G$ and let $F_r(\\cdot)$ be the Lov\\'asz--Simonovits $r$-clique density function. For any integers $2\\le s<t$, we determine the asymptotically sharp lower bound on $k_t(G)$ in an $n$-vertex graph $G$ with a prescribed number $k_s(G)$, by showing that \\[ \\frac{k_t(G)}{n^t}\\ge F_t\\!\\left(F_s^{-1}\\!\\left(\\frac{k_s(G)}{n^s}\\right)\\right), \\] where $F_s^{-1}$ denotes the generalized inverse. This strengthens Bollob\\'as's piecewise-linear interpolation bound and, in the case $s=2$, recovers Reiher's clique density theorem via a new inductive p","authors_text":"Jie Ma, Tianhen Wang, Tianming Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T17:10:55Z","title":"On clique-to-clique densities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31967","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:7803c31f7c6c85adb81e0b8f2c996ecf83bad34476420edae64a571098548b95","target":"record","created_at":"2026-07-01T01:18:27Z","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":"46a334a5da40fb9bab8febadaeef5985cd5dc99ff250514bb45e7b4229c2fb9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T17:10:55Z","title_canon_sha256":"8e4dd8cfde7b11a3977dd4ea68042670364e26f7c1cc44a92b89b28b1f7773ce"},"schema_version":"1.0","source":{"id":"2606.31967","kind":"arxiv","version":1}},"canonical_sha256":"c647a3c0bb36a5002c11113058d2ea4c25012e34d3d3eff461551db721678a27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c647a3c0bb36a5002c11113058d2ea4c25012e34d3d3eff461551db721678a27","first_computed_at":"2026-07-01T01:18:27.223860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:27.223860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CcC6K38Z1beEVXl6d/GB7F6Sr7nm2/6rS61zG3ab83BHmljBZ6vMRuEPQQschsIRZFkyhRe7nsZHe7YeIaP6AA==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:27.224278Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7803c31f7c6c85adb81e0b8f2c996ecf83bad34476420edae64a571098548b95","sha256:7a98aa6d47de9a4251870a9687553f93ead112dfdacc8c1b1eedad83f9d3648d"],"state_sha256":"352735e3eb39f5b291c8f54d2c4eb13702b14f0381eb5a8c90ffaceacafb6cb5"}