{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YZD2HQF3G2SQALARCEYFRUXKJQ","short_pith_number":"pith:YZD2HQF3","schema_version":"1.0","canonical_sha256":"c647a3c0bb36a5002c11113058d2ea4c25012e34d3d3eff461551db721678a27","source":{"kind":"arxiv","id":"2606.31967","version":1},"attestation_state":"computed","paper":{"title":"On clique-to-clique densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianhen Wang, Tianming Zhu","submitted_at":"2026-06-30T17:10:55Z","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"},"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.31967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T17:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"8e4dd8cfde7b11a3977dd4ea68042670364e26f7c1cc44a92b89b28b1f7773ce","abstract_canon_sha256":"46a334a5da40fb9bab8febadaeef5985cd5dc99ff250514bb45e7b4229c2fb9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:27.224278Z","signature_b64":"CcC6K38Z1beEVXl6d/GB7F6Sr7nm2/6rS61zG3ab83BHmljBZ6vMRuEPQQschsIRZFkyhRe7nsZHe7YeIaP6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c647a3c0bb36a5002c11113058d2ea4c25012e34d3d3eff461551db721678a27","last_reissued_at":"2026-07-01T01:18:27.223860Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:27.223860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On clique-to-clique densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianhen Wang, Tianming Zhu","submitted_at":"2026-06-30T17:10:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31967","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.31967/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.31967","created_at":"2026-07-01T01:18:27.223918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31967v1","created_at":"2026-07-01T01:18:27.223918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31967","created_at":"2026-07-01T01:18:27.223918+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZD2HQF3G2SQ","created_at":"2026-07-01T01:18:27.223918+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZD2HQF3G2SQALAR","created_at":"2026-07-01T01:18:27.223918+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZD2HQF3","created_at":"2026-07-01T01:18:27.223918+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.01073","citing_title":"An edge-spectral supersaturation of Mubayi's theorem for color-critical graphs","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ","json":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ.json","graph_json":"https://pith.science/api/pith-number/YZD2HQF3G2SQALARCEYFRUXKJQ/graph.json","events_json":"https://pith.science/api/pith-number/YZD2HQF3G2SQALARCEYFRUXKJQ/events.json","paper":"https://pith.science/paper/YZD2HQF3"},"agent_actions":{"view_html":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ","download_json":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ.json","view_paper":"https://pith.science/paper/YZD2HQF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31967&json=true","fetch_graph":"https://pith.science/api/pith-number/YZD2HQF3G2SQALARCEYFRUXKJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YZD2HQF3G2SQALARCEYFRUXKJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ/action/storage_attestation","attest_author":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ/action/author_attestation","sign_citation":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ/action/citation_signature","submit_replication":"https://pith.science/pith/YZD2HQF3G2SQALARCEYFRUXKJQ/action/replication_record"}},"created_at":"2026-07-01T01:18:27.223918+00:00","updated_at":"2026-07-01T01:18:27.223918+00:00"}