{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6EW67MOCHBGTDG2F5DN6EB5XYM","short_pith_number":"pith:6EW67MOC","schema_version":"1.0","canonical_sha256":"f12defb1c2384d319b45e8dbe207b7c31729aa505f50b5b262149576314a0f94","source":{"kind":"arxiv","id":"1702.02662","version":2},"attestation_state":"computed","paper":{"title":"The maximum number of cycles in a graph with fixed number of edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrii Arman, Sergei Tsaturian","submitted_at":"2017-02-09T00:18:52Z","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"},"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":"1702.02662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-09T00:18:52Z","cross_cats_sorted":[],"title_canon_sha256":"8148bbf8f027c3d94c0345fab7bf371b72e4921c87dd2fa2360e8f4aa77497e8","abstract_canon_sha256":"66beb395c81bdf58670d8c3dd0b0d863e6f38cd0adc89d0f59abfa04fa659440"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:59.026468Z","signature_b64":"+Vl69btl4ouT7JpPTVo6js1uGebvckPvEvXi8uKRRGhpDMeU1oWLYJ2BGE7luXbfyao/c4D5RCYq8FvvuvPMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f12defb1c2384d319b45e8dbe207b7c31729aa505f50b5b262149576314a0f94","last_reissued_at":"2026-05-18T00:50:59.025808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:59.025808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum number of cycles in a graph with fixed number of edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrii Arman, Sergei Tsaturian","submitted_at":"2017-02-09T00:18:52Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02662","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":""},"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":"1702.02662","created_at":"2026-05-18T00:50:59.025912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02662v2","created_at":"2026-05-18T00:50:59.025912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02662","created_at":"2026-05-18T00:50:59.025912+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EW67MOCHBGT","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EW67MOCHBGTDG2F","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EW67MOC","created_at":"2026-05-18T12:31:03.183658+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/6EW67MOCHBGTDG2F5DN6EB5XYM","json":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM.json","graph_json":"https://pith.science/api/pith-number/6EW67MOCHBGTDG2F5DN6EB5XYM/graph.json","events_json":"https://pith.science/api/pith-number/6EW67MOCHBGTDG2F5DN6EB5XYM/events.json","paper":"https://pith.science/paper/6EW67MOC"},"agent_actions":{"view_html":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM","download_json":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM.json","view_paper":"https://pith.science/paper/6EW67MOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02662&json=true","fetch_graph":"https://pith.science/api/pith-number/6EW67MOCHBGTDG2F5DN6EB5XYM/graph.json","fetch_events":"https://pith.science/api/pith-number/6EW67MOCHBGTDG2F5DN6EB5XYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM/action/storage_attestation","attest_author":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM/action/author_attestation","sign_citation":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM/action/citation_signature","submit_replication":"https://pith.science/pith/6EW67MOCHBGTDG2F5DN6EB5XYM/action/replication_record"}},"created_at":"2026-05-18T00:50:59.025912+00:00","updated_at":"2026-05-18T00:50:59.025912+00:00"}