{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IVRMEHCCNAKVWFLMHPNSZKORSS","short_pith_number":"pith:IVRMEHCC","schema_version":"1.0","canonical_sha256":"4562c21c4268155b156c3bdb2ca9d194b6b0ded645b16fa119ea5c724ebdc241","source":{"kind":"arxiv","id":"2505.08634","version":2},"attestation_state":"computed","paper":{"title":"Small hitting sets for longest paths and cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Wollan, Raphael Steiner, Sergey Norin, Stephan Thomass\\'e","submitted_at":"2025-05-13T14:52:55Z","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"},"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":"2505.08634","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-13T14:52:55Z","cross_cats_sorted":[],"title_canon_sha256":"c1cc59a9e4622fa89db0d796ac6faf6eac7e6952322e2e6707068caf8e047387","abstract_canon_sha256":"3ae9d0517befa915dabc7c65f959faeeb2d75b3db4f7fd86021e666692483f4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:03.459548Z","signature_b64":"42Ca/vQqDhNoP18OHSEn4fUPGJ0zxm3jnc3cFg+f2N1P3zDH2XbD5ZtPc7z9qkemaFSpuOLd0O9qRAgdRUy3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4562c21c4268155b156c3bdb2ca9d194b6b0ded645b16fa119ea5c724ebdc241","last_reissued_at":"2026-07-05T11:48:03.459008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:03.459008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small hitting sets for longest paths and cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul Wollan, Raphael Steiner, Sergey Norin, Stephan Thomass\\'e","submitted_at":"2025-05-13T14:52:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08634","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.08634/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":"2505.08634","created_at":"2026-07-05T11:48:03.459080+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08634v2","created_at":"2026-07-05T11:48:03.459080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08634","created_at":"2026-07-05T11:48:03.459080+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVRMEHCCNAKV","created_at":"2026-07-05T11:48:03.459080+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVRMEHCCNAKVWFLM","created_at":"2026-07-05T11:48:03.459080+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVRMEHCC","created_at":"2026-07-05T11:48:03.459080+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/IVRMEHCCNAKVWFLMHPNSZKORSS","json":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS.json","graph_json":"https://pith.science/api/pith-number/IVRMEHCCNAKVWFLMHPNSZKORSS/graph.json","events_json":"https://pith.science/api/pith-number/IVRMEHCCNAKVWFLMHPNSZKORSS/events.json","paper":"https://pith.science/paper/IVRMEHCC"},"agent_actions":{"view_html":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS","download_json":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS.json","view_paper":"https://pith.science/paper/IVRMEHCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08634&json=true","fetch_graph":"https://pith.science/api/pith-number/IVRMEHCCNAKVWFLMHPNSZKORSS/graph.json","fetch_events":"https://pith.science/api/pith-number/IVRMEHCCNAKVWFLMHPNSZKORSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS/action/storage_attestation","attest_author":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS/action/author_attestation","sign_citation":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS/action/citation_signature","submit_replication":"https://pith.science/pith/IVRMEHCCNAKVWFLMHPNSZKORSS/action/replication_record"}},"created_at":"2026-07-05T11:48:03.459080+00:00","updated_at":"2026-07-05T11:48:03.459080+00:00"}