{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:34TVQFRRMTIHR2B65335QM5CE4","short_pith_number":"pith:34TVQFRR","schema_version":"1.0","canonical_sha256":"df2758163164d078e83eeef7d833a2272b69546a6f4945e12a3e0b12c0086522","source":{"kind":"arxiv","id":"2507.18090","version":2},"attestation_state":"computed","paper":{"title":"Counting $k$-cycles in $5$-connected planar triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gyaneshwar Agrahari, Xiaonan Liu, Zhiyu Wang","submitted_at":"2025-07-24T04:58:54Z","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$."},"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":"2507.18090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-24T04:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"6f48c9702cea3ef554bc39c164bc17357b9615cb450e5f7ae569ded5e8f2ede4","abstract_canon_sha256":"8ad1a3c27c8f78469b8dfa592a5192afb4b0517fe555ac4aa75ea4a7243578a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:57.657384Z","signature_b64":"mBZlBPEgO0J2aYaTn5bWTv2yKNrhYAwxTqiAVLeuNXvPBulpeqxx5struB+C8/HUBRkCWrG3cwmsb85AWZ27Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df2758163164d078e83eeef7d833a2272b69546a6f4945e12a3e0b12c0086522","last_reissued_at":"2026-07-05T11:49:57.656930Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:57.656930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting $k$-cycles in $5$-connected planar triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gyaneshwar Agrahari, Xiaonan Liu, Zhiyu Wang","submitted_at":"2025-07-24T04:58:54Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.18090","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/2507.18090/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":"2507.18090","created_at":"2026-07-05T11:49:57.656986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.18090v2","created_at":"2026-07-05T11:49:57.656986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.18090","created_at":"2026-07-05T11:49:57.656986+00:00"},{"alias_kind":"pith_short_12","alias_value":"34TVQFRRMTIH","created_at":"2026-07-05T11:49:57.656986+00:00"},{"alias_kind":"pith_short_16","alias_value":"34TVQFRRMTIHR2B6","created_at":"2026-07-05T11:49:57.656986+00:00"},{"alias_kind":"pith_short_8","alias_value":"34TVQFRR","created_at":"2026-07-05T11:49:57.656986+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/34TVQFRRMTIHR2B65335QM5CE4","json":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4.json","graph_json":"https://pith.science/api/pith-number/34TVQFRRMTIHR2B65335QM5CE4/graph.json","events_json":"https://pith.science/api/pith-number/34TVQFRRMTIHR2B65335QM5CE4/events.json","paper":"https://pith.science/paper/34TVQFRR"},"agent_actions":{"view_html":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4","download_json":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4.json","view_paper":"https://pith.science/paper/34TVQFRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.18090&json=true","fetch_graph":"https://pith.science/api/pith-number/34TVQFRRMTIHR2B65335QM5CE4/graph.json","fetch_events":"https://pith.science/api/pith-number/34TVQFRRMTIHR2B65335QM5CE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4/action/storage_attestation","attest_author":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4/action/author_attestation","sign_citation":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4/action/citation_signature","submit_replication":"https://pith.science/pith/34TVQFRRMTIHR2B65335QM5CE4/action/replication_record"}},"created_at":"2026-07-05T11:49:57.656986+00:00","updated_at":"2026-07-05T11:49:57.656986+00:00"}