{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HZGVS62FEDLTGGUTLMZLPK7QU3","short_pith_number":"pith:HZGVS62F","canonical_record":{"source":{"id":"2110.07319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-14T12:51:30Z","cross_cats_sorted":[],"title_canon_sha256":"158abaf189dec5ac09a91391a5dec7d5fbe7b35c922e15f8c1bfed45cf813799","abstract_canon_sha256":"35223eff1d9e86967d27a7e49f06eb8734038ddfd0f788d4dc32ea7e4e079f5c"},"schema_version":"1.0"},"canonical_sha256":"3e4d597b4520d7331a935b32b7abf0a6eb37c39a4650177f9445b9d3911a84f0","source":{"kind":"arxiv","id":"2110.07319","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.07319","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"arxiv_version","alias_value":"2110.07319v2","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07319","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"pith_short_12","alias_value":"HZGVS62FEDLT","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"pith_short_16","alias_value":"HZGVS62FEDLTGGUT","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"pith_short_8","alias_value":"HZGVS62F","created_at":"2026-07-05T07:35:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HZGVS62FEDLTGGUTLMZLPK7QU3","target":"record","payload":{"canonical_record":{"source":{"id":"2110.07319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-14T12:51:30Z","cross_cats_sorted":[],"title_canon_sha256":"158abaf189dec5ac09a91391a5dec7d5fbe7b35c922e15f8c1bfed45cf813799","abstract_canon_sha256":"35223eff1d9e86967d27a7e49f06eb8734038ddfd0f788d4dc32ea7e4e079f5c"},"schema_version":"1.0"},"canonical_sha256":"3e4d597b4520d7331a935b32b7abf0a6eb37c39a4650177f9445b9d3911a84f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:57.869390Z","signature_b64":"i4XKMEEayrc9KV3s9M68Y7bCVFOI7Gwf8PQhS5MULufPqxZIPANWgcH8vOQzFaaccR8O/MAoD6UFYf+9LcxQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e4d597b4520d7331a935b32b7abf0a6eb37c39a4650177f9445b9d3911a84f0","last_reissued_at":"2026-07-05T07:35:57.868947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:57.868947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.07319","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-05T07:35:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mIz2wqx4T2UAbHEGg9jlVWzK4zzhEnsjmkukitci0kJkxE3ej9WVtxxvcNCMT0cylRqeywW4LZZqxCbGPVcsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T17:19:05.380548Z"},"content_sha256":"d10b6df32c1111553009f5d26617d1891fdda76052faf868bdc0e98ba735e870","schema_version":"1.0","event_id":"sha256:d10b6df32c1111553009f5d26617d1891fdda76052faf868bdc0e98ba735e870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HZGVS62FEDLTGGUTLMZLPK7QU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planar graphs with the maximum number of induced 6-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Savery","submitted_at":"2021-10-14T12:51:30Z","abstract_excerpt":"For large $n$ we determine the maximum number of induced 6-cycles which can be contained in a planar graph on $n$ vertices, and we classify the graphs which achieve this maximum. In particular we show that the maximum is achieved by the graph obtained by blowing up three pairwise non-adjacent vertices in a 6-cycle to sets of as even size as possible, and that every extremal example closely resembles this graph. This extends previous work by the author which solves the problem for 4-cycles and 5-cycles. The 5-cycle problem was also solved independently by Ghosh, Gy\\H{o}ri, Janzer, Paulos, Salia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07319","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/2110.07319/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-05T07:35:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fj3lKn4wQN2KyCunkkWwjYRCqg2Es4Fgqf+9NClsdZlsOuEJEW+a7MTD36g4QEwUpyPD6XiPMx535+WrRVrFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T17:19:05.380916Z"},"content_sha256":"4477362b4c7c966d518c96599d2c55de40d60f6ac2207b718cf12b2265731d51","schema_version":"1.0","event_id":"sha256:4477362b4c7c966d518c96599d2c55de40d60f6ac2207b718cf12b2265731d51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZGVS62FEDLTGGUTLMZLPK7QU3/bundle.json","state_url":"https://pith.science/pith/HZGVS62FEDLTGGUTLMZLPK7QU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZGVS62FEDLTGGUTLMZLPK7QU3/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-08T17:19:05Z","links":{"resolver":"https://pith.science/pith/HZGVS62FEDLTGGUTLMZLPK7QU3","bundle":"https://pith.science/pith/HZGVS62FEDLTGGUTLMZLPK7QU3/bundle.json","state":"https://pith.science/pith/HZGVS62FEDLTGGUTLMZLPK7QU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZGVS62FEDLTGGUTLMZLPK7QU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HZGVS62FEDLTGGUTLMZLPK7QU3","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":"35223eff1d9e86967d27a7e49f06eb8734038ddfd0f788d4dc32ea7e4e079f5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-14T12:51:30Z","title_canon_sha256":"158abaf189dec5ac09a91391a5dec7d5fbe7b35c922e15f8c1bfed45cf813799"},"schema_version":"1.0","source":{"id":"2110.07319","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.07319","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"arxiv_version","alias_value":"2110.07319v2","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07319","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"pith_short_12","alias_value":"HZGVS62FEDLT","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"pith_short_16","alias_value":"HZGVS62FEDLTGGUT","created_at":"2026-07-05T07:35:57Z"},{"alias_kind":"pith_short_8","alias_value":"HZGVS62F","created_at":"2026-07-05T07:35:57Z"}],"graph_snapshots":[{"event_id":"sha256:4477362b4c7c966d518c96599d2c55de40d60f6ac2207b718cf12b2265731d51","target":"graph","created_at":"2026-07-05T07:35: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/2110.07319/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For large $n$ we determine the maximum number of induced 6-cycles which can be contained in a planar graph on $n$ vertices, and we classify the graphs which achieve this maximum. In particular we show that the maximum is achieved by the graph obtained by blowing up three pairwise non-adjacent vertices in a 6-cycle to sets of as even size as possible, and that every extremal example closely resembles this graph. This extends previous work by the author which solves the problem for 4-cycles and 5-cycles. The 5-cycle problem was also solved independently by Ghosh, Gy\\H{o}ri, Janzer, Paulos, Salia","authors_text":"Michael Savery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-14T12:51:30Z","title":"Planar graphs with the maximum number of induced 6-cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07319","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:d10b6df32c1111553009f5d26617d1891fdda76052faf868bdc0e98ba735e870","target":"record","created_at":"2026-07-05T07:35: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":"35223eff1d9e86967d27a7e49f06eb8734038ddfd0f788d4dc32ea7e4e079f5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-14T12:51:30Z","title_canon_sha256":"158abaf189dec5ac09a91391a5dec7d5fbe7b35c922e15f8c1bfed45cf813799"},"schema_version":"1.0","source":{"id":"2110.07319","kind":"arxiv","version":2}},"canonical_sha256":"3e4d597b4520d7331a935b32b7abf0a6eb37c39a4650177f9445b9d3911a84f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e4d597b4520d7331a935b32b7abf0a6eb37c39a4650177f9445b9d3911a84f0","first_computed_at":"2026-07-05T07:35:57.868947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:57.868947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i4XKMEEayrc9KV3s9M68Y7bCVFOI7Gwf8PQhS5MULufPqxZIPANWgcH8vOQzFaaccR8O/MAoD6UFYf+9LcxQAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:57.869390Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.07319","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d10b6df32c1111553009f5d26617d1891fdda76052faf868bdc0e98ba735e870","sha256:4477362b4c7c966d518c96599d2c55de40d60f6ac2207b718cf12b2265731d51"],"state_sha256":"cdfec639588bfda3caabf0e2e45e95d240d7ad51c52608e584aec8650d86f22c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdLzclPMo1hpzNBwFSjYSTzfV0BM6mP/Ntl0mVwGZtd9AveCmtsLqvqJMcXR+Y1/sb15gvi3XrjzOoWfn3K5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T17:19:05.382884Z","bundle_sha256":"3f812656f036810dc459f6f880bd32baa00b2b7ee64cc21a61f9cf168636cf60"}}