{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:34TVQFRRMTIHR2B65335QM5CE4","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":"8ad1a3c27c8f78469b8dfa592a5192afb4b0517fe555ac4aa75ea4a7243578a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-24T04:58:54Z","title_canon_sha256":"6f48c9702cea3ef554bc39c164bc17357b9615cb450e5f7ae569ded5e8f2ede4"},"schema_version":"1.0","source":{"id":"2507.18090","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.18090","created_at":"2026-07-05T11:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"2507.18090v2","created_at":"2026-07-05T11:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.18090","created_at":"2026-07-05T11:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"34TVQFRRMTIH","created_at":"2026-07-05T11:49:57Z"},{"alias_kind":"pith_short_16","alias_value":"34TVQFRRMTIHR2B6","created_at":"2026-07-05T11:49:57Z"},{"alias_kind":"pith_short_8","alias_value":"34TVQFRR","created_at":"2026-07-05T11:49:57Z"}],"graph_snapshots":[{"event_id":"sha256:e2c05521778b2fab6e328b05401e8349fa385e940854eec0fa5354658bcc8bf2","target":"graph","created_at":"2026-07-05T11:49: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/2507.18090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that every $n$-vertex $5$-connected planar triangulation has at most $9n-50$ many cycles of length $5$ for all $n\\ge 20$ and this upper bound is tight. We also show that for every $k\\geq 6$, there exists some constant $C(k)$ such that for sufficiently large $n$, every $n$-vertex $5$-connected planar graph has at most $C(k) \\cdot n^{\\lfloor{k/3}\\rfloor}$ many cycles of length $k$. This upper bound is asymptotically tight for all $k\\geq 6$.","authors_text":"Gyaneshwar Agrahari, Xiaonan Liu, Zhiyu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-24T04:58:54Z","title":"Counting $k$-cycles in $5$-connected planar triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.18090","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:57bceb876f9a49acb132685d74e66a73e25d7fda73b20dc7a9ab2f8dbfe6ffc3","target":"record","created_at":"2026-07-05T11:49: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":"8ad1a3c27c8f78469b8dfa592a5192afb4b0517fe555ac4aa75ea4a7243578a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-24T04:58:54Z","title_canon_sha256":"6f48c9702cea3ef554bc39c164bc17357b9615cb450e5f7ae569ded5e8f2ede4"},"schema_version":"1.0","source":{"id":"2507.18090","kind":"arxiv","version":2}},"canonical_sha256":"df2758163164d078e83eeef7d833a2272b69546a6f4945e12a3e0b12c0086522","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df2758163164d078e83eeef7d833a2272b69546a6f4945e12a3e0b12c0086522","first_computed_at":"2026-07-05T11:49:57.656930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:57.656930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mBZlBPEgO0J2aYaTn5bWTv2yKNrhYAwxTqiAVLeuNXvPBulpeqxx5struB+C8/HUBRkCWrG3cwmsb85AWZ27Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:57.657384Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.18090","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57bceb876f9a49acb132685d74e66a73e25d7fda73b20dc7a9ab2f8dbfe6ffc3","sha256:e2c05521778b2fab6e328b05401e8349fa385e940854eec0fa5354658bcc8bf2"],"state_sha256":"210920aadbb1158a7f7639566caca13b671ff3980433be49100ae415636a9b34"}