{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NKUL7SRAL46P4JTLVHAHEA5RON","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":"88ac717b5e8b195623d8ad16a2a57565f0c9840eb37a97abbb9ab6312f15812a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T16:39:07Z","title_canon_sha256":"67486eb87781496125b50284fbbf564bf0da2ddbe0d5b70a2c056a93c4c66bb2"},"schema_version":"1.0","source":{"id":"1510.08373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08373","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08373v1","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08373","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"pith_short_12","alias_value":"NKUL7SRAL46P","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NKUL7SRAL46P4JTL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NKUL7SRA","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:1f59f714e48bed2ad22eae7359395c9015dc975fb7a9115aa7f906d3ce82540a","target":"graph","created_at":"2026-05-18T01:28:36Z","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":"An extremal graph for a graph $H$ on $n$ vertices is a graph on $n$ vertices with maximum number of edges that does not contain $H$ as a subgraph. Let $T_{n,r}$ be the Tur\\'{a}n graph, which is the complete $r$-partite graph on $n$ vertices with part sizes that differ by at most one. The well-known Tur\\'{a}n Theorem states that $T_{n,r}$ is the only extremal graph for complete graph $K_{r+1}$. Erd\\\"{o}s et al. (1995) determined the extremal graphs for intersecting triangles and Chen et al. (2003) determined the maximum number of edges of the extremal graphs for intersecting cliques. In this pa","authors_text":"Boyuan Liu, Xinmin Hou, Yu Qiu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T16:39:07Z","title":"Extremal graph for intersecting odd cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08373","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:0a6806ae2234ee66fde5b73084694a1e3b09b6cc17ddc78d9ec98596d99575b5","target":"record","created_at":"2026-05-18T01:28:36Z","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":"88ac717b5e8b195623d8ad16a2a57565f0c9840eb37a97abbb9ab6312f15812a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T16:39:07Z","title_canon_sha256":"67486eb87781496125b50284fbbf564bf0da2ddbe0d5b70a2c056a93c4c66bb2"},"schema_version":"1.0","source":{"id":"1510.08373","kind":"arxiv","version":1}},"canonical_sha256":"6aa8bfca205f3cfe266ba9c07203b1736e83520eaab444788f66ebe66926d870","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aa8bfca205f3cfe266ba9c07203b1736e83520eaab444788f66ebe66926d870","first_computed_at":"2026-05-18T01:28:36.229004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:36.229004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sTsWOcd/LGZmcQaTmhh6Uy5zj9Oo3DFq1TDivPcbwQMfIsW9t61qLo+dLZ0LHaN2Pcty4dR1lDTG5u2Xw7VoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:36.229807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a6806ae2234ee66fde5b73084694a1e3b09b6cc17ddc78d9ec98596d99575b5","sha256:1f59f714e48bed2ad22eae7359395c9015dc975fb7a9115aa7f906d3ce82540a"],"state_sha256":"9d93baad54fcb3a0265fad0b67e57a8c99305451c28de934a6974b00aa97a111"}