{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I6US5HG2MWPIWDI737HD4WFCQ3","short_pith_number":"pith:I6US5HG2","schema_version":"1.0","canonical_sha256":"47a92e9cda659e8b0d1fdfce3e58a286d742462a0bbb178f63da01097eac1fda","source":{"kind":"arxiv","id":"1604.06833","version":1},"attestation_state":"computed","paper":{"title":"Counting odd cycles in locally dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher","submitted_at":"2016-04-22T22:48:14Z","abstract_excerpt":"We prove that for any given $\\varepsilon>0$ and $d\\in [0,1]$, every sufficiently large $(\\varepsilon, d)$-dense graph $G$ contains for each odd integer $r$ at least $(d^r-\\varepsilon)|V(G)|^r$ cycles of length $r$. Here, $G$ being $(\\varepsilon, d)$-dense means that every set $X$ containing at least~$\\varepsilon\\,|V(G)|$ vertices spans at least $\\tfrac d2\\, |X|^2$ edges, and what we really count is the number of homomorphisms from an $r$-cycle into $G$.\n  The result adresses a question of Y. Kohayakawa, B. Nagle, V. R\\\"odl, and M. Schacht."},"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":"1604.06833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-22T22:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"a956ecb3fee2d14bdccf67a43ed09d8b0bfb52089315150f4330365170de5bbf","abstract_canon_sha256":"8646695c1e29d144d48e79a96f473401c6cf4a9c3256cba380a919fd237894c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.841361Z","signature_b64":"1N0eWQqP2KWwrvoH8oGAfxUN8VI8L5sodDHgcGr5QOpw3TpbLhszq2yj8gIOUBwB/FBA5PURizMVvoVH0k12AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47a92e9cda659e8b0d1fdfce3e58a286d742462a0bbb178f63da01097eac1fda","last_reissued_at":"2026-05-18T01:16:23.840777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.840777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting odd cycles in locally dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher","submitted_at":"2016-04-22T22:48:14Z","abstract_excerpt":"We prove that for any given $\\varepsilon>0$ and $d\\in [0,1]$, every sufficiently large $(\\varepsilon, d)$-dense graph $G$ contains for each odd integer $r$ at least $(d^r-\\varepsilon)|V(G)|^r$ cycles of length $r$. Here, $G$ being $(\\varepsilon, d)$-dense means that every set $X$ containing at least~$\\varepsilon\\,|V(G)|$ vertices spans at least $\\tfrac d2\\, |X|^2$ edges, and what we really count is the number of homomorphisms from an $r$-cycle into $G$.\n  The result adresses a question of Y. Kohayakawa, B. Nagle, V. R\\\"odl, and M. Schacht."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06833","kind":"arxiv","version":1},"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":"1604.06833","created_at":"2026-05-18T01:16:23.840866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06833v1","created_at":"2026-05-18T01:16:23.840866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06833","created_at":"2026-05-18T01:16:23.840866+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6US5HG2MWPI","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6US5HG2MWPIWDI7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6US5HG2","created_at":"2026-05-18T12:30:22.444734+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/I6US5HG2MWPIWDI737HD4WFCQ3","json":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3.json","graph_json":"https://pith.science/api/pith-number/I6US5HG2MWPIWDI737HD4WFCQ3/graph.json","events_json":"https://pith.science/api/pith-number/I6US5HG2MWPIWDI737HD4WFCQ3/events.json","paper":"https://pith.science/paper/I6US5HG2"},"agent_actions":{"view_html":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3","download_json":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3.json","view_paper":"https://pith.science/paper/I6US5HG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06833&json=true","fetch_graph":"https://pith.science/api/pith-number/I6US5HG2MWPIWDI737HD4WFCQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/I6US5HG2MWPIWDI737HD4WFCQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/action/storage_attestation","attest_author":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/action/author_attestation","sign_citation":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/action/citation_signature","submit_replication":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/action/replication_record"}},"created_at":"2026-05-18T01:16:23.840866+00:00","updated_at":"2026-05-18T01:16:23.840866+00:00"}