{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ALKICTOGU4YZ7MCKZDAFJQDJ6H","short_pith_number":"pith:ALKICTOG","schema_version":"1.0","canonical_sha256":"02d4814dc6a7319fb04ac8c054c069f1cd1c1ebcbe7e9864ac888fdf41c2c6a2","source":{"kind":"arxiv","id":"1902.02526","version":2},"attestation_state":"computed","paper":{"title":"Going Far From Degeneracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh","submitted_at":"2019-02-07T09:00:23Z","abstract_excerpt":"An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least d+1. The proof of Erd\\H{o}s and Gallai is constructive and can be turned into a polynomial time algorithm constructing a cycle of length at least d+1. But can we decide in polynomial time whether a graph contains a cycle of length at least d+2? An easy reduction from Hamiltonian Cycle provides a negative answer to this question: deciding whether a graph has a cycle of length a"},"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":"1902.02526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T09:00:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"815de751b41bd33959b3e13a37518e13c6903797f9cc04a3d2c1d020ea899876","abstract_canon_sha256":"a1709adcd8c6e8d5bf50e7a5a10e0ae0a62aba9326c3196d189a4a8ac4d4a2ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:02.102157Z","signature_b64":"n29xj83TX9vfADHI+D91qk7e4XRQgW7PJapvynbXXNh70A5Q0JXAqmEkPJRTYkWSyFXQlGj1Gjkb1JnxXZFkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02d4814dc6a7319fb04ac8c054c069f1cd1c1ebcbe7e9864ac888fdf41c2c6a2","last_reissued_at":"2026-05-17T23:54:02.101336Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:02.101336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Going Far From Degeneracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh","submitted_at":"2019-02-07T09:00:23Z","abstract_excerpt":"An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least d+1. The proof of Erd\\H{o}s and Gallai is constructive and can be turned into a polynomial time algorithm constructing a cycle of length at least d+1. But can we decide in polynomial time whether a graph contains a cycle of length at least d+2? An easy reduction from Hamiltonian Cycle provides a negative answer to this question: deciding whether a graph has a cycle of length a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02526","kind":"arxiv","version":2},"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":"1902.02526","created_at":"2026-05-17T23:54:02.101479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02526v2","created_at":"2026-05-17T23:54:02.101479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02526","created_at":"2026-05-17T23:54:02.101479+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALKICTOGU4YZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALKICTOGU4YZ7MCK","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALKICTOG","created_at":"2026-05-18T12:33:12.712433+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/ALKICTOGU4YZ7MCKZDAFJQDJ6H","json":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H.json","graph_json":"https://pith.science/api/pith-number/ALKICTOGU4YZ7MCKZDAFJQDJ6H/graph.json","events_json":"https://pith.science/api/pith-number/ALKICTOGU4YZ7MCKZDAFJQDJ6H/events.json","paper":"https://pith.science/paper/ALKICTOG"},"agent_actions":{"view_html":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H","download_json":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H.json","view_paper":"https://pith.science/paper/ALKICTOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02526&json=true","fetch_graph":"https://pith.science/api/pith-number/ALKICTOGU4YZ7MCKZDAFJQDJ6H/graph.json","fetch_events":"https://pith.science/api/pith-number/ALKICTOGU4YZ7MCKZDAFJQDJ6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/action/storage_attestation","attest_author":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/action/author_attestation","sign_citation":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/action/citation_signature","submit_replication":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/action/replication_record"}},"created_at":"2026-05-17T23:54:02.101479+00:00","updated_at":"2026-05-17T23:54:02.101479+00:00"}