{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IVRMEHCCNAKVWFLMHPNSZKORSS","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":"3ae9d0517befa915dabc7c65f959faeeb2d75b3db4f7fd86021e666692483f4b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-13T14:52:55Z","title_canon_sha256":"c1cc59a9e4622fa89db0d796ac6faf6eac7e6952322e2e6707068caf8e047387"},"schema_version":"1.0","source":{"id":"2505.08634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.08634","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.08634v2","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08634","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"IVRMEHCCNAKV","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"IVRMEHCCNAKVWFLM","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"IVRMEHCC","created_at":"2026-07-05T11:48:03Z"}],"graph_snapshots":[{"event_id":"sha256:929b4c35c3e5c6bce79e06c28fc38d24cafd2d5ce5dfdeba36dac626a1f1a66d","target":"graph","created_at":"2026-07-05T11:48:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.08634/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by an old question of Gallai (1966) on the intersection of longest paths in a graph and the well-known conjectures of Lov\\'{a}sz (1969) and Thomassen (1978) on the maximum length of paths and cycles in vertex-transitive graphs, we present improved bounds for the parameters $\\mathrm{lpt}(G)$ and $\\mathrm{lct}(G)$, defined as the minimum size of a set of vertices in a graph $G$ hitting all longest paths (cycles, respectively). First, we show that every connected graph $G$ on $n$ vertices satisfies $\\mathrm{lpt}(G)\\le \\sqrt{8n}$, and $\\mathrm{lct}(G)\\le \\sqrt{8n}$ if $G$ is additionally","authors_text":"Paul Wollan, Raphael Steiner, Sergey Norin, Stephan Thomass\\'e","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-13T14:52:55Z","title":"Small hitting sets for longest paths and cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08634","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:c6b4fd7fb294f439cf4d48a660362775f3b184d6c06d10b70843abe61467fb72","target":"record","created_at":"2026-07-05T11:48:03Z","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":"3ae9d0517befa915dabc7c65f959faeeb2d75b3db4f7fd86021e666692483f4b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-13T14:52:55Z","title_canon_sha256":"c1cc59a9e4622fa89db0d796ac6faf6eac7e6952322e2e6707068caf8e047387"},"schema_version":"1.0","source":{"id":"2505.08634","kind":"arxiv","version":2}},"canonical_sha256":"4562c21c4268155b156c3bdb2ca9d194b6b0ded645b16fa119ea5c724ebdc241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4562c21c4268155b156c3bdb2ca9d194b6b0ded645b16fa119ea5c724ebdc241","first_computed_at":"2026-07-05T11:48:03.459008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:48:03.459008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"42Ca/vQqDhNoP18OHSEn4fUPGJ0zxm3jnc3cFg+f2N1P3zDH2XbD5ZtPc7z9qkemaFSpuOLd0O9qRAgdRUy3CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:48:03.459548Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.08634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6b4fd7fb294f439cf4d48a660362775f3b184d6c06d10b70843abe61467fb72","sha256:929b4c35c3e5c6bce79e06c28fc38d24cafd2d5ce5dfdeba36dac626a1f1a66d"],"state_sha256":"79f32a9961e653ded1558ff49083fc95695ffe71a57cc88c0bf0c13a1ebb1930"}