{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6EW67MOCHBGTDG2F5DN6EB5XYM","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":"66beb395c81bdf58670d8c3dd0b0d863e6f38cd0adc89d0f59abfa04fa659440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-09T00:18:52Z","title_canon_sha256":"8148bbf8f027c3d94c0345fab7bf371b72e4921c87dd2fa2360e8f4aa77497e8"},"schema_version":"1.0","source":{"id":"1702.02662","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02662","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02662v2","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02662","created_at":"2026-05-18T00:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"6EW67MOCHBGT","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6EW67MOCHBGTDG2F","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6EW67MOC","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c92c50fa9af1f3b2e1bd514983367a6af2dd0dee69f10e4f13d737a5c0748e07","target":"graph","created_at":"2026-05-18T00:50:59Z","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"},"paper":{"abstract_excerpt":"The main topic considered is maximizing the number of cycles in a graph with given number of edges. In 2009, Kir\\'aly conjectured that there is constant $c$ such that any graph with $m$ edges has at most $(1.4)^m$ cycles. In this paper, it is shown that for sufficiently large $m$, a graph with $m$ edges has at most $(1.443)^m$ cycles. For sufficiently large $m$, examples of a graph with $m$ edges and $(1.37)^m$ cycles are presented. For a graph with given number of vertices and edges an upper bound on the maximal number of cycles is given. Also, exponentially tight bounds are proved for the ma","authors_text":"Andrii Arman, Sergei Tsaturian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-09T00:18:52Z","title":"The maximum number of cycles in a graph with fixed number of edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02662","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:a0fb1be3324c16b083a44faf71ff0897d8494d670427c28d79e2397ad1cb5cd0","target":"record","created_at":"2026-05-18T00:50:59Z","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":"66beb395c81bdf58670d8c3dd0b0d863e6f38cd0adc89d0f59abfa04fa659440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-09T00:18:52Z","title_canon_sha256":"8148bbf8f027c3d94c0345fab7bf371b72e4921c87dd2fa2360e8f4aa77497e8"},"schema_version":"1.0","source":{"id":"1702.02662","kind":"arxiv","version":2}},"canonical_sha256":"f12defb1c2384d319b45e8dbe207b7c31729aa505f50b5b262149576314a0f94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f12defb1c2384d319b45e8dbe207b7c31729aa505f50b5b262149576314a0f94","first_computed_at":"2026-05-18T00:50:59.025808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:59.025808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Vl69btl4ouT7JpPTVo6js1uGebvckPvEvXi8uKRRGhpDMeU1oWLYJ2BGE7luXbfyao/c4D5RCYq8FvvuvPMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:59.026468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02662","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0fb1be3324c16b083a44faf71ff0897d8494d670427c28d79e2397ad1cb5cd0","sha256:c92c50fa9af1f3b2e1bd514983367a6af2dd0dee69f10e4f13d737a5c0748e07"],"state_sha256":"2086f61b8476698dcc56d4d91347b86a446ecf7b2ece684d04a171ffaa5ecc7d"}