{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QCZ4PHMHPAPSTTDZJDM7F4TDHS","short_pith_number":"pith:QCZ4PHMH","schema_version":"1.0","canonical_sha256":"80b3c79d87781f29cc7948d9f2f2633ca9caca42c1843cb95283f77768ef7c6b","source":{"kind":"arxiv","id":"2202.03061","version":1},"attestation_state":"computed","paper":{"title":"Longest Cycle above Erd\\H{o}s-Gallai Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2022-02-07T10:52:36Z","abstract_excerpt":"In 1959, Erd\\H{o}s and Gallai proved that every graph G with average vertex degree ad(G)\\geq 2 contains a cycle of length at least ad(G). We provide an algorithm that for k\\geq 0 in time 2^{O(k)} n^{O(1)} decides whether a 2-connected n-vertex graph G contains a cycle of length at least ad(G)+k. This resolves an open problem explicitly mentioned in several papers. The main ingredients of our algorithm are new graph-theoretical results interesting on their own."},"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":"2202.03061","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-02-07T10:52:36Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"100f7c4557e2c485afcfab880d23552494b001be6459bd01fd25701b11405af3","abstract_canon_sha256":"5eae9318bec62e72b368a3bdda781827c821771f0d766b5001f42b05ef06bd92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:35.307910Z","signature_b64":"hmGgwNLGjjHe7cXrcNhf1zOvbGwD2E+hM/7zIpbzaTmY0tj1hFrj08hANM2NOlZD/U5zid1rDQ0w/NDV4gNfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b3c79d87781f29cc7948d9f2f2633ca9caca42c1843cb95283f77768ef7c6b","last_reissued_at":"2026-07-05T03:54:35.307541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:35.307541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Cycle above Erd\\H{o}s-Gallai Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2022-02-07T10:52:36Z","abstract_excerpt":"In 1959, Erd\\H{o}s and Gallai proved that every graph G with average vertex degree ad(G)\\geq 2 contains a cycle of length at least ad(G). We provide an algorithm that for k\\geq 0 in time 2^{O(k)} n^{O(1)} decides whether a 2-connected n-vertex graph G contains a cycle of length at least ad(G)+k. This resolves an open problem explicitly mentioned in several papers. The main ingredients of our algorithm are new graph-theoretical results interesting on their own."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03061","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.03061/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2202.03061","created_at":"2026-07-05T03:54:35.307592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.03061v1","created_at":"2026-07-05T03:54:35.307592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03061","created_at":"2026-07-05T03:54:35.307592+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCZ4PHMHPAPS","created_at":"2026-07-05T03:54:35.307592+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCZ4PHMHPAPSTTDZ","created_at":"2026-07-05T03:54:35.307592+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCZ4PHMH","created_at":"2026-07-05T03:54:35.307592+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/QCZ4PHMHPAPSTTDZJDM7F4TDHS","json":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS.json","graph_json":"https://pith.science/api/pith-number/QCZ4PHMHPAPSTTDZJDM7F4TDHS/graph.json","events_json":"https://pith.science/api/pith-number/QCZ4PHMHPAPSTTDZJDM7F4TDHS/events.json","paper":"https://pith.science/paper/QCZ4PHMH"},"agent_actions":{"view_html":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS","download_json":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS.json","view_paper":"https://pith.science/paper/QCZ4PHMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.03061&json=true","fetch_graph":"https://pith.science/api/pith-number/QCZ4PHMHPAPSTTDZJDM7F4TDHS/graph.json","fetch_events":"https://pith.science/api/pith-number/QCZ4PHMHPAPSTTDZJDM7F4TDHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS/action/storage_attestation","attest_author":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS/action/author_attestation","sign_citation":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS/action/citation_signature","submit_replication":"https://pith.science/pith/QCZ4PHMHPAPSTTDZJDM7F4TDHS/action/replication_record"}},"created_at":"2026-07-05T03:54:35.307592+00:00","updated_at":"2026-07-05T03:54:35.307592+00:00"}