{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NKUL7SRAL46P4JTLVHAHEA5RON","short_pith_number":"pith:NKUL7SRA","schema_version":"1.0","canonical_sha256":"6aa8bfca205f3cfe266ba9c07203b1736e83520eaab444788f66ebe66926d870","source":{"kind":"arxiv","id":"1510.08373","version":1},"attestation_state":"computed","paper":{"title":"Extremal graph for intersecting odd cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Xinmin Hou, Yu Qiu","submitted_at":"2015-10-28T16:39:07Z","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"},"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":"1510.08373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T16:39:07Z","cross_cats_sorted":[],"title_canon_sha256":"67486eb87781496125b50284fbbf564bf0da2ddbe0d5b70a2c056a93c4c66bb2","abstract_canon_sha256":"88ac717b5e8b195623d8ad16a2a57565f0c9840eb37a97abbb9ab6312f15812a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:36.229807Z","signature_b64":"sTsWOcd/LGZmcQaTmhh6Uy5zj9Oo3DFq1TDivPcbwQMfIsW9t61qLo+dLZ0LHaN2Pcty4dR1lDTG5u2Xw7VoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aa8bfca205f3cfe266ba9c07203b1736e83520eaab444788f66ebe66926d870","last_reissued_at":"2026-05-18T01:28:36.229004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:36.229004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal graph for intersecting odd cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Xinmin Hou, Yu Qiu","submitted_at":"2015-10-28T16:39:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08373","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":""},"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":"1510.08373","created_at":"2026-05-18T01:28:36.229094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08373v1","created_at":"2026-05-18T01:28:36.229094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08373","created_at":"2026-05-18T01:28:36.229094+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKUL7SRAL46P","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKUL7SRAL46P4JTL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKUL7SRA","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON","json":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON.json","graph_json":"https://pith.science/api/pith-number/NKUL7SRAL46P4JTLVHAHEA5RON/graph.json","events_json":"https://pith.science/api/pith-number/NKUL7SRAL46P4JTLVHAHEA5RON/events.json","paper":"https://pith.science/paper/NKUL7SRA"},"agent_actions":{"view_html":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON","download_json":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON.json","view_paper":"https://pith.science/paper/NKUL7SRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08373&json=true","fetch_graph":"https://pith.science/api/pith-number/NKUL7SRAL46P4JTLVHAHEA5RON/graph.json","fetch_events":"https://pith.science/api/pith-number/NKUL7SRAL46P4JTLVHAHEA5RON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON/action/storage_attestation","attest_author":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON/action/author_attestation","sign_citation":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON/action/citation_signature","submit_replication":"https://pith.science/pith/NKUL7SRAL46P4JTLVHAHEA5RON/action/replication_record"}},"created_at":"2026-05-18T01:28:36.229094+00:00","updated_at":"2026-05-18T01:28:36.229094+00:00"}