{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2KMMD6B4W3QCWQ4PTBDT4L37K2","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":"a41dfe79d3ef7d524de6d8f37bb49adc5b0ae6a35d0685a398bc486f211f9f22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-10T08:55:52Z","title_canon_sha256":"881868cafbc291f5bc8dfdb579f0f2084a8ea12450eb9e8050ee3dad6fbc7f57"},"schema_version":"1.0","source":{"id":"2503.07072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.07072","created_at":"2026-07-05T10:27:49Z"},{"alias_kind":"arxiv_version","alias_value":"2503.07072v1","created_at":"2026-07-05T10:27:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07072","created_at":"2026-07-05T10:27:49Z"},{"alias_kind":"pith_short_12","alias_value":"2KMMD6B4W3QC","created_at":"2026-07-05T10:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"2KMMD6B4W3QCWQ4P","created_at":"2026-07-05T10:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"2KMMD6B4","created_at":"2026-07-05T10:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:0125e5e7d97684265f3f1ec59e5856cbb6400c3390ea78cf7ccbe8094ce8f228","target":"graph","created_at":"2026-07-05T10:27:49Z","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/2503.07072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of determining the maximum number of copies of $T$ in an $H$-free graph, for any graphs $T$ and $H$, was considered by Alon and Shikhelman. This is a variant of Tur\\'{a}n's classical extremal problem. We show lower and upper bounds for the maximum number of $s$-cliques in a graph with no disjoint copies of arbitrary graph. \nWe also determine the maximum number of $s$-cliques in an $n$-vertex graph that does not contain a disjoint union of $k$ paths of length two when $k=2,3$, or $s\\geqslant k+2$, or $n$ is sufficiently large, this partly confirms a conjecture posed by Chen, Yang, Y","authors_text":"Changhong Lu, Long-tu Yuan, Ping Li, Rui Sun, Zhipeng Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-10T08:55:52Z","title":"The maximum number of cliques in disjoint copies of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07072","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:a0bd55454550939d7f9f7732807287856220dd75d2d8a6e0bc9ec61f65fe3990","target":"record","created_at":"2026-07-05T10:27:49Z","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":"a41dfe79d3ef7d524de6d8f37bb49adc5b0ae6a35d0685a398bc486f211f9f22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-10T08:55:52Z","title_canon_sha256":"881868cafbc291f5bc8dfdb579f0f2084a8ea12450eb9e8050ee3dad6fbc7f57"},"schema_version":"1.0","source":{"id":"2503.07072","kind":"arxiv","version":1}},"canonical_sha256":"d298c1f83cb6e02b438f98473e2f7f5690a5bbfd1b7e9d023b80a7f3930207d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d298c1f83cb6e02b438f98473e2f7f5690a5bbfd1b7e9d023b80a7f3930207d7","first_computed_at":"2026-07-05T10:27:49.127781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:27:49.127781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oHMslgsrMa6EVGg/UQFkSAjBv6oX9xWSATJlvhoULNwFsHu9JAn5G8K+4w+b9/BJCw8buTGeN+yQJyeOMIkrBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:27:49.128782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.07072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0bd55454550939d7f9f7732807287856220dd75d2d8a6e0bc9ec61f65fe3990","sha256:0125e5e7d97684265f3f1ec59e5856cbb6400c3390ea78cf7ccbe8094ce8f228"],"state_sha256":"41d9dba0d0fc49411e6631b2135c1160a9c97c32ce8804b8ad2dce9dd428454f"}