{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SW3F75HABULTG67XYYQA3XONDY","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":"dd5ee4366f19e2bd028b35c470e29cf3d6a04a772dd3f47ccb870bc4af77f943","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T13:52:21Z","title_canon_sha256":"3b8fb8ff1ac0c8cc7f0bbc4774c22d0ae2c439d8e76498f50f0dcc0410205be3"},"schema_version":"1.0","source":{"id":"2606.12093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12093","created_at":"2026-06-11T01:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12093v1","created_at":"2026-06-11T01:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12093","created_at":"2026-06-11T01:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"SW3F75HABULT","created_at":"2026-06-11T01:10:47Z"},{"alias_kind":"pith_short_16","alias_value":"SW3F75HABULTG67X","created_at":"2026-06-11T01:10:47Z"},{"alias_kind":"pith_short_8","alias_value":"SW3F75HA","created_at":"2026-06-11T01:10:47Z"}],"graph_snapshots":[{"event_id":"sha256:b24f1351a4a9cb89044f498f529699874648a4e35fcec58f3913bc6c5785fcc8","target":"graph","created_at":"2026-06-11T01:10:47Z","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.12093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For integers $k\\ge 1$ and $n\\ge k+1$, let $\\operatorname{ex}^{\\mathrm{HIST}}_k(n)$ denote the maximum number of edges in a $k$-connected graph of order $n$ which contains no homeomorphically irreducible spanning tree (or briefly HIST). We determine these extremal numbers for $k=1$ and $k=2$. More precisely, we prove that $\\operatorname{ex}^{\\mathrm{HIST}}_1(n)=\\binom{n-2}{2}+2$ for $n\\ge 9$, with $L_n$ as the unique extremal graph, and that $\\operatorname{ex}^{\\mathrm{HIST}}_2(n)=\\binom{n-3}{2}+4$ for $n\\ge 13$, with $B_n$ as the unique extremal graph. This provides a Tur\\'an-type extremal res","authors_text":"Huiqing Liu, Xiaolan Hu, Yibo Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T13:52:21Z","title":"Extremal number of edges in graphs without homeomorphically irreducible spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12093","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:33e9da5f721617618e41dc129cdf9e65f05166e443af6a50bf9fd2bc9fcb01a2","target":"record","created_at":"2026-06-11T01:10:47Z","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":"dd5ee4366f19e2bd028b35c470e29cf3d6a04a772dd3f47ccb870bc4af77f943","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T13:52:21Z","title_canon_sha256":"3b8fb8ff1ac0c8cc7f0bbc4774c22d0ae2c439d8e76498f50f0dcc0410205be3"},"schema_version":"1.0","source":{"id":"2606.12093","kind":"arxiv","version":1}},"canonical_sha256":"95b65ff4e00d17337bf7c6200dddcd1e2281d15363f4db4a74e9b9bdd174849f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95b65ff4e00d17337bf7c6200dddcd1e2281d15363f4db4a74e9b9bdd174849f","first_computed_at":"2026-06-11T01:10:47.816910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:47.816910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YW+bToW/k9nDOOghp2hRjjRc71FJor1z8vj3s2+QEF7AGR/43DA9eirY46bjCusiPegJdcqFfeuPwysAYKrqCw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:47.817795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e9da5f721617618e41dc129cdf9e65f05166e443af6a50bf9fd2bc9fcb01a2","sha256:b24f1351a4a9cb89044f498f529699874648a4e35fcec58f3913bc6c5785fcc8"],"state_sha256":"56d18579aa6bd71722c04ee6cb1118daafaa58d8457efc7946085af3df1970dd"}