{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:67G2YZ5O7BDXMSQCE7IIN3Z5UG","short_pith_number":"pith:67G2YZ5O","canonical_record":{"source":{"id":"1304.3774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-13T04:23:23Z","cross_cats_sorted":[],"title_canon_sha256":"d0a5e30cccfd3b60ab44b6a66f64a1b169ad5fb646daa6d3ab58733301befeb0","abstract_canon_sha256":"08b178d0aa163ffe03eb45ee33186872f548130e81b79e4073b5938ed5a4eb98"},"schema_version":"1.0"},"canonical_sha256":"f7cdac67aef847764a0227d086ef3da19173dedd59ceb1d196910bb5670404f0","source":{"kind":"arxiv","id":"1304.3774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3774","created_at":"2026-05-18T03:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3774v1","created_at":"2026-05-18T03:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3774","created_at":"2026-05-18T03:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"67G2YZ5O7BDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"67G2YZ5O7BDXMSQC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"67G2YZ5O","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:67G2YZ5O7BDXMSQCE7IIN3Z5UG","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-13T04:23:23Z","cross_cats_sorted":[],"title_canon_sha256":"d0a5e30cccfd3b60ab44b6a66f64a1b169ad5fb646daa6d3ab58733301befeb0","abstract_canon_sha256":"08b178d0aa163ffe03eb45ee33186872f548130e81b79e4073b5938ed5a4eb98"},"schema_version":"1.0"},"canonical_sha256":"f7cdac67aef847764a0227d086ef3da19173dedd59ceb1d196910bb5670404f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:04.393503Z","signature_b64":"Mno+mSr0cgx85jui4ZVISfhV5szscJndsFvWcmTKIjoSALR6OIu8T5nxiDzE7W7YW8DtQAwFRmYYSb+aEMWgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7cdac67aef847764a0227d086ef3da19173dedd59ceb1d196910bb5670404f0","last_reissued_at":"2026-05-18T03:28:04.392242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:04.392242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3774","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hM7LcH9WLYROtfqa/ZtPX2RxynvYAWw7VADAjL506W05OrIppwooYH0MuJBAMhSGze6YD13nqx8XVymLl+7BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:25:56.820974Z"},"content_sha256":"2a5c42f0ff92d5962952c69b2c9eef33996182b3a2ba9ab38371a41390c72dc2","schema_version":"1.0","event_id":"sha256:2a5c42f0ff92d5962952c69b2c9eef33996182b3a2ba9ab38371a41390c72dc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:67G2YZ5O7BDXMSQCE7IIN3Z5UG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On extremal graphs with at most $\\ell$ internally disjoint Steiner trees connecting any n-1 vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao","submitted_at":"2013-04-13T04:23:23Z","abstract_excerpt":"The concept of maximum local connectivity $\\bar {\\kappa}$ of a graph was introduced by Bollob\\'{a}s. One of the problems about it is to determine the largest number of edges $f(n;\\bar{\\kappa}\\leq \\ell)$ for graphs of order $n$ that have local connectivity at most $\\ell$. We consider a generalization of the above concept and problem. For $S\\subseteq V(G)$ and $|S|\\geq 2$, the \\emph{generalized local connectivity} $\\kappa(S)$ is the maximum number of internally disjoint trees connecting $S$ in $G$. The parameter $\\bar{\\kappa}_k(G)=max\\{\\kappa(S)|S\\subseteq V(G),|S|=k\\}$ is called the \\emph{maxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3774","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xpdarL82LEIwVuxZaLZ4p1oGUbbS5kdZUWpwa+DlSJ+wWNRMGk/cFuj/GFB951L2gwIKM0JJjxm+SOqzyrWHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:25:56.821339Z"},"content_sha256":"d4cb15e8482ff42498a70da228bdebdd2286645b89751f54451b04e78c723ec3","schema_version":"1.0","event_id":"sha256:d4cb15e8482ff42498a70da228bdebdd2286645b89751f54451b04e78c723ec3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67G2YZ5O7BDXMSQCE7IIN3Z5UG/bundle.json","state_url":"https://pith.science/pith/67G2YZ5O7BDXMSQCE7IIN3Z5UG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67G2YZ5O7BDXMSQCE7IIN3Z5UG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T21:25:56Z","links":{"resolver":"https://pith.science/pith/67G2YZ5O7BDXMSQCE7IIN3Z5UG","bundle":"https://pith.science/pith/67G2YZ5O7BDXMSQCE7IIN3Z5UG/bundle.json","state":"https://pith.science/pith/67G2YZ5O7BDXMSQCE7IIN3Z5UG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67G2YZ5O7BDXMSQCE7IIN3Z5UG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:67G2YZ5O7BDXMSQCE7IIN3Z5UG","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":"08b178d0aa163ffe03eb45ee33186872f548130e81b79e4073b5938ed5a4eb98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-13T04:23:23Z","title_canon_sha256":"d0a5e30cccfd3b60ab44b6a66f64a1b169ad5fb646daa6d3ab58733301befeb0"},"schema_version":"1.0","source":{"id":"1304.3774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3774","created_at":"2026-05-18T03:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3774v1","created_at":"2026-05-18T03:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3774","created_at":"2026-05-18T03:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"67G2YZ5O7BDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"67G2YZ5O7BDXMSQC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"67G2YZ5O","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:d4cb15e8482ff42498a70da228bdebdd2286645b89751f54451b04e78c723ec3","target":"graph","created_at":"2026-05-18T03:28:04Z","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 concept of maximum local connectivity $\\bar {\\kappa}$ of a graph was introduced by Bollob\\'{a}s. One of the problems about it is to determine the largest number of edges $f(n;\\bar{\\kappa}\\leq \\ell)$ for graphs of order $n$ that have local connectivity at most $\\ell$. We consider a generalization of the above concept and problem. For $S\\subseteq V(G)$ and $|S|\\geq 2$, the \\emph{generalized local connectivity} $\\kappa(S)$ is the maximum number of internally disjoint trees connecting $S$ in $G$. The parameter $\\bar{\\kappa}_k(G)=max\\{\\kappa(S)|S\\subseteq V(G),|S|=k\\}$ is called the \\emph{maxim","authors_text":"Xueliang Li, Yaping Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-13T04:23:23Z","title":"On extremal graphs with at most $\\ell$ internally disjoint Steiner trees connecting any n-1 vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3774","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:2a5c42f0ff92d5962952c69b2c9eef33996182b3a2ba9ab38371a41390c72dc2","target":"record","created_at":"2026-05-18T03:28:04Z","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":"08b178d0aa163ffe03eb45ee33186872f548130e81b79e4073b5938ed5a4eb98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-13T04:23:23Z","title_canon_sha256":"d0a5e30cccfd3b60ab44b6a66f64a1b169ad5fb646daa6d3ab58733301befeb0"},"schema_version":"1.0","source":{"id":"1304.3774","kind":"arxiv","version":1}},"canonical_sha256":"f7cdac67aef847764a0227d086ef3da19173dedd59ceb1d196910bb5670404f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7cdac67aef847764a0227d086ef3da19173dedd59ceb1d196910bb5670404f0","first_computed_at":"2026-05-18T03:28:04.392242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:04.392242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mno+mSr0cgx85jui4ZVISfhV5szscJndsFvWcmTKIjoSALR6OIu8T5nxiDzE7W7YW8DtQAwFRmYYSb+aEMWgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:04.393503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a5c42f0ff92d5962952c69b2c9eef33996182b3a2ba9ab38371a41390c72dc2","sha256:d4cb15e8482ff42498a70da228bdebdd2286645b89751f54451b04e78c723ec3"],"state_sha256":"6c30b19b03617073d59082fcbed037df3d28501c175210382001e43d463a0b75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYCH6KZNoGpyWViJRdAVwaUrfuUAsLAkQpx360OAOXvFMwBkznBSxWCVc9Jt4P9OxeBICZN4ZR0FbB7b8w7oAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:25:56.823151Z","bundle_sha256":"88d0d8516b501941cda1674ffbd0c4a193f27664d6d4de47ef552b2f574caf6a"}}