{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7JKSGXNJAVRBCWIK4RHQVMH553","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":"77df1871f30bc44a8db8b0cecf381308289141df46577193e11af7754fa686bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T03:46:01Z","title_canon_sha256":"62653e8bdfb8e98a94a87d97236e631b00b7c254df58b626e12877cc6cc39846"},"schema_version":"1.0","source":{"id":"1301.4623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4623","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4623v1","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4623","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"7JKSGXNJAVRB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7JKSGXNJAVRBCWIK","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7JKSGXNJ","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:d7fbd0fe4f50b1ed541c2e98b8aa808a22163fa731ca2b87becd9cd5f1f0472e","target":"graph","created_at":"2026-05-18T03:35:56Z","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"},"paper":{"abstract_excerpt":"The problem of determining the largest number $f(n;\\bar{\\kappa}\\leq \\ell)$ of edges for graphs with $n$ vertices and maximal local connectivity at most $\\ell$ was considered by Bollob\\'{a}s. Li et al. studied the largest number $f(n;\\bar{\\kappa}_3\\leq2)$ of edges for graphs with $n$ vertices and at most two internally disjoint Steiner trees connecting any three vertices. In this paper, we further study the largest number $f(n;\\bar{\\kappa}_k=1)$ of edges for graphs with $n$ vertices and exactly one Steiner tree connecting any $k$ vertices with $k\\geq 3$. It turns out that this is not an easy ta","authors_text":"Xueliang Li, Yan Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T03:46:01Z","title":"On extremal graphs with exactly one Steiner tree connecting any $k$ vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4623","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:ec6755a4b14d5c854e0bef22b2d2f89bcb39ac824b1d87a9b067252b66477bc9","target":"record","created_at":"2026-05-18T03:35:56Z","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":"77df1871f30bc44a8db8b0cecf381308289141df46577193e11af7754fa686bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T03:46:01Z","title_canon_sha256":"62653e8bdfb8e98a94a87d97236e631b00b7c254df58b626e12877cc6cc39846"},"schema_version":"1.0","source":{"id":"1301.4623","kind":"arxiv","version":1}},"canonical_sha256":"fa55235da9056211590ae44f0ab0fdeef7429cc1277378d1ec12244cc62bf9c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa55235da9056211590ae44f0ab0fdeef7429cc1277378d1ec12244cc62bf9c7","first_computed_at":"2026-05-18T03:35:56.124092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:56.124092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H5ACjoJepKPky7eV00L6w+aYUeVYf+BTwzxphB9Q4kAOX7KIT9tgu/gFZ1T4i7JsQ44S3NHvziG9m9RnKTNfAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:56.125094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec6755a4b14d5c854e0bef22b2d2f89bcb39ac824b1d87a9b067252b66477bc9","sha256:d7fbd0fe4f50b1ed541c2e98b8aa808a22163fa731ca2b87becd9cd5f1f0472e"],"state_sha256":"f2285430c446de9c44732d6653b3dd7b33300a3f8df8fc1c4d8380931a2aa984"}