{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ALKICTOGU4YZ7MCKZDAFJQDJ6H","short_pith_number":"pith:ALKICTOG","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"},"canonical_sha256":"02d4814dc6a7319fb04ac8c054c069f1cd1c1ebcbe7e9864ac888fdf41c2c6a2","source":{"kind":"arxiv","id":"1902.02526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02526","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02526v2","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02526","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"ALKICTOGU4YZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ALKICTOGU4YZ7MCK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ALKICTOG","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ALKICTOGU4YZ7MCKZDAFJQDJ6H","target":"record","payload":{"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"},"canonical_sha256":"02d4814dc6a7319fb04ac8c054c069f1cd1c1ebcbe7e9864ac888fdf41c2c6a2","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"},"source_kind":"arxiv","source_id":"1902.02526","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4B9qtv1Rv5udHcmD41ZXVA0l2aqum4VD79km3OOz749k3YV56PDQ/RPxQXHSWG5GEF16b1fvwbKMVNBGA0GIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:17:17.113882Z"},"content_sha256":"7978858170327492d6cbdafd84914124d24d6737fee6438b89511a696a8fce3b","schema_version":"1.0","event_id":"sha256:7978858170327492d6cbdafd84914124d24d6737fee6438b89511a696a8fce3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ALKICTOGU4YZ7MCKZDAFJQDJ6H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AA08DyuMos4XmQ3gStEPo6/ThEVgdh0IyP4BBEyun5PDnxY/Inrw3f1NED4CexkkCzOJOo4yVxJFR2ETPCnjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:17:17.114577Z"},"content_sha256":"8798ecd893650f02aeec48b65f017306fde6561dfc8133215afdf7a1bdce5f3e","schema_version":"1.0","event_id":"sha256:8798ecd893650f02aeec48b65f017306fde6561dfc8133215afdf7a1bdce5f3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/bundle.json","state_url":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T18:17:17Z","links":{"resolver":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H","bundle":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/bundle.json","state":"https://pith.science/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALKICTOGU4YZ7MCKZDAFJQDJ6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ALKICTOGU4YZ7MCKZDAFJQDJ6H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a1709adcd8c6e8d5bf50e7a5a10e0ae0a62aba9326c3196d189a4a8ac4d4a2ac","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T09:00:23Z","title_canon_sha256":"815de751b41bd33959b3e13a37518e13c6903797f9cc04a3d2c1d020ea899876"},"schema_version":"1.0","source":{"id":"1902.02526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02526","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02526v2","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02526","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"ALKICTOGU4YZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ALKICTOGU4YZ7MCK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ALKICTOG","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:8798ecd893650f02aeec48b65f017306fde6561dfc8133215afdf7a1bdce5f3e","target":"graph","created_at":"2026-05-17T23:54:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T09:00:23Z","title":"Going Far From Degeneracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02526","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7978858170327492d6cbdafd84914124d24d6737fee6438b89511a696a8fce3b","target":"record","created_at":"2026-05-17T23:54:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a1709adcd8c6e8d5bf50e7a5a10e0ae0a62aba9326c3196d189a4a8ac4d4a2ac","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T09:00:23Z","title_canon_sha256":"815de751b41bd33959b3e13a37518e13c6903797f9cc04a3d2c1d020ea899876"},"schema_version":"1.0","source":{"id":"1902.02526","kind":"arxiv","version":2}},"canonical_sha256":"02d4814dc6a7319fb04ac8c054c069f1cd1c1ebcbe7e9864ac888fdf41c2c6a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02d4814dc6a7319fb04ac8c054c069f1cd1c1ebcbe7e9864ac888fdf41c2c6a2","first_computed_at":"2026-05-17T23:54:02.101336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:02.101336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n29xj83TX9vfADHI+D91qk7e4XRQgW7PJapvynbXXNh70A5Q0JXAqmEkPJRTYkWSyFXQlGj1Gjkb1JnxXZFkBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:02.102157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7978858170327492d6cbdafd84914124d24d6737fee6438b89511a696a8fce3b","sha256:8798ecd893650f02aeec48b65f017306fde6561dfc8133215afdf7a1bdce5f3e"],"state_sha256":"d680d697693a35b85480e2f6b5cf636bfa7bde9283590d12495bc03985427870"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8cYOUPIqyQKydrBhQB4wYI5lI6pIYZegkjMsX65Id8A+r7iEazQp7gf/IQdx8+KgMHMASqwJVOhmIhEVv+TCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:17:17.118288Z","bundle_sha256":"1ddbb54af396b57c420885db3448e37c9eeec54d1918d6b9845a442f7644c40e"}}