{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JBLGHBFNIBSXXBGSW3JEYXTLN5","short_pith_number":"pith:JBLGHBFN","canonical_record":{"source":{"id":"1201.3699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-18T06:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"4b3379ed0cae0e2c79a5f43848f0ffc806df1c5edc773d19f586fa6903cf3660","abstract_canon_sha256":"001e8c1301b135aa248cb3acb5ea5c2ffb3d48667fce51629775b057cc0d6b94"},"schema_version":"1.0"},"canonical_sha256":"48566384ad40657b84d2b6d24c5e6b6f5d8d645da5f45fcc07674f4d5b5f8a4c","source":{"kind":"arxiv","id":"1201.3699","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3699","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3699v2","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3699","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"pith_short_12","alias_value":"JBLGHBFNIBSX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JBLGHBFNIBSXXBGS","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JBLGHBFN","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JBLGHBFNIBSXXBGSW3JEYXTLN5","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-18T06:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"4b3379ed0cae0e2c79a5f43848f0ffc806df1c5edc773d19f586fa6903cf3660","abstract_canon_sha256":"001e8c1301b135aa248cb3acb5ea5c2ffb3d48667fce51629775b057cc0d6b94"},"schema_version":"1.0"},"canonical_sha256":"48566384ad40657b84d2b6d24c5e6b6f5d8d645da5f45fcc07674f4d5b5f8a4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:01.825748Z","signature_b64":"2AtljtPV/InHdzji+yYvGMoFwHW59SCYeq6t38DMDHhOu3pkyPkr3Gg2l8BZn9DTKYU9Fs7inwN94/mPNDNsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48566384ad40657b84d2b6d24c5e6b6f5d8d645da5f45fcc07674f4d5b5f8a4c","last_reissued_at":"2026-05-18T03:19:01.825092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:01.825092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3699","source_version":2,"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:19:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHtjpHcCxUMIXdMevDMas+eknW9wTilnWiYTrkdPyBZ/VXovL/b0jLU2G0R8Da4/J0EBVWyD1FMZYEQHDPbxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:23:48.317355Z"},"content_sha256":"5cf347b9debd556016e58fbba6773093f45f1d3c08f9ddf661c88fb5d0997a5b","schema_version":"1.0","event_id":"sha256:5cf347b9debd556016e58fbba6773093f45f1d3c08f9ddf661c88fb5d0997a5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JBLGHBFNIBSXXBGSW3JEYXTLN5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimal size of a graph with given generalized 3-edge-connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao","submitted_at":"2012-01-18T06:04:55Z","abstract_excerpt":"For $S\\subseteq V(G)$ and $|S|\\geq 2$, $\\lambda(S)$ is the maximum number of edge-disjoint trees connecting $S$ in $G$. For an integer $k$ with $2\\leq k\\leq n$, the \\emph{generalized $k$-edge-connectivity} $\\lambda_k(G)$ of $G$ is then defined as $\\lambda_k(G)= min\\{\\lambda(S) : S\\subseteq V(G) \\ and \\ |S|=k\\}$. It is also clear that when $|S|=2$, $\\lambda_2(G)$ is nothing new but the standard edge-connectivity $\\lambda(G)$ of $G$. In this paper, graphs of order $n$ such that $\\lambda_3(G)=n-3$ is characterized. Furthermore, we determine the minimal number of edges of a graph of order $n$ with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3699","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"},"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:19:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjefX9EGNYw+vo9XY23jpO7WoHuD09IDqVbBAERxC+9fc6LwWWkDwJMcV6IO15Vpr6UiTMeoHMJ7yHlN+IHOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:23:48.317699Z"},"content_sha256":"c8aec7f726a0b80cb42a4b3d30fc3b5fecebdc52c3b3c91f40d473076435ab4a","schema_version":"1.0","event_id":"sha256:c8aec7f726a0b80cb42a4b3d30fc3b5fecebdc52c3b3c91f40d473076435ab4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBLGHBFNIBSXXBGSW3JEYXTLN5/bundle.json","state_url":"https://pith.science/pith/JBLGHBFNIBSXXBGSW3JEYXTLN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBLGHBFNIBSXXBGSW3JEYXTLN5/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-02T09:23:48Z","links":{"resolver":"https://pith.science/pith/JBLGHBFNIBSXXBGSW3JEYXTLN5","bundle":"https://pith.science/pith/JBLGHBFNIBSXXBGSW3JEYXTLN5/bundle.json","state":"https://pith.science/pith/JBLGHBFNIBSXXBGSW3JEYXTLN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBLGHBFNIBSXXBGSW3JEYXTLN5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JBLGHBFNIBSXXBGSW3JEYXTLN5","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":"001e8c1301b135aa248cb3acb5ea5c2ffb3d48667fce51629775b057cc0d6b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-18T06:04:55Z","title_canon_sha256":"4b3379ed0cae0e2c79a5f43848f0ffc806df1c5edc773d19f586fa6903cf3660"},"schema_version":"1.0","source":{"id":"1201.3699","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3699","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3699v2","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3699","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"pith_short_12","alias_value":"JBLGHBFNIBSX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JBLGHBFNIBSXXBGS","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JBLGHBFN","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:c8aec7f726a0b80cb42a4b3d30fc3b5fecebdc52c3b3c91f40d473076435ab4a","target":"graph","created_at":"2026-05-18T03:19:01Z","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":"For $S\\subseteq V(G)$ and $|S|\\geq 2$, $\\lambda(S)$ is the maximum number of edge-disjoint trees connecting $S$ in $G$. For an integer $k$ with $2\\leq k\\leq n$, the \\emph{generalized $k$-edge-connectivity} $\\lambda_k(G)$ of $G$ is then defined as $\\lambda_k(G)= min\\{\\lambda(S) : S\\subseteq V(G) \\ and \\ |S|=k\\}$. It is also clear that when $|S|=2$, $\\lambda_2(G)$ is nothing new but the standard edge-connectivity $\\lambda(G)$ of $G$. In this paper, graphs of order $n$ such that $\\lambda_3(G)=n-3$ is characterized. Furthermore, we determine the minimal number of edges of a graph of order $n$ with","authors_text":"Xueliang Li, Yaping Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-18T06:04:55Z","title":"The minimal size of a graph with given generalized 3-edge-connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3699","kind":"arxiv","version":2},"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:5cf347b9debd556016e58fbba6773093f45f1d3c08f9ddf661c88fb5d0997a5b","target":"record","created_at":"2026-05-18T03:19:01Z","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":"001e8c1301b135aa248cb3acb5ea5c2ffb3d48667fce51629775b057cc0d6b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-18T06:04:55Z","title_canon_sha256":"4b3379ed0cae0e2c79a5f43848f0ffc806df1c5edc773d19f586fa6903cf3660"},"schema_version":"1.0","source":{"id":"1201.3699","kind":"arxiv","version":2}},"canonical_sha256":"48566384ad40657b84d2b6d24c5e6b6f5d8d645da5f45fcc07674f4d5b5f8a4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48566384ad40657b84d2b6d24c5e6b6f5d8d645da5f45fcc07674f4d5b5f8a4c","first_computed_at":"2026-05-18T03:19:01.825092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:01.825092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AtljtPV/InHdzji+yYvGMoFwHW59SCYeq6t38DMDHhOu3pkyPkr3Gg2l8BZn9DTKYU9Fs7inwN94/mPNDNsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:01.825748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3699","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cf347b9debd556016e58fbba6773093f45f1d3c08f9ddf661c88fb5d0997a5b","sha256:c8aec7f726a0b80cb42a4b3d30fc3b5fecebdc52c3b3c91f40d473076435ab4a"],"state_sha256":"02c4f63dbfeefffe99fe167c5d105141917a3d7715b08e971bf2ece2fc696ec1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ttn5lzjIS5oXagbkbjeUyP+W5LSuFag/MRwCxq6PWCFgrLM0h9pdqrPjHbx9Nv3p9lNdSuUwZVS53HZmaLbmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:23:48.319705Z","bundle_sha256":"b2d3d7a3b3b9a6e696532ad78a2301a59dc2242d57ccd95ef2bf7aa0d84012c1"}}