{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FEZ7RQA76QK347JAFL4FLQ5EYO","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":"e5d1afbfc1584ecd99861600259ef3ad03bb1e4c806c3b68decc4bd5f2ebf397","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T14:03:31Z","title_canon_sha256":"303207df38c7774de8c64b76c26b3ac7af4b06ea81b62cab8e0696bd5ece4a3d"},"schema_version":"1.0","source":{"id":"2606.02279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02279","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02279v1","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02279","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"FEZ7RQA76QK3","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"FEZ7RQA76QK347JA","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"FEZ7RQA7","created_at":"2026-06-02T03:04:54Z"}],"graph_snapshots":[{"event_id":"sha256:2556ad8d8eec10abfe4012f1d4b950676e1242ca405b320f2038f37f51d2de5a","target":"graph","created_at":"2026-06-02T03:04:54Z","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/2606.02279/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Carol T. Zamfirescu, Jorik Jooken","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T14:03:31Z","title":"Counting Hamiltonian paths between prescribed vertices in traceable graphs with a forbidden induced subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02279","kind":"arxiv","version":1},"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:4d206b80718bd8a907f93091dd9d64fb864be951d8167dc02dc74f40779a443e","target":"record","created_at":"2026-06-02T03:04:54Z","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":"e5d1afbfc1584ecd99861600259ef3ad03bb1e4c806c3b68decc4bd5f2ebf397","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T14:03:31Z","title_canon_sha256":"303207df38c7774de8c64b76c26b3ac7af4b06ea81b62cab8e0696bd5ece4a3d"},"schema_version":"1.0","source":{"id":"2606.02279","kind":"arxiv","version":1}},"canonical_sha256":"2933f8c01ff415be7d202af855c3a4c38a5626031bf493c253fc8c4a2913a889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2933f8c01ff415be7d202af855c3a4c38a5626031bf493c253fc8c4a2913a889","first_computed_at":"2026-06-02T03:04:54.922259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:04:54.922259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/R/rIfFTdUaoIBOIqEFQxGdGOizTJt19aFVbZbqjNYizelo3KbEBlbuuHpaV+xjPgkbM0Y5MX+23uu2DRHjJCw==","signature_status":"signed_v1","signed_at":"2026-06-02T03:04:54.922609Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d206b80718bd8a907f93091dd9d64fb864be951d8167dc02dc74f40779a443e","sha256:2556ad8d8eec10abfe4012f1d4b950676e1242ca405b320f2038f37f51d2de5a"],"state_sha256":"367e552c87b14e451c3a5da3bb6f1c7970096ae3e1d15ddfc33df06abf23d9d2"}