{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TSQTLDECEPASHGKZK227USA453","short_pith_number":"pith:TSQTLDEC","schema_version":"1.0","canonical_sha256":"9ca1358c8223c123995956b5fa481ceed276d33e2b1340e922ef966f87cce534","source":{"kind":"arxiv","id":"2108.00526","version":2},"attestation_state":"computed","paper":{"title":"Planar graphs with the maximum number of induced 4-cycles or 5-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Savery","submitted_at":"2021-08-01T19:17:49Z","abstract_excerpt":"For large $n$ we determine exactly the maximum numbers of induced $C_4$ and $C_5$ subgraphs that a planar graph on $n$ vertices can contain. We show that $K_{2,n-2}$ uniquely achieves this maximum in the $C_4$ case, and we identify the graphs which achieve the maximum in the $C_5$ case. This extends work in a paper by Hakimi and Schmeichel and a paper by Ghosh, Gy\\H{o}ri, Janzer, Paulos, Salia, and Zamora which together determine both maxima asymptotically."},"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":"2108.00526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-01T19:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"59bd84a06c9547d016b692834c9acfcb0e3d2e87ebd5718e3e554afb99caf1ac","abstract_canon_sha256":"e79e2075e463f363d1b8e9adf6c7a3fb7e51f48b16b54ffb8d9145a5b500f3ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:57.550488Z","signature_b64":"ivWatK5FjeHmnu9V4OKfPbdNoWVZBERCNYg3QuT51dH7nQVt1+92enp2RLaZ9PoXOppgAwReU0RIW+6V8boyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ca1358c8223c123995956b5fa481ceed276d33e2b1340e922ef966f87cce534","last_reissued_at":"2026-07-05T03:17:57.550049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:57.550049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar graphs with the maximum number of induced 4-cycles or 5-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Savery","submitted_at":"2021-08-01T19:17:49Z","abstract_excerpt":"For large $n$ we determine exactly the maximum numbers of induced $C_4$ and $C_5$ subgraphs that a planar graph on $n$ vertices can contain. We show that $K_{2,n-2}$ uniquely achieves this maximum in the $C_4$ case, and we identify the graphs which achieve the maximum in the $C_5$ case. This extends work in a paper by Hakimi and Schmeichel and a paper by Ghosh, Gy\\H{o}ri, Janzer, Paulos, Salia, and Zamora which together determine both maxima asymptotically."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.00526","kind":"arxiv","version":2},"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/2108.00526/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":"2108.00526","created_at":"2026-07-05T03:17:57.550099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.00526v2","created_at":"2026-07-05T03:17:57.550099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.00526","created_at":"2026-07-05T03:17:57.550099+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSQTLDECEPAS","created_at":"2026-07-05T03:17:57.550099+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSQTLDECEPASHGKZ","created_at":"2026-07-05T03:17:57.550099+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSQTLDEC","created_at":"2026-07-05T03:17:57.550099+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/TSQTLDECEPASHGKZK227USA453","json":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453.json","graph_json":"https://pith.science/api/pith-number/TSQTLDECEPASHGKZK227USA453/graph.json","events_json":"https://pith.science/api/pith-number/TSQTLDECEPASHGKZK227USA453/events.json","paper":"https://pith.science/paper/TSQTLDEC"},"agent_actions":{"view_html":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453","download_json":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453.json","view_paper":"https://pith.science/paper/TSQTLDEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.00526&json=true","fetch_graph":"https://pith.science/api/pith-number/TSQTLDECEPASHGKZK227USA453/graph.json","fetch_events":"https://pith.science/api/pith-number/TSQTLDECEPASHGKZK227USA453/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/action/storage_attestation","attest_author":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/action/author_attestation","sign_citation":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/action/citation_signature","submit_replication":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/action/replication_record"}},"created_at":"2026-07-05T03:17:57.550099+00:00","updated_at":"2026-07-05T03:17:57.550099+00:00"}