{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CZQZPC2QLP2GYEFXE7JZ2WZKOI","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":"64bb3d5c039841937720edf4476f272282f3a919431200b1c41d80bd22b0ff2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-11T19:48:27Z","title_canon_sha256":"28d5d632c5128b7f6c9bc81c5f8fbfe6d5e5742399f2ea115e2af5cb2b6f78aa"},"schema_version":"1.0","source":{"id":"1610.03476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03476","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03476v1","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03476","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"CZQZPC2QLP2G","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CZQZPC2QLP2GYEFX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CZQZPC2Q","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:73c3074e4ba6af8ca8dc094416e52bd731e8578ace234d30b83345bf2e8b08d9","target":"graph","created_at":"2026-05-18T01:02:31Z","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":"Let $L$ be a set of positive integers. We call a (directed) graph $G$ an $L$\\emph{-cycle graph} if all cycle lengths in $G$ belong to $L$. Let $c(L,n)$ be the maximum number of cycles possible in an $n$-vertex $L$-cycle graph (we use $\\vec{c}(L,n)$ for the number of cycles in directed graphs). In the undirected case we show that for any fixed set $L$, we have $c(L,n)=\\Theta_L(n^{\\lfloor k/\\ell \\rfloor})$ where $k$ is the largest element of $L$ and $2\\ell$ is the smallest even element of $L$ (if $L$ contains only odd elements, then $c(L,n)=\\Theta_L(n)$ holds.) We also give a characterization of","authors_text":"Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, Cory Palmer, D\\'aniel Gerbner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-11T19:48:27Z","title":"On the number of cycles in a graph with restricted cycle lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03476","kind":"arxiv","version":1},"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:b7d4945a8156537162fcc60604aa5aadbce1a30b3e2f5f9f9cc00dd1951709e4","target":"record","created_at":"2026-05-18T01:02:31Z","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":"64bb3d5c039841937720edf4476f272282f3a919431200b1c41d80bd22b0ff2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-11T19:48:27Z","title_canon_sha256":"28d5d632c5128b7f6c9bc81c5f8fbfe6d5e5742399f2ea115e2af5cb2b6f78aa"},"schema_version":"1.0","source":{"id":"1610.03476","kind":"arxiv","version":1}},"canonical_sha256":"1661978b505bf46c10b727d39d5b2a7231c063eafe02469097fdea952ce468e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1661978b505bf46c10b727d39d5b2a7231c063eafe02469097fdea952ce468e5","first_computed_at":"2026-05-18T01:02:31.356469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:31.356469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EgwcBY6EvzJonPDkUrf7Je0sorWvY9RaOZ0LbFN4fUfbIQQY+sQu3zjsK1LXrzWUeuJQGkvu21JVx9H0ozyvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:31.357024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7d4945a8156537162fcc60604aa5aadbce1a30b3e2f5f9f9cc00dd1951709e4","sha256:73c3074e4ba6af8ca8dc094416e52bd731e8578ace234d30b83345bf2e8b08d9"],"state_sha256":"e6800911c663169175775ccc63bb6280fc4b6bbde57c9979158503aa8238eda1"}