{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TG777OZH7RAELW5I5S4AZC5YFD","short_pith_number":"pith:TG777OZH","schema_version":"1.0","canonical_sha256":"99bfffbb27fc4045dba8ecb80c8bb828f7b261f25c23132263c68b0ce523aa17","source":{"kind":"arxiv","id":"2305.02011","version":1},"attestation_state":"computed","paper":{"title":"Approximating Long Cycle Above Dirac's Guarantee","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor F. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2023-05-03T10:04:22Z","abstract_excerpt":"Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit ``natural'' guarantees bringing to algorithmic questions whether a better solution (above the guarantee) could be obtained efficiently. The above guarantee paradigm has led to several exciting discoveries in the areas of parameterized algorithms and kernelization. We argue that this paradigm could bring forth fresh perspectives on well-studied problems in approximation algorithms. Our example is the longest cycle problem. One of the oldest result"},"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":"2305.02011","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-03T10:04:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e2f8a2e3a4ca72c4980aaf2b12f7432ce8685b9218ab1f39e6d0194430aed928","abstract_canon_sha256":"bf433e4ea760b46615458a8a57415c7afc72b79679ff807e29481a7ffc9672e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:46.462981Z","signature_b64":"OghASGvrqvfqeM1J/nMu4JpJrY1qr/5on9c3OexSkKI08qjJn46ix4AFo9tU9m8w4I8PBJNWncuhnysO0zbxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99bfffbb27fc4045dba8ecb80c8bb828f7b261f25c23132263c68b0ce523aa17","last_reissued_at":"2026-07-05T06:06:46.462585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:46.462585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Long Cycle Above Dirac's Guarantee","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor F. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2023-05-03T10:04:22Z","abstract_excerpt":"Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit ``natural'' guarantees bringing to algorithmic questions whether a better solution (above the guarantee) could be obtained efficiently. The above guarantee paradigm has led to several exciting discoveries in the areas of parameterized algorithms and kernelization. We argue that this paradigm could bring forth fresh perspectives on well-studied problems in approximation algorithms. Our example is the longest cycle problem. One of the oldest result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02011","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/2305.02011/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":"2305.02011","created_at":"2026-07-05T06:06:46.462647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02011v1","created_at":"2026-07-05T06:06:46.462647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02011","created_at":"2026-07-05T06:06:46.462647+00:00"},{"alias_kind":"pith_short_12","alias_value":"TG777OZH7RAE","created_at":"2026-07-05T06:06:46.462647+00:00"},{"alias_kind":"pith_short_16","alias_value":"TG777OZH7RAELW5I","created_at":"2026-07-05T06:06:46.462647+00:00"},{"alias_kind":"pith_short_8","alias_value":"TG777OZH","created_at":"2026-07-05T06:06:46.462647+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/TG777OZH7RAELW5I5S4AZC5YFD","json":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD.json","graph_json":"https://pith.science/api/pith-number/TG777OZH7RAELW5I5S4AZC5YFD/graph.json","events_json":"https://pith.science/api/pith-number/TG777OZH7RAELW5I5S4AZC5YFD/events.json","paper":"https://pith.science/paper/TG777OZH"},"agent_actions":{"view_html":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD","download_json":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD.json","view_paper":"https://pith.science/paper/TG777OZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02011&json=true","fetch_graph":"https://pith.science/api/pith-number/TG777OZH7RAELW5I5S4AZC5YFD/graph.json","fetch_events":"https://pith.science/api/pith-number/TG777OZH7RAELW5I5S4AZC5YFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD/action/storage_attestation","attest_author":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD/action/author_attestation","sign_citation":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD/action/citation_signature","submit_replication":"https://pith.science/pith/TG777OZH7RAELW5I5S4AZC5YFD/action/replication_record"}},"created_at":"2026-07-05T06:06:46.462647+00:00","updated_at":"2026-07-05T06:06:46.462647+00:00"}