{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6U5YWDJW33YRDQDKXMIBYJMFEB","short_pith_number":"pith:6U5YWDJW","schema_version":"1.0","canonical_sha256":"f53b8b0d36def111c06abb101c2585204fa214f0798e16431f551da14ac0e081","source":{"kind":"arxiv","id":"1705.07545","version":1},"attestation_state":"computed","paper":{"title":"A note on the number of edges in a Hamiltonian graph with no repeated cycle length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Joey Lee","submitted_at":"2017-05-22T03:10:19Z","abstract_excerpt":"Let $G$ be an $n$-vertex graph obtained by adding chords to a cycle of length $n$. Markstr\\\"{o}m asked for the maximum number of edges in $G$ if there are no two cycles in $G$ with the same length. A simple counting argument shows that such a graph can have at most $n + \\sqrt{2n} +1 $ edges. Using difference sets in $\\mathbb{Z}_n$, we show that for infinitely many $n$, there is an $n$-vertex Hamiltonian graph with $n + \\sqrt{n - 3/4} - 3/2$ edges and no repeated cycle length."},"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":"1705.07545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T03:10:19Z","cross_cats_sorted":[],"title_canon_sha256":"ef38463d5ef8b4ceca1a0162e36b5722a9c6bbcac52807d79ef518720fcfca9f","abstract_canon_sha256":"2cb3b5d835c72405a7b92e8e3de68507ea0d0826116abf88196da55c27fb54de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.249004Z","signature_b64":"c5Tyj8noX7/v4+zmHIsfnzdkAa/rXmc/fbqhZlxsgf/cfn4esgWavPIozAiNEym126sJ8N3kdCK4vct7e0pGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f53b8b0d36def111c06abb101c2585204fa214f0798e16431f551da14ac0e081","last_reissued_at":"2026-05-18T00:44:05.248393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.248393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the number of edges in a Hamiltonian graph with no repeated cycle length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Joey Lee","submitted_at":"2017-05-22T03:10:19Z","abstract_excerpt":"Let $G$ be an $n$-vertex graph obtained by adding chords to a cycle of length $n$. Markstr\\\"{o}m asked for the maximum number of edges in $G$ if there are no two cycles in $G$ with the same length. A simple counting argument shows that such a graph can have at most $n + \\sqrt{2n} +1 $ edges. Using difference sets in $\\mathbb{Z}_n$, we show that for infinitely many $n$, there is an $n$-vertex Hamiltonian graph with $n + \\sqrt{n - 3/4} - 3/2$ edges and no repeated cycle length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07545","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":"1705.07545","created_at":"2026-05-18T00:44:05.248487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07545v1","created_at":"2026-05-18T00:44:05.248487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07545","created_at":"2026-05-18T00:44:05.248487+00:00"},{"alias_kind":"pith_short_12","alias_value":"6U5YWDJW33YR","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6U5YWDJW33YRDQDK","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6U5YWDJW","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/6U5YWDJW33YRDQDKXMIBYJMFEB","json":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB.json","graph_json":"https://pith.science/api/pith-number/6U5YWDJW33YRDQDKXMIBYJMFEB/graph.json","events_json":"https://pith.science/api/pith-number/6U5YWDJW33YRDQDKXMIBYJMFEB/events.json","paper":"https://pith.science/paper/6U5YWDJW"},"agent_actions":{"view_html":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB","download_json":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB.json","view_paper":"https://pith.science/paper/6U5YWDJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07545&json=true","fetch_graph":"https://pith.science/api/pith-number/6U5YWDJW33YRDQDKXMIBYJMFEB/graph.json","fetch_events":"https://pith.science/api/pith-number/6U5YWDJW33YRDQDKXMIBYJMFEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB/action/storage_attestation","attest_author":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB/action/author_attestation","sign_citation":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB/action/citation_signature","submit_replication":"https://pith.science/pith/6U5YWDJW33YRDQDKXMIBYJMFEB/action/replication_record"}},"created_at":"2026-05-18T00:44:05.248487+00:00","updated_at":"2026-05-18T00:44:05.248487+00:00"}