{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:W2Q4XFBLJM3ZPACOBPOESZIWXT","short_pith_number":"pith:W2Q4XFBL","schema_version":"1.0","canonical_sha256":"b6a1cb942b4b3797804e0bdc496516bcfb8c9d76566b5dc2483121a37b5b5ecc","source":{"kind":"arxiv","id":"1210.8021","version":2},"attestation_state":"computed","paper":{"title":"On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yaping Mao","submitted_at":"2012-10-30T14:24:49Z","abstract_excerpt":"The problem of determining the smallest number of edges, $h(n;\\bar{\\kappa}\\geq r)$, which guarantees that any graph with $n$ vertices and $h(n;\\bar{\\kappa}\\geq r)$ edges will contain a pair of vertices joined by $r$ internally disjoint paths was posed by Erd\\\"{o}s and Gallai. Bollob\\'{a}s considered the problem of determining the largest number of edges $f(n;\\bar{\\kappa}\\leq \\ell)$ for graphs with $n$ vertices and local connectivity at most $\\ell$. One can see that $f(n;\\bar{\\kappa}\\leq \\ell)= h(n;\\bar{\\kappa}\\geq \\ell+1)-1$. These two problems had received a wide attention of many researchers"},"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":"1210.8021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T14:24:49Z","cross_cats_sorted":[],"title_canon_sha256":"cb2c62ddee8b0491fe09943a7a5e4c3d72271942f7ca733bfa92090eedecb13c","abstract_canon_sha256":"1948d3ee5ea4e716b5250f4c293a8bc82c5b1d5d8011be5a2ec71ad110e1d6f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:25.302712Z","signature_b64":"tGp2+sAWtnfc/kaj6iSCmTZNpCJL1oyAZvbUfOSMnSbmOLxwF1ecpjy3qH2+jqz0wSdaNpJ157MwjJoEBVOyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6a1cb942b4b3797804e0bdc496516bcfb8c9d76566b5dc2483121a37b5b5ecc","last_reissued_at":"2026-05-18T03:35:25.302045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:25.302045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yaping Mao","submitted_at":"2012-10-30T14:24:49Z","abstract_excerpt":"The problem of determining the smallest number of edges, $h(n;\\bar{\\kappa}\\geq r)$, which guarantees that any graph with $n$ vertices and $h(n;\\bar{\\kappa}\\geq r)$ edges will contain a pair of vertices joined by $r$ internally disjoint paths was posed by Erd\\\"{o}s and Gallai. Bollob\\'{a}s considered the problem of determining the largest number of edges $f(n;\\bar{\\kappa}\\leq \\ell)$ for graphs with $n$ vertices and local connectivity at most $\\ell$. One can see that $f(n;\\bar{\\kappa}\\leq \\ell)= h(n;\\bar{\\kappa}\\geq \\ell+1)-1$. These two problems had received a wide attention of many researchers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8021","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":""},"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":"1210.8021","created_at":"2026-05-18T03:35:25.302143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8021v2","created_at":"2026-05-18T03:35:25.302143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8021","created_at":"2026-05-18T03:35:25.302143+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2Q4XFBLJM3Z","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2Q4XFBLJM3ZPACO","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2Q4XFBL","created_at":"2026-05-18T12:27:25.539911+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/W2Q4XFBLJM3ZPACOBPOESZIWXT","json":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT.json","graph_json":"https://pith.science/api/pith-number/W2Q4XFBLJM3ZPACOBPOESZIWXT/graph.json","events_json":"https://pith.science/api/pith-number/W2Q4XFBLJM3ZPACOBPOESZIWXT/events.json","paper":"https://pith.science/paper/W2Q4XFBL"},"agent_actions":{"view_html":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT","download_json":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT.json","view_paper":"https://pith.science/paper/W2Q4XFBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8021&json=true","fetch_graph":"https://pith.science/api/pith-number/W2Q4XFBLJM3ZPACOBPOESZIWXT/graph.json","fetch_events":"https://pith.science/api/pith-number/W2Q4XFBLJM3ZPACOBPOESZIWXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT/action/storage_attestation","attest_author":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT/action/author_attestation","sign_citation":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT/action/citation_signature","submit_replication":"https://pith.science/pith/W2Q4XFBLJM3ZPACOBPOESZIWXT/action/replication_record"}},"created_at":"2026-05-18T03:35:25.302143+00:00","updated_at":"2026-05-18T03:35:25.302143+00:00"}