{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TSQTLDECEPASHGKZK227USA453","short_pith_number":"pith:TSQTLDEC","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"},"canonical_sha256":"9ca1358c8223c123995956b5fa481ceed276d33e2b1340e922ef966f87cce534","source":{"kind":"arxiv","id":"2108.00526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.00526","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2108.00526v2","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.00526","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"TSQTLDECEPAS","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"TSQTLDECEPASHGKZ","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"TSQTLDEC","created_at":"2026-07-05T03:17:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TSQTLDECEPASHGKZK227USA453","target":"record","payload":{"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"},"canonical_sha256":"9ca1358c8223c123995956b5fa481ceed276d33e2b1340e922ef966f87cce534","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"},"source_kind":"arxiv","source_id":"2108.00526","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vB76qeRzsf/n+D0h2NrRFIkrzhBtrB/84gfSmNAJoavn1cuWVblOe+0iodqHl80gEFwOSftJHXEyCj0xdZKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:56:47.802397Z"},"content_sha256":"c47a3f2cd9423ee7615097b32bd3848d4b1b4d4ee3ea00154d5aebebc5dd9f19","schema_version":"1.0","event_id":"sha256:c47a3f2cd9423ee7615097b32bd3848d4b1b4d4ee3ea00154d5aebebc5dd9f19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TSQTLDECEPASHGKZK227USA453","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jh2Ct+ykmfQAsbASqq+5Rzxtap46YeJOn0Nce/CNXam8EWAsj60yLKV4ulNu1247Vigk0ovpyXF52ct5PlUoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:56:47.802780Z"},"content_sha256":"56e7f4ce6fc917d10910e2ad6df69857f917cb15a21f8a38ed537b2af17b28bb","schema_version":"1.0","event_id":"sha256:56e7f4ce6fc917d10910e2ad6df69857f917cb15a21f8a38ed537b2af17b28bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/bundle.json","state_url":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSQTLDECEPASHGKZK227USA453/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-08T13:56:47Z","links":{"resolver":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453","bundle":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/bundle.json","state":"https://pith.science/pith/TSQTLDECEPASHGKZK227USA453/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSQTLDECEPASHGKZK227USA453/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TSQTLDECEPASHGKZK227USA453","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":"e79e2075e463f363d1b8e9adf6c7a3fb7e51f48b16b54ffb8d9145a5b500f3ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-01T19:17:49Z","title_canon_sha256":"59bd84a06c9547d016b692834c9acfcb0e3d2e87ebd5718e3e554afb99caf1ac"},"schema_version":"1.0","source":{"id":"2108.00526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.00526","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2108.00526v2","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.00526","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"TSQTLDECEPAS","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"TSQTLDECEPASHGKZ","created_at":"2026-07-05T03:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"TSQTLDEC","created_at":"2026-07-05T03:17:57Z"}],"graph_snapshots":[{"event_id":"sha256:56e7f4ce6fc917d10910e2ad6df69857f917cb15a21f8a38ed537b2af17b28bb","target":"graph","created_at":"2026-07-05T03:17:57Z","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/2108.00526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Michael Savery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-01T19:17:49Z","title":"Planar graphs with the maximum number of induced 4-cycles or 5-cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.00526","kind":"arxiv","version":2},"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:c47a3f2cd9423ee7615097b32bd3848d4b1b4d4ee3ea00154d5aebebc5dd9f19","target":"record","created_at":"2026-07-05T03:17:57Z","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":"e79e2075e463f363d1b8e9adf6c7a3fb7e51f48b16b54ffb8d9145a5b500f3ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-01T19:17:49Z","title_canon_sha256":"59bd84a06c9547d016b692834c9acfcb0e3d2e87ebd5718e3e554afb99caf1ac"},"schema_version":"1.0","source":{"id":"2108.00526","kind":"arxiv","version":2}},"canonical_sha256":"9ca1358c8223c123995956b5fa481ceed276d33e2b1340e922ef966f87cce534","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ca1358c8223c123995956b5fa481ceed276d33e2b1340e922ef966f87cce534","first_computed_at":"2026-07-05T03:17:57.550049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:17:57.550049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivWatK5FjeHmnu9V4OKfPbdNoWVZBERCNYg3QuT51dH7nQVt1+92enp2RLaZ9PoXOppgAwReU0RIW+6V8boyDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:17:57.550488Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.00526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c47a3f2cd9423ee7615097b32bd3848d4b1b4d4ee3ea00154d5aebebc5dd9f19","sha256:56e7f4ce6fc917d10910e2ad6df69857f917cb15a21f8a38ed537b2af17b28bb"],"state_sha256":"a0d6d3afa5429d6b3b4456ef71b8b0358c7d5a3254323c9aae6772a7b76e6cc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMIxrbKFJs/LdC+1SI0iHCKzLHpAD67sUNk1ELto8J9pctTKsMcNLRox/x55/W6XSp8uTx/7NkyDqgJ/BA+DBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T13:56:47.804873Z","bundle_sha256":"4937115cb0e305e9ffe9e928dd9362ce089aabb8b07b2cea5641cf8a8ada7b09"}}