{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FEZ7RQA76QK347JAFL4FLQ5EYO","short_pith_number":"pith:FEZ7RQA7","schema_version":"1.0","canonical_sha256":"2933f8c01ff415be7d202af855c3a4c38a5626031bf493c253fc8c4a2913a889","source":{"kind":"arxiv","id":"2606.02279","version":1},"attestation_state":"computed","paper":{"title":"Counting Hamiltonian paths between prescribed vertices in traceable graphs with a forbidden induced subgraph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carol T. Zamfirescu, Jorik Jooken","submitted_at":"2026-06-01T14:03:31Z","abstract_excerpt":"For graphs $G$ and $F$, we say that $G$ is $F$-free if $F$ does not occur as an induced subgraph of $G$. This paper is concerned with the following question: Given an $F$-free graph $G$ having two vertices between which there exists at least one Hamiltonian path, how many Hamiltonian paths between these endpoints must exist (in terms of the order of $G$)? Our main result shows that there exists a sharp dichotomy. More precisely, we show that if $F$ is not an induced subgraph of $P_3+sP_1$ for any integer $s \\geq 0$, then there exists an infinite family of $F$-free graphs having two vertices be"},"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":"2606.02279","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T14:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"303207df38c7774de8c64b76c26b3ac7af4b06ea81b62cab8e0696bd5ece4a3d","abstract_canon_sha256":"e5d1afbfc1584ecd99861600259ef3ad03bb1e4c806c3b68decc4bd5f2ebf397"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:54.922609Z","signature_b64":"/R/rIfFTdUaoIBOIqEFQxGdGOizTJt19aFVbZbqjNYizelo3KbEBlbuuHpaV+xjPgkbM0Y5MX+23uu2DRHjJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2933f8c01ff415be7d202af855c3a4c38a5626031bf493c253fc8c4a2913a889","last_reissued_at":"2026-06-02T03:04:54.922259Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:54.922259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Hamiltonian paths between prescribed vertices in traceable graphs with a forbidden induced subgraph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carol T. Zamfirescu, Jorik Jooken","submitted_at":"2026-06-01T14:03:31Z","abstract_excerpt":"For graphs $G$ and $F$, we say that $G$ is $F$-free if $F$ does not occur as an induced subgraph of $G$. This paper is concerned with the following question: Given an $F$-free graph $G$ having two vertices between which there exists at least one Hamiltonian path, how many Hamiltonian paths between these endpoints must exist (in terms of the order of $G$)? Our main result shows that there exists a sharp dichotomy. More precisely, we show that if $F$ is not an induced subgraph of $P_3+sP_1$ for any integer $s \\geq 0$, then there exists an infinite family of $F$-free graphs having two vertices be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02279","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/2606.02279/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":"2606.02279","created_at":"2026-06-02T03:04:54.922322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02279v1","created_at":"2026-06-02T03:04:54.922322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02279","created_at":"2026-06-02T03:04:54.922322+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEZ7RQA76QK3","created_at":"2026-06-02T03:04:54.922322+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEZ7RQA76QK347JA","created_at":"2026-06-02T03:04:54.922322+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEZ7RQA7","created_at":"2026-06-02T03:04:54.922322+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/FEZ7RQA76QK347JAFL4FLQ5EYO","json":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO.json","graph_json":"https://pith.science/api/pith-number/FEZ7RQA76QK347JAFL4FLQ5EYO/graph.json","events_json":"https://pith.science/api/pith-number/FEZ7RQA76QK347JAFL4FLQ5EYO/events.json","paper":"https://pith.science/paper/FEZ7RQA7"},"agent_actions":{"view_html":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO","download_json":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO.json","view_paper":"https://pith.science/paper/FEZ7RQA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02279&json=true","fetch_graph":"https://pith.science/api/pith-number/FEZ7RQA76QK347JAFL4FLQ5EYO/graph.json","fetch_events":"https://pith.science/api/pith-number/FEZ7RQA76QK347JAFL4FLQ5EYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO/action/storage_attestation","attest_author":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO/action/author_attestation","sign_citation":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO/action/citation_signature","submit_replication":"https://pith.science/pith/FEZ7RQA76QK347JAFL4FLQ5EYO/action/replication_record"}},"created_at":"2026-06-02T03:04:54.922322+00:00","updated_at":"2026-06-02T03:04:54.922322+00:00"}